Placement Papers - Silent Infotech

Silent Infotech Interview Experience - Infocity, Gandhinagar
Posted by :
Abhishek R Soni
(11)
Me and my other friends were attempted the "Technical Written Test" at Gandhinagar Infocity.
The Question Paper Fully Consists of 7 Coding Problems. (You can implement on it in any Programing Language).
6 out of 7 Questions are given below.
1] Find the longest String and Count the Total no of words in the String.
Input: "I Love My India".
Output: Word_length: 4.
Longest Word: India.
2] Find the index of the Pair whose Sum is equal to the target value.
Input: [2, 4, 3, 7, 8] target = 9.
Output: [0, 3] (2+7 = target).
3] Two sorted arrays are given you have to merge both and make a sorted array (can't contain redundant value).
Intput: [1, 2, 4, 5, 6], [3, 6, 7, 8, 9]
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
4] Find the sum of all indices except the Current Index.
Input: [2, 4, 6]
Output: [10, 8, 6]
Justification:
10: 4 + 6.
8 : 2 + 6.
6 : 2 + 4.
5] Find the longest SubString.
Input: "abcabcbb".
Output: 3 (abc).
Input: "bbbb".
Output: 1 (b).
6] Find the Triplet where the Sum of the index is equal to 0 (Zero).
(can't contain redundant value).
Input: [-1, 0, 1, 2, -1, -4]
Output:
[
[-1, 0, 1],
[-1, -1, 2].
]
The Question Paper Fully Consists of 7 Coding Problems. (You can implement on it in any Programing Language).
6 out of 7 Questions are given below.
1] Find the longest String and Count the Total no of words in the String.
Input: "I Love My India".
Output: Word_length: 4.
Longest Word: India.
2] Find the index of the Pair whose Sum is equal to the target value.
Input: [2, 4, 3, 7, 8] target = 9.
Output: [0, 3] (2+7 = target).
3] Two sorted arrays are given you have to merge both and make a sorted array (can't contain redundant value).
Intput: [1, 2, 4, 5, 6], [3, 6, 7, 8, 9]
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
4] Find the sum of all indices except the Current Index.
Input: [2, 4, 6]
Output: [10, 8, 6]
Justification:
10: 4 + 6.
8 : 2 + 6.
6 : 2 + 4.
5] Find the longest SubString.
Input: "abcabcbb".
Output: 3 (abc).
Input: "bbbb".
Output: 1 (b).
6] Find the Triplet where the Sum of the index is equal to 0 (Zero).
(can't contain redundant value).
Input: [-1, 0, 1, 2, -1, -4]
Output:
[
[-1, 0, 1],
[-1, -1, 2].
]
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers