Skip to main content
9 min read0

LeetCode Study Plan for Uzbek Developers: 8-Week Roadmap

LeetCode is the single most reliable proxy for technical interview performance in 2026 — whether you're targeting Uzum, Click, EPAM in Tashkent, or a remote role at a European product company. But grinding 500 random problems is not a strategy. This 8-week plan targets the patterns that actually appear in local Tashkent interviews and the classic FAANG-style rounds that international companies run.

Before You Start: Set Your Baseline

Spend the first two days solving 10 easy problems you've never seen before, without any hints. Time yourself. This tells you which areas need the most work. Most Tashkent developers are strong on arrays and loops but weaker on graphs and dynamic programming — plan accordingly.

Target weekly time: 10–14 hours (about 1.5–2 hours per day). More than this leads to burnout; less than this means the patterns won't stick.

Week 1–2: Foundations (Arrays, Strings, HashMaps)

These patterns appear in nearly every first technical round in Tashkent companies. Master them before anything else.

  • Two Pointers — Valid Palindrome, Two Sum II, Container With Most Water
  • Sliding Window — Maximum Subarray, Longest Substring Without Repeating Characters
  • HashMap counting — Two Sum, Group Anagrams, Top K Frequent Elements
  • String manipulation — Reverse String, Valid Anagram, Longest Common Prefix

Do 3–4 problems per day. After solving each one, write down the pattern name and the key insight. Review your notes every morning — spaced repetition makes patterns stick faster than pure volume.

Week 3: Stacks and Queues

Stacks are underestimated. They appear in disguised form in many graph and parsing problems.

  • Valid Parentheses, Min Stack, Daily Temperatures
  • Evaluate Reverse Polish Notation, Largest Rectangle in Histogram
  • Queue: Implement Queue Using Stacks, Design Circular Queue

The key insight for stacks: whenever you see "find the next greater/smaller element" or "balance checking," think stack immediately.

Week 4: Trees and Binary Search

Trees are the most common data structure in mid-level interviews at Tashkent companies like Uzum, Humans, and IT Park residents. Binary Search is asked in almost every backend interview.

  • Tree traversals — Inorder, Preorder, Postorder (both recursive and iterative)
  • BST operations — Insert, Delete, Validate BST, Lowest Common Ancestor
  • Binary Search variants — Search in Rotated Sorted Array, Find First and Last Position, Search a 2D Matrix
  • Level-order BFS — Binary Tree Level Order Traversal, Right Side View

Many candidates can solve the recursive tree solution but freeze on the iterative version. Practice both — interviewers often ask you to eliminate recursion.

Week 5: Graphs

Graph problems are rare in phone screens but common in on-site rounds at larger Tashkent companies and in all international interviews.

  • BFS/DFS on grid — Number of Islands, Rotting Oranges, Flood Fill
  • Graph BFS/DFS — Clone Graph, Course Schedule (cycle detection), Pacific Atlantic Water Flow
  • Union-Find — Number of Connected Components, Redundant Connection

Build a mental template for BFS (queue + visited set) and DFS (stack or recursion + visited set). Most graph problems are variations on these two templates.

Week 6: Dynamic Programming — Fundamentals

DP is where many Uzbek developers struggle the most. The good news: 80% of DP problems in local interviews fall into 4 patterns.

  • 1D DP — Climbing Stairs, House Robber, Coin Change, Longest Increasing Subsequence
  • 2D DP — Unique Paths, Minimum Path Sum, Edit Distance
  • Knapsack pattern — 0/1 Knapsack, Partition Equal Subset Sum, Target Sum
  • String DP — Longest Common Subsequence, Palindromic Substrings

For each DP problem: define the state, write the recurrence, figure out the base case, then code. Don't jump to code first. Writing the recurrence on paper saves 20+ minutes per problem.

Week 7: DP Advanced + Heaps

  • Interval DP — Burst Balloons, Matrix Chain Multiplication
  • State machine DP — Best Time to Buy/Sell Stock (multiple variants)
  • Heap/Priority Queue — Kth Largest Element, Merge K Sorted Lists, Task Scheduler, Find Median from Data Stream

Heaps appear frequently in system design–adjacent coding questions: "design a feature that always returns the top N items." Know both min-heap and max-heap and when to use each.

Week 8: Mock Interviews + Weak Spot Drilling

Stop learning new patterns in week 8. Focus entirely on simulation.

  • Do 2 full mock interviews per week (timer on, camera on, explain out loud)
  • Use NeetCode's 150 list to fill any remaining gaps
  • Revisit every problem you couldn't solve in weeks 1–7 and solve it again from scratch
  • Practice explaining your approach before writing any code — Tashkent interviewers value communication as much as the solution

The 3 Mistakes Uzbek Developers Make on LeetCode

  1. Grinding quantity over patterns. 300 random problems with no pattern recognition is worth less than 80 well-categorized problems. After each problem, label it with its core pattern.
  2. Skipping the problem statement analysis. Most bugs come from misreading constraints. Before coding, ask: What is the input size? Can it be empty? Can values be negative? Are there duplicates?
  3. Practicing silently. In a real interview you must think out loud. If you practice silently at home, you'll freeze when asked to explain. Narrate your reasoning from day one.

Recommended Resources

  • NeetCode.io — best categorized problem list with video explanations
  • Blind 75 — the minimum viable problem set for interview prep
  • LeetCode Discuss — read the top solutions after you've solved (or failed) a problem
  • Pramp / Interviewing.io — free mock interviews with real engineers

Eight weeks of consistent, pattern-focused practice is enough to pass the coding round at any Tashkent company and most mid-level international interviews. The goal is not to memorize solutions — it's to recognize which template applies within the first 2 minutes of reading a problem.