You are a parking lot attendant in a lot that has one open spot, and you want to move the cars from their original positions into a new arrangement. Create a program that will print out instructions on how to move the cars most efficiently.
Software Engineer Internship Interview Questions
665,002 software engineer internship interview questions shared by candidates
Whats is max possible edges in a graph with no cycles.
Partition an array in such way zeros to be moved on the left side of the array, other numbers on the right side of the array. Extra storage not allowed, only in-place.
Items are pushed onto a stack, and therefore may be accessed in a last-in-first-out (LIFO) manner. How might you access these items in a first-in-first-out (FIFO) manner?
An array has negative and positive numbers. Separate the numbers such that negative numbers are at the beginning and positive numbers at the end without changing the order. You cannot sort it. Explain with O(1) space
We're playing a game of Russian Roulette. I take 2 consecutive bullets out of the 6 bullet revolver and spin the chamber. I go first and shoot the bullet at my head, which misses. I then pass the gun to you, where you have the option of spinning the chamber, or shooting. Which would you do to maximize your probability of not dieing?
Write a code to convert an ASCII representation of a positive integer to it's numeric value.
Say you use SVN for source control..you have several revisions of a file...R1, r2, r3..etc..Someone checked in a bug and the revision became bad..need t find the first bad revision..gave a function findBadRevision(int goodRevision, int badRevision) so for e.g the revisions were GGBB and function passes in 0,4 so the first bad revision is 2. There exists a function boolean hasBug(int revision) which will tell us if a certain revision has a bug. can assume good revision < bad revision
O(n) time O(1) space to print link list reversely.
One question 3 of the interviewers asked me was "What was the most difficult thing you had to deal with.".
Viewing 411 - 420 interview questions