Канал: take U forward

Launching the best DSA Course + Platform

Launching the best DSA Course + Platform

L18. Implement LRU Cache

L18. Implement LRU Cache

L17. The Celebrity Problem | Stack and Queue Playlist

L17. The Celebrity Problem | Stack and Queue Playlist

L16. Sliding Window Maximum | Stack and Queue Playlist

L16. Sliding Window Maximum | Stack and Queue Playlist

L15. Stock Span Problem | Stack and Queue Playlist

L15. Stock Span Problem | Stack and Queue Playlist

L14. Remove K Digits | Stack and Queue Playlist

L14. Remove K Digits | Stack and Queue Playlist

L13. Maximal Rectangle | Stack and Queue Playlist

L13. Maximal Rectangle | Stack and Queue Playlist

L12. Largest Rectangle in Histogram | Stack and Queue Playlist

L12. Largest Rectangle in Histogram | Stack and Queue Playlist

L11. Aestroid Collisions | Stack and Queue Playlist

L11. Aestroid Collisions | Stack and Queue Playlist

L10. Sum of subarray ranges | Stack and Queue Playlist

L10. Sum of subarray ranges | Stack and Queue Playlist

L9. Sum of Subarray Minimum | Stack and Queue Playlist

L9. Sum of Subarray Minimum | Stack and Queue Playlist

L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist

L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist

L7. Previous Smaller Element | Stack and Queue Playlist

L7. Previous Smaller Element | Stack and Queue Playlist

L6. Next Greater Element - II | Stack and Queue Playlist

L6. Next Greater Element - II | Stack and Queue Playlist

L5. Next Greater Element | Stack and Queue Playlist

L5. Next Greater Element | Stack and Queue Playlist

L4. Implement Min Stack | Stack and Queue Playlist

L4. Implement Min Stack | Stack and Queue Playlist

L2. Check for Balanced Parentheses | Stack and Queue

L2. Check for Balanced Parentheses | Stack and Queue

L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist

L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist

L1. Introduction to Stack and Queue | Implementation using Data Structures

L1. Introduction to Stack and Queue | Implementation using Data Structures

L13. Fractional Knapsack Algorithm

L13. Fractional Knapsack Algorithm

L12. Candy | Slope Approach Intuition Based

L12. Candy | Slope Approach Intuition Based

L11. Valid Parenthesis String | Multiple Approaches

L11. Valid Parenthesis String | Multiple Approaches

L10. Minimum number of platforms required in a railway station

L10. Minimum number of platforms required in a railway station

L9. Insert Intervals | Greedy Algorithms Playlist

L9. Insert Intervals | Greedy Algorithms Playlist

L8. Non Overlapping Intervals | Greedy Algorithms Playlist

L8. Non Overlapping Intervals | Greedy Algorithms Playlist

L7. N Meeting in One Room | Greedy Algorithms Playlist

L7. N Meeting in One Room | Greedy Algorithms Playlist

L6. Job Sequencing Problem | Greedy Algorithm Playlist

L6. Job Sequencing Problem | Greedy Algorithm Playlist

L5. Jump Game - II | Greedy Algorithm Playlist

L5. Jump Game - II | Greedy Algorithm Playlist

L4. Jump Game - I | Greedy Algorithm Playlist

L4. Jump Game - I | Greedy Algorithm Playlist

L3. Shortest Job First (or SJF) CPU Scheduling

L3. Shortest Job First (or SJF) CPU Scheduling

L2. Lemonade Change | Greedy Algorithm Playlist

L2. Lemonade Change | Greedy Algorithm Playlist

L1. Assign Cookies | Greedy Algorithm Playlist

L1. Assign Cookies | Greedy Algorithm Playlist

L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist

L12. Minimum Window Substring | 2 Pointers and Sliding Window Playlist

L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist

L11. Subarray with k different integers | 2 Pointers and Sliding Window Playlist

