Algorithms Short Course

Build the algorithmic thinking skills that top tech companies test for in coding interviews and that make you a better programmer. This course covers Big O notation, searching and sorting algorithms, hash tables, stacks, queues, recursion, and common problem-solving patterns. Understanding algorithms and data structures is the difference between writing code that works and code that scales.. Master algorithms through bite-sized, swipeable learning tiles — designed for busy people who want to learn on the go.

Start This Course →

About This Algorithms Course

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

Core Algorithms

Sorting, searching, and Big O

Big O notationlinear and binary searchbubble sort and merge sorthash tablesstacks and queuesrecursion basicstwo-pointer technique

Array Algorithms

Essential array techniques

two-pointer techniquesliding windowprefix sumskadane's algorithmDutch national flagarray rotationmerge intervals

Sorting Algorithms

Classic and efficient sorts

bubble and selection sortinsertion sortmerge sortquicksortheap sortcounting and radix sortsorting stability and comparison

Search Algorithms

Find elements efficiently

linear searchbinary search variationsternary searchinterpolation searchsearch in rotated arraysfirst/last occurrencesearch in 2D matrices

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

Graph Algorithms

Navigate connected networks

graph representationsBFS and DFS on graphsshortest path (Dijkstra)topological sortcycle detectionminimum spanning treeunion-find data structure

Dynamic Programming

Solve overlapping subproblems

memoization vs tabulationfibonacci and climbing stairscoin change problemlongest common subsequenceknapsack problemDP on stringsrecognizing DP problems

Linked Lists & Stacks

Sequential data structures

linked list reversalcycle detection (Floyd's)merge two sorted listsstack applicationsqueue implementationsmonotonic stackdeque problems

Hashing & Maps

O(1) lookup techniques

hash map internalstwo sum patternfrequency countinggroup anagramshash set for duplicatescollision resolutionrolling hash basics

Interview Preparation

Ace coding interviews

problem-solving frameworktime and space complexity analysiscommon interview patternssystem design basicsbehavioral question prepwhiteboard coding tipsmock interview strategies