YOE-3 , Recuriter reached out to me , Position was for Data Engineer(Hadoop/Spark)

Roud1(HackerRank) :

• Medium level Stack based question
• Medium level Slinding Window question

Round2(CoderPad) :

• Given list of Child->Parent(Trees) relations in a forest , Need to find the number of unconnected Trees , Root of Tree with maximum children (DFS)
• Grid Problem (DP)

Super Day : Elimination Rounds
Round1 :

• Given list of sorted numbers in an array and value k , using k value need to increment any number/s in an array , need to find the maximun nubmer of same elements after using upto k value (Sliding Window)
• Given some array of tasks , CPU can process single task in a cycle , similar tasks can be performed after some k cooling period cycles , need to return the minimun cpu cycles to compute all the tasks (Heap , Queue)

Roud2 :

• Some discussion related to current projects , resume
• Implement TTL based Cache
• Implement Notification System (LLD) -> (Focus more on classes and relations and design patterns )

Rejected in Round 2 didn't perform well .