Must do Problems to crack the FAANG Companies

FAANG Companies

Cracking coding interviews at FAANG companies is generally a brew of adopting the right strategy and executing it to the tee. It involves putting in the hours every day, mastering concepts in algorithms and systems design, and solving numerous problems to boost your problem-solving skills. But when there’s so much to do, we fail to understand where to start and what to follow ?

Don’t worry !! Placewit is here to help you out. Below is a list crafted that includes all the must do problems you should attempt in order to ace your placement rounds.

  1. Two Sum
  2. Longest Substring Without Repeating Characters
  3. Longest Palindromic Substring
  4. Container With Most Water
  5. 3Sum
  6. Remove Nth Node From End of List
  7. Valid Parentheses
  8. Merge Two Sorted Lists
  9. Merge k Sorted Lists
  10. Search in Rotated Sorted Array
  11. Combination Sum
  12. Rotate Image
  13. Group Anagrams
  14. Maximum Subarray
  15. Spiral Matrix
  16. Jump Game
  17. Merge Intervals
  18. Insert Interval
  19. Unique Paths
  20. Climbing Stairs
  21. Set Matrix Zeroes
  22. Minimum Window Substring
  23. Word Search
  24. Decode Ways
  25. Validate Binary Search Tree
  26. Same Tree
  27. Binary Tree Level Order Traversal
  28. Maximum Depth of Binary Tree
  29. Construct Binary Tree from Preorder and Inorder Traversal
  30. Best Time to Buy and Sell Stock
  31. Binary Tree Maximum Path Sum
  32. Valid Palindrome
  33. Longest Consecutive Sequence
  34. Clone Graph
  35. Word Break
  36. Linked List Cycle
  37. Reorder List
  38. Maximum Product Subarray
  39. Find Minimum in Rotated Sorted Array
  40. Reverse Bits
  41. Number of 1 Bits
  42. House Robber
  43. Number of Islands
  44. Reverse Linked List
  45. Course Schedule
  46. Implement Trie (Prefix Tree)
  47. Design Add and Search Words Data Structure
  48. Word Search II
  49. House Robber II
  50. Contains Duplicate
  51. Invert Binary Tree
  52. Kth Smallest Element in a BST
  53. Lowest Common Ancestor of a Binary Search Tree
  54. Lowest Common Ancestor of a Binary Tree
  55. Product of Array Except Self
  56. Valid Anagram
  57. Meeting Rooms
  58. Meeting Rooms II
  59. Graph Valid Tree
  60. Missing Number
  61. Alien Dictionary
  62. Encode and Decode Strings
  63. Find Median from Data Stream
  64. Longest Increasing Subsequence
  65. Coin Change
  66. Number of Connected Components in an Undirected Graph
  67. Counting Bits
  68. Top K Frequent Elements
  69. Sum of Two Integers
  70. Pacific Atlantic Water Flow

So, these were the questions that will shape the way you think when a question is presented before you. Make sure you solve them all without looking at the solutions till the point where you have tried your best. Placewit wishes you luck for your preparation and we hope you succeed in cracking one of the FAANG Companies.

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.

Upskilling students for tech placements!