Given a m*n grid starting from (1, 1). At any point (x, y), you has two choices for the next move: 1) move to (x+y, y); 2) move to (x, y+x); From point (1, 1), how to move to (m, n) in least moves? (or there's no such a path)
Engineer Interview Questions
1,134,434 engineer interview questions shared by candidates
# Question 3: # -- % Of sales that had a valid promotion, the VP of marketing # -- wants to know what % of transactions occur on either # -- the very first day or the very last day of a promotion campaign.
Given a wireless channel with loss rate 0.1, what's the throughput one can get with retransmission.
There is a refrigerator in a perfectly insulated room. The door is then opened. Is it an open or closed system? After a long time has passed, has the temperature in the room increased or decreased?
Write a recursive function to determine prime number
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
Explain P&IDs
Find max k elements among mostly sorted list.
Viewing 331 - 340 interview questions