L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist

L10. Count number of Nice subarrays | 2 Pointers and Sliding Window Playlist

L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist

L9. Binary Subarrays With Sum | 2 Pointers and Sliding Window Playlist

L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist

L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist

L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist

L7. Number of Substrings Containing All Three Characters | 2 Pointers and Sliding Window Playlist

L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist

L6. Longest Substring With At Most K Distinct Characters | 2 Pointers and Sliding Window Playlist

L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist

L5. Fruit Into Baskets | 2 Pointers and Sliding Window Playlist

L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist

L4. Max Consecutive Ones III | 2 Pointers and Sliding Window Playlist

L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist

L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist

L2. Maximum Points You Can Obtain from Cards | 2 Pointers and Sliding Window Playlist

L2. Maximum Points You Can Obtain from Cards | 2 Pointers and Sliding Window Playlist

L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns

L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns

L8. Smallest Prime Factor (SPF) | Prime Factorisation | Query Based Problem | Maths Playlist

L8. Smallest Prime Factor (SPF) | Prime Factorisation | Query Based Problem | Maths Playlist

L7. Count Prime in a range L-R | Maths Playlist

L7. Count Prime in a range L-R | Maths Playlist

L6. Sieve of Eratosthenes | Maths Playlist

L6. Sieve of Eratosthenes | Maths Playlist

L5. Power Exponentiation | Maths Playlist

L5. Power Exponentiation | Maths Playlist

L4. Print all prime factors of a Number | Maths Playlist

L4. Print all prime factors of a Number | Maths Playlist

L3. Check if a Number if Prime or not | Maths Playlist

L3. Check if a Number if Prime or not | Maths Playlist

L2. Print all Divisors of a Number | Maths Playlist

L2. Print all Divisors of a Number | Maths Playlist

L9. Divide Two Integers without using Multiplication and Division Operators | Bit Manipulation

L9. Divide Two Integers without using Multiplication and Division Operators | Bit Manipulation

L8. XOR of Numbers in a Given Range | Bit Manipulation

L8. XOR of Numbers in a Given Range | Bit Manipulation

L7. Single Number III | Bit Manipulation

L7. Single Number III | Bit Manipulation

L6. Single Number II | Bit Manipulation

L6. Single Number II | Bit Manipulation

L5. Single Number-I | Bit Manipulation

L5. Single Number-I | Bit Manipulation

L4. Power Set | Bit Manipulation

L4. Power Set | Bit Manipulation

L3. Minimum Bit Flips to Convert Number | Bit Manipulation

L3. Minimum Bit Flips to Convert Number | Bit Manipulation

L2. Must Know Tricks in Bit Manipulation | Swap two numbers without third variable

L2. Must Know Tricks in Bit Manipulation | Swap two numbers without third variable

L1. Introduction to Bit Manipulation | 1's 2's Compliment | Bit Operators

L1. Introduction to Bit Manipulation | 1's 2's Compliment | Bit Operators

Don't watch my A2Z DSA Course

Don't watch my A2Z DSA Course

L28. Design a Browser History | LinkedList Implementation

L28. Design a Browser History | LinkedList Implementation

L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers

L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers

L26. Sort a Linked List | Merge Sort and Brute Force

L26. Sort a Linked List | Merge Sort and Brute Force

L24. Flattening a LinkedList | Multiple Approaches with Dry Run

L24. Flattening a LinkedList | Multiple Approaches with Dry Run

L25. Merge K Sorted Lists | Multiple Approaches

L25. Merge K Sorted Lists | Multiple Approaches

L23. Merge two sorted Linked Lists

L23. Merge two sorted Linked Lists

L22. Rotate a LinkedList

L22. Rotate a LinkedList

L21. Reverse Nodes in K Group Size of LinkedList

L21. Reverse Nodes in K Group Size of LinkedList

L20. Remove duplicates from sorted DLL

