Moonfrog Labs | SSE-2

Round 1

Questions:

1. You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
2. Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.
3. You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

Round 2

Questions:

• LLD Snake and Ladder game.