CONCEPT BLOGS
Deep concept tutorials — written the way we teach Multi-phase guides with mental models, worked examples, diagrams, and real edge cases — the public form of Learnisim AI's conceptual learning. Read here; train it interactively in the app.
HOW WE TEACH · SAME ARC AS THE APP
Why → Model → Worked → Practice → Edge cases → Apply
LEVEL All beginner intermediate advanced
TOPIC All advanced algorithm analysis algorithms amortized array arrays backtracking beginner bfs binary search binary search trees binary-tree binary-trees bits bitwise bst bucket coding interview coding-interview complexity analysis computer science cycle data structures data-structures deque design dfs dp dsa dynamic programming dynamic-programming floyd geometry graph graph-theory graphs greedy greedy algorithms hash map hash set hashmap heap in-place intermediate intervals interview prep interview-prep kadane kmp leetcode linked list math matrix mental model monotonic stack number-theory optimization performance permutation pointers prefix prefix sum problem solving problem-solving programming fundamentals queue recursion scheduling serialization simulation sliding window sorting stack streaming strings time complexity topo tree trees trie two pointers union-find voting worked example xor
beginner 8 min · Oct 14, 2026
Learn how the Euclidean algorithm quickly finds the greatest common divisor. Step through concrete calculations for 24, 18, 5, 0, 17, and 13.
dsa math number-theory algorithms
Read article → 
