{"id":26990444,"url":"https://github.com/vishesh-gupta/algolvers","last_synced_at":"2025-04-03T21:38:06.877Z","repository":{"id":213805501,"uuid":"187513841","full_name":"Vishesh-Gupta/Algolvers","owner":"Vishesh-Gupta","description":"A :notebook: to my solutions to algorithms that I have encountered and want to face","archived":false,"fork":false,"pushed_at":"2023-12-23T08:25:48.000Z","size":36,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-05-02T04:38:18.516Z","etag":null,"topics":["algorthims","cpp","data-structures","leetcode"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Vishesh-Gupta.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}},"created_at":"2019-05-19T18:32:51.000Z","updated_at":"2023-12-23T08:25:53.000Z","dependencies_parsed_at":"2023-12-23T09:03:23.921Z","dependency_job_id":null,"html_url":"https://github.com/Vishesh-Gupta/Algolvers","commit_stats":null,"previous_names":["vishesh-gupta/algolvers"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vishesh-Gupta%2FAlgolvers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vishesh-Gupta%2FAlgolvers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vishesh-Gupta%2FAlgolvers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vishesh-Gupta%2FAlgolvers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vishesh-Gupta","download_url":"https://codeload.github.com/Vishesh-Gupta/Algolvers/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247085972,"owners_count":20881157,"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":["algorthims","cpp","data-structures","leetcode"],"created_at":"2025-04-03T21:38:06.279Z","updated_at":"2025-04-03T21:38:06.854Z","avatar_url":"https://github.com/Vishesh-Gupta.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algolvers\n\nAlgolvers (acronym for Algorithm Solvers) is a set of solutions to multiple algorithm problems that were discovered online or asked to me while interviews\n\n## Table of Contents\n\n### **Data Structures**\n\n- Lists\n- Stack\n- Queue\n- Double Ended Queue\n- Linked Lists\n- Trees\n  - [Binary Search Tree](./data-structures/tree/bst/)\n  - [AVL Tree](./data-structures/tree/avl/)\n  - [Red-Black Tree](./data-structures/tree/red=black-tree/)\n  - Priority Queue\n  - [Heap](./data-structures/heap/)\n  - Fibonacci Heap\n  - Van Emde Boas Tree\n  - Graphs\n  - Adjacency List\n- RangeQueries\n  - Quadtree\n  - kd-Tree\n  - RangeTree\n- Hashing\n  - Cuckoo Hashing \n  - \n\n### **Algorithms**\n  \n- **Array**\n  - Array Rotate\n  - Move Zeros\n  - Fisher–Yates Shuffle\n  - Kadane's Algorithm\n  - 3 Sum\n  - Rotate square matrix 90º\n  - Search Rotated Array\n  - Zero Matrix\n  - Two Sum\n  - Three Sum\n  - Maximum Difference First Before Second\n  - Pair Sum To Target\n  - Container With Most Water\n  - Trapping Rain Water\n  - Longest Consecutive Subsequence\n  - Stock Buy Sell k times\n  - MO’s Algorithm\n  - Maximum Occurance In Given Range\n  - Missing Number\n  - Generate Power Set of a set\n  - [LC-217.](https://leetcode.com/problems/contains-duplicate/) [Contains Duplicates](./array/containsduplicate.js)\n  - [LC-728.](https://leetcode.com/problems/self-dividing-numbers/) [Self Dividing Numbers](./array/selfdividingnumber.cpp)\n  - [LC-867.](https://leetcode.com/problems/transpose-matrix/) [Transpose Matrix](./matrices/transpose.cpp)\n  - [LC-896.](https://leetcode.com/problems/monotonic-array/) [Monotonic Array](./array/monotonic.cpp)\n  - [LC-961.](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) [N-Repeated Element in Size 2N Array](./array/n-repeatedelem.cpp)\n\n- **Tree**\n  - [LC-94.](https://leetcode.com/problems/binary-tree-inorder-traversal/) [Binary Tree Inorder Traversal (Recursive)](./tree/binary%20tree/inordertraversal.js) Binary Tree Inorder Traversal (Iterative) \n  - LC-96. Unique Binary Search Tree\n  - LC-98. Validate Binay Search Tree\n  - [LC-101.](https://leetcode.com/problems/symmetric-tree/) [Symmetric Tree](./tree/binary%20tree/symmetric-tree.cpp)\n  - [LC-104.](https://leetcode.com/problems/maximum-depth-of-binary-tree/) [Maximum Depth of Binary Tree](./tree/binary%20tree/maxdepth-tree.js)\n  - [LC-144.](https://leetcode.com/problems/binary-tree-preorder-traversal/) [Binary Tree Preorder Traversal (Recursive)](./tree/binary%20tree/preordertraversal.js) Binary Tree PreOrder Traversal (Iterative)\n  - [LC-145.](https://leetcode.com/problems/binary-tree-postorder-traversal/) [Binary Tree Postorder Traversal (Recursive)](./tree/binary%20tree/postordertraversal.js) Binary Tree Post Order Traversal (Iterative)\n  - [LC-589.](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) [N-ary Tree Preorder Traversal (Recursive)](./tree/n-ary%20tree/preordertraversal.js) N-ary Tree Preorder Traversal (Iterative)\n  - [LC-590.](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) [N-ary Tree Postorder Traversal (Recursive)](./tree/n-ary%20tree/preordertraversal.js) N-ary Tree Postorder Traversal (Iterative)\n  - [LC-617.](https://leetcode.com/problems/merge-two-binary-trees/) [Merge Two Binary Trees](./tree/binary%20tree/symmetric-tree.cpp)\n  - [LC-700.](https://leetcode.com/problems/search-in-a-binary-search-tree/) [Search in a Binary Search Tree](./tree/binary%20tree/binary%20search%20tree/searchinvst.cpp)\n  - [LC-938.](https://leetcode.com/problems/range-sum-of-bst/) [Range Sum of BST](./tree/binary%20search%20tree/rangesumofbst.cpp)\n  - [LC-965.](https://leetcode.com/problems/univalued-binary-tree/) [Univalued Binary Tree](./tree/binary%20tree/univalued-tree.cpp)\n\n- **String**\n  - Is Unique\n  - Check Permutation\n  - One Away\n  - String Compression\n  - String Rotation\n  - Naïve String Search\n  - Rabin–Karp\n  - Knuth–Morris–Pratt\n  - Boyer–Moore\n\n- **Linked Lists**\n  - Reverse Iterative\n  - Reverse Recursive\n  - Floyd's Cycle Detection\n\n- **Stack**\n  - [Balanced Parentheses](./stack/balanced_parenthesis.cpp)\n  - Infix to Postfix\n  - Prefix to Infix\n  - Prefix to Postfix\n  - Postfix to Prefix\n  - Postfix to Infix\n  - [Reverse a Stack](./stack/reverse.cpp)\n\n- **Sorting**\n  - Insertion Sort\n  - Heap Sort\n  - [Merge Sort](./sorting/mergesort.cpp)\n  - Quick Sort\n  - Bubble Sort\n  - Counting Sort\n\n- **Search**\n  - [Linear Search](./search/linearsearch.cpp)\n  - [Binary Search](./search/binarysearch.cpp)\n  - [Interpolation Search](./search/interpolationsearch.cpp)\n  - [Range Search 1-D](./search/rangesearch.cpp)\n\n- **Selection**\n\n- **Divide and Conquer**\n  - Recursive Max Sub Array\n\n- **Dynamic Programming**\n  - [LC-53.](https://leetcode.com/problems/?search=53) [Maximum Sum of a Sub Array](./array/subrangemaxsum.cpp)\n  - Longest Common Subsequence\n  - Shortest Common Supersequence\n  - Longest Increasing Subsequence\n  - Probability Knight Remains In Chessboard\n  - Count All Matrix Paths\n  - Word Break\n  - Cutting a rod\n  - Integer Break (Maximum Product)\n  - Levenshtein distance\n  - Staircase Problem\n  - Matrix Chain Multiplication\n  - 0–1 Knapsack Problem\n  - Partition Problem\n  - Rod Cut\n  - Coin Change Problem\n\n- **Greedy**\n  - Minimum product subset of an array\n  - Maximum product subset of an array\n  - Maximize the sum of arr[i]*i\n  - Minimum sum of product of two arrays\n  - Activity Selection Problem\n  - Egyptian Fraction\n  - Huffman Coding\n  - Huffman Decoding\n  - Water Connection Problem\n\n- **Graph**\n  - Breadth First Search\n  - Number of islands\n  - Software Engineering\n\n- **Design Patterns**\n  - Singleton\n  - Observer\n  - Mediator\n  - Prototype\n  - Command\n\n- **Functional Programming**\n\n- **Regular Expressions**\n\n- **Mathematical Problems**\n  - [LC-509.](https://leetcode.com/problems/fibonacci-number/) [Fibonacci Number](./math/fibonaccinumber.cpp)\n\n- **Shell**\n  - [LC-192.](https://leetcode.com/problems/word-frequency/) [Word Frequency](./shell/wordfrequency.sh) \n  - [LC-194.](https://leetcode.com/problems/transpose-file) [Transpose File](./shell/transpose-file)\n  - [LC-195.](https://leetcode.com/problems/tenth-line) [Tenth Line](./shell/tenthline.sh)\n  - [LC-193.](https://leetcode.com/problems/valid-phone-numbers/) [Valid Phone Numbers](./shell/validphonenumber.sh)\n\n- **SQL**\n  - [LC-595.](https://leetcode.com/problems/big-countries) [Big Countries](./sql/bigcountries.sql)\n  - [LC-620](https://leetcode.com/problems/not-boring-movies/) [Not Boring Movies](./sql/notboringmovies.sql)\n  - [LC-627.](https://leetcode.com/problems/swap-salary/) [Swap Salary](./sql/swapsalary.sql)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvishesh-gupta%2Falgolvers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvishesh-gupta%2Falgolvers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvishesh-gupta%2Falgolvers/lists"}