HackerRank assesment test (50% cutoff):

1. https://leetcode.com/problems/group-anagrams/description/ -- 30% points
2. Variation of Grid (instead of one step we can move to k steps (1 -> k)) in all four directions min steps from 0,0 to reach n,m -- 70% points
   there are obstacles with infite height which means we can't process in that direction
   Got 75% so cleared this round

DSA(Round 1)

1. Given heights of building and distance k find same height atmost k distance return True if exist else false (solved with dp, windows)
2. same question with follow up almost same height atmost H difference (expectation is to solve this O(nlogn))

eg: height = [1,5,6,2,5,4,6] h = 1 k = 3 output is True
as abs(height[3] - height[0]) = 1 <= h and 3 - 0 <= K
h = 0 k = 3 output is false
not able to solve follow up in O(nlogn) rejected in this round

If anyone know leetcode problem number of these question please share i will update here so it will be easy to undersand.