**DP World | SDE-1 Banglore 3.3 Year **
September 2021
Round One(Online assesment):-
Two coding question 2 Hour
1.)https://leetcode.com/problems/rotting-oranges/
2.) Did not remeber but it was an easy array problem
3.) 10 MCQ's based on different CS subject like (Operaing System, Java OOPS concepts etc)

Round Two (F2F Technical)
1.) Count total Inversion In an array
https://leetcode.com/problems/global-and-local-inversions/
2.)Given two sorted arrays, we need to merge them in O((n+m)*log(n+m)) time with O(1) extra space into a sorted array, when n is the size of the first array, and m is the size of the second array.
**Input: ar1[] = {10};
ar2[] = {2, 3};
Output: ar1[] = {2}
ar2[] = {3, 10} **

Input: ar1[] = {1, 5, 9, 10, 15, 20};
ar2[] = {2, 3, 8, 13};
Output: ar1[] = {1, 2, 3, 5, 8, 9}
ar2[] = {10, 13, 15, 20}

Round 3(F2F Technical)
1.) https://leetcode.com/problems/next-greater-element-iii/
2.)https://leetcode.com/problems/palindromic-substrings/

Round 4 :-(F2F Hiring manager +Technical)
1.)https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
2.)https://leetcode.com/problems/sliding-window-maximum/
3.)https://leetcode.com/problems/car-pooling/
Deeply Discussion about current project and role.

Round 5 (HR round-Telephonic )
Normal HR Questions and salary discussion

Verdict : Selected