Wish Interview Question for Solutions Engineers
- 4of 4 votes
Wish Interview- aonecoding November 03, 2017 in United States
-Phone: Two sum, Three sum, N sum(recursion)
-Implement merge sort (recursion&iteration)
-Merge two sorted arrays: one of length m+n, the other n; store the result in the longer array
-Given a number print diamond:
- Rank N people in a game. There may be a tie among participants. How many possible ways of ranking there is.
- Design: Define a bot as an IP that hits the web app over M times in the past T seconds (not necessarily hits on the same page. Also take into account different API calls.) How to design a bot detector layer and where to place it in the system.
| Report Duplicate | Flag | PURGE
Wish Solutions Engineer Algorithm
Interview Type: In-Person
Open Chat in New Window