Geico [oa] -

1. Find the optimal path in a gird like array and return the max value in the path. Either move right or down
   example -
   [3,4,5]
   [6,4,5] Similar https://leetcode.com/problems/path-with-maximum-minimum-value/description/

2. Rearrange the elements(balls) such that adjacent elements have an empty
   Sample - ["b","","","b"] to ["b","","b",""]

3. Given a string of binary representation of a numerical lets call V. If its even divide by 2 and if its odd sub by 1 until the V value is zero. return the number of operations required to get the V value to zero
   Similar to this https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/description/

4. Similar to Merge intervals problem. Couldnt get a time to understand the question.
   https://leetcode.com/problems/merge-intervals/description/

Role - SSE, remote.
Takeaways -
The interviewer was very helpful, guiding me through the problem and brainstorming with me, which was a positive takeaway. However, after 60 minutes, I had only managed to complete the first problem. Honestly, they’re looking for LeetCode rockstars, which I didn’t quite expect.

No feedback yet.

UPDATE - GOT REJECTED. Morale is down! Need to grind leetcode more. Apparently, this is the way!