Array manipulation, string manipulation, algorithm questions, and time complexity questions.
Grad Interview Questions
7,381 grad interview questions shared by candidates
given an array of n integers, check if the array has two nearby duplicate numbers (meaning if a [2] = 3, Then check if 3 occurs at most two positions after.
related to strings
Find the longest path in a travel flights path which is a directed acyclic graphic
The first one is a assigning cars to uses problem. The second is the robot problem on the leetcode.
Write a function debounce(fn, timeout) which accepts a function and timeout as inputs and returns a function which will on allow fn to run after timeout ms.
Create the class SnapshottableArray, which is a normal array except it has the ability to take a snapshot in time of the current values of the array, giving a handle/id. It has the class signature below. Focus on reducing space at the cost of time complexity. Fill in the function bodies to complete the class. (I wrote the class with types to make it clear what everything does, but the code should be in JS.) class SnapshottableArray{ SnapshottableArray(int size); // create new snapshottable array with size void set(int index, int value); // set's array at index to value int get(int index); // return the array at index's value int takeSnapshot(); // take a snapshot and return the handle/id of it int getSnapshotValue(int id, int index); // return the array at index's value for the given snapshot, represented by id }
Using JS Browser DOM API available functions, write "getElementsByClassName(className)" which accepts a string className and returns a list of HTML Elements which have the required className.
Dont remember questions in snapshot, used hash-map, stacks and recursion. Phone Interview: An m*n matrix filled with 0's and 1's, Find maximum number of squares that have all 1's in int.
What's your favourite j&j product and why?
Viewing 231 - 240 interview questions