L20. Remove duplicates from sorted DLL

L19. Find all Pairs with given Sum in DLL

L19. Find all Pairs with given Sum in DLL

L18. Delete all occurrences of a Key in DLL

L18. Delete all occurrences of a Key in DLL

L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches

L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches

L16. Delete the middle node of the LinkedList

L16. Delete the middle node of the LinkedList

L15. Find the length of the Loop in LinkedList

L15. Find the length of the Loop in LinkedList

L14. Detect a loop or cycle in LinkedList | With proof and Intuition

L14. Detect a loop or cycle in LinkedList | With proof and Intuition

L13. Find the middle element of the LinkedList | Multiple Approaches

L13. Find the middle element of the LinkedList | Multiple Approaches

L12. Find the intersection point of Y LinkedList

L12. Find the intersection point of Y LinkedList

L11. Add 1 to a number represented by LinkedList

L11. Add 1 to a number represented by LinkedList

L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches

L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches

L9. Reverse a LinkedList | Iterative and Recursive

L9. Reverse a LinkedList | Iterative and Recursive

L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches

L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches

L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches

L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches

L6. Odd Even Linked List | Multiple Approaches

L6. Odd Even Linked List | Multiple Approaches

L5. Add 2 numbers in LinkedList | Dummy Node Approach

L5. Add 2 numbers in LinkedList | Dummy Node Approach

L4. Reverse a DLL | Multiple Approaches

L4. Reverse a DLL | Multiple Approaches

L3. Introduction to Doubly LinkedList | Insertions and Deletions

L3. Introduction to Doubly LinkedList | Insertions and Deletions

L2. Deletion and Insertion in LL | 8 Problems

L2. Deletion and Insertion in LL | 8 Problems

L1. Introduction to LinkedList | Traversal | Length | Search an Element

L1. Introduction to LinkedList | Traversal | Length | Search an Element

Paid LinkedList Bootcamp - Launch Video

Paid LinkedList Bootcamp - Launch Video

System Design Roadmap. Special thanks to @gkcs for helping with this one ♥️

System Design Roadmap. Special thanks to @gkcs for helping with this one ♥️

What caused facebook to go down?

What caused facebook to go down?

How to setup VS code for DSA and CP | Input / Output split format

How to setup VS code for DSA and CP | Input / Output split format

TODO: Add this chrome extension for your internship and placement season

TODO: Add this chrome extension for your internship and placement season

BS-27. Median in a Row Wise Sorted Matrix

BS-27. Median in a Row Wise Sorted Matrix

BS-26. Find Peak Element-II | Binary Search

BS-26. Find Peak Element-II | Binary Search

Crack high paying MAANG jobs with Newton Edge

Crack high paying MAANG jobs with Newton Edge

BS-25. Search in a 2D Matrix - II | Binary Search on 2D

BS-25. Search in a 2D Matrix - II | Binary Search on 2D

BS-24. Search in a 2D Matrix - I | Binary Search of 2D

BS-24. Search in a 2D Matrix - I | Binary Search of 2D

BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays

BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays

Bs-22. K-th element of two sorted arrays | Binary Search Approach

Bs-22. K-th element of two sorted arrays | Binary Search Approach

BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach

BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach

BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition

BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition

BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search

BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search

BS 19. Painter's Partition and Split Array - Largest Sum

BS 19. Painter's Partition and Split Array - Largest Sum

Update on A2Z DSA course!

Update on A2Z DSA course!

BS-18. Allocate Books or Book Allocation | Hard Binary Search

BS-18. Allocate Books or Book Allocation | Hard Binary Search

BS-17. Aggressive Cows | Binary Search Hard

BS-17. Aggressive Cows | Binary Search Hard

BS-16. Kth Missing Positive Number | Maths + Binary Search

BS-16. Kth Missing Positive Number | Maths + Binary Search

BS-15. Capacity to Ship Packages within D Days

