Linear Search Problem Statement

Given a random integer array/list ARR of size N, and an integer X, you are required to search for the integer X in the given array/list using Linear Search.

Return the index at which X is found. If X appears multiple times, return the index of its first occurrence. If X is not present, return -1.

Example:

Input:

t = 1
N = 5
ARR = [1, 2, 3, 4, 5]
X = 3

Output:

2

Explanation:

X is located at index 2 in ARR.

Constraints:

1 ≤ t ≤ 10^2

0 ≤ N ≤ 10^5

-2^{31} ≤ X ≤ (2^{31}) - 1

Time Limit: 1 sec

Question

Linear Search Problem Statement

Given a random integer array/list ARR of size N, and an integer X, you are required to search for the integer X in the given array/list using Linear Search.

Return the index at which X is found. If X appears multiple times, return the index of its first occurrence. If X is not present, return -1.

Example:

Input:

t = 1
N = 5
ARR = [1, 2, 3, 4, 5]
X = 3

Output:

Explanation:

X is located at index 2 in ARR.

Constraints:

1 ≤ t ≤ 10^2
0 ≤ N ≤ 10^5
-2^{31} ≤ X ≤ (2^{31}) - 1
Time Limit: 1 sec

Accepted Answer

Linear search algorithm to find the first occurrence of an integer in an array.

Iterate through the array and compare each element with the target integer.
Return the index if the target integer is found, else return -1.
Time complexity is O(N) where N is the size of the array.

Linear Search Problem Statement

Example:

Input:

Output:

Explanation:

Constraints:

Wipro Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Wipro Software Developer