ProgramGuru.org

ProgramGuru.org

DSA to Dream Job
Crack Interviews

Visualize Algorithms. Understand Better.
{"array": [10, 20, 30, 40, 50],"showIndices": true,"highlightIndices": [4]}
{ "array": [10, 20, 30, 40, 50], "highlightIndices": [] }

Data Structures

ArraysArrays (4)▼

  1. 1Arrays Introduction
  2. 2Array Operations
  3. 3Time Complexity of Array Operations
  4. 4Space Complexity of Array Operations

StacksStacks (4)▼

  1. 1Stacks Introduction
  2. 2Stack Operations
  3. 3Time Complexity of Stack Operations
  4. 4Space Complexity of Stack Operations

QueuesQueues (4)▼

  1. 1Queues Introduction
  2. 2Queue Operations
  3. 3Time Complexity of Queue Operations
  4. 4Space Complexity of Queue Operations

Linked ListsLinked Lists (2)▼

  1. 1Singly Linked List Introduction
  2. 2Doubly Linked List Introduction

TreesTrees (3)▼

  1. 1Binary Tree Introduction
  2. 2Binary Search Tree (BST) Introduction
  3. 3Time Complexity of Binary Tree Operations

Algorithm Visualizations

Overview of TechniquesOverview of Techniques (14)▼

  1. 1Overview of DSA Problem Solving Techniques
  2. 2Brute Force Technique in DSA
  3. 3Greedy Algorithm Technique in DSA
  4. 4Divide and Conquer Technique in DSA
  5. 5Dynamic Programming Technique in DSA
  6. 6Backtracking Technique in DSA
  7. 7Recursion Technique in DSA
  8. 8Sliding Window Technique in DSA
  9. 9Two Pointers Technique
  10. 10Binary Search Technique
  11. 11Tree / Graph Traversal Technique in DSA
  12. 12Bit Manipulation Technique in DSA
  13. 13Hashing Technique
  14. 14Heaps Technique in DSA

SortingSorting (10)▼

  1. 1Bubble Sort
  2. 2Selection Sort
  3. 3Insertion Sort
  4. 4Merge Sort
  5. 5Quick Sort
  6. 6Heap Sort
  7. 7Radix Sort
  8. 8Counting Sort
  9. 9Bucket Sort
  10. 10Shell Sort

Two PointersTwo Pointers (1)▼

  1. 1Reverse Array using Two Pointers

ArraysArrays (25)▼

  1. 1Find Maximum and Minimum in Array using Loop
  2. 2Find Second Largest in Array - Optimal Approach
  3. 3Find Second Smallest in Array - Optimal Approach
  4. 4Check if Array is Sorted - Optimal Solution
  5. 5Remove Duplicates from Sorted Array - Optimal Solution
  6. 6Left Rotate an Array by One Place - Optimal Solution
  7. 7Left Rotate an Array by K Places - Optimal Solution
  8. 8Move Zeroes in Array to End - Optimal Approach
  9. 9Linear Search in Array - Optimal Approach
  10. 10Union of Two Arrays - Optimal Approach
  11. 11Find Missing Number in Array - Optimal Solution
  12. 12Max Consecutive Ones in Array - Optimal Approach
  13. 13Find Kth Smallest Element using Quickselect
  14. 14Longest Subarray with Given Sum (Positives) - Optimal Approach
  15. 15Longest Subarray with Given Sum (Positives and Negatives) - Optimal Approach
  16. 16Find Majority Element in Array - Optimal Approach
  17. 17Maximum Subarray Sum using Kadane's Algorithm - Optimal Approach
  18. 18Print Subarray with Maximum Sum - Extension of Kadane's Algorithm
  19. 19Stock Buy and Sell - Optimal Approach
  20. 20Rearrange Array in Alternating Positive and Negative Items - Optimal Approach
  21. 21Next Permutation of Array - Optimal Approach
  22. 22Leaders in an Array - Optimal Approach
  23. 23Longest Consecutive Sequence in Array - Optimal Approach
  24. 24Count Subarrays with Given Sum - Optimal Approach
  25. 25Sort an Array of 0s, 1s, and 2s - Optimal Approach

