Google

4 rounds Data structure and algorithms: * Depth First Search * Breadth First Search * Arrays and Linked lists * Recursion * JSON patching * Heaps * HashSets * HashMaps * Lists

First round - phone call - asked about technical projects, current org work, coding experience, and preferred language. Second round - coding interview. Two questions - a graph and a BST question.

Great for its OA. One LeetCode easy problem, one easy problem. The first one focuses on the partition of a string, and the second one is basically just a math problem.