{"id":21882409,"url":"https://github.com/venkatesh-bharath/dsa-full-course","last_synced_at":"2025-06-26T00:06:31.774Z","repository":{"id":245685392,"uuid":"815246643","full_name":"Venkatesh-Bharath/DSA-Full-Course","owner":"Venkatesh-Bharath","description":"Data Structures and Algorithams","archived":false,"fork":false,"pushed_at":"2024-06-23T12:23:12.000Z","size":152,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-22T01:15:16.094Z","etag":null,"topics":["dsa-algorithm","java"],"latest_commit_sha":null,"homepage":"https://youtube.com/playlist?list=PLKZ1dSitnT20uUtl0GnzPlCm8UwAFmXlQ\u0026si=T0AMFOzPnHshWjda","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Venkatesh-Bharath.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-14T17:11:40.000Z","updated_at":"2024-06-23T12:23:14.000Z","dependencies_parsed_at":"2024-06-23T12:51:48.148Z","dependency_job_id":null,"html_url":"https://github.com/Venkatesh-Bharath/DSA-Full-Course","commit_stats":null,"previous_names":["venkatesh-bharath/dsa-full-course"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Venkatesh-Bharath/DSA-Full-Course","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Venkatesh-Bharath%2FDSA-Full-Course","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Venkatesh-Bharath%2FDSA-Full-Course/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Venkatesh-Bharath%2FDSA-Full-Course/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Venkatesh-Bharath%2FDSA-Full-Course/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Venkatesh-Bharath","download_url":"https://codeload.github.com/Venkatesh-Bharath/DSA-Full-Course/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Venkatesh-Bharath%2FDSA-Full-Course/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261973727,"owners_count":23238586,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dsa-algorithm","java"],"created_at":"2024-11-28T09:29:03.946Z","updated_at":"2025-06-26T00:06:31.749Z","avatar_url":"https://github.com/Venkatesh-Bharath.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Full Course\nData Structures and Algorithms \n# Syllabus ( Only Java -Ignore c++ )\n# Module 1: Introduction\n 1. Analysis of Algorithm\n 2. Background analysis through a Program and its functions.\n 3. Order of Growth\n 4. A mathematical explanation of the growth analysis through limits and functions.\n 5. A direct way of calculating the order of growth\n 6. Asymptotic Notations\n 7. Best, Average and Worst case explanation through a program.\n 8. Big O Notation\n 9. Graphical and mathematical explanation.\n 10. Calculation\n 11. Applications at Linear Search\n 12. Omega Notation\n 13. Graphical and mathematical explanation.\n 14. Calculation.\n 15. Theta Notation\n 16. Graphical and mathematical explanation.\n 17. Calculation.\n 18. Analysis of common loops\n 19. Single, multiple and nested loops\n 20. Analysis of Recursion\n 21. Various calculations through Recursion Tree method\n 22. Space Complexity\n 23. Basic Programs\n 24. Auxiliary Space\n 25. Space Analysis of Recursion\n 26. Space Analysis of Fibonacci number\n# Module 2: Mathematics\n 1. Finding the number of digits in a number.\n 2. Arithmetic and Geometric Progressions.\n 3. Quadratic Equations.\n 4. Mean and Median.\n 5. Prime Numbers.\n 6. LCM and HCF\n 7. Factorials\n 8. Permutations and Combinations\n 9. Modular Arithmetic\n 10. Practice Problems\n# Module 3: Bitmagic\n 1. Bitwise Operators in C++\n 2. Operation of AND, OR, XOR operators\n 3. Operation of Left Shift, Right Shift and Bitwise Not\n 4. Bitwise Operators in Java\n 5. Operation of AND, OR\n 6. Operation of Bitwise Not, Left Shift \n 7. Operation of Right Shift and unsigned Right Shift\n 8. Problem(With Video Solutions): Check Kth bit is set or not\n 9. Using the left Shift.\n 10. Using the right shift\n 11. Problem(With Video Solutions): Count Set Bits\n 12. Simple method\n 13. Brian and Kerningham Algorithm\n 14. Using Lookup Table\n 15. Problems(With Video Solutions):\n 16. To check whether a number is a power of 2 or not\n 17. Odd occurrences in an array.\n 18. Two numbers having odd occurrences in an array.\n 19. Generate power set using bitwise operators.\n 20. Practice Problems\n# Module 4: Recursion\n 1. Writing base cases in Recursion\n 2. Factorial\n 3. N-th Fibonacci number\n 4. Various problems on Recursion(With Video Solutions)\n 5. Print n to 1\n 6. Tail Recursion\n 7. Checking Palindrome\n 8. Sum of digits\n 9. Rod cutting\n 10. Subsets of a set\n 11. Tower of Hanoi Problem\n 12. Josephus Problem\n# Module 5: Arrays\n 1. Introduction and Advantages\n 2. Types of Arrays\n 3. Fixed-sized array\n 4. Dynamic-sized array\n 5. Operations on Arrays\n 6. Searching\n 7. Insertions\n 8. Deletion\n 9. Arrays vs other DS\n 10. Reversing - Explanation with complexity\n 11. Left Rotation of the array by 1\n 12. Left Rotation of the array by D places\n 13. Leaders in an Array\n 14. Maximum Difference Problem\n 15. Stock Buy and Sell Problem\n 16. Trapping Rainwater Problem\n 17. Maximum subarray sum\n 18. Longest even-odd subarray\n 19. Maximum Circular sum subarray. \n 20. Majority Element\n 21. Minimum Consecutive Flips\n 22. Sliding Window Technique\n 23. Prefix sum technique\n 24. Practice Problems\n# Module 6: Searching\n 1. Binary Search and various associated problems(With Video Solutions)\n 2. Leftmost index of an element in an array\n 3. Count of occurrences of x in sorted element\n 4. Count of 1s in a binary sorted array\n 5. Find an element in sorted and rotated array\n 6. Peak element\n 7. Find an element in an infinite sized sorted array\n 8. The square root of an integer\n 9. Two Pointer Approach Problems(With Video Solutions)\n 10. Find pair in an unsorted array which gives sum X\n 11. Find pair in a sorted array which gives sum X\n 12. Find triplet in an array which gives sum X\n 13. Problems(With Video Solutions)\n 14. Median of two sorted arrays\n 15. Majority Element\n# Module 7: Sorting\n1. Implementation of C++ STL sort() function in Arrays and Vector\n2. Time Complexities\n3. Sorting in Java\n4. Arrays.sort() in Java\n5. Collection.sort() in Java\n6. Stability in Sorting Algorithms\n7. Examples of Stable and Unstable Algos\n8. Insertion Sort\n9. Merge Sort\n10. Intersection of 2 sorted arrays\n11. Union of 2 sorted arrays\n12. Count Inversions in arrays\n13. Partitions (With Video Solutions)\n14. Quick Sort\n15. Using Lomuto and Hoare\n16. Time and Space analysis\n17. Choice of Pivot and Worst case\n18. Tail call elimination\n19. Problems (With Video Solutions)\n20. Kth Smallest element\n21. Chocolate Distribution Problem\n22. Sorting arrays with 2 and 3 types of elements\n23. Merge Overlapping Intervals\n24. Meeting the Maximum Guests\n25. Cycle Sort\n26. Counting Sort\n27. Radix Sort\n# Module 8: Matrix\n 1. Introduction to Matrix in C++ and Java\n 2. Printing matrix in a snake pattern\n 3. Transposing a matrix\n 4. Rotating a Matrix\n 5. Check if the element is present in a row and column-wise sorted matrix.\n 6. Boundary Traversal\n 7. Spiral Traversal\n 8. Matrix Multiplication\n# Module 9: Hashing\n 1. Introduction and Time complexity analysis\n 2. Application of Hashing\n 3. Discussion on Direct Address Table\n 4. Working and examples on various Hash Functions\n 5. Introduction and Various techniques on Collision Handling\n 6. Chaining and its implementation\n 7. Open Addressing and its Implementation\n 8. Chaining V/S Open Addressing\n 9. Double Hashing\n 10. C++\n 11. Unordered Set\n 12. Unordered Map\n 13. Java\n 14. HashSet\n 15. HashMap\n 16. Problems(With Video Solutions):\n 17. Count Distinct Elements\n 18. Count of the frequency of array elements\n 19. The intersection of two arrays\n 20. Union of two unsorted arrays\n 21. Pair with given sum in an unsorted array\n 22. Subarray with zero-sum\n 23. Subarray with given sum\n 24. Longest subarray with a given sum\n 25. Longest subarray with an equal number of 0’s and 1’s\n 26. Longest common span with the same sum in a binary array\n 27. Longest Consecutive Subsequence\n 28. Count Distinct elements in every window\n# Module 10: String\n 1. Discussion of String DS\n 2. Problems(With Video Solutions)\n 3. Given a string, check if they are an anagram of each other.\n 4. Given a string, find the leftmost character that repeats.\n 5. Given a string, find the leftmost character that does not repeat.\n 6. Given a string, find the lexicographic rank of it in O(n) time.\n 7. Implementation of the previously discussed lexicographic rank problem.\n 8. Given a text string and a pattern string, find if a permutation of the pattern exists in the text.\n 9. Given two strings, check if they are rotations of each other or not.\n 10. Various Pattern Searching Algorithms.\n 11. Rabin Karp Algorithm\n 12. KMP Algorithm\n# Module 11: Linked List \n 1. Introduction\n 2. Implementation in CPP\n 3. Implementation in Java\n 4. Comparison with Array DS\n 5. Doubly Linked List\n 6. Circular Linked List\n 7. Loop Problems\n 8. Detecting Loops\n 9. Detecting loops using Floyd cycle detection\n 10. Detecting and Removing Loops in Linked List\n 11. Problems(With Video Solutions):\n 12. Middle of Linked List\n 13. Nth node from the end of linked list\n 14. Deleting a Node without accessing Head pointer of Linked List\n 15. An iterative method to Reverse a linked list\n 16. Recursive method to reverse a linked list\n 17. Segregating even-odd nodes of linked list\n 18. The intersection of two linked list\n 19. Pairwise swap nodes of linked list\n 20. Clone a linked list using a random pointer\n 21. LRU Cache Design\n# Module 12: Arrays\n 1. Understanding the Stack data structure\n 2. Applications of Stack\n 3. Implementation of Stack in Array and Linked List\n 4. In C++\n 5. In Java\n 6. Problems(With Video Solutions):\n 7. Balanced Parenthesis\n 8. Two stacks in an array\n 9. K Stacks in an array\n 10. Stock span problem with variations\n 11. Previous Greater Element\n 12. Next Greater Element\n 13. Largest Rectangular Area in a Histogram\n 14. Understanding getMin() in Stack with O(1)\n# Module 13: Queue\n 1. Introduction and Application\n 2. Implementation of the queue using array and LinkedList\n 3. In C++ STL\n 4. In Java\n 5. Stack using queue\n 6. Problems(With Video Solutions)\n 7. Reversing a Queue\n 8. Generate numbers with given digits\n 9. Maximums of all subarrays of size k\n# Module 14: Tree\n 1. Introduction\n 2. Tree\n 3. Application\n 4. Binary Tree\n 5. Tree Traversal\n 6. Implementation of:\n 7. Inorder Traversal\n 8. Preorder Traversal\n 9. Postorder Traversal\n 10. Level Order Traversal (Line by Line)\n 11. Tree Traversal in Spiral Form\n 12. Problems(With Video Solutions):\n 13. Size of Binary Tree\n 14. Maximum in Binary Tree\n 15. Height of Binary Tree\n 16. Print Nodes at K distance\n 17. Print Left View of Binary Tree\n 18. Children Sum Property\n 19. Check for Balanced Binary Tree\n 20. Maximum Width of Binary Tree\n 21. Convert Binary Tree to Doubly Linked List\n 22. Construct Binary Tree from Inorder and Preorder\n 23. The diameter of a Binary Tree\n 24. LCA problem with an efficient solution\n# Module 15: Binary Search Tree\n 1. Background, Introduction and Application\n 2. Implementation of Search in BST\n 3. In CPP\n 4. In Java\n 5. Insertion in BST\n 6. In CPP\n 7. In Java\n 8. Deletion in BST\n 9. In CPP\n 10. In Java\n 11. Floor in BST\n 12. In CPP\n 13. In Java\n 14. Self Balancing BST\n 15. AVL Tree\n 16. Red Black Tree\n 17. Set in C++ STL\n 18. Map in C++ STL\n 19. TreeSet in java\n 20. TreeMap in Java\n 21. Problems(With Video Solutions):\n 22. The ceiling of a key in BST\n 23. Ceiling on the left side in an array\n 24. Find Kth Smallest in BST\n 25. Check for BST\n 26. Fix BST with Two Nodes Swapped\n 27. Pair Sum with given BST\n 28. Vertical Sum in a Binary Tree\n 29. Vertical Traversal of Binary Tree\n 30. Top View of Binary Tree\n 31. Bottom View of Binary Tree\n# Module 16: Heap\n 1. Introduction \u0026 Implementation\n 2. Binary Heap\n 3. Insertion\n 4. Heapify and Extract\n 5. Decrease Key, Delete and Build Heap\n 6. Heap Sort\n 7. Priority Queue in C++\n 8. PriorityQueue in Java\n 9. Problems(With Video Solutions):\n 10. Sort K-Sorted Array\n 11. Buy Maximum Items with Given Sum\n 12. K Largest Elements\n 13. Merge K Sorted Arrays\n 14. Median of a Stream\n# Module 17: Graph\n 1. Introduction to Graph\n 2. Graph Representation\n 3. Adjacency Matrix\n 4. Adjacency List in CPP and Java\n 5. Adjacency Matrix VS List\n 6. Breadth-First Search\n 7. Applications\n 8. Depth First Search\n 9. Applications\n 10. Problems(With Video Solutions):\n 11. Shortest Path in an Unweighted Graph\n 12. Detecting Cycle\n 13. In the Undirected Graph\n 14. In the Directed Graph\n 15. Topological Sorting\n 16. Kahn's BFS Based Algorithm\n 17. DFS Based Algorithm\n 18. Shortest Path in Directed Acyclic Graph\n# Module 18: Greedy\n 1. Introduction\n 2. Activity Selection Problem\n 3. Fractional Knapsack\n 4. Job Sequencing Problem\n# Module 19: Backtracking\n 1. Concepts of Backtracking\n 2. Rat In a Maze\n 3. N Queen Problem\n 4. Sudoku Problem\n# Module 20: Dynamic Programming\n 1. Introduction\n 2. Dynamic Programming\n 3. Memoization\n 4. Tabulation\n 5. Problems(With Video Solutions):\n 6. Longest Common Subsequence\n 7. Coin Change Count Combinations\n 8. Edit Distance Problem\n 9. Naive Approach\n 10. DP Approach\n 11. Longest Increasing Subsequence Problem\n 12. Naive Approach\n 13. Efficient Approach\n 14. Maximum Cuts\n 15. Minimum coins to make a value\n 16. Minimum Jumps to reach at the end\n 17. 0-1 knapsack problem\n 18. Naive Approach\n 19. Efficient Approach\n 20. Optimal Strategy for a Game\n 21. Variation of Longest Common Subsequence\n 22. Variation of Longest Increasing Subsequence\n 23. Egg Dropping Problem\n# Module 21: Graph Advance\n 1. Prim's Algorithm/Minimum Spanning Tree\n 2. Dijkstra's Shortest Path Algorithm\n 3. Bellman-Ford Shortest Path Algorithm\n 4. Kosaraju's Algorithm\n 5. Articulation Point \n 6. Bridges in Graph\n 7. Tarjan’s Algorithm\n# Module 22: Trie\n 1. Introduction\n 2. Representation\n 3. Search\n 4. Insert \n 5. Delete\n 6. Count Distinct Rows in a Binary Matrix\n# Module 23: Segment Tree\n 1. Introduction\n 2. Construction\n 3. Range Query\n 4. Update Query\n# Module 24: Disjoint Set\n 1. Introduction\n 2. Find and Union Operations\n 3. Union by Rank\n 4. Path Compression\n 5. Kruskal's Algorith\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvenkatesh-bharath%2Fdsa-full-course","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvenkatesh-bharath%2Fdsa-full-course","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvenkatesh-bharath%2Fdsa-full-course/lists"}