Can an array be divided into two subsequences with equal sums?
Software Developer New Grad Interview Questions
2,866 software developer new grad interview questions shared by candidates
Talked about conflicts, successes, past projects, feedback from peers.
Went through two technical problems, one involving dynamic programming.
NDA, topics: two pointers, set
2 LC Mediums. Facebook-tagged questions.
Unable to remember the exact question, but something about a tree.
Phone screen: Find depth sums in a binary tree and deep copy a linked list with an other pointer. Onsite: Cannot reveal due to NDA, but questions related to trees (BFS / DFS), strings, arrays, and hashmaps. Behavioural questions are pretty standard.
Take Home Front-End Coding Challenge - Create a infinite scroll for thumbnails w/o any libraries for nearly ~300k+ photos. DOM elements should be proportional to visible thumbnails. Should be done within 3 hrs.
The dot product between two sparse arrays. A better solution than O(n). You can pre-process the input.
Question 1: Given two sorted arrays, write a function to find the kth smallest element among both the arrays. (This was required to be solved in constant space without using any additional data structures).
Viewing 2231 - 2240 interview questions