Data Structures & Algorithms: Hash table concepts and implementation, DFS preorder traversal, and Binary Search Tree.
This round went really smoothly. The questions were fairly basic and focused mainly on fundamental concepts.
Spark: Questions about Spark parameters, including what they are and whether I had ever tuned them. They also discussed the concept of shuffle and how to handle a large list using Spark.
Data Structures & Algorithms:
Path Sum Letter Combinations of a Phone Number Word Break
All three were the original LeetCode problems without any modifications.
This round was more of a casual discussion, covering my past experience along with hash table implementation.
The discussion focused mainly on my past project experience, including a detailed walkthrough of the process involved in one of my previous projects. The round also included an introduction to the team.