Problem-solving patterns for coding interviews. Master algorithms through bite-sized, swipeable learning tiles — designed for busy people who want to learn on the go.
This Algorithms short course on SkillTiles breaks down everything you need to know into 10 structured milestones, each packed with bite-sized learning tiles you can swipe through in under 15 seconds each.
Whether you're a complete beginner or looking to refresh your knowledge, this online algorithms course uses AI-powered content to adapt to your learning pace. Each tile delivers a focused concept, example, or quiz — making it perfect for commutes, coffee breaks, or quick study sessions.
Covering 70 key topics across 10 milestones, this course takes you from foundations to practical application. Earn badges as you complete each milestone and track your progress on your learning dashboard.
Course Curriculum
1
Core Algorithms
Sorting, searching, and Big O
Big O notationlinear and binary searchbubble sort and merge sorthash tablesstacks and queuesrecursion basicstwo-pointer technique
2
Array Algorithms
Essential array techniques
two-pointer techniquesliding windowprefix sumskadane's algorithmDutch national flagarray rotationmerge intervals
3
Sorting Algorithms
Classic and efficient sorts
bubble and selection sortinsertion sortmerge sortquicksortheap sortcounting and radix sortsorting stability and comparison
4
Search Algorithms
Find elements efficiently
linear searchbinary search variationsternary searchinterpolation searchsearch in rotated arraysfirst/last occurrencesearch in 2D matrices
5
Trees & BST
Hierarchical data structures
binary tree traversals (in/pre/post)BFS vs DFS on treesbinary search tree operationsbalanced BST conceptslowest common ancestortree serializationtrie data structure
6
Graph Algorithms
Navigate connected networks
graph representationsBFS and DFS on graphsshortest path (Dijkstra)topological sortcycle detectionminimum spanning treeunion-find data structure
7
Dynamic Programming
Solve overlapping subproblems
memoization vs tabulationfibonacci and climbing stairscoin change problemlongest common subsequenceknapsack problemDP on stringsrecognizing DP problems
8
Linked Lists & Stacks
Sequential data structures
linked list reversalcycle detection (Floyd's)merge two sorted listsstack applicationsqueue implementationsmonotonic stackdeque problems
9
Hashing & Maps
O(1) lookup techniques
hash map internalstwo sum patternfrequency countinggroup anagramshash set for duplicatescollision resolutionrolling hash basics
10
Interview Preparation
Ace coding interviews
problem-solving frameworktime and space complexity analysiscommon interview patternssystem design basicsbehavioral question prepwhiteboard coding tipsmock interview strategies