Codes updation till Arrays

Author: AdarshRawat1

.gitignore

@@ -0,0 +1 @@
+*.class

.vscode/settings.json

@@ -0,0 +1,2 @@
+{
+}

1. FlowCharts/1. Average of three numbers.txt

@@ -0,0 +1,4 @@
+Average of three numbers
+
+You are given three numbers. You need to calculate and print their average value. Draw a flowchart for this process.
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/2. Check Number.txt

@@ -0,0 +1,8 @@
+Check Number
+
+You are given a single number. You need to print one of the following outputs according to the number's nature.
+Print 1, if the number is positive
+Print -1, if it's negative
+Print 0, if it's equal to 0
+Draw a flowchart for this process.
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/3. Valid Triangle.txt

@@ -0,0 +1,6 @@
+Valid Triangle
+
+You are given 3 numbers. Each number represents the length of a line. You need to figure out whether these lines can form a valid triangle.
+If a valid triangle can be formed, print "Yes", otherwise print "No".
+Draw a flowchart for this process
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/4. Find Product.txt

@@ -0,0 +1,6 @@
+Find Product
+
+You are given a single non-negative integer, N. You need to calculate and print N factorial (N!)
+N factorial is defined as the product of all integers from 1 to N (both inclusive)
+Draw a flowchart for this process
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/5. Print Even Numbers.txt

@@ -0,0 +1,5 @@
+Print Even Numbers
+
+You are given a single positive integer, N. You need to print all even integers that occur between 1 and N (both inclusive).
+Draw a flowchart for this process
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/6. Check Prime.txt

@@ -0,0 +1,6 @@
+Check Prime
+
+Draw a flowchart to take a number N from user. And check if that number is prime or not.
+Print "Yes" if number is prime, otherwise print "No".
+Assume N >= 2.
+Note : You don't need to submit the problem. Just attempt in your notebook and ask doubts if you need help.

1. FlowCharts/README.txt

@@ -0,0 +1 @@
+I have not uploaded my solutions of Flowchart.

10. Searching and Sorting/12.0 Arrays Sum.txt

@@ -0,0 +1,33 @@
+Arrays Sum
+
+Given an array/list(ARR) of length N, you need to find and return the sum of all the elements in the array/list.
+Input Format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+The first line of each test case or query contains an integer 'N' representing the size of the array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+Output Format :
+For each test case, print the sum of the numbers in the array/list.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^5
+
+Time Limit: 1sec
+Sample Input 1:
+1
+3
+9 8 9
+Sample Output 1:
+26
+Sample Input 2:
+2
+5
+1 2 3 4 5 
+3
+10 20 30 
+Sample Output 2:
+15
+60

10. Searching and Sorting/12.1 Arrays Sum Solution.JPG

@@ -0,0 +1,40 @@
+Linear Search
+
+You have been given a random integer array/list(ARR) of size N, and an integer X. You need to search for the integer X in the given array/list using 'Linear Search'.
+ You have been required to return the index at which X is present in the array/list. If X has multiple occurrences in the array/list, then you need to return the index at which the first occurrence of X would be encountered. In case X is not present in the array/list, then return -1.
+'Linear search' is a method for finding an element within an array/list. It sequentially checks each element of the array/list until a match is found or the whole array/list has been searched.
+Input format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+
+Third line contains the value of X(integer to be searched in the given array/list)
+Output format :
+For each test case, print the index at which X is present or -1, otherwise.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^5
+-2 ^ 31 <= X <= (2 ^ 31) - 1
+Time Limit: 1 sec
+Sample Input 1:
+1
+7
+2 13 4 1 3 6 28
+3
+Sample Output 1:
+4
+Sample Input 2:
+2
+7
+2 13 4 1 3 6 28
+9
+5
+7 8 5 9 5      
+5
+Sample Output 2:
+-1
+2

10. Searching and Sorting/14.0 Linear Search.txt

@@ -0,0 +1,31 @@
+Arrange Numbers in Array
+
+You have been given an empty array(ARR) and its size N. The only input taken from the user will be N and you need not worry about the array.
+Your task is to populate the array using the integer values in the range 1 to N(both inclusive) in the order - 1,3,.......4,2.
+Note:
+You need not print the array. You only need to populate it.
+Input Format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+The first and the only line of each test case or query contains an integer 'N'.
+Output Format :
+For each test case, print the elements of the arra/listy separated by a single space.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^4
+
+Time Limit: 1sec
+Sample Input 1 :
+1
+6
+Sample Output 1 :
+1 3 5 6 4 2
+Sample Input 2 :
+2
+9
+3
+Sample Output 2 :
+1 3 5 7 9 8 6 4 2
+1 3 2

10. Searching and Sorting/14.1 Linear Search Hint.pdf

