DSA - Level 1
5.0
(1)
22 learners
What you'll learn
This course includes
- 75 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 505 lessons • 75 hours of video
DSA - Level 1
505 lessons
• 69.3 hours
DSA - Level 1
505 lessons
• 69.3 hours
- Introduction to Java Foundation | Basic Data Structures | Java Foundation Course | Pepcoding 09:30
- How to Print Output in Java | Java Foundation Course | "Hello World" | Lecture -1 08:30
- How to Print Z - Question | Java Foundation Course | Lecture 2 01:20
- How to Print Z - Solution Video | Java Foundation Course | Lecture 3 02:38
- Variables in Java | Java Foundation Course | Lecture 4 14:51
- Conditional Statements | If, Else if and Else | Java Foundation Course | Lecture 5 11:45
- Conditionals - Question | Grading System | Java Foundation Course | Lecture 6 01:53
- Conditionals - Solution | Grading System | Java Foundation Course | Lecture 7 03:32
- Loops | Java Foundation Course | Lecture 8 10:32
- Take Input | Java Foundation Course | Lecture 9 08:18
- Is a number Prime? - Question | Java Foundation Course | Lecture 10 02:25
- Is a number Prime? - Solution | Java Foundation Course | Lecture 11 18:20
- Print all Prime Numbers till N - Question | Java Foundation Course | Lecture 12 01:25
- Print all Prime Numbers till N - Solution | Java Foundation Course | Lecture 13 06:17
- Print all Fibonacci Numbers till N - Question | Java Foundation Course | Lecture 14 01:28
- Print all Fibonacci Numbers till N - Solution | Java Foundation Course | Lecture 15 08:31
- Count Digits in a Number - Question | Java Foundation Course | Lecture 16 00:40
- Count Digits in a Number - Solution | Java Foundation Course | Lecture 17 03:19
- Digits of a number - Question | Java Foundation Course | Lecture 18 00:40
- Digits of a number - Solution | Java Foundation Course | Lecture 19 09:20
- Reverse a number - Question | Java Foundation Course | Lecture 20 00:36
- Reverse a number - Solution | Java Foundation Course | Lecture 21 02:36
- Inverse of a number - Question | Java Foundation Course | Lecture 22 04:20
- Inverse of a number - Solution | Java Foundation Course | Lecture 23 15:05
- Rotate a number - Question | Java Foundation Course | Lecture 24 04:00
- Rotate a number - Solution | Java Foundation Course | Lecture 25 10:25
- GCD and LCM - Question | Java Foundation Course | Lecture 26 01:00
- GCD and LCM - Solution | Java Foundation Course | Lecture 27 07:49
- Prime Factorization - Question | Java Foundation Course | Lecture 28 01:10
- Prime Factorization - Solution | Java Foundation Course | Lecture 29 08:00
- Pythagorean Triplets - Question | Java Foundation Course 01:00
- Pythagorean Triplets - Solution | Java Foundation Course 05:18
- Benjamin Bulbs - Question | Java Foundation Course 01:34
- Benjamin Bulbs - Solution | Java Foundation Course 08:27
- Pattern-1 | Question | Java Foundation Course 00:33
- Pattern-1 | Solution | Java Foundation Course 15:10
- Pattern-2 | Question | Java Foundation Course 00:40
- Pattern-2 | Solution | Java Foundation Course 08:48
- Pattern-3 | Question | Java Foundation Course 00:30
- Pattern-3 | Solution | Java Foundation Course 09:33
- Pattern-4 | Question | Java Foundation Course 00:33
- Pattern-4 | Solution | Java Foundation Course 07:41
- Pattern-5 | Question | Java Foundation Course 00:24
- Pattern-5 | Solution | Java Foundation Course 08:43
- Pattern-6 | Question | Java Foundation Course 01:24
- Pattern-6 | Solution | Java Foundation Course 06:12
- Pattern-7 | Question | Java Foundation Course 00:23
- Pattern-7 | Solution | Java Foundation Course 05:09
- Pattern-8 | Question | Java Foundation Course 00:22
- Pattern-8 | Solution | Java Foundation Course 03:56
- Pattern-9 | Question | Java Foundation Course 00:23
- Pattern-9 | Solution | Java Foundation Course 02:33
- Pattern-10 | Question | Java Foundation Course 01:04
- Pattern-10 | Solution | Java Foundation Course 09:44
- Pattern-11 | Question | Java Foundation Course 00:31
- Pattern-11 | Solution | Java Foundation Course 06:09
- Pattern-12 | Question | Java Foundation Course 00:28
- Pattern-12 | Solution | Java Foundation Course 03:06
- Pattern 13 | Question | Java Foundation Course 00:45
- Pattern-13 | Solution | Java Foundation Course 11:26
- Pattern-14 | Question | Java Foundation Course 00:25
- Pattern-14 | Solution | Java Foundation Course 02:02
- Pattern-15 | Question | Java Foundation Course 04:05
- Pattern-15 | Solution | Java Foundation Course 10:44
- Pattern-16 | Question | Java Foundation Course 01:47
- Pattern-16 | Solution | Java Foundation Course 11:01
- Pattern-17 | Question | Java Foundation Course 01:17
- Pattern-17 | Solution | Java Foundation Course 06:08
- Pattern-18 | Question | Java Foundation Course 01:09
- Pattern-18 | Solution | Java Foundation Course 06:57
- Pattern-19 | Question | Java Foundation Course 00:33
- Pattern-19 | Solution | Java Foundation Course 14:15
- Pattern-20 | Question | Java Foundation Course 00:16
- Pattern-20 | Solution | Java Foundation Course 04:06
- Introduction to Functions 19:28
- Digits Frequency | Question 00:28
- Digits Frequency | Solution 03:49
- Introduction to Number System 11:58
- Decimal to any Base | Question 00:48
- Decimal to any Base | Solution 12:34
- Any base to decimal | Question 01:01
- Any base to Decimal | Solution 06:08
- Any base to any base | Question 00:37
- Any base to any base | Solution 03:33
- Any base addition | Question 03:32
- Any base Addition | Solution 13:11
- Any base subtraction | Question 01:54
- Any base subtraction | Solution 09:42
- Any base multiplication | Question 02:50
- Any base multiplication | Solution 08:57
- Introduction to Arrays 06:21
- Arrays - Memory 15:08
- Span of an Array | Question 00:57
- Span of an Array | Solution 05:45
- Find Element in Array | Question 01:09
- Find element in an Array | Solution 03:53
- Bar Chart | Question 00:54
- Bar Chart | Solution 07:36
- Sum of two arrays | Question 01:18
- Sum of two arrays | Solution 11:23
- Difference of two arrays | Question 01:24
- Difference of two arrays | Solution 15:56
- Introduction to Stacks and its usage 11:31
- Duplicate Brackets | Question 02:33
- Duplicate Brackets | Solution 08:12
- Balanced Brackets | Question 02:38
- Balanced Brackets | Solution 12:33
- Next Greater Element on the Right | Question 02:14
- Next Greater element on the right | Solution 16:27
- Next Greater Element on the Right | Alternative Solution 13:39
- Stock Span | Question 03:01
- Stock Span | Solution 06:29
- Largest Area Histogram | Question 02:33
- Largest Area Histogram | Solution 20:05
- Sliding Window Maximum | Question 01:59
- Sliding Window Maximum | Solution 21:15
- Infix Evaluation | Question 02:04
- Infix Evaluation | Solution 23:03
- Infix Conversions | Questions 16:50
- Infix Conversions | Solution 21:56
- Postfix Evaluations and Conversions | Questions 06:52
- Postfix Expressions | Solution 10:23
- Prefix Evaluations and Conversion | Question 05:00
- Prefix Evaluation and Conversion | Solution 09:54
- Celebrity Problem | Question 03:19
- Celebrity Problem | Solution 11:53
- Merge Overlapping Intervals | Question 02:50
- Merge Overlapping Intervals | Solution 14:12
- Smallest number following Pattern | Questions 02:32
- Smallest number following Pattern | Solution 21:37
- OOP's - Classes and Objects 09:14
- OOP's | Swap Game 1 04:10
- OOP's | Swap Game 2 04:16
- OOP's | Swap Game 3 05:22
- OOP's | Constructors and This 11:05
- Build Normal Stack | Question 02:03
- Build Normal Stack | Solution 06:11
- Build Dynamic Stack | Question 01:28
- Build Dynamic Stack | Solution 02:54
- Minimum Stack - 1 | Question 01:05
- Minimum Stack - 1 | Solution 04:14
- Minimum Stack - 2 | Question 01:21
- Minimum Stack - 2 | Solution 24:01
- Queues | Introduction and Usage 07:11
- Build Normal Queue | Question 02:15
- Build Normal Queue | Solution 17:54
- Build Dynamic Queue | Question 01:03
- Build Dynamic Queue | Solution 02:36
- Linked Lists | Introduction 05:22
- Data Members of a Linked List 03:10
- Add Last in Linked List | Question 01:47
- Add Last in Linked List | Solution 04:36
- Display and Size of Linked List | Solution 02:50
- Remove First from Linked List | Question 00:32
- Remove First in Linked List | Solution 03:26
- Get Value in Linked List | Question 01:25
- Get Value in Linked List | Solution 03:03
- Add First in Linked List | Question 00:43
- Add First in Linked List | Solution 03:27
- Add at Index in Linked List | Question 01:37
- Add at Index in Linked List | Solution 05:07
- Remove Last in Linked List | Question 01:18
- Remove Last in Linked List | Solution 02:23
- Remove at Index in Linked List | Question 00:43
- Remove at Index in Linked List | Solution 03:30
- Reverse a Linked List - Data Iterative | Question 01:13
- Reverse a Linked List - Data Iterative | Solution 02:32
- Reverse a Linked List - Pointer Iterative | Question 01:42
- Reverse a Linked List - Pointer Iterative | Solution 02:32
- Linked List to Stack Adapter | Question 00:45
- Linked List to Stack Adapter | Solution 06:50
- Linked List to Queue Adapter | Question 00:52
- Linked List to Queue Adapter | Solution 03:16
- Kth element from the end in Linked List | Question 01:08
- Kth element from the end in Linked List | Solution 02:33
- Middle of Linked List | Question 00:53
- Middle of a Linked List | Solution 02:23
- Merge two sorted Linked List | Question 01:14
- Merge two sorted Linked List | Solution 03:48
- Merge Sort a Linked List | Question 04:45
- Merge Sort a Linked List | Solution 09:32
- Remove duplicates in a sorted Linked List | Question 00:33
- Remove duplicates from a sorted Linked List | Solution 06:22
- Odd Even List | Question 00:53
- Odd Even List | Solution 07:00
- K Reverse in Linked List | Question 00:53
- K Reverse in Linked List| Solution 06:39
- Display Reverse Linked List - Recursive | Question 00:56
- Display Reverse Linked List - Recursive | Solution 03:01
- Reverse Linked List using Pointer - Recursive | Question 01:49
- Reverse a Linked List using Pointers - Recursive | Solution 04:51
- Queue to Stack Adapter - Pop Efficient | Question 00:33
- Queue to Stack Adapter - Pop Efficient | Solution 05:28
- Queue to Stack Adapter - Push Efficient | Question 00:52
- Queue to Stack Adapter - Push Efficient | Solution 06:24
- Stack to Queue Adapter - Remove Efficient | Question 00:43
- Stack to Queue Adapter - Remove Efficient | Solution 04:17
- Stack to Queue Adapter - Add Efficient | Question 00:47
- Stack to Queue Adapter - Add Efficient | Solution 05:11
- Two Stacks in an Array - Question 01:57
- Two stack in an Array | Solution 05:55
- Reverse a Linked List - Data Recursive | Question 01:04
- Reverse a Linked List - Data Recursive | Solution 16:53
- Is a Linked List Palindrome | Question 01:00
- Is a Linked List Palindrome | Solution 13:29
- Fold a Linked List | Question 01:00
- Fold a Linked List | Solution 18:45
- Add two Linked Lists | Question 02:04
- Generic Tree - Introduction and Data Members 05:03
- Size of a Generic Tree | Question 00:38
- Add two Linked Lists | Solution 15:46
- Intersection point of Linked List | Question 00:58
- Intersection point of Linked List | Solution 03:02
- Generic Tree - Constructor 09:40
- Display a Generic Tree 17:21
- Size of a Generic Tree | Solution 07:28
- Maximum in a Generic Tree | Question 00:22
- Maximum in a Generic Tree | Solution 11:46
- Height of a Generic Tree | Question 01:43
- Height of a Generic Tree | Solution 09:15
- Traversal in Generic Tree | Question 02:18
- Traversals in a Generic Tree | Solution 13:33
- Level Order Traversal in a Generic Tree | Question 00:33
- Level order traversal in Generic Tree | Solution 04:11
- Level Order Linewise in Generic Tree | Question 00:57
- Level Order Linewise in Generic Tree | Solution 04:10
- Level Order Linewise - Zig Zag | Question 00:57
- Level Order line wise - Zig Zag | Solution 09:02
- Level Order Traversals - More Approaches 22:54
- Mirror a Generic Tree | Question 01:11
- Mirror a Generic Tree | Solution 07:05
- Remove Leaves from a Generic Trees | Question 00:45
- Removes leaves from a Generic Tree | Solution 11:02
- Linearize a Generic Tree | Question 01:40
- Linearize a Generic Tree | Solution 08:36
- Linearize a Generic Tree | Efficient Approach 07:54
- Find an element in a Generic Tree | Question 00:35
- Find an element in Generic Tree | Solution 06:20
- Node to Root Path | Question 00:47
- Node to Root Path | Solution 06:54
- Lowest Common Ancestor | Question 00:51
- Lowest Common Ancestor | Solution 04:10
- Distance between Nodes in Generic Tree | Question 00:45
- Distance between nodes | Solution 03:41
- Are Trees Similar in Shape | Question 00:43
- Are Trees Similar in Shape | Solution 07:53
- Are Trees Mirror in Shape | Question 02:00
- Are Trees Mirror in Shape | Solution 09:53
- Is Generic Tree Symmetric | Question 01:36
- Is Generic Tree Symmetric | Solution 08:23
- Generic Tree - Multisolver 13:50
- Predecessor and Successor of an element | Question 02:10
- Predecessor and Successor of an element | Solution 07:19
- Ceil and Floor | Question 02:01
- Ceil and Floor | Solution 04:11
- Kth Largest Element | Question 00:39
- Kth Largest Element | Solution 04:04
- Node with Maximum Subtree Sum | Question 02:27
- Node with Maximum Subtree Sum | Solution 10:07
- Diameter of Generic Tree | Question 01:21
- Diameter of a Generic Tree | Solution 18:06
- Iterative Pre-order and Post-order Traversal | Question 01:32
- Iterative Pre-order and Post-order | Solution 16:12
- Iterable and Iterator 39:12
- Introduction to Binary Trees | Data Structures and Algorithms 04:00
- Binary Tree - Constructor | Data Structure and Algorithms in Java 16:29
- Display a Binary Tree | Data Structures and Algorithms in JAVA 10:17
- Size, Sum, Max and Height of a Binary Tree | Question | Data Structures and Algorithms in JAVA 00:59
- Size, Sum, Max and Height in a Binary Tree | Solution | Data Structures and Algorithms in JAVA 20:55
- Traversals in a Binary Tree | Data Structures and Algorithms in JAVA 17:40
- Level Order Traversal in a Binary Tree | Question | Data Structure and Algorithms | Java and C++ 00:46
- Level Order Traversal in Binary Tree | Solution | Data Structure and Algorithms | Java and C++ 04:07
- Iterative Pre, Post and In-Order Traversal in Binary Tree | Data Structure and Algorithms | JAVA 02:08
- Iterative Pre, Post and In-order traversal in Binary Tree | Solution | Data Structures and Algorithm 09:56
- Node to Root Path | Question | Data Structures and Algorithms | JAVA and C++ 00:40
- Node to Root Path | Solution | Data Structures and Algorithms | JAVA and C++ 09:31
- Print K Levels Down | Question | Data Structure and Algorithms | Binary Tree in JAVA 00:42
- Print K Levels Down | Solution | Data Structure and Algorithms in JAVA | Binary Trees 01:57
- Print Nodes K Level Far | Question | Binary Tree in JAVA | Data Structure and Algorithms 03:00
- Print Nodes K Level Far | Solution | Binary Tree in JAVA | Data Structure and Algorithms 14:16
- Path to Leaf from Root | Question | Binary Tree in JAVA | Data Structures and Algorithms 00:55
- Path to Leaf from Root | Solution | Binary tree in JAVA | Data Structures and Algorithms 04:17
- Transform to Left Cloned Tree | Question | Binary Tree in JAVA | Data Structures and Algorithms 01:15
- Transform to Left Cloned Tree | Solution | Binary Tree in JAVA | Data Structures and Algorithms 14:04
- Transform Back from a Left Cloned Tree | Question | Binary Tree in JAVA Data Structure and Algorithm 00:57
- Transform Back from a Left Cloned Tree | Solution | Binary Tree | Data Structure and Algorithm 11:00
- Print Single Child Nodes | Question | Binary Trees | Data Structure and Algorithms in JAVA 01:01
- Print Single Child Nodes | Solution | Binary Trees | Data Structures and Algorithms in JAVA 02:46
- Remove Leaves | Question | Binary Tree | Data Structures and Algorithms in JAVA 00:37
- Remove Leaves | Solution | Binary Trees | Data Structure and Algorithms in JAVA 05:54
- Diameter of a Binary Tree | Question | Binary Trees in JAVA | Data Structure and Algorithms 01:25
- Diameter of a Binary Tree | Solution | Binary Tree | Data Structures and Algorithms in JAVA 35:09
- Introduction to 2-D Arrays | Data Structures and Algorithms in JAVA 10:30
- Matrix Multiplication - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 03:08
- Matrix Multiplication - Solution | 2-D Arrays | Data Structure and Algorithms in JAVA 10:32
- Wave Traversal - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 01:15
- Wave Traversal - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 05:05
- Spiral Traversal - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 02:03
- Exit Point of a Matrix - Question | 2-D Arrays | Data Structure and Algorithms in JAVA 01:57
- Exit Point of a Matrix - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 17:16
- Rotate by 90 degree - Question | 2-D Arrays | Data Structure and Algorithms in JAVA 01:05
- Rotate by 90 degree - Solution | 2-D Arrays | Data Structure and Algorithms in JAVA 11:00
- Shell Rotate - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 03:03
- Shell Rotate - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 29:57
- Diagonal Traversal - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 00:50
- Diagonal Traversal - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 05:54
- Saddle Point - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 00:34
- Saddle Point - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 08:46
- Search in sorted 2-D Array - Question | 2-D Arrays | Data Structures and Algorithms in JAVA 00:48
- Search in a sorted 2-D Array - Solution | 2-D Arrays | Data Structures and Algorithms in JAVA 04:42
- Reverse an Array - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:09
- Reverse an Array - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 02:41
- Rotate an Array - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 03:20
- Rotate an Array - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 09:24
- Inverse of an Array - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:06
- Inverse of an Array - Solution | Functions and Array | Data Structures and Algorithms in JAVA 02:47
- Subarrays of an Array - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:44
- Subarrays of an Array - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 03:57
- Subsets of an Array - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:35
- Subsets of an Array - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 10:32
- Binary Search Algorithm | Functions and Arrays | Data Structures and Algorithms in JAVA 09:43
- Ceil and Floor - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:00
- Ceil and Floor - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 06:49
- First and Last Index - Question | Functions and Arrays | Data Structures and Algorithms in JAVA 01:13
- First and Last Index - Solution | Functions and Arrays | Data Structures and Algorithms in JAVA 10:31
- Introduction to Recursion - How Recursion Works | Print Decreasing using Recursion 19:50
- Recursion Motion - Basics of Recursion | Print Increasing using Recursion 10:28
- Basics of Recursion | Print Decreasing Increasing Numbers using Recursion 01:14
- Recursion Basics | Print Decreasing Increasing Solution using Recursion 07:06
- Factorial - Question | Recursion | Data Structures and Algorithms in JAVA 00:34
- Recursion Basics | Factorial of a number using Recursion in JAVA 06:13
- Calculate Power (x,n) using Recursion - Solution | Recursion in JAVA 06:01
- Calculate Power using Recursion (Logarithmic) | Recursion in JAVA 13:54
- Print Zig-Zag | Recursion for Beginners | Algorithms in JAVA 30:00
- Tower of Hanoi - Question | Recursion | Data Structures and Algorithms in JAVA 03:53
- Tower of Hanoi solved using Recursion | Recursion Euler Tree in JAVA 26:21
- Display an Array - Question | Recursion | Data Structures and Algorithms in JAVA 00:40
- Display Array Elements using Recursion | Algorithms in JAVA | Recursion Playlist 06:36
- Display Array in Reverse - Question | Recursion | Data Structure and Algorithms in JAVA 00:24
- Display Array in Reverse using Recursion | Algorithms in JAVA | Recursion Playlist 05:58
- Maximum of an Array - Question | Recursion | Data Structures and Algorithms in JAVA 00:24
- Find Maximum of an Array using Recursion | Algorithms in JAVA 09:37
- First Index of occurrence - Question | Recursion | Data Structures and Algorithms in JAVA 00:51
- First Index of Occurrence in Array using Recursion | Algorithms in JAVA 15:21
- Last Index of Occurrence - Solution | Recursion | Data Structures and Algorithms in JAVA 14:34
- Last Index of Occurrence - Question | Recursion | Data Structures and Algorithms in JAVA 00:49
- All Indices in Array - Solution | Recursion | Data Structures and Algorithms in JAVA 15:34
- All Indices in Array - Question | Recursion | Data Structures and Algorithms in JAVA 00:43
- Get Subsequence - Introduction to Arraylists | Recursion | Data Structures and Algorithms in JAVA 31:10
- Get Keypad Combination - Question | Recursion | Data Structures and Algorithms in JAVA 03:03
- Get Keypad Combination - Solution | Recursion | Data Structures and Algorithms in JAVA 24:07
- Get Stairs Path - Solution | Recursion | Data Structures and Algorithms in JAVA 28:47
- Get Stairs Path - Question | Recursion | Data Structures and Algorithms in JAVA 01:12
- Get Maze Paths - Question | Recursion | Data Structures and Algorithms in JAVA 02:52
- Get Maze Paths - Solution | Recursion | Data Structures and Algorithms in JAVA 17:31
- Get Maze Paths with Jump - Question | Recursion | Data Structure and Algorithms in JAVA 01:56
- Get Maze Paths with Jump - Solution | Recursion | Data Structures and Algorithms in JAVA 13:29
- Print Subsequence | Recursion | Data Structures and Algorithms in JAVA 17:32
- Print Keypad Combination - Solution | Recursion | Data Structures and Algorithms in JAVA 13:27
- Print Stair Paths - Question | Recursion | Data Structures and Algorithms in JAVA 01:17
- Print Stair Paths - Solution | Recursion | Data Structure and Algorithms in JAVA 09:49
- Print Maze Paths - Question | Recursion | Data Structure and Algorithms in JAVA 01:09
- Print Maze Paths - Solution | Recursion | Data Structure and Algorithms in JAVA 10:52
- Print Maze Path with Jumps - Question | Recursion | Data Structure and Algorithms in JAVA 02:34
- Print Maze Paths with Jumps - Solution | Recursion | Data Structures and Algorithms in JAVA 07:53
- Print Permutations - Question | Recursion | Data Structure and Algorithms in JAVA 02:35
- Print Permutations - Solution | Recursion | Data Structures and Algorithms in JAVA 07:17
- Print Encodings - Question | Recursion | Data Structures and Algorithms in JAVA 04:39
- Print Encodings - Solution | Recursion | Data Structure and Algorithms in JAVA 12:30
- Flood Fill - Question | Recursion | Data Structure and Algorithms in JAVA 03:34
- Flood Fill - Solution | Recursion | Data Structures and Algorithms in JAVA 41:24
- Target Sum Subsets - Question | Recursion | Data Structure and Algorithms in JAVA 00:59
- Target Sum Subsets - Solution | Recursion | Data Structures and Algorithms in JAVA 07:37
- N Queens - Question | Recursion | Data Structures and Algorithms in JAVA 02:42
- N Queens - Solution | Recursion | Data Structures and Algorithms in JAVA 30:08
- Knights Tour - Question | Recursion | Data Structures and Algorithms in JAVA 04:01
- Knights Tour - Solution | Recursion | Data Structures and Algorithms in JAVA 13:46
- Introduction to Dynamic Programming (DP) | Memoization in Dynamic Programming Algorithm 25:31
- Climbing Stairs - Dynamic Programming using Tabulation | Recursive Staircase Problem 19:19
- Climbing Stairs with Jumps using Dynamic Programming | Recursive Staircase Problem 11:51
- Climb Stairs with Minimum Moves - Question | Dynamic Programming | Data Structure and Algorithms 01:42
- Climbing Stairs with Minimum Moves | Dynamic Programming Problem Explained 19:08
- Tilt of Binary Tree - Question | Binary Trees | Data Structure and Algorithms in JAVA 02:01
- Tilt of a Binary Tree - Solution | Binary Trees | Data Structure and Algorithms in JAVA 08:13
- Is a tree Binary Search Tree - Question | Binary Trees | Data Structure and Algorithms in JAVA 01:46
- Is a tree Binary Search Tree - Solution | Binary Trees | Data Structure and Algorithms in JAVA 29:29
- Balanced Binary Tree - Question | Binary Trees | Data Structure and Algorithms in JAVA 02:57
- Balanced Binary Tree - Solution | Binary Trees | Data Structure and Algorithms in JAVA 10:11
- Largest BST Subtree - Question | Binary Trees | Data Structure and Algorithms in JAVA 02:57
- Largest BST Subtree - Solution | Binary Trees | Data Structure and Algorithms in JAVA 28:09
- Minimum Cost Path - Question | Dynamic Programming Leetcode #64 02:26
- Minimum Cost Path Dynamic Programming Explained with Code | Leetcode #64 16:55
- Path with Maximum Gold - Dynamic Programming | Goldmine Problem Explained 14:26
- Goldmine - Question | Dynamic Programming | Data Structure and Algorithms in JAVA 01:29
- Introduction to Binary Search Tree | Data Structure and Algorithms in JAVA 03:39
- Constructor of BST | Binary Search Tree | Data Structure and Algorithms in JAVA 07:12
- Size, Sum, Max & Min in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 00:28
- How to Add Node in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 00:28
- How to Add Node in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 03:29
- How to Remove Node in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 09:17
- Replace Sum of Larger in BST - Question | Binary Search Tree| Data Structure and Algorithms in JAVA 01:13
- Replace Sum of Larger in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 03:42
- How to find LCA in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 01:02
- How to find LCA in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 03:48
- How to print in range in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 00:40
- How to Print in range in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 04:41
- Target Sum Pair in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 01:02
- Target Sum Pair in BST - Solution |Binary Search Tree | Data Structure and Algorithms in JAVA 04:06
- Target Sum Pair in BST - More Approaches | Binary Search Tree | Data Structure and Algorithms 25:02
- How to Remove Node in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 01:51
- Introduction To Hashmap | Hashmap and Heaps | Data Structure and Algorithms in JAVA 08:45
- Highest Frequency Character - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 00:34
- Highest Frequency Character - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 04:36
- Get Common Element 1 - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 00:59
- Get Common Element 2 - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 00:52
- Get Common Element 2 - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 03:29
- Longest Consecutive Sequence - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 14:24
- Size, Sum, Max and Min in BST -Solution | Binary Search Tree | Data Structure and Algorithms in JAVA 05:46
- Introduction to Heaps | Hashmap and Heap | Data Structure and Algorithms in JAVA 04:53
- How to find K Largest Elements in an Array - Question | Hashmap and Heap | DS and Algorithms in JAVA 00:43
- How to find K Largest Elements in an Array - Solution | Hashmap and Heap | DS and Algorithms in JAVA 03:28
- How to Sort a nearly Sorted Array - Question | Hashmap and Heap | D S and Algorithms in JAVA 02:04
- How to Sort a nearly Sorted Array - Solution | Hashmap and Heap | D S and Algorithms in JAVA 06:55
- Median Priority Queue - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 02:19
- Median Priority Queue - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 17:13
- Merge K sorted Lists - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 00:45
- Merge K sorted Lists - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 20:41
- Write Priority Queue using Heap- Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 05:50
- Write Priority Queue using Heap- Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 31:49
- Target Sum Subsets - Question | Dynamic Programming | Data Structure and Algorithms in JAVA 02:50
- Target Sum Subsets Dynamic Programming | Subset Sum Problem 29:20
- Coin Change Combination - Question | Dynamic Programming | Data Structure and Algorithms in JAVA 01:15
- Coin Change Combination Problem Dynamic Programming Explained | Coin Change Minimum Number of Coins 21:52
- Coin Change Permutations Problem Dynamic Programming | Total Number of Ways to Get Amount 24:14
- Coin Change Problems Analysis | Leetcode 322 v/s 518 Explained | Dynamic Programming In-Depth 29:38
- 0-1 Knapsack Problem Dynamic Programming Solved with Code | Dynamic Programming Interview Questions 29:07
- Unbounded Knapsack using Dynamic Programming Explained with Code 27:52
- Count Binary Strings | Binary Strings with no consecutive 0's | Dynamic Programming 17:23
- Arrange Buildings Dynamic Programming | Dynamic Programming Tutorials with Code 10:49
- Decode Ways Dynamic Programming | Total Ways to Decode a String | Count Encodings 31:45
- Count Subsequences of form A^i B^j C^k | Count A+ B+ C+ Subsequences Dynamic Programming 15:15
- How to implement Hashmap in Java | Hashmap and Heap | Data Structure and Algorithms in JAVA 44:00
- Constructor for Linear Time Complexity of Heap | Hashmap and Heap | D S and Algorithms in JAVA 16:27
- Generic Heap - Comparable vs Comparator | Hashmap and Heap | Data Structure and Algorithms in JAVA 32:07
- Bubble Sort | Time and Space | Data Structure and Algorithms in JAVA 10:30
- Selection Sort | Time and Space | Data Structure and Algorithms in JAVA 15:41
- Insertion Sort | Time and Space | Data Structure and Algorithms in JAVA 13:19
- Maximum Sum Non Adjacent Elements Dynamic Programming | Greedy Approach 29:25
- Paint House (Leetcode) Dynamic Programming | Explained with Code 13:06
- Paint House - 2 (Many Colors) Dynamic Programming | Explained with Code 31:19
- Get Common Element 1 - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA 04:20
- Longest Consecutive Sequence - Question | Hashmap and Heap | Data Structure and Algorithms in JAVA 01:06
- Merge Two Sorted Arrays | Time and Space | Data Structure and Algorithms in JAVA 05:47
- Merge sort | Time and Space | Data Structure and Algorithms in JAVA 06:14
- Partioning an Array | Time and Space | Data Structure and Algorithms in JAVA 22:42
- Quick Sort | Time and Space | Data Structure and Algorithms in JAVA 11:52
- Quick Select | Time and Space | Data Structure and Algorithms in JAVA 08:18
- Count Sort | Time and Space | Data Structure and Algorithms in JAVA 36:42
- Sort 01 | Time and Space | Data Structure and Algorithms in JAVA 07:42
- Sort 012 | Time and Space | Data Structure and Algorithms in JAVA 19:37
- Paint Fence (Leetcode) Dynamic Programming | Explanation with Code 17:30
- Target Sum Pair | Time and Space | Data Structure and Algorithms in JAVA 09:00
- Pivot of Sorted Rotated Array | Time and Space | Data Structure and Algorithms in JAVA 11:59
- Radix Sort | Time and Space | Data Structure and Algorithms in JAVA 12:57
- Tiling with Dominoes Dynamic Programming | Explanation and Code 15:09
- Tiling with M x 1 Tiles Dynamic Programming | Explanation with Code 10:14
- Friends Pairing Problem Dynamic Programming | Explanation with Code 23:14
- Partition into Subsets Dynamic Programming | Explanation and Code 28:38
- Best Time to Buy and Sell Stocks - One Transaction Allowed - Dynamic Programming 14:35
- Best Time to Buy and Sell Stocks - 2 (Infinite Transactions) Dynamic Programming 14:46
- Best Time to Buy and Sell Stocks with Transaction Fee and Infinite Transactions Dynamic Programming 30:59
- Best Time to Buy and Sell Stocks with Cool down - Infinite Transactions Dynamic Programming 24:57
- Best Time to Buy and Sell Stocks - Two Transaction Allowed (Hard) | Dynamic Programming 45:04
- Best Time to Buy and Sell Stocks - K Transaction Allowed Dynamic Programming 48:44
- Introduction to Graphs in Data Structures | Representation of Graphs in JAVA 08:18
- How to Find Path in Graphs using Depth First Search | Graphs in Data Structures 27:38
- How to Find All Paths in Graph using Depth First Search? | Data Structures 43:49
- Easily Solve Graph Problems with DFS!! | Data Structure and Algorithms 24:25
- Get Connected Components of Graphs in JAVA | Data Structure and Algorithms 14:53
- Is Graph Connected | Graphs | Data Structure and Algorithms 03:03
- Count Number of Islands using Graphs | Data Structure and Algorithms 16:49
- Hamiltonian Path & Cycles in Graphs and Graph Theory 24:23
- Introduction to Breadth First Traversal (BFS) in Graphs | Algorithms in JAVA 11:11
- Is a Graph Cyclic? | Graph Data Structure | Cycles in Graphs in JAVA 15:13
- Is a Graph Bipartite? | Bipartite Graph Algorithm in JAVA | Graph Algorithms 41:36
- Spread Infection | Graphs | Data Structure and Algorithms 10:22
- Dijkstra Algorithm in Graphs | Single Source Shortest Path in Weights | Graphs Algorithms in JAVA 13:52
- Prim's Algorithm - Graphs | Minimum Spanning Tree(MST) in Graphs | Code and Implementation 17:23
- Iterative Depth First Traversal | Iterative DFS in Graphs | DFS Code 16:13
- Perfect Friends Problem using Graphs | Data Structures in JAVA 20:14
- Topological Sort Algorithm with DFS | Course Schedule in JAVA | Code and Implementation 38:49
- Sort Dates | Time and Space | Data Structure and Algorithms in JAVA 19:19
- How to Add Node in BST - Question | Binary Search Tree | Data Structure and Algorithms in JAVA 00:35
- Reverse a Linked List - Pointer Iterative | Solution 08:23
- Introduction to Strings, StringBuilders and Arraylists in JAVA 19:11
- Print all Palindromic Substrings | Strings and StringBuilders in JAVA 06:18
- String Interning and Immutability | Strings and StringBuilders in JAVA 20:56
- String Builder - Usage and Performance | Strings and Arraylists 12:10
- String Compression Leetcode(Medium) in JAVA | Explanation and Code 07:29
- Remove prime numbers from Arraylist | Strings and Arraylists 05:59
- Toggle Case of Characters in a String | Explanation and JAVA Code 04:51
- String with ASCII difference of characters | Explanation and Code in JAVA 04:00
- Permutations of a String - Iterative Solution | String and Stringbuilders in JAVA 09:36
- Introduction to Arraylists in JAVA - Usage and Implementation | Arraylists Tutorial 06:12
- Arraylists, Stacks and Queues in JAVA | Java Tutorials for C++ Coders 14:12
Take this course with you
Download the app to continue lessons from your phone anytime.
