Round 1: Online Coding Test

• Two DSA questions

Round 2: Technical Interview

• Two coding questions, both array-based

Round 3: Technical Interview

• Two coding questions: easy and medium level

Round 4: Technical Interview

• Two coding questions: easy and medium level

Given three arrays, find all pairs from two arrays such that the sum of those elements exists in the third array.

Reverse a Linked List.

Find the Kth Max Occurring Element in the Array. Used HashMap and Heap to solve this question. Time Complexity: O(n*log n)

Find the K-th Permutation Sequence: Given N and K, where N is the sequence of numbers from 1 to N ([1, 2, 3, ..., N]), find the Kth permutation sequence.