They gave me the below question to solve in 30 mins. Based on customer research, we know that our guests get confused when they are searching for accommodation and they found multiple hotels with the same name in the same city. To avoid this, we want to create a tool to identify "confusing" cities: cities with at least 3 hotels with the same name. Given a list of tuples (hotel_id, hotel_name, city) return a list of all "confusing" cities. Input: [ {hotel_1234, "Sheraton", "Amsterdam"} , {hotel_1000, "Sheraton", "Buenos Aires"} , {hotel_1001, "Hilton", "Amsterdam"} , {hotel_1002, "Royal Palace", "Bogota"} , {hotel_1003, "Hilton", "Amsterdam"} , {hotel_1004, "Sheraton", "Buenos Aires"} , {hotel_1005, "Sheraton", "Buenos Aires"} ] Output: [ "Buenos Aires" ]
Engin Interview Questions
843,740 engin interview questions shared by candidates
Create a 8 input AND gate using 3 4:1 muxes
"What is the size of an integer on a 32-bit system?"
How to remove a node from a singly-linked list when only given the pointer to the node
Find max k elements among mostly sorted list.
Was asked how I would implement division without using division or mod operators. The answer should return in the form quotient r remainder.
Given 2 numbers x and y, check if x is an integer power of y. For instance, x = 8, y = 2 would return true and x = 10 and y = 2 would return false since the first one is an integer power but the second isn't.
How to reverse a number, e.g. 1234.
Print a singly-linked list backwards, in constant space and linear time.
Mark likes to listen to music while travelling. His iPod™ contains N songs and he wants to listen to L (not necessarily different) songs during a trip. So he creates a playlist such that: • Every song is played at least once. • A song can be played again only if at least K other songs have been played Mark wants to know how many different playlists are possible. Can you help Mark determine this number? As the number can be very large, display number modulo 1,000,000,007. You are given N, K and L.
Viewing 281 - 290 interview questions