Find the maximum value in a stack, with constant complexity
Software Development Engineer Interview Questions
32,827 software development engineer interview questions shared by candidates
Given a list of numbers and a rand(0,1) function, which returns a random integer between 0 and 1. Provide an algorithm to randomly sort the given list, based on the output of the rand() function, which should be called once for every number on the list. Code the solution in any language of your choice.
He asked the best way to store boolean values on memory. I said an array but he wanted more, so in the end I said BinaryVector class. He asked why a binary vector is a better option but I couldn't answer that. I told him that I don't know the internal implementation.
How would you implemented a priority queue that allows one to get minimum and maximum from the same data structure?
// // Write a function that takes a string and returns its length without using built in properties (such as .length or .size()). //
First question: for a random-ordered bucket of numbers 1 through 3000 with one number missing, how would you detect which number is missing?
Check if a string is a pallindrome Find the longest distance between any two nodes in a binary tree.
Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
Connect Four is a game where two players take turns dropping their color discs into a vertically suspended grid. The game ends when a player adds a disc to the playing grid that connects four discs of their color. The connected discs can be in a horizontal, vertical or diagonal line. Write a function to be called after every turn that returns true if the game is over (and false otherwise).
You have 16 race horses and a racetrack which only fits 4 horses at one time. Find the top 4 horses in the fewest number of races.
Viewing 251 - 260 interview questions