WheelsEye Interview Experience for SDE-2

Round 1: Written round in the office

• Expectation code/pseudo code.
  1. Minimize swaps: https://www.w3wiki.net/minimum-swaps-required-bring-elements-less-equal-k-together/
  2. Job scheduling: https://www.w3wiki.net/activity-selection-problem-greedy-algo-1/
  3. 3d points: Don’t remember the exact question. Given multiple points in 3D space represented by (X, Y, Z). Count points with the same permutation of the coordinates. SOLUTION: convert all coordinates to a common form (I sorted the 3 coordinates) per point and hashed using the sorted coordinates. Now iterate over the hash keys() and count.

Round 2: I had given pseudo-code for problem 1 above.

• Write code for the heap: https://www.w3wiki.net/binary-heap
• Solution discussion for: https://www.w3wiki.net/given-sorted-dictionary-find-precedence-characters/
• Mathematical problem: https://www.w3wiki.net/how-to-check-whether-a-number-is-in-the-rangea-b-using-one-comparison/

Round 3:

• Maximum product of a triplet from over a stream with negatives included.
• Lift design: