Recently I gave a flipkart OA they asked 3 coding questions

1) It was really easy just implement what was asked
2) Given points in cartesian 2D plane and we have to check if we can make a square or not and if we can make then what is the `minimum length square` can be formed.(Similar to Leetcode 939 [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle/))
3) 
**Given** : 
- a natural number `n` and there is a round track with `n` stops
- `curr` and `final` stops $$1 \leq curr,final \leq n$$
- array of digits `digits`. $$ 0 \leq digits[i] \leq 9$$

**Target**:
- Minimum number of moves to reach `final` from `curr`

**Moves**:

- Moving forward or backward count as 1 move
- We can teleport from current stop to any stop that can be formed using given digits in `k+1` moves where `k` is the number of digits in teleported stop.

Recently I gave a flipkart OA they asked 3 coding questions
It was really easy just implement what was asked
Given points in cartesian 2D plane and we have to check if we can make a square or not and if we can make then what is the minimum length squ