{"id":13694254,"url":"https://github.com/priyankchheda/algorithms","last_synced_at":"2025-04-04T13:09:53.012Z","repository":{"id":40610452,"uuid":"133684565","full_name":"priyankchheda/algorithms","owner":"priyankchheda","description":"Data Structure Libraries and Algorithms implementation","archived":false,"fork":false,"pushed_at":"2023-08-13T16:46:13.000Z","size":383,"stargazers_count":641,"open_issues_count":2,"forks_count":66,"subscribers_count":15,"default_branch":"master","last_synced_at":"2024-10-14T07:07:39.809Z","etag":null,"topics":["algorithm","algorithm-library","c","cpp","data-structures","data-structures-algorithms","go","golang","python3"],"latest_commit_sha":null,"homepage":"","language":"C++","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/priyankchheda.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,"governance":null,"roadmap":null,"authors":null}},"created_at":"2018-05-16T15:10:56.000Z","updated_at":"2024-09-30T07:49:31.000Z","dependencies_parsed_at":"2024-01-13T23:06:52.292Z","dependency_job_id":"e1fc6e06-2510-4235-a3c3-6bc318282c6a","html_url":"https://github.com/priyankchheda/algorithms","commit_stats":{"total_commits":312,"total_committers":7,"mean_commits":44.57142857142857,"dds":0.03205128205128205,"last_synced_commit":"38a5de72db14ef2664489da9857b598d24c4e276"},"previous_names":["x899/algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/priyankchheda%2Falgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/priyankchheda%2Falgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/priyankchheda%2Falgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/priyankchheda%2Falgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/priyankchheda","download_url":"https://codeload.github.com/priyankchheda/algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247182334,"owners_count":20897379,"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":["algorithm","algorithm-library","c","cpp","data-structures","data-structures-algorithms","go","golang","python3"],"created_at":"2024-08-02T17:01:28.017Z","updated_at":"2025-04-04T13:09:52.991Z","avatar_url":"https://github.com/priyankchheda.png","language":"C++","readme":"# Algorithms\nData Structure Libraries and Algorithms implementation in C++\n\n**Disclaimer**\u003cbr /\u003e\nThis repository is meant to be used as a reference to learn data structure and\nalgorithm.\n\n## Algorithms in Other Languages\n* [C](c_language/)\n* [C++](cpp/)\n* [Golang](golang/)\n\n## Data structure\n* [Array](array)\n  * [Find duplicates in array](array/duplicates_array.py)\n  * [Largest Rectangle in Histogram](array/largest_rectangle_histogram.py)\n  * [Largest Sum of Contiguous subarray within an array](array/largest_sum_subarray.py)\n  * [Inplace array reversal](array/reverse_array_inplace.py)\n* [AVL Tree](avl_tree/avl_tree.py)\n* [Binary Search Tree](binary_search_tree/library/binary_search_tree.py)\n  * [BFS Traversal](binary_search_tree/bfs_traversals.py)\n  * [Compare two BST](binary_search_tree/compare_two_bst.py)\n  * [DFS Traversal](binary_search_tree/dfs_traversals.py)\n  * [Is BST?](binary_search_tree/is_bst.py)\n  * [Lowest Common Ancestor](binary_search_tree/lowest_common_ancestor.py)\n* [Binary Tree](binary_tree/)\n  * [Depth First Traversal](binary_tree/depth_first_traversal.py)\n  * [Level Order Traversal](binary_tree/level_order_traversal.py)\n  * [Lowest Common Ancestor](binary_tree/lowest_common_ancestor.py)\n  * [Top View](binary_tree/top_view.py)\n  * [Vertical Order Traversal](binary_tree/vertical_order_traversal.py)\n* [Deque](deque/deque.py)\n* [Dynamic Connectivity](dynamic_connectivity/)\n  * [Quick Find](dynamic_connectivity/quick_find.py)\n  * [Quick Union](dynamic_connectivity/quick_union.py)\n  * [Weighted Quick Union](dynamic_connectivity/weighted_quick_union.py)\n* [Graph](graph/library/graph.py)\n  * [Bellman Ford Algorithm](graph/bellman_ford_algorithm.py)\n  * [Breadth First Search](graph/breadth_first_search.py)\n  * [Connected Componenets](graph/connected_components.py)\n  * [Depth First Search](graph/depth_first_search.py)\n  * [Dijkstra Algorithm](graph/dijkstra_algorithm.py)\n  * [Kosaraju Algorithm](graph/kosaraju_algorithm.py)\n  * [Kruskal Algorithm](graph/kruskal_algorithm.py)\n  * [Prim Algorithm](graph/prim_algorithm.py)\n  * [Topological Sort](graph/topological_sort.py)\n* [Hash Table](hashtable/)\n  * [Linear Probing](hashtable/linear_probing.py)\n  * [Separate Chaining](hashtable/separate_chaining.py)\n* [Linked List](linked_list/)\n  * [Singly Linked List](linked_list/library/linked_list.py)\n    * [Find Middle Node](linked_list/find_middle_node.py)\n    * [Is Palindrome?](linked_list/is_palindrome.py)\n    * [Merge Two Sorted Linked List](linked_list/merge_two_sorted_list.py)\n    * [Node Swap](linked_list/node_swap.py)\n    * [Remove duplicates from Singly Linked List](linked_list/remove_duplicates_singly.py)\n    * [Return nth element from last node](linked_list/nth_to_last_node.py)\n    * [Reverse Singly Linked List](linked_list/reverse_singly_list.py)\n    * [Rotate](linked_list/rotate.py)\n    * [Sum of two lists](linked_list/sum_two_lists.py)\n  * [Doubly Linked List](linked_list/library/doubly_linked_list.py)\n    * [Remove duplicates from Doubly Linked List](linked_list/remove_duplicates_doubly.py)\n    * [Reverse Doubly Linked List](linked_list/reverse_doubly_list.py)\n  * [Circular Linked List](linked_list/library/circular_linked_list.py)\n    * [Is Circular?](linked_list/is_circular.py)\n    * [Josephus Circle](linked_list/josephus_circle.py)\n    * [Split Circular Lists](linked_list/split_circular_lists.py)\n* [Miscellaneous](misc/)\n  * [Anagram](misc/anagram.py)\n  * [Integer Reversion](misc/integer_reversion.py)\n  * [Palindrome Check](misc/palindrome_check.py)\n* [Priority Queue/Binary Heap](priority_queue/)\n  * [Min Heap](priority_queue/minheap.py)\n  * [Max Heap](priority_queue/maxheap.py)\n* [Queue](queue/library/queue.py)\n* [Red Black Tree](red_black_tree/red_black_tree.py)\n* [Binary Search](search/binary_search.py)\n* [Shuffle using Fisher-Yates (Knuth) shuffling algorithm](shuffle/shuffle.py)\n* [Sorting Algorithms](sort/)\n  * [Bubble Sort](sort/bubble.py)\n  * [Gnome Sort](sort/gnome.py)\n  * [Insertion Sort](sort/insertion.py)\n  * [Merge Sort](sort/merge.py)\n  * [Odd Even Sort](sort/oddeven.py)\n  * [Quick Sort](sort/quick.py)\n  * [Selection Sort](sort/selection.py)\n  * [Shell Sort](sort/shell.py)\n* [Stack](stack/library/stack.py)\n  * [Balanced Paranthesis](stack/balanced_parenthesis.py)\n  * [Track Current Minimum](stack/getmin_special_stack.py)\n  * [Integer to Binary](stack/integer_to_binary.py)\n  * [Queue using Stack](stack/queue_using_stack.py)\n  * [Two Stack in an Array](stack/two_stack_in_an_array.py)\n* [Ternary Search Tries](ternary_search_tries/ternary_search_tries.py)\n* [Tree](tree/library/tree.py)\n* [Trie](trie/trie.py)\n\n\n## TO DO\n* Vertical Order Traversal of Tree\n* Order Statistics of Tree\n* Red Black Tree\n* Deque using circular array\n* Tree Varient\n* Graph Varient\n* [cocktail sort](https://en.wikipedia.org/wiki/Cocktail_shaker_sort)\n* [comb sort](https://en.wikipedia.org/wiki/Comb_sort)\n\n## Contribution\nFeel Free to contribute.\u003cbr /\u003e\nPlease follow standard C++ Guidelines.\n","funding_links":[],"categories":["开源类库","Open source library","C++"],"sub_categories":["算法","Algorithm"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpriyankchheda%2Falgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpriyankchheda%2Falgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpriyankchheda%2Falgorithms/lists"}