{"id":15879725,"url":"https://github.com/sydrawat01/algorithms","last_synced_at":"2025-04-02T00:44:04.247Z","repository":{"id":37382301,"uuid":"499232689","full_name":"sydrawat01/algorithms","owner":"sydrawat01","description":"🗂 Leetcode and ADT","archived":false,"fork":false,"pushed_at":"2022-08-30T22:14:27.000Z","size":132,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-07T16:19:19.647Z","etag":null,"topics":["algorithms","java","leetcode","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sydrawat01.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-06-02T17:41:53.000Z","updated_at":"2023-03-07T02:48:40.000Z","dependencies_parsed_at":"2023-01-16T15:15:13.492Z","dependency_job_id":null,"html_url":"https://github.com/sydrawat01/algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sydrawat01%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sydrawat01%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sydrawat01%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sydrawat01%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sydrawat01","download_url":"https://codeload.github.com/sydrawat01/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246735350,"owners_count":20825223,"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":["algorithms","java","leetcode","leetcode-solutions"],"created_at":"2024-10-06T03:04:27.648Z","updated_at":"2025-04-02T00:44:04.224Z","avatar_url":"https://github.com/sydrawat01.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms [![CircleCI](https://dl.circleci.com/status-badge/img/gh/sydrawat01/algorithms/tree/master.svg?style=svg)](https://dl.circleci.com/status-badge/redirect/gh/sydrawat01/algorithms/tree/master)\n\nBasic algorithms, Data Structures and Graphs. Also includes LeetCode problems and their solutions.\n\n## Elementary Sorting Techniques\n\n- [Bubble Sort](./src/main/java/ADT/Sort/BubbleSort)\n- [Insertion Sort](./src/main/java/ADT/Sort/InsertionSort)\n- [Selection Sort](./src/main/java/ADT/Sort/SelectionSort)\n- [Merge Sort](./src/main/java/ADT/Sort/MergeSort) [WIP]\n- [Shell Sort](./src/main/java/ADT/Sort/ShellSort)\n- [Quick Sort](./src/main/java/ADT/Sort/QuickSort)\n- [Heap Sort](./src/main/java/ADT/Sort/HeapSort) [WIP]\n\n## Linear Non-Sorting Techniques\n\n- [Knuth Shuffle](./src/main/java/ADT/Sort/Shuffling/KnuthShuffle.java)\n- [Quick Select](./src/main/java/ADT/Sort/Shuffling/QuickSelect.java) [WIP]\n\n## Abstract Data Types\n\n- [Binary Search](./src/main/java/ADT/BinarySearch/BinarySearch.java) [Iterative \u0026 Recursive]\n- [Binary Insertion Sort](./src/main/java/ADT/BinaryInsertion/BinaryInsertionSort.java)\n- [ArrayList Duplicates](./src/main/java/ADT/Duplicates/ArrayListDuplicates.java)\n- [LinkedList](./src/main/java/ADT/LinkedList)\n- [Doubly Linked List](./src/main/java/ADT/DList/DList.java)\n- [Stack](./src/main/java/ADT/Stack)\n- [Queue](./src/main/java/ADT/Queue)\n- [Quick Find](./src/main/java/ADT/UnionFind/QuickFindUF.java)\n- [Quick Union](./src/main/java/ADT/UnionFind/QuickUnionUF.java)\n- [Weighted Quick Union](./src/main/java/ADT/UnionFind/WeightedQuickUnionUF.java)\n- [Weighted Quick Union with Path Compression](./src/main/java/ADT/UnionFind/WeightedQuickUnionPCUF.java)\n- [Binary Search Tree](./src/main/java/ADT/BST/BinarySearchTree.java)\n\n## APIs\n\n- [Linked List](./src/main/java/ADT/API/LinkedList/LinkedList.java)\n- [Doubly Linked List](./src/main/java/ADT/API/DoublyLinkedList)\n- [Stack](./src/main/java/ADT/API/Stack)\n- [Queue](./src/main/java/ADT/API/Queue)\n- [Queue as Doubly-linked list](./src/main/java/ADT/API/DoublyLinkedList/DLLQueue.java)\n- [Bag](./src/main/java/ADT/API/Bag)\n\n## Graphs\n\n- [Depth First Search](./src/main/java/Graphs/DFS.java)\n- [DFS Paths](./src/main/java/Graphs/DFSPaths.java)\n- [Breadth First Search](./src/main/java/Graphs/BFSPaths.java)\n- [Undirected Graph](./src/main/java/Graphs/Graph.java) [Basic]\n- [Directed Graphs](./src/main/java/Graphs/digraph)\n- [Minimum Spanning Tree](./src/main/java/Graphs/MST)\n- [Shortest Path](./src/main/java/Graphs/ShortestPath)\n\n## Leetcode Solutions\n\nBelow are some LeetCode problems that are solved using Java. These are divided into easy, medium and hard problems for\nbetter classification.\n\nLong way to go!\n\n### Easy Java\n\n- [x] [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/) : [Solution](./src/main/java/leetcode/solutions/solution9)\n- [x] [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/) : [Solution](./src/main/java/leetcode/solutions/solution35)\n- [x] [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/) : [Solution](./src/main/java/leetcode/solutions/solution58)\n- [x] [83. Remove Duplicates from a Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) : [Solution](./src/main/java/leetcode/solutions/solution83)\n- [x] [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) : [Solution](./src/main/java/leetcode/solutions/solution206)\n- [x] [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/): [Solution](./src/main/java/leetcode/solutions/solution234)\n- [x] [287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) : [Solution](./src/main/java/leetcode/solutions/solution287)\n- [x] [442. Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) : [Solution](./src/main/java/leetcode/solutions/solution442)\n- [x] [1342. Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) : [Solution](./src/main/java/leetcode/solutions/solution1342)\n- [x] [1356. Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) : [Solution](./src/main/java/leetcode/solutions/solution1356)\n- [x] [1365. How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) : [Solution](./src/main/java/leetcode/solutions/solution1365)\n- [x] [2062. Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/) : [Solution](./src/main/java/leetcode/solutions/solution2062)\n\n## Unit Tests\n\nUnit tests have been implemented for 100% code coverage. Algorithms that have not yet been implemented, or have bugs, have not been implemented yet.\n\nHere's the link to the unit tests: [Unit Tests](/src/test/java)\n\n## Author\n\n[Siddharth Rawat](https://sydrawat.netlify.app)\n\n## [License](./LICENSE)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsydrawat01%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsydrawat01%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsydrawat01%2Falgorithms/lists"}