Skip to content

Latest commit

Β 

History

History

02-Problems

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

README.md

Track 2 β€” Gates (Problems Bank)

Learn + Solve. Every folder is a Gate. Enter only Gates at or below your Hunter Rank.

Spoiler rule: no finished solutions ship by default. You create solution-1.php.

At a glance

Bank size 238 Gate stubs (climb + Side Quests + Interview Armor)
Order law Gate IDs ascend with difficulty: E β†’ D β†’ C β†’ B β†’ A β†’ S β†’ Side β†’ Armor
Start 01-E-Gates/ β€” lowest IDs first
Layout Rank-folder / Pattern-category / Gate-NNN-kebab/
Optional 07-Side-Quests/ β€” not graduation-critical
Armor Linked lists / TreeNode β†’ ../04-Interview-Armor/ (after S on the ID ladder)

How to clear one Gate: open its README.md β†’ Brief β†’ Brute β†’ Tighten β†’ Talk (see root Quick start) β†’ fill solution-1.php β†’ mark βœ… below β†’ update root Status Window.

Folder name: Gate-NNN-kebab-case/ under Rank/Category/ (example: 02-D-Gates/05-Arrays-Hashing/Gate-080-contains-duplicate/).

Category order: within each rank, numbered folders ascend by skill load (easy drills β†’ core patterns). Gate IDs follow that walk.


Difficulty emoji

Every Gate title and map row carries a rank emoji (climb heat, not platform labels):

Emoji Lane Feel
🌱 E-Gates Survive β€” warmups
πŸ“— D-Gates Core Easy
βš”οΈ C-Gates Easy β†’ early Medium
πŸ”₯ B-Gates Main Medium
πŸ’Ž A-Gates Stretch
πŸŒ‘ S-Gates Prestige
🧭 Side Quests Optional detour
πŸ›‘οΈ Interview Armor Lists / trees (late)

Gate ranks

Folder Min Hunter Rank Intent ID range
🌱 01-E-Gates/ E Survive β€” PHP confidence 001–049
πŸ“— 02-D-Gates/ D Core Easy 050–094
βš”οΈ 03-C-Gates/ C Easy β†’ early Medium 095–132
πŸ”₯ 04-B-Gates/ B Main Medium set 133–178
πŸ’Ž 05-A-Gates/ A Stretch 179–197
πŸŒ‘ 06-S-Gates/ S Prestige (PHP-fit only) 198–200
🧭 07-Side-Quests/ any Optional β€” not graduation-critical 201–221
πŸ›‘οΈ ../04-Interview-Armor/ B+ Interview lists/trees 222–238

Gate Source Map (progression order)

