Lessons

// lessons for this module are on the way.

// lessons for this module are on the way.

• algorithmfree

  Insertion sort

  Sort an array by growing a sorted prefix, one element at a time.

  time

  O(n²)

  space

  O(1)

• algorithmfree

  Two pointers

  Find a pair in a sorted array that adds up to a target, in a single pass.

  time

  O(n)

  space

  O(1)

• algorithmfree

  Sliding window

  Find the largest sum of k consecutive numbers without re-adding the whole window each time.

  time

  O(n)

  space

  O(1)

• data structurefree

  Stack

  A last-in, first-out collection: you only ever touch the top.

  time

  O(1)

  space

  O(n)

• data structurefree

  Queue

  A first-in, first-out collection: add at the back, remove from the front.

  time

  O(1)

  space

  O(n)

• algorithmfree

  Reverse a linked list

  Flip every next pointer in place, using three pointers: prev, curr and nxt.

  time

  O(n)

  space

  O(1)

// lessons for this module are on the way.

• algorithmpro

  Binary search

  Find a value in a sorted array by halving the search range at every step.

  time

  O(log n)

  space

  O(1)

// lessons for this module are on the way.

// lessons for this module are on the way.