USCode ✌️

Overview

Welcome to USCode - a collaborative coding interview preparation repository designed to help our team master technical interviews for US tech companies. This repository serves as our central hub for sharing solutions, discussing problem-solving strategies, and tracking our progress through various coding challenges.

Our mission is to build a strong foundation in data structures, algorithms, and system design while fostering a supportive learning environment where we can grow together and achieve our career goals in the US tech industry.

🧑‍💻 Members

Name
[Member 1]
[Member 2]
[Member 3]
[Member 4]

💻 Workflow & Rules

To be defined after team discussion and agreement

🗓️ Roadmap

1️⃣ Phase 1: Foundation Building (Weeks 1-4)

Week 1: Arrays & Hashing

1. [NeetCode] #49. Group Anagrams
2. [NeetCode] #347. Top K Frequent Elements
3. [FAANG Interview] #238. Product of Array Except Self (Amazon/Meta)

Week 2: Two Pointers

1. [NeetCode] #167. Two Sum II - Input Array Is Sorted
2. [NeetCode] #15. 3Sum
3. [FAANG Interview] #11. Container With Most Water (Google/Meta)

Week 3: Sliding Window

1. [NeetCode] #3. Longest Substring Without Repeating Characters
2. [NeetCode] #424. Longest Repeating Character Replacement
3. [FAANG Interview] #567. Permutation in String (Meta)

Week 4: Stack & Binary Search

1. [NeetCode] #150. Evaluate Reverse Polish Notation
2. [NeetCode] #74. Search a 2D Matrix
3. [FAANG Interview] #33. Search in Rotated Sorted Array (Amazon/Google)

2️⃣ Phase 2: Core Pattern Mastery (Weeks 5-8)

Week 5: Linked List

1. [NeetCode] #19. Remove Nth Node From End of List
2. [NeetCode] #143. Reorder List
3. [FAANG Interview] #2. Add Two Numbers (Amazon/Meta)

Week 6: Trees

1. [NeetCode] #102. Binary Tree Level Order Traversal
2. [NeetCode] #98. Validate Binary Search Tree
3. [FAANG Interview] #230. Kth Smallest Element in a BST (Amazon/Meta)

Week 7: Heaps (Priority Queue) & Tries

1. [NeetCode] #973. K Closest Points to Origin
2. [NeetCode] #211. Design Add and Search Words Data Structure
3. [FAANG Interview] #215. Kth Largest Element in an Array (Amazon/Meta)

Week 8: Backtracking & Graphs

1. [NeetCode] #46. Permutations
2. [NeetCode] #207. Course Schedule
3. [FAANG Interview] #79. Word Search (Amazon/Meta)

3️⃣ Phase 3: Advanced & Real-world Preparation (Weeks 9-11)

Week 9: 1-D Dynamic Programming

1. [NeetCode] #322. Coin Change
2. [NeetCode] #139. Word Break
3. [FAANG Interview] #198. House Robber (Google/Amazon)

Week 10: 2-D Dynamic Programming

1. [NeetCode] #62. Unique Paths
2. [NeetCode] #1143. Longest Common Subsequence
3. [FAANG Interview] #5. Longest Palindromic Substring (Amazon/Google)

Week 11: Greedy & Intervals

1. [NeetCode] #55. Jump Game
2. [NeetCode] #56. Merge Intervals
3. [FAANG Interview] #435. Non-overlapping Intervals (Meta/Google)

📚 References

Primary Resources

• LeetCode - The gold standard for coding interview practice
• NeetCode - Structured learning path with video explanations

Additional Study Materials

• This is Coding Test - Algorithm-specific YouTube video guide in Korean
• Cracking the Coding Interview - Classic book by Gayle Laakmann McDowell
• Algorithms, Part I & II (Princeton) - Free Coursera course by Robert Sedgewick
• System Design Interview - Alex Xu's comprehensive system design guide
• Blind 75 - Curated list of the most important LeetCode problems
• Grokking the Coding Interview - Pattern-based approach to coding interviews

Practice Platforms

• HackerRank - Additional practice problems
• CodeSignal - Company-specific practice tests
• Pramp - Mock interview practice with peers

Interview Preparation

• InterviewBit - Structured learning paths
• GeeksforGeeks - Comprehensive algorithm explanations
• YouTube - Back To Back SWE - High-quality coding interview explanations