Crack Coding Interviews:Data Structures + Algorithms-Python

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: How to succeed in this course

Lecture 3: Leetcode

Chapter 2: Interviews

Lecture 1: Resume

Lecture 2: When to apply for a job ?

Lecture 3: How to get Interviews!!

Lecture 4: How to perform in technical interviews

Lecture 5: Technical interview demo

Lecture 6: Summary

Chapter 3: BigO Notations

Lecture 1: Introduction

Lecture 2: What does large input mean?

Lecture 3: Asymptotic Notations

Lecture 4: Time Complexity

Lecture 5: O(1) – Constant Time

Lecture 6: O(n) – Linear Time

Lecture 7: O(n^2) – Quadratic Time

Lecture 8: O(logn) – Logarithmic Time

Lecture 9: Which time complexity is better?

Lecture 10: Rules of BigO

Lecture 11: RAM – Random Access Memory

Lecture 12: Space Complexity

Lecture 13: O(1) – Constant Space

Lecture 14: O(n) – Linear Space

Lecture 15: Time or Space ?

Chapter 4: Data Structures

Lecture 1: What is a data structure ?

Lecture 2: Why do we need data structures ?

Lecture 3: Data Structures classification

Lecture 4: Basic Operations on Data Structures

Chapter 5: Arrays

Lecture 1: What is an array?

Lecture 2: Types of arrays

Lecture 3: Arrays in memory

Lecture 4: Create and Insert

Lecture 5: Traversal

Lecture 6: Access

Lecture 7: Search : Linear Search

Lecture 8: Search : Binary Search

Lecture 9: Delete/Remove

Lecture 10: Summary

Lecture 11: When to use arrays?

Lecture 12: Resources

Chapter 6: Lists

Lecture 1: What is a list?

Lecture 2: Properties of a list

Lecture 3: List vs Array

Lecture 4: List operations : Create

Lecture 5: List operations : Access

Lecture 6: List operations : Insert

Lecture 7: List operations : Traversal

Lecture 8: Linear Search

Lecture 9: Binary Search

Lecture 10: List operations : Delete

Lecture 11: List slicing

Lecture 12: Other List operations

Lecture 13: Strings

Lecture 14: List comprehension and map

Lecture 15: Common mistakes

Lecture 16: Summary

Lecture 17: Resources

Chapter 7: List – Practice problems

Lecture 1: Copy & Reverse – Problem

Lecture 2: Copy & Reverse – Solution

Lecture 3: Reverse & Split – Problem

Lecture 4: Reverse & Split – Solution

Lecture 5: Rotate array – Problem

Lecture 6: Rotate array – Solution

Lecture 7: String compression – Problem

Lecture 8: String compression – Solution

Lecture 9: Chess tournament – Problem

Lecture 10: Chess tournament – Solution (Part – 1)

Lecture 11: Chess tournament – Solution (Part – 2)

Lecture 12: Chess tournament – Solution (Part – 3)

Lecture 13: Stocks – Problem

Lecture 14: Stocks – Solution

Lecture 15: Trapping rain water – Problem

Lecture 16: Trapping rain water – Solution (Part – 1)

Lecture 17: Trapping rain water – Solution (Part – 2)

Chapter 8: Data Structures : Hash Tables/Dictionaries

Lecture 1: What is a dictionary ?

Lecture 2: Why do we need dictionaries?

Lecture 3: Dictionaries in memory

Lecture 4: Create

Lecture 5: Access, Insert and Update

Lecture 6: Traversal

Lecture 7: Delete

Lecture 8: Collision resolution

Lecture 9: Built-in functions

Lecture 10: List vs Dictionary

Lecture 11: Summary

Chapter 9: Dictionary – Practice problems

Lecture 1: Design Hashmap – Problem

Lecture 2: Design Hashmap – Solution

Lecture 3: Longest Word – Problem