DSA-One Course - The Complete Data Structures and Algorithms Course
5.0
(0)
5 learners
What you'll learn
This course includes
- 25.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 100 lessons • 25.3 hours of video
DSA-One Course - The Complete Data Structures and Algorithms Course
100 lessons
• 25.3 hours
DSA-One Course - The Complete Data Structures and Algorithms Course
100 lessons
• 25.3 hours
- Time Complexity & Big O notation | Analysis and Calculation | Java C++ Anuj Bhaiya ✅DSAOne Course #1 17:05
- Bit Manipulation Algorithms Part 1 | Interview Questions Java C++ | Anuj Bhaiya ✅| DSAOne Course #2 30:39
- Bit Masking - Important Bit Manipulation Algorithms Part 2 | Java C++ | Anuj Bhaiya✅DSAOne Course #3 19:24
- XOR Problems in Bit Manipulation | Advanced Bit Manipulation Techniques✅ Java C++ | DSAOne Course #4 18:41
- Mathematics & Number Theory Algorithms | Part - 1 | DSA-One Course 16:11
- Euclid GCD, Prime Numbers & Sieve of Eratosthenes | Mathematics Part - 2 | DSA-One Course #6 17:08
- Modulo Arithmetics | Compute answer modulo 1000000007 | Mathematics Part 3 | DSA-One Course #7 15:29
- Recursion in 3 steps | Recursion Algorithms Basics - Part 1 | DSA-One Course #8 13:17
- Josephus Problem, Matrix Paths | Recursive Solution Java and C++ | Anuj Bhaiya ✅| DSA-One Course #9 21:06
- Permutations of a String | Recursion Algorithms on Strings | Power Set of String ✅ DSAOne Course #10 23:03
- Backtracking | N-Queen Problem & Sudoku Solver | Java and C++ | Anuj Bhaiya ✅| DSAOne Course #11 23:39
- Majority Elements in an Array | Moore's Voting Algorithm | Java C++ | Anuj Bhaiya ✅DSAOne Course #12 25:02
- Kadane's Algorithm | Largest Sum Contiguous Subarray | Java and C++ | Anuj Bhaiya ✅DSAOne Course #13 14:02
- Best time to buy and sell stock to Maximise Profit Leetcode - 121 | Java and C++ | DSAOne Course #14 13:31
- Best time to Buy and Sell Stock ii || Leetcode - 122 | Stock Buy and Sell || DSA-One Course #15 07:16
- Trapping Rainwater Problem | Leetcode | Rain water trapping problem | DSA-One Course #16 10:57
- Bubble Sort Algorithm | C++ / Java | Complete explanation for Beginners and Code | DSAOne Course #17 14:22
- Insertion Sort Algorithm | C++ / Java Complete explanation for Beginners and Code | DSAOne Course 18 17:24
- Selection Sort Algorithm | C++ / Java Complete explanation for Beginners and Code | DSAOne Course 19 10:43
- Quick Sort Algorithm | C++ / Java complete explanation for Beginners and Code | DSA-One Course #20 26:52
- Merge Sort Algorithm | C++ / Java Complete explanation for Beginners and Code | DSA-One Course #21 19:51
- Binary Search in C++ and Java | Recursively and Iteratively | DSA-One Course #22 | Anuj Bhaiya 17:55
- Search an element in an Infinite Sorted array | Binary Search, Part 2 | DSA-One Course #23 12:58
- Search an element in a Sorted & Rotated Array | Binary Search, Part 3 | DSA-One Course #24 12:41
- Books Allocation - Google Interview Question | Binary Search, Part 4 | DSA-One Course #25 18:30
- Introduction to Hashing | HashSet in Java & unordered_set in C++ | DSA-One Course #26 10:41
- Hashing Challenge | Count Distinct Elements | Union & Intersection of Two Arrays| DSA-One Course #27 12:24
- Find Subarray with the given sum k 🔥| Hashmap in Java | DSA-One Course #28 16:33
- Count Distinct Elements in every Window of size k | HashMap Interview Problems | DSA-One Course #29 10:57
- Hashmap in Java | Internal Working of Hashmap in Java | Hashmap Implementation | DSA-One Course #30 16:39
- Heap Data Structure | MaxHeap Insertion and Deletion | DSA-One Course #31 21:37
- HeapSort | Heapify method to build a MaxHeap in O(n) | DSA-One Course #32 24:07
- Find Kth Largest/Smallest Element in an Array | PriorityQueue in Java & C++ | DSA-One Course #33 13:15
- Connect N Ropes with minimum cost | Amazon Interview Question | PriorityQueue | DSA-One Course #34 10:58
- Heap - Find Median of Running stream of Integers | Google Interview Question | DSA-One Course #35 15:35
- Linked List Data Structure | Insert, Traverse and Delete Nodes in a Linked List | DSA-One Course #36 28:47
- Reverse a Linked List | Iteratively & Recursively | DSA-One Course #37 17:52
- Palindrome Linked List & Find the middle of a Given Linked List | DSA-One Course #38 12:12
- Detect & Remove Cycle in a Linked List | Floyd's Cycle Detection Algorithm | DSA-One Course #39 15:45
- Clone a Linked List with Next and Random Pointer | Important Interview Question | DSA-One Course #40 11:44
- Stack Data Structure | Stack using Arrays & LinkedList | Stack in C++ & Java | DSA-One Course #41 16:19
- Nearest Smaller Element on Left & Right side of an Array | Stack | DSA-One Course #42 18:03
- Parenthesis Checker | Valid Parentheses Leetcode | Balanced Parentheses Hackerrank | DSAOne #43 10:06
- Largest Rectangular in Histogram | Maximum Rectangular Area in a Histogram | DSA-One Course #44 13:49
- Max rectangle | Maximal Rectangle | Maximum Size Rectangle in Binary Matrix | DSA-One Course #45 10:54
- Infix to Postfix Conversion Using Stack | Infix Postfix and Prefix Expressions | DSA-One Course #46 15:17
- Infix to Postfix Conversion Using Stack | Postfix Evaluation using Stack | DSA-One Course #47 15:04
- Queue Data Structure | Queue in Java | Implement Queue using LinkedList | DSA-One Course #48 09:27
- Circular Queue Implementation using Array | Queue in Data Structure | DSA-One Course #49 20:55
- Queue in Java and C++ | Queue Data Structure | Queue Implementation Java | DSA-One Course #50 05:43
- Implement Queue using two Stack & Implement Stack using two Queue | DSA-One Course #51 08:57
- Flattening a Linked List | Flatten a Multilevel Doubly Linked List | DSA-One Course #52 16:28
- Deque in Data Structure | Double ended queue Data Structure | Stack & Queue using Deque | DSAOne #53 08:39
- Sliding Window Maximum | Sliding Window Algorithm | Deque Data Structure | DSA-One Course #54 18:12
- Binary Tree Data Structure | Implementation of a Binary Tree | Java C++ | DSA-One Course #55 20:56
- Binary Tree Traversals 🔥 | InOrder, PreOrder and PostOrder Traversals | DSA-One Course #56 12:58
- Height of Binary Tree | Height of a Binary Tree | Binary Tree Data Structure | DSA-One Course #57 08:36
- Size of a Binary Tree & Max/Min in a Binary Tree | Binary Tree Data Structure | DSA-One Course #58 08:48
- Level Order Traversal Binary Tree | Binary Tree Level Order Traversal | DSAOne Course #59 16:43
- Left view of Binary Tree | Right view of Binary Tree | Left view of Tree | DSA-One Course #60 10:59
- Top view of Binary Tree | Bottom view of Binary Tree | Binary Tree Data Structures Java | DSAOne #61 16:52
- Binary Tree to DLL | Flatten Binary Tree to Doubly Linked List | DSA-One Course #62 09:33
- Diameter of a Binary Tree | Diameter of a Tree | Maximum width of Binary Tree | DSA-One Course #63 11:35
- Lowest Common Ancestor in a Binary Tree | LCA of a Binary Tree | DSA-One Course #64 11:00
- Burn a Tree | Minimum Time To Burn A Binary Tree Starting From The Leaf Node | DSA-One Course #65 13:43
- Binary Search Tree Data Structure | BST Introduction | Searching, Implementation | DSAOne Course #66 12:24
- Insertion in Binary Search Tree | Insertion in BST | Iteratively & Recursively | DSA-One Course #67 13:58
- Delete a Node in BST | Deletion in BST | Delete a Node in Binary Search Tree | DSA-One Course #68 13:17
- Check for BST | Validate Binary Search Tree | Validate BST | Check BST | DSA-One Course #69 14:39
- Find the Floor & Ceil Value in a BST | Ceil in BST | Floor in BST | Binary search tree | DSAOne #70 14:45
- Two Sum in BST | Pair Sum in BST | Two sum Problem in Binary Search Tree | DSA-One Course #71 07:28
- Vertical Order Traversal of Binary Tree | Vertical Traversal of a Binary Tree | DSA-One Course #72 15:14
- AVL Tree in Data Structure | AVL Tree Insertion , Implementation, Rotation | Java C++ Code } | #73 24:56
- Graph Data Structure | Adjacency Matrix and Adjacency List Graph | Graph DSA Java C++ | DSAOne #74 12:16
- BFS Algorithm | Breadth First Search in Graph | BFS Traversal | BFS Graph | DSA-One Course #75 13:10
- DFS Algorithm | Depth First Search Traversal in Graph | DFS Graph | DSA-One Course #76 13:39
- Detect Cycle in Undirected Graph | Using DFS | Cycle detection in Graph | DSA-One Course #77 12:17
- Detect cycle in a Directed Graph | Using DFS | Graph Data Structure | DSA-One Course #78 11:12
- Topological Sort using DFS | Graph Data Structure | Topological Sort Algorithm | DSAOne #79 08:53
- Kahn's Algorithm | Topological Sort using BFS | Graph Data Structure | Kahn Algorithm | DSAOne #80 12:14
- Prim's Algorithm | Minimum Spanning Tree | Graph Data Structure | Java C++ Code | DSAOne #81 16:30
- Dijkstra's Algorithm | Single Source Shortest Path Algorithm in Graph | Dijkstra algorithm Java #82 12:00
- Bellman Ford Algorithm | Negative Weight Cycle Detection | Shortest Path | DSA-One Course #83 16:22
- Union Find Algorithm | Disjoint Set | Union By Rank & Path Compression | DSA-One Course #84 18:48
- Kruskal's Algorithm to find Minimum Spanning Tree in a Graph | DSA-One Course #85 15:45
- Dynamic Programming 🔥| Coin Change Problem Leetcode | C++ | Java | DSA-One Course #86 30:30
- 0/1 Knapsack Problem using Dynamic Programming | DSA-One Course #87 23:54
- Longest Common Subsequence (LCS) using Dynamic Programming (DP) DSA-One Course #88 25:43
- Longest Common Subsequence LCS using Tabulation Method | Dynamic Programming | DSA-One Course #89 13:24
- 5 Problems on Variations of Longest Common Subsequence | DP | Java DSA Placement Course #90 09:27
- Minimum Edit Distance Problem | DP | Dynamic Programming | DSA-One Course #91 13:42
- Rod Cutting Problem | Easy Explanation & Code | Dynamic Programming | DSA-One Course #92 13:02
- Maximum Sum Rectangle | Extended Kadane's Algorithm | Dynamic Programming | DSA-One Course #93 10:43
- Matrix Chain Multiplication Problem | DP Dynamic Programming | DSA-One Course #94 20:00
- Palindromic Partitioning Problem (Minimum cuts required to make Palindromes) DP | DSA-One Course #95 10:59
- Activity Selection Problem using Greedy Method | Maximum Disjoint Intervals | DSA-One Course #96 13:12
- Wine Buying and Selling Problem | Greedy Algorithm | DSA-One Course #97 07:19
- Minimum Platforms Problem | Greedy Algorithm | DSA-One Course #98 07:10
- Trie Data Structure | Insertion, Deletion & Searching in a Trie | DSA-One Course #99 18:10
- Maximum XOR of Two Numbers in an Array | using Trie Data Structure | DSA-One Course #100 🎉 18:59
Take this course with you
Download the app to continue lessons from your phone anytime.
