Formers Interview Questions and Answers

Q1. Questions are based on your core subjects of your department.
Add your answer

Normal test based on subject knowledge

Q1. It is also normal test
Add your answer

Q1. Technical interview questions mostly on basics of electronic components and applications
Add your answer

Q1. Its simple and easy to pass this round
Add your answer

Q1. In HR round they will just explain the role of your job and what are the situation faced on site
Add your answer

Q1. They will conduct medical test to check your physical strength
Add your answer

Round duration - 30. minutes
Round difficulty - Easy

It was in the evening, question were moderate

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the night around 9:00 PM.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer