Grid Illumination: Given an NxN grid with an array of lamp coordinates. Each lamp provides illumination to every square on their x axis, every square on their y axis, and every square that lies in their diagonal (think of a Queen in chess). Given an array of query coordinates, determine whether that point is illuminated or not. The catch is when checking a query all lamps adjacent to, or on, that query get turned off. The ranges for the variables/arrays were about: 10^3 < N < 10^9, 10^3 < lamps < 10^9, 10^3 < queries < 10^9.
Ingegneria Interview Questions
375,191 ingegneria interview questions shared by candidates
Given a 1TB file of serialized 4 byte integers, and 2GB of ram, sort the integers into a resulting 1TB file. My interviewer was very collaborative in entertaining various solution ideas until we came up with a combo that would work performantly and reduce the number of passes over the 1TB file and intermediate files.
Implement the div operator without using / or %
Interweave a linked list. Do it in Linear time and constant space. Input: A->B->C->D->E Output: A->E->B->D->C
for encoding that {a,b,c,...,z}<->{1,2,3,...,26} if given a list of digit e.g. [1,2,3], this may represent {1,2,3}->{a,b,c} or {12,3}->{l,c} or {1,23}->{a,w}. so there are 3 possible interpretations for list [1,2,3] so, given a list of digit, calculate the number of possible interpretations for the list.
find 3 elements in an array that sum to 0.
If you had to change permissions to read/write all recursively in the unix terminal, how would you do it?
Why u chose IT? Why do want to join syntel?
Here is the brain teaser question: Given integers as 1, 2, 3, 4, ..., N. Every time you remove an alternative element until only one is left. If you reach the end, just do a rounding. Return the remaining element. For example, given 1,2,3,4,5,6, you remove 1, 3, 5 and then 2, 6. So the remaining element is 4. What is the remaining element if N is 2000?
Given a Binary Search Tree with integers at every node and an integer k, write code that decides whether or not there exists two nodes a and b such that a+b=k
Viewing 361 - 370 interview questions