YOE: 1 year 8 months.

Applied through Hackerearth Contest.
Number of rounds – 3

Round 1 – PS/DS (60 mins)

1. Basic Introductions
2. Some LP questions
3. https://leetcode.com/problems/longest-consecutive-sequence, Couldn't able to come up with optimal solution, had to use space inorder to reduce TC.

Round 2 – PS/DS (60 mins)

1. Basic Introductions
2. Some LP questions
3. https://leetcode.com/problems/koko-eating-bananas/
4. https://leetcode.com/problems/decode-string/, couldn't able to solve this completely since my code has some bugs, later took some time & explained approach to which interviewer also agreed.

Round 3 – SDM Round (60 mins)

1. Basic Introductions
2. Some LP questions
3. https://leetcode.com/problems/word-ladder/, a modified version of this where instead of providing a set of words, it is all english words available in dictionary. Proposed three solutions
   • Graph based DFS traversal
   • Trie Based solution to search whether a word exists in dictionary
   • Binary Search solution to optimise above solution

EDIT: Verdict – Rejected