Online Assessment:
4 Questions of Medium-Hard difficulty.
Needed atleast 3 full and 1 partial for next round.

Round1: Technical Round (Senior SDE) [45 mins]
Q1: A Dice is there, print all subsets for k throws of that dice. Similar to (https://leetcode.com/problems/subsets/)
Q2: Merge 2 sorted arrays.
	Follow up: Merge k sorted arrays.
Q3: Search in sorted rotated array. (https://leetcode.com/problems/search-in-rotated-sorted-array/)
Q4: Given an array, a subarray could be of 3 types. Check whether the array could be split into subarrays using those operations. [1D DP]
     Type 1: Subarray consists of 3 elements, all are increasing in nature with difference of one. Ex (1, 2, 3)
	 Type 2: Subarray consists of 2 elements, all are same. Ex (1, 1)
	 Type 3: Subarray consists of 3 elements, all are same. Ex (1, 1, 1)
 
    I/P: [1, 2, 3, 4, 4, 4, 5, 6]
    O/P: true (partitions: [1, 2, 3], [4, 4], [4, 5, 6])
   
    I/P: [1, 1, 1, 2]
    O/P: false
   
Was able to solve all in under 30 mins.

Round 2: Technical Round (Senior SDE) [45 mins]
Q1: Zig-Zag Traversal of Binary Tree (https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)
Q2: Maximum Product Subarray (https://leetcode.com/problems/maximum-product-subarray/)
Q3: Find occurence of given word in a big file. [Only logic was needed, told string matching algorithm, KMP, rabin-karp]
Q4: OOPS Concepts: Virtual function, abstract class, overloaded destructor.

Was able to solve dsa questions in 30 mins, not able to give proper answers for OOPS concepts.

Round 3: Manager Round [1 hr]
Q1: Make the given class thread safe.
Q2: OS Concepts: Race Condition, Deadlocks, Semaphore, Mutex.
Q3: DBMS Concepts: Indexing (Interviewer wanted to go in deep, but since I wasn't that good in DBMS, told him upfront)
Q4: Garbage Collection in Java (Again, Interviewer want to go in deep, but told him upfront that I didn't know much about it)
Q5: Reader-Writer Problem

Was able to give proper answers for first 2 questions, but struggled in others.