implement a stack with a method which can return the minimal value in the stack without remove this value.
Developer Interview Questions
640,318 developer interview questions shared by candidates
Write an algorithm to return the intersect of two arrays.
You need to design a system to provide answers to factorials for between 1 and 100. You can cache 10 numbers. How would you arrange/manage that cache, and what is the worst case for lookup on a cache miss?
2 medium questions and 1 hard
Given an ordered large array of integers, find all pairs of numbers that add up to a particular given sum.
round 1: Why coming to Berlin from India? Why Zalando? What do you know about Zalando? Salary expectations? Do you have any questions? round 2: Tell me about about a situation when there has been a conflict between you and your colleague, how you resolved it. Tell me about about a situation when there has been a conflict between two of your colleagues, they approached how you resolved it. How do you convince people to choose a technology? Tell me about about a situation when you went against odds / didn't listen to your manager. How you convince people to help you with technical issues. Tell me about about a situation which proves you are motivated to take up challenges and learn new technologies. How you choose a a particular technology/solution from among multiple technologies/solutions.
There are 2 ropes which both last for 1 hour when burning. Use these 2 ropes to get 1 hour and a half.
puzzle : there is a island and the resident are either blue or black eyed. The residents are trapped in the island and want to leave. One day a foreigner comes and says there are few blue eyed people. He will be sending a steamer to the island every day and blue eyed people can leave. But if a black eyed person approaches the steamer, he will be killed. Constraint: No body knows their eye colour and can't even ask or say the colour to any other person. even cant see their reflection. So how many days is required for all the blue eyed person to leave the island.
Flatten a list containing n sublists. Ex: [3, 4, [4, [[55]]]] -> [3, 4, 4, 55]
sort binary array with minimum time complexity
Viewing 1201 - 1210 interview questions