Track
Tensor→Tenant
108-week apprenticeship · 548 Darbar slots · 36-week on-ramp
Syllabus · Gates · Week loop · Darbar · On-ramp · Official T2T site
Overview
On-ramp
- On-ramp week 1 — Learning how to learnEasy
- On-ramp week 2 — Learning how to learnEasy
- On-ramp week 3 — Computer science foundationsEasy
- On-ramp week 4 — Computer science foundationsEasy
- On-ramp week 5 — Computer science foundationsEasy
- On-ramp week 6 — Computer science foundationsEasy
- On-ramp week 7 — A computer from first principlesEasy
- On-ramp week 8 — A computer from first principlesEasy
- On-ramp week 9 — A computer from first principlesEasy
- On-ramp week 10 — A computer from first principlesEasy
- On-ramp week 11 — Mathematics for computer scienceEasy
- On-ramp week 12 — Mathematics for computer scienceEasy
- On-ramp week 13 — Mathematics for computer scienceEasy
- On-ramp week 14 — Mathematics for computer scienceEasy
- On-ramp week 15 — Mathematics for computer scienceEasy
- On-ramp week 16 — Mathematics for computer scienceEasy
- On-ramp week 17 — Programming paradigmsEasy
- On-ramp week 18 — Programming paradigmsEasy
- On-ramp week 19 — Statistical learningEasy
- On-ramp week 20 — Statistical learningEasy
- On-ramp week 21 — Statistical learningEasy
- On-ramp week 22 — Statistical learningEasy
- On-ramp week 23 — Statistical learningEasy
- On-ramp week 24 — Statistical learningEasy
- On-ramp week 25 — Statistical learningEasy
- On-ramp week 26 — Statistical learningEasy
- On-ramp week 27 — Statistical learningEasy
- On-ramp week 28 — Statistical learningEasy
- On-ramp week 29 — Software engineering at scaleEasy
- On-ramp week 30 — Software engineering at scaleEasy
- On-ramp week 31 — Software engineering at scaleEasy
- On-ramp week 32 — Software engineering at scaleEasy
- On-ramp week 33 — Synthesis projectEasy
- On-ramp week 34 — Synthesis projectEasy
- On-ramp week 35 — Synthesis projectEasy
- On-ramp week 36 — Synthesis projectEasy
Darbar
- Darbar · Array
- Darbar · Backtracking
- Darbar · Bit Manipulation
- Darbar · Divide And Conquer
- Darbar · Dynamic Programming
- Darbar · Graphs
- Darbar · Greedy
- Darbar · Hash Table
- Darbar · Heap
- Darbar · Linked List
- Darbar · Math
- Darbar · Queue
- Darbar · Range Query
- Darbar · Recursion
- Darbar · Searching And Sorting
- Darbar · Stack
- Darbar · String
- Darbar · Trees
- Darbar · Trie
Darbar · Array
- Darbar 001 — Find Target Indices After Sorting ArrayEasy
- Darbar 002 — Count Negative Numbers In A Sorted MatrixEasy
- Darbar 003 — The K Weakest Rows In A MatrixEasy
- Darbar 004 — Search Insert PositionEasy
- Darbar 005 — Check If N And Its Double ExistEasy
- Darbar 006 — Decode Xored ArrayEasy
- Darbar 007 — Count The Number Of Consistent StringsEasy
- Darbar 008 — Sum Of All Subset Xor TotalsEasy
- Darbar 009 — Divide Array Into Equal PairsEasy
- Darbar 010 — Set MismatchEasy
- Darbar 011 — Best Time To Buy And Sell StockEasy
- Darbar 012 — Get Maximum In Generated ArrayEasy
- Darbar 013 — Maximum SubarrayEasy
- Darbar 014 — Stone Game IiMedium
- Darbar 015 — Beautiful ArrangementMedium
- Darbar 016 — Check If It Is A Straight LineEasy
- Darbar 017 — Queries On Number Of Points Inside A CircleMedium
- Darbar 018 — Detonate The Maximum BombsMedium
- Darbar 019 — Max Points On A LineHard
- Darbar 020 — Number Of Good PairsEasy
- Darbar 021 — How Many Numbers Are Smaller Than The Current NumberEasy
- Darbar 022 — Count Number Of Pairs With Absolute Difference KEasy
- Darbar 023 — Count The Number Of Consistent StringsEasy
- Darbar 024 — Unique Morse Code WordsEasy
- Darbar 025 — Richest Customer WealthEasy
- Darbar 026 — Flipping An ImageEasy
- Darbar 027 — Matrix Diagonal SumEasy
- Darbar 028 — Count Negative Numbers In A Sorted MatrixEasy
- Darbar 029 — Subrectangle QueriesMedium
- Darbar 030 — Running Sum Of 1D ArrayEasy
- Darbar 031 — Find The Highest AltitudeEasy
- Darbar 032 — Find Pivot IndexEasy
- Darbar 033 — Maximum Xor For Each QueryMedium
- Darbar 034 — Matrix Block SumMedium
- Darbar 035 — Build Array From PermutationEasy
- Darbar 036 — Concatenation Of ArrayEasy
- Darbar 037 — Shuffle The ArrayEasy
- Darbar 038 — Kids With The Greatest Number Of CandiesEasy
- Darbar 039 — Decode Xored ArrayEasy
- Darbar 040 — Minimum Difference Between Highest And Lowest Of K ScoresEasy
- Darbar 041 — Maximum Average Subarray IEasy
- Darbar 042 — Maximum Points You Can Obtain From CardsMedium
- Darbar 043 — Binary Subarrays With SumMedium
- Darbar 044 — Minimum Swaps To Group All 1S Together IiMedium
- Darbar 045 — How Many Numbers Are Smaller Than The Current NumberEasy
- Darbar 046 — Minimum Number Of Moves To Seat EveryoneEasy
- Darbar 047 — Maximum Product Difference Between Two PairsEasy
- Darbar 048 — Find Target Indices After Sorting ArrayEasy
- Darbar 049 — Maximum Product Of Two Elements In An ArrayEasy
- Darbar 050 — Flipping An ImageEasy
- Darbar 051 — Find First Palindromic String In The ArrayEasy
- Darbar 052 — Di String MatchEasy
- Darbar 053 — Sort Array By ParityEasy
- Darbar 054 — Squares Of A Sorted ArrayEasy
Darbar · Backtracking
Darbar · Bit Manipulation
- Darbar 060 — Count Number Of Maximum Bitwise Or SubsetsMedium
- Darbar 061 — Letter Case PermutationMedium
- Darbar 062 — SubsetsMedium
- Darbar 063 — Circular Permutation In Binary RepresentationMedium
- Darbar 064 — Beautiful ArrangementMedium
- Darbar 065 — Counting BitsEasy
- Darbar 066 — Number Of Good Ways To Split A StringMedium
- Darbar 067 — Beautiful ArrangementMedium
- Darbar 068 — Maximum Compatibility Score SumMedium
- Darbar 069 — Maximum Product Of The Length Of Two Palindromic SubsequencesMedium
- Darbar 070 — Count The Number Of Consistent StringsEasy
- Darbar 071 — Divide Array Into Equal PairsEasy
- Darbar 072 — Longest Nice SubstringEasy
- Darbar 073 — Missing NumberEasy
- Darbar 074 — Find The DifferenceEasy
- Darbar 075 — Power Of TwoEasy
- Darbar 076 — Power Of FourEasy
- Darbar 077 — Maximum Points In An Archery CompetitionMedium
- Darbar 078 — Number Of Steps To Reduce A Number To ZeroEasy
- Darbar 079 — Decode Xored ArrayEasy
- Darbar 080 — Xor Operation In An ArrayEasy
- Darbar 081 — Count The Number Of Consistent StringsEasy
- Darbar 082 — Minimum Bit Flips To Convert NumberEasy
- Darbar 083 — Longest Nice SubstringEasy
- Darbar 084 — Repeated Dna SequencesMedium
Darbar · Divide And Conquer
Darbar · Dynamic Programming
- Darbar 090 — Fibonacci NumberEasy
- Darbar 091 — N Th Tribonacci NumberEasy
- Darbar 092 — Climbing StairsEasy
- Darbar 093 — Pascals Triangle IiEasy
- Darbar 094 — All Possible Full Binary TreesMedium
- Darbar 095 — Counting BitsEasy
- Darbar 096 — Fibonacci NumberEasy
- Darbar 097 — Divisor GameEasy
- Darbar 098 — Pascals TriangleEasy
- Darbar 099 — N Th Tribonacci NumberEasy
Darbar · Graphs
- Darbar 100 — All Paths From Source To TargetMedium
- Darbar 101 — Maximum Path Quality Of A GraphHard
- Darbar 102 — Find If Path Exists In GraphEasy
- Darbar 103 — All Paths From Source To TargetMedium
- Darbar 104 — Keys And RoomsMedium
- Darbar 105 — Number Of ProvincesMedium
- Darbar 106 — Redundant ConnectionMedium
- Darbar 107 — Shortest Path Visiting All NodesHard
- Darbar 108 — Possible BipartitionMedium
- Darbar 109 — Is Graph BipartiteMedium
- Darbar 110 — Possible BipartitionMedium
- Darbar 111 — Is Graph BipartiteMedium
- Darbar 112 — Shortest Path With Alternating ColorsMedium
- Darbar 113 — Number Of Operations To Make Network ConnectedMedium
- Darbar 114 — Number Of ProvincesMedium
- Darbar 115 — Critical Connections In A NetworkHard
- Darbar 116 — Find Critical And Pseudo Critical Edges In Minimum Spanning TreeHard
- Darbar 117 — Minimum Degree Of A Connected Trio In A GraphHard
- Darbar 118 — Course Schedule IiMedium
- Darbar 119 — Redundant ConnectionMedium
- Darbar 120 — Course ScheduleMedium
- Darbar 121 — Find Eventual Safe StatesHard
- Darbar 122 — Find If Path Exists In GraphEasy
- Darbar 123 — All Paths From Source To TargetMedium
- Darbar 124 — Minimum Number Of Vertices To Reach All NodesMedium
- Darbar 125 — Keys And RoomsMedium
- Darbar 126 — Number Of ProvincesMedium
- Darbar 127 — Find The City With The Smallest Number Of Neighbors At A Threshold DistanceMedium
- Darbar 128 — Number Of Ways To Arrive At DestinationMedium
- Darbar 129 — Cheapest Flights Within K StopsMedium
- Darbar 130 — Shortest Path Visiting All NodesHard
- Darbar 131 — Parallel Courses IiiHard
- Darbar 132 — Reconstruct ItineraryHard
- Darbar 133 — Detonate The Maximum BombsMedium
- Darbar 134 — Find The Town JudgeEasy
- Darbar 135 — Minimum Number Of Vertices To Reach All NodesMedium
- Darbar 136 — Maximal Network RankMedium
- Darbar 137 — Count Sub IslandsMedium
- Darbar 138 — Number Of Closed IslandsMedium
- Darbar 139 — Max Area Of IslandMedium
- Darbar 140 — Count Servers That CommunicateMedium
- Darbar 141 — Evaluate DivisionMedium
- Darbar 142 — Find The City With The Smallest Number Of Neighbors At A Threshold DistanceMedium
- Darbar 143 — Network Delay TimeMedium
- Darbar 144 — Number Of Ways To Arrive At DestinationMedium
- Darbar 145 — Cheapest Flights Within K StopsMedium
- Darbar 146 — Find Center Of Star GraphEasy
- Darbar 147 — Find If Path Exists In GraphEasy
- Darbar 148 — Find The Town JudgeEasy
- Darbar 149 — Minimum Number Of Vertices To Reach All NodesMedium
- Darbar 150 — Maximal Network RankMedium
- Darbar 151 — Find Critical And Pseudo Critical Edges In Minimum Spanning TreeHard
- Darbar 152 — Min Cost To Connect All PointsMedium
- Darbar 153 — Number Of Operations To Make Network ConnectedMedium
- Darbar 154 — Number Of ProvincesMedium
- Darbar 155 — Critical Connections In A NetworkHard
- Darbar 156 — Find Critical And Pseudo Critical Edges In Minimum Spanning TreeHard
- Darbar 157 — Minimum Degree Of A Connected Trio In A GraphHard
- Darbar 158 — Number Of Ways To Arrive At DestinationMedium
- Darbar 159 — Minimum Height TreesMedium
- Darbar 160 — Course ScheduleMedium
- Darbar 161 — Course Schedule IiMedium
- Darbar 162 — All Ancestors Of A Node In A Directed Acyclic GraphMedium
- Darbar 163 — Number Of ProvincesMedium
- Darbar 164 — Redundant ConnectionMedium
- Darbar 165 — Evaluate DivisionMedium
- Darbar 166 — Number Of Operations To Make Network ConnectedMedium
- Darbar 167 — Is Graph BipartiteMedium
Darbar · Greedy
- Darbar 168 — Longest PalindromeEasy
- Darbar 169 — Partition LabelsMedium
- Darbar 170 — Reduce Array Size To The HalfMedium
- Darbar 171 — Minimum Operations To Make The Array AlternatingMedium
- Darbar 172 — Find Original Array From Doubled ArrayMedium
- Darbar 173 — Max Increase To Keep City SkylineMedium
- Darbar 174 — Score After Flipping MatrixMedium
- Darbar 175 — Reconstruct A 2 Row Binary MatrixMedium
- Darbar 176 — Maximum Matrix SumMedium
- Darbar 177 — Minimum Swaps To Arrange A Binary GridMedium
- Darbar 178 — Split A String In Balanced StringsEasy
- Darbar 179 — Maximum 69 NumberEasy
- Darbar 180 — Minimum Operations To Make The Array IncreasingEasy
- Darbar 181 — Minimum Cost To Move Chips To The Same PositionEasy
- Darbar 182 — Minimum Number Of Operations To Convert TimeEasy
- Darbar 183 — Minimum Sum Of Four Digit Number After Splitting DigitsEasy
- Darbar 184 — Array PartitionEasy
- Darbar 185 — Minimum Subsequence In Non Increasing OrderEasy
- Darbar 186 — Minimum Time To Type Word Using Special TypewriterEasy
- Darbar 187 — Two Furthest Houses With Different ColorsEasy
- Darbar 188 — Di String MatchEasy
- Darbar 189 — Valid Palindrome IiEasy
- Darbar 190 — Minimize Maximum Pair Sum In ArrayMedium
- Darbar 191 — Partition LabelsMedium
- Darbar 192 — Minimum Adjacent Swaps To Reach The Kth Smallest NumberMedium
Darbar · Hash Table
- Darbar 193 — Intersection Of Two ArraysEasy
- Darbar 194 — Check If N And Its Double ExistEasy
- Darbar 195 — Intersection Of Two Arrays IiEasy
- Darbar 196 — Number Of Flowers In Full BloomHard
- Darbar 197 — Count The Number Of Consistent StringsEasy
- Darbar 198 — Divide Array Into Equal PairsEasy
- Darbar 199 — Set MismatchEasy
- Darbar 200 — Missing NumberEasy
- Darbar 201 — Count Triplets That Can Form Two Arrays Of Equal XorMedium
- Darbar 202 — Number Of Good PairsEasy
- Darbar 203 — How Many Numbers Are Smaller Than The Current NumberEasy
- Darbar 204 — Count Number Of Pairs With Absolute Difference KEasy
- Darbar 205 — Increasing Decreasing StringEasy
- Darbar 206 — Check If All Characters Have Equal Number Of OccurrencesEasy
- Darbar 207 — Top K Frequent ElementsMedium
- Darbar 208 — Construct Binary Tree From Preorder And Inorder TraversalMedium
- Darbar 209 — Count Substrings That Differ By One CharacterMedium
- Darbar 210 — Longest String ChainMedium
- Darbar 211 — Total Appeal Of A StringHard
- Darbar 212 — Flip Columns For Maximum Number Of Equal RowsMedium
- Darbar 213 — Check If Every Row And Column Contains All NumbersEasy
- Darbar 214 — Number Of Submatrices That Sum To TargetHard
- Darbar 215 — Jewels And StonesEasy
- Darbar 216 — Rings And RodsEasy
- Darbar 217 — Check If The Sentence Is PangramEasy
- Darbar 218 — Unique Morse Code WordsEasy
- Darbar 219 — Destination CityEasy
- Darbar 220 — Substrings Of Size Three With Distinct CharactersEasy
- Darbar 221 — Contains Duplicate IiEasy
- Darbar 222 — Number Of Substrings Containing All Three CharactersMedium
- Darbar 223 — Sliding Window MedianHard
- Darbar 224 — Minimum Window SubstringHard
- Darbar 225 — How Many Numbers Are Smaller Than The Current NumberEasy
- Darbar 226 — Keep Multiplying Found Values By TwoEasy
- Darbar 227 — Make Two Arrays Equal By Reversing SubarraysEasy
- Darbar 228 — Intersection Of Two ArraysEasy
- Darbar 229 — Sort Array By Increasing FrequencyEasy
- Darbar 230 — Find Elements In A Contaminated Binary TreeMedium
- Darbar 231 — Create Binary Tree From DescriptionsMedium
- Darbar 232 — Lowest Common Ancestor Of Deepest LeavesMedium
- Darbar 233 — Smallest Subtree With All The Deepest NodesMedium
- Darbar 234 — Throne InheritanceMedium
- Darbar 235 — Intersection Of Two ArraysEasy
- Darbar 236 — Check If N And Its Double ExistEasy
- Darbar 237 — Intersection Of Two Linked ListsEasy
- Darbar 238 — Happy NumberEasy
- Darbar 239 — Intersection Of Two Arrays IiEasy
Darbar · Heap
- Darbar 240 — The K Weakest Rows In A MatrixEasy
- Darbar 241 — Kth Smallest Element In A Sorted MatrixMedium
- Darbar 242 — Path With Minimum EffortMedium
- Darbar 243 — Find K Closest ElementsMedium
- Darbar 244 — Two Best Non Overlapping EventsMedium
- Darbar 245 — Find Kth Largest Xor Coordinate ValueHard
- Darbar 246 — Reorganize StringMedium
- Darbar 247 — Sort Characters By FrequencyMedium
- Darbar 248 — Top K Frequent ElementsMedium
- Darbar 249 — Top K Frequent WordsMedium
- Darbar 250 — Construct String With Repeat LimitMedium
- Darbar 251 — K Closest Points To OriginMedium
- Darbar 252 — Top K Frequent ElementsMedium
- Darbar 253 — Kth Largest Element In An ArrayMedium
- Darbar 254 — Find Kth Largest Xor Coordinate ValueMedium
- Darbar 255 — Sort An ArrayMedium
- Darbar 256 — Super Ugly NumberMedium
- Darbar 257 — Ugly Number IiMedium
- Darbar 258 — Two Best Non Overlapping EventsMedium
- Darbar 259 — Jump Game ViMedium
- Darbar 260 — Cheapest Flights Within K StopsMedium
- Darbar 261 — K Closest Points To OriginMedium
- Darbar 262 — Path With Minimum EffortMedium
- Darbar 263 — Network Delay TimeMedium
- Darbar 264 — K Highest Ranked Items Within A Price RangeMedium
- Darbar 265 — Cheapest Flights Within K StopsMedium
- Darbar 266 — Swim In Rising WaterHard
- Darbar 267 — Find Subsequence Of Length K With The Largest SumEasy
- Darbar 268 — Reduce Array Size To The HalfMedium
- Darbar 269 — Sort Characters By FrequencyMedium
- Darbar 270 — Top K Frequent ElementsMedium
- Darbar 271 — Top K Frequent WordsMedium
- Darbar 272 — The K Weakest Rows In A MatrixEasy
- Darbar 273 — Find Kth Largest Xor Coordinate ValueMedium
- Darbar 274 — Kth Smallest Element In A Sorted MatrixMedium
- Darbar 275 — Path With Minimum EffortMedium
- Darbar 276 — Get Biggest Three Rhombus Sums In A GridMedium
- Darbar 277 — Find Kth Largest Xor Coordinate ValueMedium
- Darbar 278 — Car PoolingMedium
- Darbar 279 — Get Biggest Three Rhombus Sums In A GridMedium
- Darbar 280 — Shortest Subarray With Sum At Least KHard
- Darbar 281 — Car PoolingMedium
- Darbar 282 — Max Value Of EquationHard
- Darbar 283 — Constrained Subsequence SumHard
- Darbar 284 — Sliding Window MaximumHard
- Darbar 285 — Shortest Subarray With Sum At Least KHard
- Darbar 286 — Jump Game ViMedium
- Darbar 287 — Maximum Score From Removing StonesMedium
- Darbar 288 — Seat Reservation ManagerMedium
- Darbar 289 — Remove Stones To Minimize The TotalMedium
- Darbar 290 — Longest Happy StringMedium
- Darbar 291 — Top K Frequent WordsMedium
- Darbar 292 — Jump Game ViMedium
- Darbar 293 — Max Value Of EquationHard
- Darbar 294 — Constrained Subsequence SumHard
- Darbar 295 — Sliding Window MaximumHard
- Darbar 296 — Sliding Window MedianHard
- Darbar 297 — Maximum Product Of Two Elements In An ArrayEasy
- Darbar 298 — The K Weakest Rows In A MatrixEasy
- Darbar 299 — Last Stone WeightEasy
- Darbar 300 — Largest Number After Digit Swaps By ParityEasy
- Darbar 301 — Relative RanksEasy
- Darbar 302 — Car Fleet IiHard
- Darbar 303 — Kth Largest Element In A StreamEasy
Darbar · Linked List
- Darbar 304 — Sort ListMedium
- Darbar 305 — Intersection Of Two Linked ListsMedium
- Darbar 306 — Linked List ComponentsMedium
- Darbar 307 — Remove Zero Sum Consecutive Nodes From Linked ListMedium
- Darbar 308 — Add Two NumbersEasy
- Darbar 309 — Merge Two Sorted ListsEasy
- Darbar 310 — Convert Binary Number In A Linked List To IntegerMedium
- Darbar 311 — Middle Of The Linked ListEasy
- Darbar 312 — Delete The Middle Node Of A Linked ListMedium
- Darbar 313 — Middle Of The Linked ListEasy
- Darbar 314 — Delete The Middle Node Of A Linked ListMedium
- Darbar 315 — Reorder ListMedium
- Darbar 316 — Remove Nth Node From End Of ListMedium
- Darbar 317 — Partition ListMedium
- Darbar 318 — Add Two NumbersEasy
- Darbar 319 — Merge Two Sorted ListsEasy
- Darbar 320 — Convert Binary Number In A Linked List To IntegerMedium
- Darbar 321 — Swap Nodes In PairsMedium
- Darbar 322 — Remove Duplicates From Sorted ListEasy
- Darbar 323 — Remove Linked List ElementsEasy
- Darbar 324 — Remove Nth Node From End Of ListMedium
- Darbar 325 — Remove Duplicates From Sorted List IiMedium
- Darbar 326 — Remove Duplicates From Sorted ListEasy
- Darbar 327 — Delete Node In A Linked ListEasy
- Darbar 328 — Reorder ListMedium
- Darbar 329 — Odd Even Linked ListMedium
- Darbar 330 — Reverse Linked ListEasy
- Darbar 331 — Reverse Linked List IiMedium
- Darbar 332 — Rotate ListMedium
- Darbar 333 — Remove Duplicates From Sorted ListEasy
- Darbar 334 — Remove Duplicates From Sorted List IiMedium
- Darbar 335 — Sort ListMedium
- Darbar 336 — Split Linked List In PartsEasy
- Darbar 337 — Reorder ListMedium
- Darbar 338 — Add Two Numbers IiMedium
- Darbar 339 — Next Greater Node In Linked ListMedium
Darbar · Math
- Darbar 340 — Divisor GameEasy
- Darbar 341 — Nim GameEasy
- Darbar 342 — Maximum Number Of Coins You Can GetEasy
- Darbar 343 — Stone GameMedium
- Darbar 344 — Stone Game IiMedium
- Darbar 345 — Minimum Time Visiting All PointsEasy
- Darbar 346 — Projection Area Of 3D ShapesEasy
- Darbar 347 — Matrix Cells In Distance OrderEasy
- Darbar 348 — Check If It Is A Straight LineEasy
- Darbar 349 — Valid BoomerangEasy
- Darbar 350 — Find Greatest Common Divisor Of ArrayEasy
- Darbar 351 — Add DigitsEasy
- Darbar 352 — X Of A Kind In A Deck Of CardsEasy
- Darbar 353 — Simplified FractionsMedium
- Darbar 354 — Number Of Pairs Of Interchangeable RectanglesMedium
Darbar · Queue
- Darbar 355 — Implement Stack Using QueuesEasy
- Darbar 356 — Implement Queue Using StacksEasy
- Darbar 357 — Number Of Recent CallsEasy
- Darbar 358 — Design Circular QueueMedium
- Darbar 359 — Design Circular DequeMedium
- Darbar 360 — First Unique Character In A StringEasy
- Darbar 361 — Jump Game ViMedium
- Darbar 362 — Max Value Of EquationHard
- Darbar 363 — Longest Continuous Subarray With Absolute Diff Less Than Or Equal To LimitMedium
- Darbar 364 — Find The Winner Of The Circular GameMedium
- Darbar 365 — Time Needed To Buy TicketsEasy
- Darbar 366 — Number Of Students Unable To Eat LunchEasy
- Darbar 367 — Maximum Sum Circular SubarrayMedium
- Darbar 368 — Find The Winner Of The Circular GameMedium
- Darbar 369 — Reveal Cards In Increasing OrderMedium
- Darbar 370 — Jump Game ViMedium
- Darbar 371 — Max Value Of EquationHard
- Darbar 372 — Shortest Subarray With Sum At Least KHard
- Darbar 373 — Longest Continuous Subarray With Absolute Diff Less Than Or Equal To LimitMedium
Darbar · Range Query
Darbar · Recursion
Darbar · Searching And Sorting
- Darbar 384 — Find Target Indices After Sorting ArrayEasy
- Darbar 385 — Count Negative Numbers In A Sorted MatrixEasy
- Darbar 386 — The K Weakest Rows In A MatrixEasy
- Darbar 387 — Peak Index In A Mountain ArrayEasy
- Darbar 388 — Intersection Of Two ArraysEasy
- Darbar 389 — Minimum Sum Of Four Digit Number After Splitting DigitsEasy
- Darbar 390 — How Many Numbers Are Smaller Than The Current NumberEasy
- Darbar 391 — Sorting The SentenceEasy
- Darbar 392 — Maximum Product Difference Between Two PairsEasy
- Darbar 393 — Maximum Product Of Two Elements In An ArrayEasy
Darbar · Stack
- Darbar 394 — Increasing Order Search TreeEasy
- Darbar 395 — Binary Tree Inorder TraversalEasy
- Darbar 396 — Binary Tree Postorder TraversalEasy
- Darbar 397 — Binary Tree Preorder TraversalEasy
- Darbar 398 — Palindrome Linked ListEasy
- Darbar 399 — Implement Queue Using StacksEasy
- Darbar 400 — Implement Stack Using QueuesEasy
- Darbar 401 — Min StackEasy
- Darbar 402 — Design A Stack With Increment OperationMedium
- Darbar 403 — Online Stock SpanMedium
- Darbar 404 — Maximum Binary TreeMedium
- Darbar 405 — Construct Binary Search Tree From Preorder TraversalMedium
- Darbar 406 — Longest Valid ParenthesesHard
- Darbar 407 — Trapping Rain WaterHard
- Darbar 408 — Maximal RectangleHard
- Darbar 409 — Minimum Number Of Increments On Subarrays To Form A Target ArrayHard
- Darbar 410 — Valid Parenthesis StringMedium
- Darbar 411 — Next Greater Element IEasy
- Darbar 412 — Construct Binary Search Tree From Preorder TraversalMedium
- Darbar 413 — Final Prices With A Special Discount In A ShopEasy
- Darbar 414 — Next Greater Element IEasy
- Darbar 415 — Min StackEasy
- Darbar 416 — Maximum Binary TreeMedium
- Darbar 417 — Daily TemperaturesMedium
- Darbar 418 — N Ary Tree Postorder TraversalEasy
- Darbar 419 — N Ary Tree Preorder TraversalEasy
- Darbar 420 — Maximum Twin Sum Of A Linked ListMedium
- Darbar 421 — Basic CalculatorHard
- Darbar 422 — Maximum Nesting Depth Of The ParenthesesEasy
- Darbar 423 — Remove Outermost ParenthesesEasy
- Darbar 424 — Baseball GameEasy
- Darbar 425 — Remove All Adjacent Duplicates In StringEasy
- Darbar 426 — Build An Array With Stack OperationsEasy
- Darbar 427 — Maximum Twin Sum Of A Linked ListMedium
- Darbar 428 — Minimum Number Of Swaps To Make The String BalancedMedium
- Darbar 429 — Trapping Rain WaterHard
- Darbar 430 — Maximum Score Of A Good SubarrayHard
Darbar · String
- Darbar 431 — Binary Tree PathsEasy
- Darbar 432 — Letter Tile PossibilitiesMedium
- Darbar 433 — Iterator For CombinationMedium
- Darbar 434 — Letter Case PermutationMedium
- Darbar 435 — The K Th Lexicographical String Of All Happy Strings Of Length NMedium
- Darbar 436 — Count The Number Of Consistent StringsEasy
- Darbar 437 — Longest Nice SubstringEasy
- Darbar 438 — Find The DifferenceEasy
- Darbar 439 — Add BinaryEasy
- Darbar 440 — Letter Case PermutationMedium
- Darbar 441 — Split A String In Balanced StringsEasy
- Darbar 442 — Determine If String Halves Are AlikeEasy
- Darbar 443 — Increasing Decreasing StringEasy
- Darbar 444 — Check If All Characters Have Equal Number Of OccurrencesEasy
- Darbar 445 — Kth Distinct String In An ArrayEasy
- Darbar 446 — Is SubsequenceEasy
- Darbar 447 — Count Substrings That Differ By One CharacterMedium
- Darbar 448 — Generate ParenthesesMedium
- Darbar 449 — Number Of Good Ways To Split A StringMedium
- Darbar 450 — Different Ways To Add ParenthesesMedium
- Darbar 451 — Jewels And StonesEasy
- Darbar 452 — Count The Number Of Consistent StringsEasy
- Darbar 453 — Rings And RodsEasy
- Darbar 454 — Check If The Sentence Is PangramEasy
- Darbar 455 — Increasing Decreasing StringEasy
- Darbar 456 — Find The Longest Substring Containing Vowels In Even CountsMedium
- Darbar 457 — Maximize The Confusion Of An ExamMedium
- Darbar 458 — Minimum White Tiles After Covering With CarpetsHard
- Darbar 459 — Reverse StringEasy
- Darbar 460 — Different Ways To Add ParenthesesMedium
- Darbar 461 — Palindrome PartitioningMedium
- Darbar 462 — Find Kth Bit In Nth Binary StringMedium
- Darbar 463 — Maximum Score Words Formed By LettersHard
- Darbar 464 — Final Value Of Variable After Performing OperationsEasy
- Darbar 465 — Defanging An Ip AddressEasy
- Darbar 466 — Maximum Number Of Words Found In SentencesEasy
- Darbar 467 — Goal Parser InterpretationEasy
- Darbar 468 — Shuffle StringEasy
- Darbar 469 — Substrings Of Size Three With Distinct CharactersEasy
- Darbar 470 — Longest Nice SubstringEasy
- Darbar 471 — Number Of Substrings Containing All Three CharactersMedium
- Darbar 472 — Maximum Number Of Vowels In A Substring Of Given LengthMedium
- Darbar 473 — Maximize The Confusion Of An ExamMedium
- Darbar 474 — Sorting The SentenceEasy
- Darbar 475 — Valid AnagramEasy
- Darbar 476 — Find The DifferenceEasy
- Darbar 477 — Find And Replace PatternMedium
- Darbar 478 — Sort Characters By FrequencyMedium
- Darbar 479 — Check If A Word Occurs As A Prefix Of Any Word In A SentenceEasy
- Darbar 480 — String Matching In An ArrayEasy
- Darbar 481 — Rotate StringEasy
- Darbar 482 — Repeated Substring PatternEasy
- Darbar 483 — Maximum Repeating SubstringEasy
- Darbar 484 — Find First Palindromic String In The ArrayEasy
- Darbar 485 — Reverse Words In A String IiiEasy
- Darbar 486 — Reverse Prefix Of WordEasy
- Darbar 487 — Di String MatchEasy
- Darbar 488 — Merge Strings AlternatelyEasy
Darbar · Trees
- Darbar 489 — Binary Tree PathsEasy
- Darbar 490 — Merge Two Binary TreesEasy
- Darbar 491 — Maximum Depth Of Binary TreeEasy
- Darbar 492 — Invert Binary TreeEasy
- Darbar 493 — Univalued Binary TreeEasy
- Darbar 494 — Average Of Levels In Binary TreeEasy
- Darbar 495 — Range Sum Of BstEasy
- Darbar 496 — Search In A Binary Search TreeEasy
- Darbar 497 — Binary Tree Inorder TraversalEasy
- Darbar 498 — Convert Sorted Array To Binary Search TreeEasy
- Darbar 499 — Binary Search Tree To Greater Sum TreeMedium
- Darbar 500 — Root Equals Sum Of ChildrenEasy
- Darbar 501 — Increasing Order Search TreeEasy
- Darbar 502 — Binary Tree Postorder TraversalEasy
- Darbar 503 — Binary Tree Preorder TraversalEasy
- Darbar 504 — Binary Tree TiltEasy
- Darbar 505 — Range Sum Of BstEasy
- Darbar 506 — Increasing Order Search TreeEasy
- Darbar 507 — Merge Two Binary TreesEasy
- Darbar 508 — Sum Of Root To Leaf Binary NumbersEasy
- Darbar 509 — Maximum Depth Of Binary TreeEasy
- Darbar 510 — Maximum Binary TreeMedium
- Darbar 511 — Convert Sorted Array To Binary Search TreeEasy
- Darbar 512 — Balance A Binary Search TreeMedium
- Darbar 513 — Count Subtrees With Max Distance Between CitiesHard
- Darbar 514 — Sum Of Distances In TreeHard
- Darbar 515 — Binary Tree CamerasHard
- Darbar 516 — Maximum Sum Bst In Binary TreeHard
- Darbar 517 — Binary Tree Maximum Path SumHard
- Darbar 518 — N Ary Tree Preorder TraversalEasy
- Darbar 519 — N Ary Tree Postorder TraversalEasy
- Darbar 520 — Maximum Depth Of N Ary TreeEasy
- Darbar 521 — Subtree Of Another TreeEasy
Darbar · Trie
- Darbar 522 — Word Search IiHard
- Darbar 523 — Maximum Xor Of Two Numbers In An ArrayMedium
- Darbar 524 — Implement Trie Prefix TreeMedium
- Darbar 525 — Map Sum PairsMedium
- Darbar 526 — Implement Magic DictionaryMedium
- Darbar 527 — Short Encoding Of WordsMedium
- Darbar 528 — Design Add And Search Words Data StructureMedium
- Darbar 529 — Lexicographical NumbersMedium
- Darbar 530 — Design Add And Search Words Data StructureMedium
- Darbar 531 — Word BreakMedium
- Darbar 532 — Distinct Echo SubstringsHard
- Darbar 533 — Replace WordsMedium
- Darbar 534 — Implement Trie Prefix TreeMedium
- Darbar 535 — Map Sum PairsMedium
- Darbar 536 — Implement Magic DictionaryMedium
- Darbar 537 — Short Encoding Of WordsMedium
- Darbar 538 — Word Search IiHard
- Darbar 539 — Search Suggestions SystemMedium
- Darbar 540 — Remove Sub Folders From The FilesystemMedium
- Darbar 541 — Replace WordsMedium
- Darbar 542 — K Divisible Elements SubarraysMedium
- Darbar 543 — Palindrome PairsHard
- Darbar 544 — Distinct Echo SubstringsHard
- Darbar 545 — Top K Frequent WordsMedium
- Darbar 546 — Longest Word In DictionaryMedium
- Darbar 547 — Number Of Matching SubsequencesMedium
- Darbar 548 — Camelcase MatchingMedium
Phase 1 — Orientation, tooling, and diagnostics
Phase 2 — Mathematical foundations I: linear algebra & numerical methods
- Week 7 — Linear algebra IEasy
- Week 8 — Linear algebra IIEasy
- Week 9 — Linear algebra IIIEasy
- Week 10 — Linear algebra IVEasy
- Week 11 — Linear algebra VEasy
- Week 12 — Linear algebra VIEasy
- Week 13 — Linear algebra VIIEasy
- Week 14 — Linear algebra VIIIEasy
- Week 15 — Numerical linear algebra IEasy
- Week 16 — Numerical linear algebra IIEasy
- Week 17 — Numerical linear algebra IIIEasy
- Week 18 — Numerical linear algebra IVEasy
Phase 3 — Mathematical foundations II: calculus, autodiff, probability, statistics
- Week 19 — Calculus IEasy
- Week 20 — Calculus IIEasy
- Week 21 — Calculus IIIEasy
- Week 22 — Automatic differentiationEasy
- Week 23 — Probability IEasy
- Week 24 — Probability IIEasy
- Week 25 — Probability IIIEasy
- Week 26 — Probability IVEasy
- Week 27 — Statistics IEasy
- Week 28 — Statistics IIEasy
- Week 29 — Statistics IIIEasy
- Week 30 — Statistics IVEasy
Phase 4 — Engineering micro-projects and applied ML primitives
- Week 31 — Retrieval mathMedium
- Week 32 — Top-K systemsMedium
- Week 33 — Ranking pipelinesMedium
- Week 34 — Rate limiting IMedium
- Week 35 — CachingMedium
- Week 36 — Text chunkingMedium
- Week 37 — PII handlingMedium
- Week 38 — CalibrationMedium
- Week 39 — Ranking metricsMedium
- Week 40 — BatchingMedium
- Week 41 — ResilienceMedium
- Week 42 — SketchesMedium
- Week 43 — Cardinality/routingMedium
- Week 44 — Load balancingMedium
- Week 45 — IDs/trafficMedium
Phase 5 — System design and distributed systems fundamentals
- Week 46 — System design frameworkMedium
- Week 47 — Data and APIsMedium
- Week 48 — Rate limiting designMedium
- Week 49 — Scaling reads/writesMedium
- Week 50 — Large blobsMedium
- Week 51 — Workflow systemsMedium
- Week 52 — Schema evolutionMedium
- Week 53 — Case studies IMedium
- Week 54 — Case studies IIMedium
- Week 55 — Case studies IIIMedium
- Week 56 — Case studies IVMedium
- Week 57 — Case studies VMedium
Phase 6 — ML lifecycle, experimentation, and MLOps
- Week 58 — ML problem framingMedium
- Week 59 — Data qualityMedium
- Week 60 — Leakage/contaminationMedium
- Week 61 — Offline evaluationMedium
- Week 62 — Online evaluationMedium
- Week 63 — A/B calculatorMedium
- Week 64 — Bootstrap methodsMedium
- Week 65 — SRM detectionMedium
- Week 66 — Feature flagsMedium
- Week 67 — Experiment assignmentMedium
- Week 68 — MonitoringMedium
- Week 69 — Production failuresMedium
Phase 7 — LLM training, RAG, agents, and evaluation
- Week 70 — LLM anatomyMedium
- Week 71 — LLM data pipelinesMedium
- Week 72 — Fine-tuningMedium
- Week 73 — AlignmentMedium
- Week 74 — Distributed trainingMedium
- Week 75 — Vector searchMedium
- Week 76 — Retrieval patternsMedium
- Week 77 — Retrieval fusionMedium
- Week 78 — Retrieval evalMedium
- Week 79 — Prompt systemsMedium
- Week 80 — Memory/contextMedium
- Week 81 — Agent foundationsMedium
Phase 8 — LLM inference and performance engineering
- Week 82 — GPU performanceHard
- Week 83 — Inference arithmeticHard
- Week 84 — PagedAttention/vLLMHard
- Week 85 — vLLM internalsHard
- Week 86 — vLLM metricsHard
- Week 87 — ObservabilityHard
- Week 88 — BenchmarkingHard
- Week 89 — SGLangHard
- Week 90 — Scheduling & MoE ExecutionHard
- Week 91 — QuantizationHard
- Week 92 — Long context & attention alternativesHard
- Week 93 — DisaggregationHard
Phase 9 — Production AI platform engineering
Phase 10 — Capstone, portfolio, and interview readiness
No pages match that filter.