BS-15. Capacity to Ship Packages within D Days

BS-14. Find the Smallest Divisor Given a Threshold | Binary Search

BS-14. Find the Smallest Divisor Given a Threshold | Binary Search

BS-13. Minimum days to make M bouquets | Binary Search

BS-13. Minimum days to make M bouquets | Binary Search

BS-12. Koko Eating Bananas

BS-12. Koko Eating Bananas

BS-11. Find the Nth root of an Integer

BS-11. Find the Nth root of an Integer

BS-10. Finding Sqrt of a number using Binary Search

BS-10. Finding Sqrt of a number using Binary Search

BS-9. Find Peak Element

BS-9. Find Peak Element

Striver's SDE SHEET CHALLENGE 2023 | 2.25L Worth Prizes | Sheet for Interviews

Striver's SDE SHEET CHALLENGE 2023 | 2.25L Worth Prizes | Sheet for Interviews

BS-8. Single Element in Sorted Array

BS-8. Single Element in Sorted Array

BS-7. Find out how many times array has been rotated

BS-7. Find out how many times array has been rotated

BS-6. Minimum in Rotated Sorted Array

BS-6. Minimum in Rotated Sorted Array

BS-5. Search Element in Rotated Sorted Array II

BS-5. Search Element in Rotated Sorted Array II

BS-4. Search Element in Rotated Sorted Array - I

BS-4. Search Element in Rotated Sorted Array - I

BS-3. First and Last Occurrences in Array | Count occurrences in Array

BS-3. First and Last Occurrences in Array | Count occurrences in Array

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases

BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases

Launching Binary Search Bootcamp - C++, Java, Python, Notes, Contest, Doubt Support 🔥

Launching Binary Search Bootcamp - C++, Java, Python, Notes, Contest, Doubt Support 🔥

Maximum Product Subarray - Best Intuitive Approach Discussed

Maximum Product Subarray - Best Intuitive Approach Discussed

Reverse Pairs | Hard Interview Question

Reverse Pairs | Hard Interview Question

Count Inversions in an Array | Brute and Optimal

Count Inversions in an Array | Brute and Optimal

✅ way to showcase projects in an Tech Interview 💪

✅ way to showcase projects in an Tech Interview 💪

❌ do this in a DSA interview without asking!

❌ do this in a DSA interview without asking!

Find the Missing and Repeating Number | 4 Approaches 🔥

Find the Missing and Repeating Number | 4 Approaches 🔥

Hear it out this till the END !!

Hear it out this till the END !!

Merge Sorted Arrays Without Extra Space | 2 Optimal Solution

Merge Sorted Arrays Without Extra Space | 2 Optimal Solution

Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis

Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis

Number of Subarrays with xor K | Brute - Better - Optimal

Number of Subarrays with xor K | Brute - Better - Optimal

Dark mode extension for all websites.

Dark mode extension for all websites.

4 Sum | Brute - Better - Optimal with Codes

4 Sum | Brute - Better - Optimal with Codes

Github trick every Software Engineer should know about!

Github trick every Software Engineer should know about!

3 Sum | Brute - Better - Optimal with Codes

3 Sum | Brute - Better - Optimal with Codes

This Leetcode's feature is a scam ❌

This Leetcode's feature is a scam ❌

Majority Element II | Brute-Better-Optimal

Majority Element II | Brute-Better-Optimal

1 Crore Salary != Good Software Engineer

1 Crore Salary != Good Software Engineer

ChatGPT trick for converting codes in your language for Interview Preparation

ChatGPT trick for converting codes in your language for Interview Preparation

Pascal Triangle | Finding nCr in minimal time

Pascal Triangle | Finding nCr in minimal time

Leetcode Extension to see Company Tags | Interview Preparation

Leetcode Extension to see Company Tags | Interview Preparation

Count Subarray sum Equals K | Brute - Better -Optimal

Count Subarray sum Equals K | Brute - Better -Optimal

