Find the number of ways to get from one corner of a grid to the opposite corner, by going down or right only.
Software Engineer Developer Interview Questions
466,396 software engineer developer interview questions shared by candidates
Check if a string is balanced
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.
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.
Call a function F in a loop. F returns a string of 140 chars. Write to the output 1 when F returns a string with the same letters (basically a permutation) of a string previously returned. (the question was not this well formed)
After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :)
Viewing 411 - 420 interview questions