OA
6 questions on Hackerrank
Duration : 2 hours
I completed 5 of them and passed only half the test cases for the 6th one

1st Round

1. Given a list of points, find out if any four of them form a square. Return 'true' if possible, else 'false'.
   Examples:
   [[0, 0], [2, 0], [1, 1], [0, -1], [-1, -1], [0, 2], [0, 1], [1,0]]
   Result : true ([0, 0], [0, 1], [1, 0] and [1, 1] form a square)

   [[1, 1], [2, 0], [3, 3], [0, 2], [-5, -5]]
   Result : false

   The closest question I could find on LC was this one
   https://leetcode.com/problems/valid-square/

2. https://leetcode.com/problems/closest-dessert-cost/
   I didn't have time to write the memoization solution solution for this. So, just wrote the recursive version.

2nd Round
Just one coding question and some behavioural questions
https://leetcode.com/problems/daily-temperatures/

Offer