Google Interview Question

Array & String Manipulation: Examples like reversing an array, finding duplicates, or working with palindromes. Linked Lists: Reverse a linked list, detect a cycle, or merge sorted lists. Stacks & Queues: Implementing these data structures or using them to solve problems like evaluating expressions. Trees & Graphs: Questions like finding the Lowest Common Ancestor or traversing binary trees. Dynamic Programming: Classic problems like the Fibonacci series, longest common subsequence, or the 0/1 knapsack problem. Bit Manipulation: Problems like single number or reversing bits. Greedy Algorithms: Questions such as scheduling tasks or finding the minimum number of coins needed for change.