Spiral Traversal of a Matrix | Spiral Matrix

Spiral Traversal of a Matrix | Spiral Matrix

Rotate Matrix/Image by 90 Degrees | Brute - Optimal

Rotate Matrix/Image by 90 Degrees | Brute - Optimal

Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal

Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal

Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal

Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal

Codestudio Weekend Contest 66 Editorial | Live Problem Solving | Striver

Codestudio Weekend Contest 66 Editorial | Live Problem Solving | Striver

Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course

Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course

Next Permutation - Intuition in Detail 🔥 | Brute to Optimal

Next Permutation - Intuition in Detail 🔥 | Brute to Optimal

Rearrange Array Elements by Sign | 2 Varieties of same Problem

Rearrange Array Elements by Sign | 2 Varieties of same Problem

Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing

Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing

Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal

Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal

Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal

Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal

2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal

2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal

Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays

Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays

Codestudio Weekend Contest 64 Editorial | Live Problem Solving | Striver

Codestudio Weekend Contest 64 Editorial | Live Problem Solving | Striver

Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3

Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3

Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2

Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2

Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video

Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video

Quick Sort For Beginners | Strivers A2Z DSA Course

Quick Sort For Beginners | Strivers A2Z DSA Course

Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course

Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course

Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course

Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course

Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course

Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course

Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course

Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course

Time and Space Complexity - Strivers A2Z DSA Course

Time and Space Complexity - Strivers A2Z DSA Course

C++ Basics in One Shot - Strivers A2Z DSA Course - L1

C++ Basics in One Shot - Strivers A2Z DSA Course - L1

G-56. Articulation Point in Graph

G-56. Articulation Point in Graph

G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time

G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time

G-54. Strongly Connected Components - Kosaraju's Algorithm

G-54. Strongly Connected Components - Kosaraju's Algorithm

G-53. Most Stones Removed with Same Row or Column - DSU

G-53. Most Stones Removed with Same Row or Column - DSU

G-52. Making a Large Island - DSU

G-52. Making a Large Island - DSU

G-51. Number of Islands - II - Online Queries - DSU

G-51. Number of Islands - II - Online Queries - DSU

G-50. Accounts Merge - DSU

G-50. Accounts Merge - DSU

G-49. Number of Operations to Make Network Connected - DSU

G-49. Number of Operations to Make Network Connected - DSU

G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java

G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java

G-48. Number of Provinces - Disjoint Set

G-48. Number of Provinces - Disjoint Set

G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance

G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance

G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java

G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java

G-44. Minimum Spanning Tree - Theory

G-44. Minimum Spanning Tree - Theory

G-42. Floyd Warshall Algorithm

G-42. Floyd Warshall Algorithm

G-41. Bellman Ford Algorithm

G-41. Bellman Ford Algorithm

G-40. Number of Ways to Arrive at Destination

G-40. Number of Ways to Arrive at Destination

G-39. Minimum Multiplications to Reach End

G-39. Minimum Multiplications to Reach End

G-38. Cheapest Flights Within K Stops

G-38. Cheapest Flights Within K Stops

G-37. Path With Minimum Effort

G-37. Path With Minimum Effort

G-36. Shortest Distance in a Binary Maze

G-36. Shortest Distance in a Binary Maze

G-35. Print Shortest Path - Dijkstra's Algorithm

G-35. Print Shortest Path - Dijkstra's Algorithm

G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3

G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3

G-33. Dijkstra's Algorithm - Using Set - Part 2

G-33. Dijkstra's Algorithm - Using Set - Part 2

G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1

G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1

G-31. Word Ladder - 2 | Optimised Approach for Leetcode

G-31. Word Ladder - 2 | Optimised Approach for Leetcode

G-30. Word Ladder - 2 | Shortest Paths

G-30. Word Ladder - 2 | Shortest Paths

G-29. Word Ladder - I | Shortest Paths

G-29. Word Ladder - I | Shortest Paths