↓ Ir para o conteúdo principal

← todas as notas

📎 Webclip

Best LeetCode problems to prepare for coding interviews

Thread outlining recommended LeetCode problems to prepare for coding interviews, grouped by topic and annotated with approximate percentages of companies that test each area. Topics include arrays, hash maps, sorting, string manipulation, greedy algorithms, search, and stacks/queues, each with concrete problem suggestions.

Reading notes
#

  • The thread aims to help candidates prepare for coding interviews using LeetCode problems.
  • Arrays are highlighted first, with a claim that 70% of companies test array knowledge.
  • Recommended array problems: Two Sum, Unique Paths, Median of Two Sorted Arrays.
  • Hash maps are presented as a key topic, reportedly tested by 50% of companies.
  • Suggested hash map problems: Group Anagrams, Intersection of Two Arrays, Unique Email Addresses.
  • Sorting is another area that 50% of companies allegedly test.
  • Recommended sorting problems: Merge Intervals, Sort List, Largest Number.
  • String manipulation is said to appear in 40% of company interviews.
  • Suggested string problems: Longest Substring without Repeating Characters, String to Integer.
  • Greedy algorithms are attributed to 31% of companies testing this knowledge.
  • Recommended greedy-related problems: Subsets, Combination Sum, Permutations.
  • Search algorithms are claimed to be tested by 30% of companies.
  • Suggested search problems: Search Insert Position, Find Minimum in Rotated Sorted Array, Capacity to Ship Packages Within D Days.
  • Stacks and queues are mentioned with 17% of companies testing these structures.
  • Recommended stack/queue problems: Valid Parentheses, Reverse Linked list, Orderly Queue.
  • The final tweet in the thread only contains the handle @hackerrank without further explanation.