Dedup rule: one problem idea β†’ one climb Gate. Dual platform Sources are OK.
Related-but-distinct Gates stay separate and link each other (## Related Gates).
Interview-form twins live in 04-Interview-Armor/ (not a second core Gate).
IDs are sequential by rank β€” not by import wave.

🌱 01-E-Gates (49)

Gate Title Category Platform XP Status
001 🌱 Sum of Two Numbers 01-Numbers Edabit 25 ☐
002 🌱 Next Number 01-Numbers Edabit 25 ☐
003 🌱 Minutes to Seconds 01-Numbers Edabit 25 ☐
004 🌱 Hours to Seconds 01-Numbers Edabit 25 ☐
005 🌱 Remainder of Two Numbers 01-Numbers Edabit 25 ☐
006 🌱 Divisible by Five 01-Numbers Edabit 25 ☐
007 🌱 Multiple of 100 01-Numbers Edabit 25 ☐
008 🌱 Less Than or Equal to Zero 01-Numbers Edabit 25 ☐
009 🌱 Celsius to Fahrenheit 01-Numbers W3Schools 25 ☐
010 🌱 Area of a Triangle 01-Numbers Edabit 25 ☐
011 🌱 Maximum Triangle Edge 01-Numbers Edabit 25 ☐
012 🌱 Rectangle Perimeter 01-Numbers Edabit 25 ☐
013 🌱 Age to Days 01-Numbers Edabit 25 ☐
014 🌱 The Farm Problem 01-Numbers Edabit 25 ☐
015 🌱 Absolute Difference 01-Numbers w3resource 25 ☐
016 🌱 Sum 1 to N 01-Numbers W3Schools 25 ☐
017 🌱 Factorial 01-Numbers W3Schools 25 ☐
018 🌱 Difference of Squares 01-Numbers Exercism 25 ☐
019 🌱 Even or Odd 02-Control-Flow W3Schools 25 ☐
020 🌱 FizzBuzz 02-Control-Flow W3Schools 25 ☐
021 🌱 Keep Up the Hoop 02-Control-Flow Codewars 25 ☐
022 🌱 Multiplication Table for Number 02-Control-Flow Codewars 25 ☐
023 🌱 Grade Decision 02-Control-Flow HackerRank 25 ☐
024 🌱 Sum With a Loop 02-Control-Flow HackerRank 25 ☐
025 🌱 Factorial Table Lines 02-Control-Flow w3resource 25 ☐
026 🌱 Reverse String 03-Strings LeetCode 25 ☐
027 🌱 Count Vowels 03-Strings Original 25 ☐
028 🌱 Word Counter 03-Strings W3Schools 25 ☐
029 🌱 First and Last Character 03-Strings W3Schools 25 ☐
030 🌱 Return Something to Me 03-Strings Edabit 25 ☐
031 🌱 Is the String Empty 03-Strings Edabit 25 ☐
032 🌱 Concatenate Name 03-Strings Edabit 25 ☐
033 🌱 Convert a String to an Array 03-Strings Codewars 25 ☐
034 🌱 Remove String Spaces 03-Strings Codewars 25 ☐
035 🌱 String Concat Parts 03-Strings HackerRank 25 ☐
036 🌱 Length and Uppercase 03-Strings HackerRank 25 ☐
037 🌱 String Stats 03-Strings w3resource 25 ☐
038 🌱 Two Fer 03-Strings Exercism 25 ☐
039 🌱 Sum Array Elements 04-PHP-Arrays-Basics Original 25 ☐
040 🌱 Find Max and Min 04-PHP-Arrays-Basics Original 25 ☐
041 🌱 Average Score 04-PHP-Arrays-Basics W3Schools 25 ☐
042 🌱 Count Matches 04-PHP-Arrays-Basics W3Schools 25 ☐
043 🌱 First Array Element 04-PHP-Arrays-Basics Edabit 25 ☐
044 🌱 Reverse an Array 04-PHP-Arrays-Basics Edabit 25 ☐
045 🌱 Associative Value Sum 04-PHP-Arrays-Basics HackerRank 25 ☐
046 🌱 2D Matrix Sum 04-PHP-Arrays-Basics HackerRank 25 ☐
047 🌱 Array Values Product 04-PHP-Arrays-Basics w3resource 25 ☐
048 🌱 Unique Then Sort 04-PHP-Arrays-Basics w3resource 25 ☐
049 🌱 Resistor Color 04-PHP-Arrays-Basics Exercism 25 ☐

πŸ“— 02-D-Gates (45)

Gate Title Category Platform XP Status
050 πŸ“— Leap Year 01-Numbers W3Schools 40 ☐
051 πŸ“— Prime Check 01-Numbers W3Schools 40 ☐
052 πŸ“— Breaking Chocolate Problem 01-Numbers Codewars 40 ☐
053 πŸ“— Descending Order 01-Numbers Codewars 40 ☐
054 πŸ“— Square Every Digit 01-Numbers Codewars 40 ☐
055 πŸ“— Palindrome Number 01-Numbers LeetCode 40 ☐
056 πŸ“— Reverse Integer 01-Numbers LeetCode 40 ☐
057 πŸ“— Plus One 01-Numbers LeetCode 40 ☐
058 πŸ“— JSON Encode User Map 02-JSON w3resource 40 ☐
059 πŸ“— JSON Decode Sum Scores 02-JSON w3resource 40 ☐
060 πŸ“— Format Date Y-m-d 03-Date w3resource 40 ☐
061 πŸ“— Gigasecond 03-Date Exercism 40 ☐
062 πŸ“— Valid Palindrome 04-Strings LeetCode 40 ☐
063 πŸ“— Reverse Words 04-Strings W3Schools 40 ☐
064 πŸ“— Most Common Character 04-Strings W3Schools 40 ☐
065 πŸ“— Highest and Lowest 04-Strings Codewars 40 ☐
066 πŸ“— Disemvowel Trolls 04-Strings Codewars 40 ☐
067 πŸ“— Digits Only Check 04-Strings w3resource 40 ☐
068 πŸ“— Raindrops 04-Strings Exercism 40 ☐
069 πŸ“— Bob 04-Strings Exercism 40 ☐
070 πŸ“— Hamming Distance 04-Strings Exercism 40 ☐
071 πŸ“— Isogram 04-Strings Exercism 40 ☐
072 πŸ“— Pangram 04-Strings Exercism 40 ☐
073 πŸ“— RNA Transcription 04-Strings Exercism 40 ☐
074 πŸ“— Acronym 04-Strings Exercism 40 ☐
075 πŸ“— Isomorphic Strings 04-Strings LeetCode 40 ☐
076 πŸ“— Ransom Note 04-Strings LeetCode 40 ☐
077 πŸ“— Is Subsequence 04-Strings LeetCode 40 ☐
078 πŸ“— Two Sum 05-Arrays-Hashing LeetCode 40 ☐
079 πŸ“— Valid Anagram 05-Arrays-Hashing LeetCode 40 ☐
080 πŸ“— Contains Duplicate 05-Arrays-Hashing LeetCode 40 ☐
081 πŸ“— Move Zeros to End 05-Arrays-Hashing W3Schools 40 ☐
082 πŸ“— Letter Frequency 05-Arrays-Hashing W3Schools 40 ☐
083 πŸ“— Second Largest 05-Arrays-Hashing W3Schools 40 ☐
084 πŸ“— Running Sum 05-Arrays-Hashing W3Schools 40 ☐
085 πŸ“— Two Oldest Ages 05-Arrays-Hashing Codewars 40 ☐
086 πŸ“— Small Enough 05-Arrays-Hashing Codewars 40 ☐
087 πŸ“— Lost Number in Sequence 05-Arrays-Hashing Codewars 40 ☐
088 πŸ“— Scrabble Score 05-Arrays-Hashing Exercism 40 ☐
089 πŸ“— High Scores 05-Arrays-Hashing Exercism 40 ☐
090 πŸ“— Majority Element 05-Arrays-Hashing LeetCode 40 ☐
091 πŸ“— Single Number 05-Arrays-Hashing LeetCode 40 ☐
092 πŸ“— Happy Number 05-Arrays-Hashing LeetCode 40 ☐
093 πŸ“— Contains Duplicate II 05-Arrays-Hashing LeetCode 40 ☐
094 πŸ“— Find Pivot Index 05-Arrays-Hashing LeetCode 40 ☐

βš”οΈ 03-C-Gates (38)

Gate Title Category Platform XP Status
095 βš”οΈ Word Frequency 01-Strings W3Schools 60 ☐
096 βš”οΈ Stop Spinning My Words 01-Strings Codewars 60 ☐
097 βš”οΈ Create Phone Number 01-Strings Codewars 60 ☐
098 βš”οΈ Who Likes It 01-Strings Codewars 60 ☐
099 βš”οΈ Zigzag Conversion 01-Strings LeetCode 60 ☐
100 βš”οΈ Remove Duplicates Keep Order 02-Arrays W3Schools 60 ☐
101 βš”οΈ Rotate Left 02-Arrays W3Schools 60 ☐
102 βš”οΈ Merge Sorted Lists 02-Arrays W3Schools 60 ☐
103 βš”οΈ Longest Streak 02-Arrays W3Schools 60 ☐
104 βš”οΈ Maximum Subarray Sum 02-Arrays W3Schools 60 ☐
105 βš”οΈ Equal Sides Of An Array 02-Arrays Codewars 60 ☐
106 βš”οΈ Array Diff 02-Arrays Codewars 60 ☐
107 βš”οΈ Bit Counting 02-Arrays Codewars 60 ☐
108 βš”οΈ Pair Closest to Zero Sum 02-Arrays w3resource 60 ☐
109 βš”οΈ Product of Array Except Self 02-Arrays LeetCode 60 ☐
110 βš”οΈ Rotate Array 02-Arrays LeetCode 60 ☐
111 βš”οΈ Partition Labels 02-Arrays LeetCode 60 ☐
112 βš”οΈ Counting Bits 02-Arrays LeetCode 60 ☐
113 βš”οΈ Merge Sorted Array 02-Arrays LeetCode 60 ☐
114 βš”οΈ Flatten Array 03-Nested-Arrays Exercism 60 ☐
115 βš”οΈ Valid Parentheses 04-Stack LeetCode 60 ☐
116 βš”οΈ Daily Temperatures 04-Stack LeetCode 60 ☐
117 βš”οΈ Decode String 04-Stack LeetCode 60 ☐
118 βš”οΈ Group Anagrams 05-Hashing LeetCode 60 ☐
119 βš”οΈ Longest Consecutive Sequence 05-Hashing LeetCode 60 ☐
120 βš”οΈ Subarray Sum Equals K 05-Hashing LeetCode 60 ☐
121 βš”οΈ Container With Most Water 06-Two-Pointers LeetCode 60 ☐
122 βš”οΈ Longest Common Prefix 06-Two-Pointers W3Schools 60 ☐
123 βš”οΈ 3Sum 06-Two-Pointers LeetCode 60 ☐
124 βš”οΈ Sort Colors 06-Two-Pointers LeetCode 60 ☐
125 βš”οΈ Squares of a Sorted Array 06-Two-Pointers LeetCode 60 ☐
126 βš”οΈ Two Sum II - Input Array Is Sorted 06-Two-Pointers LeetCode 60 ☐
127 βš”οΈ Best Time to Buy and Sell Stock 07-Sliding-Window LeetCode 60 ☐
128 βš”οΈ Longest Substring Without Repeating Characters 07-Sliding-Window LeetCode 60 ☐
129 βš”οΈ Find All Anagrams in a String 07-Sliding-Window LeetCode 60 ☐
130 βš”οΈ Minimum Size Subarray Sum 07-Sliding-Window LeetCode 60 ☐
131 βš”οΈ Longest Repeating Character Replacement 07-Sliding-Window LeetCode 60 ☐
132 βš”οΈ Maximum Average Subarray I 07-Sliding-Window LeetCode 60 ☐

πŸ”₯ 04-B-Gates (46)

Gate Title Category Platform XP Status
133 πŸ”₯ Binary Search 01-Binary-Search LeetCode 90 ☐
134 πŸ”₯ Search Insert Position 01-Binary-Search LeetCode 90 ☐
135 πŸ”₯ Search a 2D Matrix 01-Binary-Search LeetCode 90 ☐
136 πŸ”₯ Search in Rotated Sorted Array 01-Binary-Search LeetCode 90 ☐
137 πŸ”₯ Find Minimum in Rotated Sorted Array 01-Binary-Search LeetCode 90 ☐
138 πŸ”₯ Find First and Last Position of Element in Sorted Array 01-Binary-Search LeetCode 90 ☐
139 πŸ”₯ Find Peak Element 01-Binary-Search LeetCode 90 ☐
140 πŸ”₯ Search a 2D Matrix II 01-Binary-Search LeetCode 90 ☐
141 πŸ”₯ Koko Eating Bananas 01-Binary-Search LeetCode 90 ☐
142 πŸ”₯ Next Permutation 02-Arrays-Medium LeetCode 90 ☐
143 πŸ”₯ Find the Duplicate Number 03-Hashing-Medium LeetCode 90 ☐
144 πŸ”₯ Valid Sudoku 03-Hashing-Medium LeetCode 90 ☐
145 πŸ”₯ Top K Frequent Elements 04-Heap-TopK LeetCode 90 ☐
146 πŸ”₯ Kth Largest Element in an Array 04-Heap-TopK LeetCode 90 ☐
147 πŸ”₯ Merge Intervals 05-Intervals LeetCode 90 ☐
148 πŸ”₯ Insert Interval 05-Intervals LeetCode 90 ☐
149 πŸ”₯ Non-overlapping Intervals 05-Intervals LeetCode 90 ☐
150 πŸ”₯ Min Stack 06-Stack-Design LeetCode 90 ☐
151 πŸ”₯ Simplify Path 06-Stack-Design LeetCode 90 ☐
152 πŸ”₯ Evaluate Reverse Polish Notation 06-Stack-Design LeetCode 90 ☐
153 πŸ”₯ LRU Cache 07-Cache-Design LeetCode 90 ☐
154 πŸ”₯ Insert Delete GetRandom O(1) 07-Cache-Design LeetCode 90 ☐
155 πŸ”₯ Maximum Depth (Nested Structure) 08-Nested-Trees LeetCode 90 ☐
156 πŸ”₯ Implement Trie (Prefix Tree) 09-Trie-Design LeetCode 90 ☐
157 πŸ”₯ Jump Game 10-Greedy LeetCode 90 ☐
158 πŸ”₯ Jump Game II 10-Greedy LeetCode 90 ☐
159 πŸ”₯ Rotate Image 11-Matrix LeetCode 90 ☐
160 πŸ”₯ Set Matrix Zeroes 11-Matrix LeetCode 90 ☐
161 πŸ”₯ Spiral Matrix 11-Matrix LeetCode 90 ☐
162 πŸ”₯ Subsets 12-Backtracking LeetCode 90 ☐
163 πŸ”₯ Permutations 12-Backtracking LeetCode 90 ☐
164 πŸ”₯ Combination Sum 12-Backtracking LeetCode 90 ☐
165 πŸ”₯ Generate Parentheses 12-Backtracking LeetCode 90 ☐
166 πŸ”₯ Letter Combinations of a Phone Number 12-Backtracking LeetCode 90 ☐
167 πŸ”₯ Meeting Rooms II 05-Intervals LeetCode 90 ☐
168 πŸ”₯ Time Based Key-Value Store 01-Binary-Search LeetCode 90 ☐
169 πŸ”₯ Gas Station 10-Greedy LeetCode 90 ☐
170 πŸ”₯ Asteroid Collision 06-Stack-Design LeetCode 90 ☐
171 πŸ”₯ Moving Average from Data Stream 13-Backend-Design LeetCode 90 ☐
172 πŸ”₯ Encode and Decode TinyURL 13-Backend-Design LeetCode 90 ☐
173 πŸ”₯ Design Authentication Manager 13-Backend-Design LeetCode 90 ☐
174 πŸ”₯ First Bad Version 01-Binary-Search LeetCode 90 ☐
175 πŸ”₯ Capacity To Ship Packages Within D Days 01-Binary-Search LeetCode 90 ☐
176 πŸ”₯ Task Scheduler 04-Heap-TopK LeetCode 90 ☐
177 πŸ”₯ Car Pooling 05-Intervals LeetCode 90 ☐
178 πŸ”₯ My Calendar I 05-Intervals LeetCode 90 ☐

πŸ’Ž 05-A-Gates (19)

Gate Title Category Platform XP Status
179 πŸ’Ž Number of Islands 01-Graphs LeetCode 130 ☐
180 πŸ’Ž Course Schedule 01-Graphs LeetCode 130 ☐
181 πŸ’Ž Course Schedule II 01-Graphs LeetCode 130 ☐
182 πŸ’Ž Number of Provinces 01-Graphs LeetCode 130 ☐
183 πŸ’Ž Rotting Oranges 01-Graphs LeetCode 130 ☐
184 πŸ’Ž Climbing Stairs 02-DP-Intro LeetCode 130 ☐
185 πŸ’Ž House Robber 02-DP-Intro LeetCode 130 ☐
186 πŸ’Ž House Robber II 02-DP-Intro LeetCode 130 ☐
187 πŸ’Ž Coin Change 02-DP-Intro LeetCode 130 ☐
188 πŸ’Ž Unique Paths 02-DP-Intro LeetCode 130 ☐
189 πŸ’Ž Minimum Path Sum 02-DP-Intro LeetCode 130 ☐
190 πŸ’Ž Maximum Product Subarray 02-DP-Intro LeetCode 130 ☐
191 πŸ’Ž Word Break 02-DP-Intro LeetCode 130 ☐
192 πŸ’Ž Longest Increasing Subsequence 02-DP-Intro LeetCode 130 ☐
193 πŸ’Ž Longest Common Subsequence 02-DP-Intro LeetCode 130 ☐
194 πŸ’Ž Partition Equal Subset Sum 02-DP-Intro LeetCode 130 ☐
195 πŸ’Ž Coin Change II 02-DP-Intro LeetCode 130 ☐
196 πŸ’Ž Trapping Rain Water 02-DP-Intro LeetCode 130 ☐
197 πŸ’Ž Word Search 03-Backtracking-Harder LeetCode 130 ☐

πŸŒ‘ 06-S-Gates (3)

Gate Title Category Platform XP Status
198 πŸŒ‘ Minimum Window Substring 01-Hard-PHP-Fit LeetCode 200 ☐
199 πŸŒ‘ Edit Distance 01-Hard-PHP-Fit LeetCode 200 ☐
200 πŸŒ‘ Sliding Window Maximum 01-Hard-PHP-Fit LeetCode 200 ☐

🧭 07-Side-Quests (21)

Gate Title Folder Platform XP Status
201 🧭 First and Last Digit 01-CodeChef CodeChef 25 ☐
202 🧭 Sum of Digits 01-CodeChef CodeChef 25 ☐
203 🧭 Reverse The Number 01-CodeChef CodeChef 25 ☐
204 🧭 Lucky Four 01-CodeChef CodeChef 25 ☐
205 🧭 Chef and Operators 01-CodeChef CodeChef 25 ☐
206 🧭 Second Largest of Three 01-CodeChef CodeChef 40 ☐
207 🧭 ATM Withdrawal 01-CodeChef CodeChef 40 ☐
208 🧭 Watermelon 02-Codeforces Codeforces 25 ☐
209 🧭 Way Too Long Words 02-Codeforces Codeforces 25 ☐
210 🧭 Team 02-Codeforces Codeforces 25 ☐
211 🧭 Bit++ 02-Codeforces Codeforces 25 ☐
212 🧭 Domino piling 02-Codeforces Codeforces 25 ☐
213 🧭 Next Round 02-Codeforces Codeforces 25 ☐
214 🧭 Beautiful Matrix 02-Codeforces Codeforces 25 ☐
215 🧭 Helpful Maths 02-Codeforces Codeforces 25 ☐
216 🧭 Stones on the Table 02-Codeforces Codeforces 25 ☐
217 🧭 Bear and Big Brother 02-Codeforces Codeforces 25 ☐
218 🧭 Wrong Subtraction 02-Codeforces Codeforces 25 ☐
219 🧭 Kefa and First Steps 02-Codeforces Codeforces 40 ☐
220 🧭 Selection Sort Steps 03-W3Resource-Extras w3resource 40 ☐
221 🧭 Bubble Sort Swap Count 04-W3Schools-Extras W3Schools 40 ☐

πŸ›‘οΈ Interview Armor (17)

Sealed until B-Rank+ on the PHP-fit climb. IDs follow Side Quests on the global ladder.

Gate Title Part Platform XP Status
222 πŸ›‘οΈ Reverse Linked List Part-1-Linked-Lists-Interview LeetCode 90 ☐
223 πŸ›‘οΈ Merge Two Sorted Lists Part-1-Linked-Lists-Interview LeetCode 90 ☐
224 πŸ›‘οΈ Linked List Cycle Part-1-Linked-Lists-Interview LeetCode 90 ☐
225 πŸ›‘οΈ Remove Nth Node From End of List Part-1-Linked-Lists-Interview LeetCode 90 ☐
226 πŸ›‘οΈ Linked List Cycle II Part-1-Linked-Lists-Interview LeetCode 90 ☐
227 πŸ›‘οΈ Palindrome Linked List Part-1-Linked-Lists-Interview LeetCode 90 ☐
228 πŸ›‘οΈ Add Two Numbers Part-1-Linked-Lists-Interview LeetCode 90 ☐
229 πŸ›‘οΈ Swap Nodes in Pairs Part-1-Linked-Lists-Interview LeetCode 90 ☐
230 πŸ›‘οΈ Invert Binary Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
231 πŸ›‘οΈ Symmetric Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
232 πŸ›‘οΈ Validate Binary Search Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
233 πŸ›‘οΈ Binary Tree Level Order Traversal Part-2-TreeNode-Interview-Form LeetCode 90 ☐
234 πŸ›‘οΈ Diameter of Binary Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
235 πŸ›‘οΈ Kth Smallest Element in a BST Part-2-TreeNode-Interview-Form LeetCode 90 ☐
236 πŸ›‘οΈ Lowest Common Ancestor of a Binary Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
237 πŸ›‘οΈ Maximum Depth of Binary Tree Part-2-TreeNode-Interview-Form LeetCode 90 ☐
238 πŸ›‘οΈ Binary Tree Inorder Traversal Part-2-TreeNode-Interview-Form LeetCode 90 ☐

Session cycle

  1. Confirm Rank unlock
  2. Read System Brief + Learn First
  3. Attempt alone
  4. Coach only if stuck (repo-ideas/21-…)
  5. CHECK β†’ mark βœ… β†’ XP β†’ update Status Window

Before Instant Dungeons (Track 3)

Usually needs B-Rank+ and core E/D/C/B clears in order.