@@ -0,0 +1,33 @@
+Swap Alternate
+
+You have been given an array/list(ARR) of size N. You need to swap every pair of alternate elements in the array/list.
+You don't need to print or return anything, just change in the input array itself.
+Input Format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+Output Format :
+For each test case, print the elements of the resulting array in a single row separated by a single space.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^5
+Time Limit: 1sec
+Sample Input 1:
+1
+6
+9 3 6 12 4 32
+Sample Output 1 :
+3 9 12 6 32 4
+Sample Input 2:
+2
+9
+9 3 6 12 4 32 5 11 19
+4
+1 2 3 4
+Sample Output 2 :
+3 9 12 6 32 4 11 5 19 
+2 1 4 3 

10. Searching and Sorting/14.3 Linear Search Solution.JPG

@@ -0,0 +1,36 @@
+Find Unique
+
+You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].
+Now, in the given array/list, 'M' numbers are present twice and one number is present only once.
+You need to find and return that number which is unique in the array/list.
+ Note:
+Unique element is always present in the array/list according to the given condition.
+Input format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+Output Format :
+For each test case, print the unique element present in the array.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^3
+Time Limit: 1 sec
+Sample Input 1:
+1
+7
+2 3 1 6 3 6 2
+Sample Output 1:
+1
+Sample Input 2:
+2
+5
+2 4 7 2 7
+9
+1 3 1 3 6 6 7 10 7
+Sample Output 2:
+4
+10

10. Searching and Sorting/15.0 Arrange Numbers in Array.txt

@@ -0,0 +1,34 @@
+Find Duplicate
+
+You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ranging from 0 to 3 and among these, there is a single integer value that is present twice. You need to find and return that duplicate number present in the array.
+Note :
+Duplicate number is always present in the given array/list.
+Input format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+Output Format :
+For each test case, print the duplicate element in the array/list.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^3
+Time Limit: 1 sec
+Sample Input 1:
+1
+9
+0 7 2 5 4 7 1 3 6
+Sample Output 1:
+7
+Sample Input 2:
+2
+5
+0 2 1 3 1
+7
+0 3 1 5 4 3 2
+Sample Output 2:
+1
+3

10. Searching and Sorting/15.1 Arrange Numbers in Array Hint.pdf

@@ -0,0 +1,51 @@
+Array Intersection
+
+You have been given two integer arrays/list(ARR1 and ARR2) of size M and N, respectively. You need to print their intersection; An intersection for this problem can be defined when both the arrays/lists contain a particular value or to put it in other words, when there is a common value that exists in both the arrays/lists.
+Note :
+Input arrays/lists can contain duplicate elements.
+
+The intersection elements printed would be in the order they appear in the first array/list(ARR1)
+
+
+Input format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the first array/list.
+
+Second line contains 'N' single space separated integers representing the elements of the first the array/list.
+
+Third line contains an integer 'M' representing the size of the second array/list.
+
+Fourth line contains 'M' single space separated integers representing the elements of the second array/list.
+Output format :
+For each test case, print the intersection elements in a row, separated by a single space.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^5
+0 <= M <= 10^5
+Time Limit: 1 sec 
+Sample Input 1 :
+2
+6
+2 6 8 5 4 3
+4
+2 3 4 7 
+2
+10 10
+1
+10
+Sample Output 1 :
+2 4 3
+10
+Sample Input 2 :
+1
+4
+2 6 1 2
+5
+1 2 3 4 2
+Sample Output 2 :
+2 1 2
+Explanation for Sample Output 2 :
+Since, both input arrays have two '2's, the intersection of the arrays also have two '2's. The first '2' of first array matches with the first '2' of the second array. Similarly, the second '2' of the first array matches with the second '2' if the second array.

10. Searching and Sorting/15.3 Arrange Numbers in Array Solution.JPG

@@ -0,0 +1,46 @@
+Pair Sum
+
+You have been given an integer array/list(ARR) and a number X. Find and return the total number of pairs in the array/list which sum to X.
+Note:
+Given array/list can contain duplicate elements. 
+Input format :
+The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
+
+First line of each test case or query contains an integer 'N' representing the size of the first array/list.
+
+Second line contains 'N' single space separated integers representing the elements in the array/list.
+
+Third line contains an integer 'X'.
+Output format :
+For each test case, print the total number of pairs present in the array/list.
+
+Output for every test case will be printed in a separate line.
+Constraints :
+1 <= t <= 10^2
+0 <= N <= 10^3
+0 <= X <= 10^9
+Time Limit: 1 sec
+Sample Input 1:
+1
+9
+1 3 6 2 5 4 3 2 4
+7
+Sample Output 1:
+7
+Sample Input 2:
+2
+9
+1 3 6 2 5 4 3 2 4
+12
+6
+2 8 10 5 -2 5
+10
+Sample Output 2:
+0
+2
+
+
+ Explanation for Input 2:
+Since there doesn't exist any pair with sum equal to 12 for the first query, we print 0.
+
+For the second query, we have 2 pairs in total that sum up to 10. They are, (2, 8) and (5, 5).