Faster launch · full-screen · home-screen access.
Uncommon — Thoroughly curated by Hiro Tanaka
LeetCode patterns, time complexity cheatsheet, common tree algorithms explained clearly.
by @hiro
This pack targets top-25 DSA interview patterns: Two Pointers, Sliding Window, BFS/DFS on trees and graphs, Dynamic Programming fundamentals, and Binary Search templates. Each concept includes time complexity, space complexity, and a worked example. Ideal for FAANG/product company preparation.
This pack targets top-25 DSA interview patterns: Two Pointers, Sliding Window, BFS/DFS on trees and graphs, Dynamic Programming fundamentals, and Binary Search templates. Each concept includes time complexity, space complexity, and a worked example. Ideal for FAANG/product company preparation.
We use essential storage to keep you signed in. With your permission, we also load Google Analytics, the Meta Pixel and Google AdSense, which set analytics and advertising cookies. Cookie policy