Given an array of integers, find the length of the shortest subsequence that sums up to over a certain threshold.
Software Engineers Interview Questions
419,718 software engineers interview questions shared by candidates
forward linked list, traverse in reverse . in O(1) memory
If you had a savings account with $1, at a 100% interest rate, at what year would you have 15 billion dollars?
The most difficult questions are about some particular algorithms or mathematical problems that interviewer is very familiar with but the candidate has never heard of. Not only it may create a stressful situation (candidate thinks that it is something he/she is supposed to know), it is not how the people solve new problems in IT. Many people may not be able to fully understand a particular mathematical (e.g. theoretical) theorem in a matter of 10-15 minutes and without good understanding of that particular theorem it may be hard to apply it to the real-life problem presented by the interviewer. For example, the question about finding the majority number in a large input sequence.
My phone and onsite interview questions were super easy. It was just designing a class that had some methods to maintain data.
For a two-dimensional array of arbitrary size (not guaranteed to be square) containing binary values, find the total number of rectangles defined by four corners and parallel to the array's dimensions.
Given a string S and string T, implement a function search(string s, string t) that returns all occurrences of T or T's permutations in S. Assume that characters in S and T comprise of only lower and upper case English letters.
What is the Heapsort algorithm based on?
If you didn't have to worry about time efficiency at all, but need a space efficiency of O(1), how do you check if an array has duplicate numbers?
The question was basically inorder traversal- how would I write out the nodes of a binary tree from left to right
Viewing 2401 - 2410 interview questions