MatrixMatrix (3)▼

  1. 1Set Matrix Zeroes - Optimal Approach
  2. 2Rotate Matrix by 90 Degrees Clockwise - Optimal Approach
  3. 3Print Matrix in Spiral Manner - Optimal Solution

Dynamic ProgrammingDynamic Programming (1)▼

  1. 1Edit Distance Problem

Binary TreesBinary Trees (36)▼

  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Postorder Traversal of a Binary Tree Using Recursion
  4. 4Postorder Traversal of a Binary Tree using Iteration
  5. 5Level Order Traversal of a Binary Tree using Recursion
  6. 6Level Order Traversal of a Binary Tree using Iteration
  7. 7Reverse Level Order Traversal of a Binary Tree using Iteration
  8. 8Reverse Level Order Traversal of a Binary Tree using Recursion
  9. 9Find Height of a Binary Tree
  10. 10Find Diameter of a Binary Tree
  11. 11Find Mirror of a Binary Tree - Todo
  12. 12Inorder Traversal of a Binary Tree using Recursion
  13. 13Inorder Traversal of a Binary Tree using Iteration
  14. 14Left View of a Binary Tree
  15. 15Right View of a Binary Tree
  16. 16Top View of a Binary Tree
  17. 17Bottom View of a Binary Tree
  18. 18Zigzag Traversal of a Binary Tree
  19. 19Check if a Binary Tree is Balanced
  20. 20Diagonal Traversal of a Binary Tree
  21. 21Boundary Traversal of a Binary Tree
  22. 22Construct a Binary Tree from a String with Bracket Representation
  23. 23Convert a Binary Tree into a Doubly Linked List
  24. 24Convert a Binary Tree into a Sum Tree
  25. 25Find Minimum Swaps Required to Convert a Binary Tree into a BST
  26. 26Check if a Binary Tree is a Sum Tree
  27. 27Check if All Leaf Nodes are at the Same Level in a Binary Tree
  28. 28Lowest Common Ancestor (LCA) in a Binary Tree
  29. 29Solve the Tree Isomorphism Problem
  30. 30Check if a Binary Tree Contains Duplicate Subtrees of Size 2 or More
  31. 31Check if Two Binary Trees are Mirror Images
  32. 32Calculate the Sum of Nodes on the Longest Path from Root to Leaf in a Binary Tree
  33. 33Print All Paths in a Binary Tree with a Given Sum
  34. 34Find the Distance Between Two Nodes in a Binary Tree
  35. 35Find the kth Ancestor of a Node in a Binary Tree
  36. 36Find All Duplicate Subtrees in a Binary Tree

Binary Search TreesBinary Search Trees (14)▼

  1. 1Find a Value in a Binary Search Tree
  2. 2Delete a Node in a Binary Search Tree
  3. 3Find the Minimum Value in a Binary Search Tree
  4. 4Find the Maximum Value in a Binary Search Tree
  5. 5Find the Inorder Successor in a Binary Search Tree
  6. 6Find the Inorder Predecessor in a Binary Search Tree
  7. 7Check if a Binary Tree is a Binary Search Tree
  8. 8Find the Lowest Common Ancestor of Two Nodes in a Binary Search Tree
  9. 9Convert a Binary Tree into a Binary Search Tree
  10. 10Balance a Binary Search Tree
  11. 11Merge Two Binary Search Trees
  12. 12Find the kth Largest Element in a Binary Search Tree
  13. 13Find the kth Smallest Element in a Binary Search Tree
  14. 14Flatten a Binary Search Tree into a Sorted List

LeetCodeLeetCode (1)▼

  1. 1LeetCode - 1. Two Sum - Brute Force Approach