IIRF Online > Development > Software Engineering > Coding Interview > Python Data Structures & Algorithms + LEETCODE Exercises
Python Data Structures & Algorithms + LEETCODE Exercises by Udemy
DSA for Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.
Course Highlights
- <> 100+ Coding Exercises with Detailed Explanations
- Enhance Your Learning with Animated Examples of DSA
- Gain Expertise in Data Structures and Algorithms
- Ace Technical Interviews with Confidence
- Understand Time and Space Complexity of Data Structures and Algorithms
- Elevate Your Development Skills to the Next Level
- Boost Your Problem-Solving Ability
Skills you will learn!
Curriculum
2 Topics
Overview (Please Watch)
Code Editor
14 Topics
Big O: Intro
Big O: Worst Case
Big O: O(n)
<> Big O: O(n)
Big O: Drop Constants
Big O: O(n^2)
<> Big O: O(n^2)
Big O: Drop Non-Dominants
Big O: O(1)
Big O: O(log n)
Big O: Different Terms for Inputs
Big O: Lists
Big O: Wrap Up
Big O
2 Topics
Classes
Pointers
17 Topics
Linked List: Intro
LL: Big O
LL: Under the Hood
LL: Constructor
Coding Exercises (Important)
LL: Print List
LL: Append
LL: Pop Intro
LL: Pop Code
LL: Prepend
LL: Pop First
LL: Get
LL: Set
LL: Insert
LL: Remove
LL: Reverse
Linked List Big O
11 Topics
LL: Constructor
LL: Print List
LL: Append
LL: Pop
LL: Prepend
LL: Pop First
LL: Get
LL: Set
LL: Insert
LL: Remove
LL: Reverse
8 Topics
Introduction to Interview Questions (PLEASE READ)
LL: Find Middle Node ( ** Interview Question)
LL: Has Loop ( ** Interview Question)
LL: Find Kth Node From End ( ** Interview Question)
LL: Partition List ( ** Interview Question)
LL: Remove Duplicates ( ** Interview Question)
LL: Binary to Decimal ( ** Interview Question)
LL: Reverse Between ( ** Interview Question)
9 Topics
DLL: Constructor
DLL: Append
DLL: Pop
DLL: Prepend
DLL: Pop First
DLL: Get
DLL: Set
DLL: Insert
DLL: Remove
9 Topics
DLL: Constructor
DLL: Append
DLL: Pop
DLL: Prepend
DLL: Pop First
DLL: Get
DLL: Set
DLL: Insert
DLL: Remove
4 Topics
DLL: Swap First and Last ( ** Interview Question)
DLL: Reverse ( ** Interview Question)
DLL: Palindrome Checker ( ** Interview Question)
DLL: Swap Nodes in Pairs ( ** Interview Question)
9 Topics
Stack: Intro
Stack: Constructor
Stack: Push
Stack: Pop
Queue: Intro
Queue: Constructor
Queue: Enqueue
Queue: Dequeue
Stacks & Queues Big O
6 Topics
Stack: Constructor
Stack:Push
Stack:Pop
Queue: Constructor
Queue:Enqueue
Queue: Dequeue
8 Topics
Stack: Implement Stack Using a List ( ** Interview Question)
Stack: Push for Stack That Uses List ( ** Interview Question)
Stack: Pop for Stack That Uses List ( ** Interview Question)
Stack: Parentheses Balanced ( ** Interview Question)
Stack: Reverse String ( ** Interview Question)
Stack: Sort Stack ( ** Interview Question)
Queue Using Stacks: Enqueue ( ** Interview Question)
Queue Using Stacks: Dequeue ( ** Interview Question)
8 Topics
Trees: Intro & Terminology
Binary Search Trees: Example
BST: Big O
BST: Constructor
BST: Insert - Intro
BST: Insert - Code
BST: Contains
BST Big O
3 Topics
BST: Constructor
BST: Insert
BST: Contains
9 Topics
Hash Table: Intro
HT: Collisions
HT: Constructor
HT: Set
HT: Get
HT: Keys
HT: Big O
HT: Interview Question
Hash Table Big O
4 Topics
HT: Constructor
HT: Set
HT: Get
HT: Keys
11 Topics
HT: Item In Common ( ** Interview Question)
HT: Find Duplicates ( ** Interview Question)
HT: First Non-Repeating Character ( ** Interview Question)
HT: Group Anagrams ( ** Interview Question)
HT: Two Sum ( ** Interview Question)
HT: Subarray Sum ( ** Interview Question)
Introduction to Sets
Set: Remove Duplicates ( ** Interview Question)
Set: Has Unique Chars ( ** Interview Question)
Set: Find Pairs ( ** Interview Question)
Set: Longest Consecutive Sequence ( ** Interview Question)
9 Topics
Graph: Intro
Graph: Adjacency Matrix
Graph: Adjacency List
Graph: Big O
Graph: Add Vertex
Graph: Add Edge
Graph: Remove Edge
Graph: Remove Vertex
Graphs
4 Topics
Graph: Add Vertex
Graph: Add Edge
Graph: Remove Edge
Graph: Remove Vertex
7 Topics
Heap: Intro
Heap: Insert (Intro)
Heap: Helper Methods
Heap: Insert (Code)
Heap: Remove
Heap: Sink Down
Heap: Priority Queues & Big O
6 Topics
Heap: Insert
Heap: Remove
Heap: Sink Down
MinHeap: Insert
MinHeap: Remove
MinHeap: Sink Down
2 Topics
Heap: Kth Smallest Element in an Array
Heap: Maximum Element in a Stream
3 Topics
Recursion: Intro
Call Stack
Factorial
7 Topics
rBST: Contains
rBST: Insert
rBST: Delete Intro
rBST: Delete Code (1 of 3)
rBST: Delete Code (2 of 3)
rBST: Minimum Value
rBST: Delete Code (3 of 3)
4 Topics
rBST: Contains
rBST: Insert
BST: Minimum Value
rBST: Delete
9 Topics
Tree Traversal: Intro
BFS (Breadth First Search): Intro
BFS: Code
DFS (Depth First Search): PreOrder - Intro
DFS: PreOrder - Code
DFS: PostOrder - Intro
DFS: PostOrder - Code
DFS: InOrder - Intro
DFS: InOrder - Code
4 Topics
BFS (Breadth First Search)
DFS PreOrder
DFS PostOrder
DFS InOrder
2 Topics
BST: Validate BST ( ** Interview Question)
BST: Kth Smallest Node ( ** Interview Question)
8 Topics
Bubble Sort: Intro
Bubble Sort: Code
Selection Sort: Intro
Selection Sort: Code
Insertion Sort: Intro
Insertion Sort: Code
Insertion Sort: Big O
Basic Sorts
3 Topics
Bubble Sort
Selection Sort
Insertion Sort
3 Topics
Bubble Sort of LL ( ** Interview Question)
Selection Sort of LL ( ** Interview Question)
Insertion Sort of LL ( ** Interview Question)
6 Topics
Merge Sort: Overview
Merge: Intro
Merge: Code
Merge Sort: Intro
Merge Sort: Code
Merge Sort: Big O
2 Topics
Merge
Merge Sort
1 Topic
Merge Two Sorted LL ( ** Interview Question)
5 Topics
Quick Sort: Intro
Pivot: Intro
Pivot: Code
Quick Sort: Code
Quick Sort: Big O
2 Topics
Pivot
Quick Sort
8 Topics
List: Remove Element ( ** Interview Question)
List: Find Max Min ( ** Interview Question)
List: Find Longest String ( ** Interview Question)
List: Remove Duplicates ( ** Interview Question)
List: Max Profit ( ** Interview Question)
List: Rotate ( ** Interview Question)
List: Max Sub Array ( ** Interview Question)
Thank You!
1 Topic
Coding Exercises Are Now After Each Section - (CLICK HERE FOR MORE INFO)
Python Data Structures & Algorithms + LEETCODE Exercises
Related Coding Interview Courses
Thank You!
Your review has been submitted successfully.