A hard DFS leetCode question. Do you have any question to them?
Engineer Software Interview Questions
419,836 engineer software interview questions shared by candidates
Introduce yourself
Linked lists, BSTs, Arrays and the final round question: You have a set of cars and parking lots. You know the distances from each car to each parking lot and the parking lot capacities. How would you make sure each car gets to a parking lot with a vacancy so that all cars travel the least amount of total distance possible? A small data set example might be: distance_car1_to_lot1 = 1 distance_car1_to_lot2 = 10 distance_car2_to_lot1 = 2 distance_car2_to_lot2 = 100 lot1_capacity = 1 lot2_capacity = 1 You can see here that if you were to take car1 and put it into lot1 and car2 into lot2, the distance traveled of all cars would be 101. Rather than doing that, taking car1 to lot2 and car2 to lot1 would result in a total travel distance of 12. Which would be the correct answer in this small data set. How might you solve this, assuming there could a wide number of cars, parking lots and varying distances than listed above.
You have been given two pieces of flammable rope. The speed at which each individual rope can burn is inconsistent, but if you light the end with a match, the short rope will take 30 minutes to burn and the long rope takes an hour. How can you used the ropes to determine when 45 minutes have passed?
A software application to be designed for the financial client
Print out all combinations of k numbers out of 1...N e.g. when k = 2, n = 4 Print out 12, 13, 14, 23, 24, 34
In sudo-code write a program that takes an integer called N and prints out the Fibonacci sequence to the Nth digit.
Find the first letter in a string that does not have a pair.
You have a file consists of billions of records. It cannot fit into memory, so you need to reverse every word in that file and save to another file.
You are given a string with each english character translated to its alphabetical position (e.g., the string "ABC" --> "123"). Provide a function that, when provided the string as an argument, will return the maximum number of strings the encoded string could represent (for example, "123" could represent "ABC", "LC", or "AW").
Viewing 3261 - 3270 interview questions