There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
FAANG Job ready DSA mastery course (250+ videos, 100+ pages revision book included)
"Master the secrets of DSA with 250+ videos and a 100+ page revision book to land your dream FAANG job!"
Instructor: 30DaysCoding
Language: Hindi
Validity Period: Lifetime
$89.99 88% OFF
$8.47 excluding 18% GST
10% Cashback as 30DC Coins
📌 Course Overview
- ✅ Certificate of completion
- ✅ 60-day money-back guarantee
- ✅ JavaScript implementations
- ✅ 150+ coding challenges
- ✅ Big O notation and algorithm analysis
- ✅ 20+ core data structures covered
- ✅ 30+ essential algorithms
- ✅ LeetCode and HackerRank problem solving
📚 Curriculum Highlights
1. Foundations of DSA Algorithm Analysis
- Time and space complexity
- Big O notation
- Best, average, and worst-case scenarios
Basic Data Structures
- Arrays and strings
- Linked lists (singly and doubly)
- Stacks and queues
2. Advanced Data Structures Trees and Graphs
- Binary trees and binary search trees
- AVL and Red-Black trees
- Graphs: representation and traversal
Hash-based Structures
- Hash tables and hash functions
- Collision resolution techniques
- Sets and maps
3. Algorithmic Paradigms Searching and Sorting
- Binary search
- Quicksort, Mergesort, Heapsort
- Counting sort and Radix sort
Dynamic Programming
- Memoization and tabulation
- Common DP patterns
- Subset sum and knapsack problems
4. Advanced Algorithms
- Greedy algorithms
- Divide and conquer
- Graph algorithms (Dijkstra's, Floyd-Warshall)
- String matching algorithms
🛠️ Practical Implementation
- 100+ coding challenges
- Implementation in Python, Java, and C++
- LeetCode and HackerRank problem solving sessions
- 5 major projects (e.g., pathfinding visualizer, sorting visualizer)
💼 Career Advancement
- DSA interview question bank
- Mock coding interviews
- System design basics
- Big tech company preparation guides
🎁 Bonus Content
- Competitive programming techniques
- Mathematical foundations for CS
- Bit manipulation tricks
- Advanced data structures (Segment trees, Fenwick trees)
✅ Course Guarantees
- Step-by-step problem-solving approach
- Visualizations for complex concepts
- Regular assignments and quizzes
- Discussion forum for doubt clearing
| Introduction to DSA course - Welcome! | |||
| Welcome to our course. DM me for any help! 1:00 | Preview | ||
| Revision focused course for all learners | Preview | ||
| [NEW NEW] - Practice 150 Questions !!! | Preview | ||
| All guides and resources - download from here | |||
| 15 DSA patterns - awesome resource | |||
| [Interview help] guides, links, questions, resources | |||
| All our premium guides (bonus - free) | |||
| DSA revision complete guide (pdf) (98 pages) | |||
| 150-DSA-questions (9 pages) | |||
| Recursion and Backtracking guide (pdf) (15 pages) | |||
| Dynamic programming guide (pdf) (10 pages) | |||
| Graphs guide (pdf) (17 pages) | |||
| Tree traversals guide (pdf) (14 pages) | |||
| Complete tech job guide (26 pages) | |||
| Facebook generic interview question list | |||
| DSA revision slides and sheets | |||
| DSA video (1.5 hrs) for quick revision 115:00 | |||
| All questions DSA Sheet | |||
| Check the sheet here | |||
| Complete this DSA sheet 1:00 | |||
| Everything about JavaScript | |||
| JS part 1 - Introduction, basics, looping 31:00 | |||
| JS part 2 - Functions, Arrays 12:00 | |||
| JS part 3 - Variables, Data Types , Type Conversions and Operators 33:00 | |||
| JS part 4 - Conditional Statements and Loop 26:00 | |||
| JS part 5 - Functions, Arrays ,For in For of , Spread, Copy, Methods and Array destructuring 45:00 | |||
| JS part 6 - Asynchronous, Set Timeout , Callback, Callback Hell, Promise and Async_Await 36:00 | |||
| JS part 7 - Objects, Object inside Array, Function inside Function, Lexical Scope, This keyword , New and Symbol 43:00 | |||
| JS part 8 - proto , prototype and class 25:00 | |||
| JS part 9 - promises, async, await, and objects 21:00 | |||
| [NEW] - DSA - 150 - zip solutions | |||
| Code file - 150 solutions | |||
| [NEW] - 150 DSA solutions - part 1 | |||
| DSA questions sheet | |||
| DSA questions list (pdf format) (5 pages) | |||
| How to solve DSA problems [must watch] 5:00 | |||
| 1 - Contains Duplicate 8:00 | Preview | ||
| 2 - Valid Anagrams 7:00 | Preview | ||
| 3 - Two Sum 13:00 | Preview | ||
| 4 - Group Anagrams 17:00 | |||
| 5 - Top K Frequent Elements 11:00 | |||
| 6 - Product of Array Except Self 16:00 | |||
| 7 - Is Valid Sudoku 14:00 | |||
| 8 - String Encode and Decode 13:00 | |||
| 9 - Longest Consecutive Sequence 10:00 | |||
| 10 - Valid Palindrome 4:00 | |||
| 11 - Two Sum II 6:00 | |||
| 12 - 3 Sum 23:00 | |||
| 13 - Permutation in String 21:00 | |||
| 14 - Trapping Rain Water 14:00 | |||
| 15 - Best time to buy and sell stock 9:00 | |||
| 16 - Longest Substring without Repeating Characters 17:00 | |||
| 17 - Longest Repeating Character Replacement | |||
| 18 - Container With Most Water 11:00 | |||
| 19 - Minimum Window Substring 32:00 | |||
| 20 - Sliding Window Maximum 10:00 | |||
| 21 - Valid Parentheses 6:00 | |||
| 22 - Min Stack 7:00 | |||
| 23 - Evaluate Reverse Polish Notation 11:00 | |||
| 24 - Generate Parentheses 13:00 | |||
| 25 - Daily Temperatures 12:00 | |||
| 27 - Largest Rectangle In Histogram 19:00 | |||
| 28 - Binary Search 5:00 | |||
| 29 - Search a 2D Matrix 10:00 | |||
| Koko eating Bananas 4:00 | |||
| 31 - Find Minimum In Rotated Sorted Array 8:00 | |||
| 32 - Search In Rotated Sorted Array 11:00 | |||
| 33 - Time Based Key Value Store 10:00 | |||
| 35 - Reverse Linked List 7:00 | |||
| 36 - Merge Two Sorted Lists 7:00 | |||
| 37 - Reorder List 13:00 | |||
| 40 - Add Two Numbers 10:00 | |||
| 41 - Singly Linked Lists 10:00 | |||
| 42 - Find The Duplicate Number 4:00 | |||
| 43 - LRU Cache 10:00 | |||
| 45 - Reverse Nodes in K Group 18:00 | |||
| 46 - Invert Binary Tree 4:00 | |||
| 47 - Maximum Depth of Binary Tree 5:00 | |||
| 48 - Diameter of Binary Tree 7:00 | |||
| 49 - Balanced Binary Tree 7:00 | |||
| 50 - Same Tree 4:00 | |||
| [NEW] - 150 DSA solutions - part 2 | |||
| 51 - Subtree of Another Tree 8:00 | |||
| 52 - Lowest Common Ancestor of a Binary Search Tree 4:00 | |||
| 53 - Binary Tree Level Order Traversal 8:00 | |||
| 54 - Binary Tree Right Side View 7:00 | |||
| 55 - Count Good Nodes In Binary Tree 4:00 | |||
| 56 - Validate Binary Search Tree 3:00 | |||
| 57 - Kth Smallest Element in BST 6:00 | |||
| 58 - Construct Binary Tree from Preorder and Inorder Traversal 8:00 | |||
| 59 - Binary Tree Maximum Path Sum 7:00 | |||
| 60 - Serialize And Deserialize Binary Tree 10:00 | |||
| 61 - Implement Trie Prefix Tree 8:00 | |||
| 62 - Design Add And Search Words Data Structure 10:00 | |||
| 63 - Word Search 2 15:00 | |||
| 64 - Kth Largest Element in Array 3:00 | |||
| 65 - Last Stone Weight 3:00 | |||
| 66 - K Closest Points to Origin 6:00 | |||
| 67 - Kth Largest Element in Array 3:00 | |||
| 68- Task Scheduler 13:00 | |||
| 69 - Design Twitter 6:00 | |||
| 70 - Find Median from Data Stream 7:00 | |||
| 71 - Subsets 7:00 | |||
| 72 - Combination Sum 10:00 | |||
| 73 - Permutation 5:00 | |||
| 74 - Subsets 2 9:00 | |||
| 75 - Combination Sum 2 12:00 | |||
| 76 - Word Search 13:00 | |||
| 77 - Palindrome Partitioning 8:00 | |||
| 78 - Letter Combinations of a Phone Number 8:00 | |||
| 80 - Number of Islands 9:00 | |||
| 81 - Clone Graph 6:00 | |||
| 82 - Max Area of Island 7:00 | |||
| 83 - Pacific Atlantic Water Flow 21:00 | |||
| 84 - Surrounded Regions 8:00 | |||
| 85 - Rotting Oranges 12:00 | |||
| 86 - Walls And Gates 6:00 | |||
| 87 - Course Schedule 12:00 | |||
| 88 - Course Schedule 2 15:00 | |||
| 89 - Redundant Connection 18:00 | |||
| 91 - Graph Valid Tree 12:00 | |||
| 92 - Word Ladder 14:00 | |||
| 93 - Reconstruct Itinerary 10:00 | |||
| 94 - Min Cost to Connect All Points 11:00 | |||
| 95 - Network Delay Time 11:00 | |||
| 96 - Swim in Rising Water 18:00 | |||
| 97 - Alien Dictionary 8:00 | |||
| 98 - Cheapest Flights Within K Stops 9:00 | |||
| 99 - Climbing Strairs 3:00 | |||
| 100 - Min Cost Climbing Stairs 5:00 | |||
| [NEW] - 150 DSA solutions - part 3 | |||
| 101 - House Robber 6:00 | |||
| 102 - House Robber 2 9:00 | |||
| 103 - Longest Palindromic Substring 7:00 | |||
| 104 - Palindromic Substrings 7:00 | |||
| 105 - Decode Ways 5:00 | |||
| 106 - Coin Change 12:00 | |||
| 107 - Maximum Subarray 3:00 | |||
| 108 - Word Break 6:00 | |||
| 109 - Longest Increasing Subsequence 3:00 | |||
| 110 - Partition Equal Subset Sum 4:00 | |||
| 111 - Unique Paths 7:00 | |||
| 112 - Longest Common Subsequence 7:00 | |||
| 113 - Best Time to Buy and Sell Stock with Cooldown 6:00 | |||
| 114 - Coin Change 2 6:00 | |||
| 115 - Target Sum 8:00 | |||
| 116 - Interleaving String 5:00 | |||
| 117 - Longest Increasing Path in a Matrix 8:00 | |||
| 118 - Distinct Subsequences 13:00 | |||
| 119 - Edit Distance 9:00 | |||
| 120 - Burst Balloons 5:00 | |||
| 121 - Regular Expression Matching 5:00 | |||
| 122 - Maximum Subarray 3:00 | |||
| 123 - Jump Game 5:00 | |||
| 124 - Jump Game 2 3:00 | |||
| 125 - Gas Station 6:00 | |||
| 126 - Hand of Straights 5:00 | |||
| 127 - Merge Triplets to Form Target Triplet 5:00 | |||
| 128 - Partition Labels 6:00 | |||
| 130 - Insert Interval 5:00 | |||
| 131 - Merge Intervals 5:00 | |||
| 132 - Non overlapping Intervals 4:00 | |||
| 133 - Meeting Rooms - I 2:00 | |||
| 134 - Meeting Rooms - II 3:00 | |||
| 136 - Rotate Image 3:00 | |||
| 137 - Spiral Matrix 7:00 | |||
| 138 - Set Matrix Zeros 6:00 | |||
| 139 - Happy Number 6:00 | |||
| 140 - Plus One 3:00 | |||
| 141 - Pow x,n 3:00 | |||
| 142 - Multiply Strings 5:00 | |||
| 143 - Detect Squares 3:00 | |||
| 144 - Single Number 1:00 | |||
| 145 - Number of 1 Bits 1:00 | |||
| 146 - Counting Bits 2:00 | |||
| 147 - Reverse Bits 5:00 | |||
| Time complexity, Big-O notation | |||
| Big O Introduction 31:00 | |||
| Big-O Space Complexity 8:00 | |||
| Big O of Array and Objects 15:00 | |||
| Big-O Exercises Time Complexity 18:00 | |||
| Arrays, Hashmaps - Introduction and Questions | |||
| Arrays(insertion , deletion , traversing) 16:00 | |||
| Big O of Array and Objects 15:00 | |||
| Arrays Questions | |||
| Arrays - Longest String 6:00 | |||
| Array - find Zero Triplets 8:00 | |||
| Arrays - Find Max Min 6:00 | |||
| Arrays - Remove Given Element 11:00 | |||
| Hashtable questions | |||
| Hash Table - Two Sum 8:00 | |||
| Hash Table - Find Duplicates 9:00 | |||
| Hash Table - Item In Common 9:00 | |||
| Arrays, Pointers, Sliding window revision | |||
| Quick revision - Arrays 40:00 | |||
| Two Pointers - Introduction 18:00 | |||
| Slow and fast pointer - Introduction 12:00 | |||
| Two pointer and Sliding window revision 18:00 | |||
| Arrays and Hashmaps generic revision sheet | |||
| Binary search | |||
| Binary search introduction 10:00 | |||
| Binary search quick revision and resources 13:00 | |||
| Binary search revision sheet and template | |||
| Linked lists | |||
| Singly Linked Lists Complete video 172:00 | |||
| Doubly Linked Lists Complete video 104:00 | |||
| Linked lists questions | |||
| Linked list revision guide (pdf) (10 pages) | |||
| Linked list quick revision (video) 4:00 | |||
| Linked lists generic revision sheet | |||
| Linked list questions - solutions | |||
| Singly Linked Lists - Reverse 13:00 | |||
| Singly Linked Lists - Remove Duplicate 7:00 | |||
| Singly Linked Lists - Remove Duplicate Unsorted Array 11:00 | |||
| Singly Linked Lists - Find Middle 8:00 | |||
| Singly Linked Lists - Detect Cycle Start 10:00 | |||
| Doubly Linked Lists - Detect Cycle 15:00 | |||
| Doubly Linked Lists - Reverse a List 17:00 | |||
| Doubly Linked Lists - Swap First and Last 6:00 | |||
| Recursion, Backtracking | |||
| Recursion - Introduction 4:00 | |||
| Recursion + Call Stack - Deep understanding 18:00 | |||
| Recursion, Backtracking intro (live class) 58:00 | |||
| Backtracking revision video 19:00 | |||
| Recursion and Backtracking (pdf guide) (15 pages) | |||
| Recursion and backtracking generic revision sheet | |||
| Backtracking questions sheet | |||
| Backtracking questions | |||
| Backtracking - subsets 3:00 | |||
| Backtracking - subsets 2 1:00 | |||
| Backtracking - permutations 2:00 | |||
| Backtracking - combination sum 3:00 | |||
| Dynamic programming | |||
| Recursion and Backtracking generic revision sheet | |||
| Dynamic Programming generic revision sheet | |||
| Dynamic programming revision (video) 33:00 | |||
| DP questions list | |||
| Dynamic programming complete guide (10 pages) | |||
| DP patterns | |||
| DP and Graphs major topics and resources | |||
| Graphs - Introduction | |||
| Graphs - Introduction 9:00 | |||
| Adjacency List - Introduction 2:00 | |||
| Adjacency Matrix - Introduction 1:00 | |||
| Adjacency List - Add Edge 3:00 | |||
| Adjacency List - Remove Edge 5:00 | |||
| Adjacency List - Add Vertex 4:00 | |||
| Adjacency List - Remove Vertex 9:00 | |||
| DP and Graphs major topics and resources | |||
| Stacks, Queues | |||
| Stacks revision sheet | |||
| Queues revision sheet | |||
| Stack - Introduction 8:00 | |||
| Stack - Constructor 5:00 | |||
| Stack - Push 6:00 | |||
| Stack - Pop 3:00 | |||
| Queue - Introduction 8:00 | |||
| Queue - Enqueue | |||
| Queue - Dequeue 5:00 | |||
| Stacks questions | |||
| Stack _ Reverse String 10:00 | |||
| Stack _ Balanced 20:00 | |||
| Stacks _ Sort Stack 20:00 | |||
| Graphs - algorithms and questions | |||
| Graphs questions list | |||
| Graphs generic revision sheet | |||
| Graphs complete (17 pages) | |||
| Graphs revision part 1 (video) 17:00 | |||
| Trees - Binary, BST, BFS, DFS | |||
| Tree Traversal Guide - BFS and DFS 49:00 | |||
| Binary Search Tree Full Video 48:00 | |||
| Breadth First Search - detailed video 11:00 | |||
| Depth First Search - detailed video 35:00 | |||
| Trees generic revision sheet | |||
| Complete question list - trees | |||
| Trees orders - in, post, pre (pdf guide) (14 pages) | |||
| Tries, Priority Queue | |||
| Tries revision (video) 10:00 | |||
| Priority queue revision (video) 11:00 | |||
| Trie visualization | |||
| Questions - heaps | |||
| Article - tries | |||
| Sorting | |||
| Merge Sort 17:00 | |||
| Insertion Sort 12:00 | |||
| Selection Sort 12:00 | |||
| Bubble Sort 13:00 | |||
| Quick Sort 13:00 | |||
| Sorting summary | |||
| Revising DSA using Chat GPT | |||
| Introduction to Chat GPT prompts | |||
| Prompt for explaining code | |||
| Prompt for similar DSA questions | |||
| Prompt for new DSA questions | |||
| Prompt for multiple solutions for DSA question | |||
| Join 1:1 mentorship | |||
| 1:1 mentorship + 24/7 Whatsapp access + all courses 1:00 | |||
| Join the mentorship plan | |||
After successful purchase, this item would be added to your Library.
You can access the library in the following ways :
- From Computer, you can access your library after successful login
- For other devices, you can access your library using this web app through browser of your device.
Other Courses