IIRF Online > Development > Software Engineering > Data Structures > Free Advanced Data Structures and Algorithms Course
Free Advanced Data Structures and Algorithms Course by Geekster
Course Highlights
- Linked List
- Stack & Queue
- Recursion
- Binary Tree & BST
- Priority Queue
- Tries
- HashMap
Skills you will learn!
Curriculum
14 Topics
Linked List Introduction
Middle of Linked List
Delete Nth Node From End
Intersection of Two LL
Linked List Cycle - I
Linked List Cycle I|
Reverse Linked List
Merge Two Lists
Partition List
Reorder Linked List
Add Two Lists
Merge K Sorted Lists
Sort Linked List
Cloned List Random Ptr
16 Topics
Design Stack
Design Queue
Design Circular Queue
Design Circular Deque
Stack Using Queue
Queue Using Stack
Min Stack - I
Min Stack - II
Valid Parantheses
Redundant Braces
Postfix Evaluation
Next Greater Element - I
Online Stock Span
Largest Area Histogram
Asteroid Collision
Remove K Digits
19 Topics
Print N to 1
Print 1 to N
Factorial Problem
Power Function - 1
Power Function - 2
Fibonacci
Check Array Sorted
Recursive Search - I
Recursive Search - II
Merge Sort
Quick Sort
Reverse String
Valid Palindrome
Power Set
Subsets
Keypad Problem
Permutations
Combinations
Remove Adjacent Duplicates
40 Topics
Trees Introduction - I
Trees Introduction - II
Binary Tree Representation
DFS Traversal
Height Binary Tree
Min Depth of Tree
Balanced Binary Tree
Diameter Binary Tree
Same or Mirror Tree
Invert Binary Tree
Flatten Binary Tree
Tilt of Binary Tree
Path Sum - 1
Path Sum - 2
Path Sum - 3
List in Binary Tree
Max Path Sum Tree
Burning Tree
Nodes at K Distance
Level Order or BFS
Level Order Linewise
BFS Variations
Cousins in Binary Tree
Populating Next Right Pointer
Left View _ Right View
Diagonal Traversal of Tree
Vertical Traversal of Tree
Top View _Bottom View
Boundary Traversal of Tree
Serialize & Deserialize Tree_2
Verify Preorder Serialization
Construct Tree From Preorder & Inorder
LCA in Binary Tree
House Robber _Zig Zag Path
DFS and BFS in NAry Tree
Insert _ Search in BST
Deletion in BST
DFS Problems in BST
Check or Construct BST
Inorder Traversal in BST
22 Topics
Priority Queue Intro
Heap Sort
K Largest Elements
K Closest Points
Merge Intervals
Non Overlap Intervals
Min Train Platforms
Indian Coin Change
Huffman Encoding
Huffman Decoding
Min Cost of Ropes
Fractional Knapsack
Circular Tour
Largest Number
Candy Problem
Two City Scheduling
Median in Data Stream
Defense Kingdom
Next Permutation
Reorganize String
Car Fleet
Wine Buying & Selling
13 Topics
Trie Introduction
Implement Trie I
Implement Trie |I
Design Dictionary
Map Sum Pairs
Longest Word in Dictionary
Longest Common Prefix
Search Suggestion System
Shortest Unique Prefix
Count Distinct Substrings
Word Search I|
Max XOR Pair
Unique Rows Matrix
7 Topics
Hashmap & Hashset Intro
Frequency Based HashMap
First Unique or Duplicate
K Sum Subarray Part 1
Index Based Hashing
String Hashing Part1
K Sum Subarray Part 2
1 Topic
Conclusion
Free Advanced Data Structures and Algorithms Course
Related Data Structures Courses
Thank You!
Your review has been submitted successfully.