Course Curriculum

  • 1

    Welcome to Interview Accelerator

    • How to approach this course

  • 2

    Time and Space Complexity

    • Understanding Time & Space Complexity

    • Practice Evaluating Algorithm Efficiency

  • 3

    Problem Solving

    • Developing the Correct Problem Solving Approach

  • 4

    Arrays

    • Introduction to Arrays

    • Interview Question #1 - Cyclic Arrays

    • Cyclic Arrays - Whiteboard Interview Solution

    • Cyclic Arrays - Code Solution

    • Interview Question #2 - Sentence Manipulation

    • Sentence Manipulation - Whiteboard Interview Solution

    • Sentence Manipulation - Code Solution

  • 5

    Hash Maps

  • 6

    Important Array and Hash Map Concepts

    • Converting Nested Loops To Linear Time Complexity

    • Working with Multiple Arrays

    • Interview Question #5 - Multi-Array Intersection

    • Multi-Array Intersection - Whiteboard Interview Solution

    • Multi-Array Intersection - Code Solution

    • Infinitely Nested Arrays

      FREE PREVIEW
    • Mutating Arrays w/ Swaps

    • Interview Question #6 - Array Swapping

    • Array Swapping - Whiteboard Interview Solution

    • Array Swapping - Code Solution

  • 7

    Combinations and Subsets

    • Combinations And Subsets

    • Interview Question #7 - Perfect Sum

    • Perfect Sum - Whiteboard Interview Solution

    • Perfect Sum - Code Solution

    • Interview Question #8 - N-Sum

    • N-Sum - Whiteboard Interview Solution

    • N-Sum - Code Solution

  • 8

    Sorting and Searching Arrays

  • 9

    Linked Lists

    • Introduction to Linked Lists

    • Implementing Linked Lists

    • Interview Question #9 - Linked List Manipulation

    • Linked List Manipulation - Whiteboard Interview Solution

    • Linked List Manipulation - Code Solution

    • Interview Question #10 - Advanced LL Manipulation

    • Advanced LL Manipulation - Whiteboard Interview Solution

    • Advanced LL Manipulation - Code Solution

  • 10

    Stacks

  • 11

    Queues

    • Queues Introduction & Implementation

    • Interview Question #13 - Stack with Queue

    • Stack with Queue - Whiteboard Interview Solution

    • Stack with Queue - Code Solution

    • Interview Question #14 - Queue with Stacks

    • Queue with Stacks - Whiteboard Interview Solution

    • Queue with Stacks - Code Solution

  • 12

    Binary Search Trees

    • Introduction to Trees

      FREE PREVIEW
    • Introduction to Binary Search Trees

    • Insert and Search in Binary Search Trees

    • Delete Algorithm on Binary Search Trees

    • Text Solution to BST Implementation

    • Traversals on Binary Search Trees

    • Interview Question #15 - Kth Smallest

    • Kth Smallest - Whiteboard Interview Solution

    • Kth Smallest - Code Solution

    • Interview Question #16 - Validating Trees

    • Validating Trees - Whiteboard Interview Solution

    • Validating Trees - Code Solution

  • 13

    Graphs

    • Introduction to Graphs

    • Graphs Implementation

    • Text Solution to Graphs Implementation

    • Adjacency Matrix with Graphs

    • Breadth First Search (BFS) on Graphs - Deep Dive

    • BFS on Graphs - Implementation

    • Depth First Search (DFS) on Graphs - Deep Dive

    • DFS on Graphs - Implementation

    • Interview Question #17 - Cycles in Graphs

    • Cycles in Graphs - Whiteboard Interview Solution

  • 14

    Dynamic Programming

    • Introduction to Dynamic Programming

    • Fundamental Concept of Dynamic Programming

    • Interview Question #18 - Largest Square

    • Largest Square - Whiteboard Interview Solution

      FREE PREVIEW
    • Largest Square - Code Solution

    • Interview Question #19 - Fibonacci Series

    • Fibonacci Series - Whiteboard Interview Solution

    • Fibonacci Series - Code Solution

  • 15

    Object Oriented Programming and Design

  • 16

    Designing Complex Algorithms

    • Step-by-step Algorithm Design -- Interview Question #20

    • Step-by-step Algorithm Design -- Whiteboard Interview Example

About

Some quote from the instructor

I HAVE CRACKED THE CODING INTERVIEW PROCESS OVER AND OVER

Some details about the course