From 9101ccd27c62a17a4cad0b72bbff7441d60b12f1 Mon Sep 17 00:00:00 2001 From: David Leal Date: Wed, 9 Nov 2022 19:21:17 -0600 Subject: [PATCH] docs: add a guide for new LeetCode solutions (#1131) * docs: add a guide for new LeetCode solutions * updating DIRECTORY.md * updating DIRECTORY.md * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> --- CONTRIBUTING.md | 6 +- DIRECTORY.md | 696 +++++++++++++++++++++--------------------- leetcode/DIRECTORY.md | 95 ++++++ leetcode/README.md | 175 +++++------ 4 files changed, 528 insertions(+), 444 deletions(-) create mode 100644 leetcode/DIRECTORY.md diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md index 75dc35de..3d05296e 100644 --- a/CONTRIBUTING.md +++ b/CONTRIBUTING.md @@ -8,7 +8,7 @@ Welcome to [TheAlgorithms/C](https://github.com/TheAlgorithms/C)! Before submitt ### Maintainer/reviewer -**Please check the [reviewer code](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/REVIEWER_CODE.md) file for maintainers and reviewers.** +**Please check the [reviewer code](https://github.com/TheAlgorithms/C/blob/master/REVIEWER_CODE.md) file for maintainers and reviewers.** ### Contributor @@ -25,6 +25,10 @@ You can add new algorithms or data structures that are **not present in the repo **Issues** Please avoid opening issues asking to be "assigned” to a particular algorithm. This merely creates unnecessary noise for maintainers. Instead, please submit your implementation in a pull request, and it will be evaluated by project maintainers. +### LeetCode solutions + +For LeetCode solutions, please check its [**guide**](https://github.com/TheAlgorithms/C/blob/master/src/leetcode/README.md) to make a proper solution file. + ### Making Changes #### Code diff --git a/DIRECTORY.md b/DIRECTORY.md index a6e53d03..a669f481 100644 --- a/DIRECTORY.md +++ b/DIRECTORY.md @@ -1,424 +1,430 @@ ## Audio - * [Alaw](https://github.com/TheAlgorithms/C/blob/master/audio/alaw.c) + * [Alaw](https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c) ## Client Server - * [Client](https://github.com/TheAlgorithms/C/blob/master/client_server/client.c) - * [Remote Command Exec Udp Client](https://github.com/TheAlgorithms/C/blob/master/client_server/remote_command_exec_udp_client.c) - * [Remote Command Exec Udp Server](https://github.com/TheAlgorithms/C/blob/master/client_server/remote_command_exec_udp_server.c) - * [Server](https://github.com/TheAlgorithms/C/blob/master/client_server/server.c) - * [Tcp Full Duplex Client](https://github.com/TheAlgorithms/C/blob/master/client_server/tcp_full_duplex_client.c) - * [Tcp Full Duplex Server](https://github.com/TheAlgorithms/C/blob/master/client_server/tcp_full_duplex_server.c) - * [Tcp Half Duplex Client](https://github.com/TheAlgorithms/C/blob/master/client_server/tcp_half_duplex_client.c) - * [Tcp Half Duplex Server](https://github.com/TheAlgorithms/C/blob/master/client_server/tcp_half_duplex_server.c) - * [Udp Client](https://github.com/TheAlgorithms/C/blob/master/client_server/udp_client.c) - * [Udp Server](https://github.com/TheAlgorithms/C/blob/master/client_server/udp_server.c) + * [Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c) + * [Remote Command Exec Udp Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/remote_command_exec_udp_client.c) + * [Remote Command Exec Udp Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/remote_command_exec_udp_server.c) + * [Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/server.c) + * [Tcp Full Duplex Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_full_duplex_client.c) + * [Tcp Full Duplex Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_full_duplex_server.c) + * [Tcp Half Duplex Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_half_duplex_client.c) + * [Tcp Half Duplex Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_half_duplex_server.c) + * [Udp Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_client.c) + * [Udp Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_server.c) ## Conversions - * [Binary To Decimal](https://github.com/TheAlgorithms/C/blob/master/conversions/binary_to_decimal.c) - * [Binary To Hexadecimal](https://github.com/TheAlgorithms/C/blob/master/conversions/binary_to_hexadecimal.c) - * [Binary To Octal](https://github.com/TheAlgorithms/C/blob/master/conversions/binary_to_octal.c) - * [C Atoi Str To Integer](https://github.com/TheAlgorithms/C/blob/master/conversions/c_atoi_str_to_integer.c) - * [Decimal To Any Base](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_any_base.c) - * [Decimal To Binary](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_binary.c) - * [Decimal To Binary Recursion](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_binary_recursion.c) - * [Decimal To Hexa](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_hexa.c) - * [Decimal To Octal](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_octal.c) - * [Decimal To Octal Recursion](https://github.com/TheAlgorithms/C/blob/master/conversions/decimal_to_octal_recursion.c) - * [Hexadecimal To Octal](https://github.com/TheAlgorithms/C/blob/master/conversions/hexadecimal_to_octal.c) - * [Hexadecimal To Octal2](https://github.com/TheAlgorithms/C/blob/master/conversions/hexadecimal_to_octal2.c) - * [Infix To Postfix](https://github.com/TheAlgorithms/C/blob/master/conversions/infix_to_postfix.c) - * [Infix To Postfix2](https://github.com/TheAlgorithms/C/blob/master/conversions/infix_to_postfix2.c) - * [Int To String](https://github.com/TheAlgorithms/C/blob/master/conversions/int_to_string.c) - * [Octal To Binary](https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_binary.c) - * [Octal To Decimal](https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_decimal.c) - * [Octal To Hexadecimal](https://github.com/TheAlgorithms/C/blob/master/conversions/octal_to_hexadecimal.c) - * [To Decimal](https://github.com/TheAlgorithms/C/blob/master/conversions/to_decimal.c) + * [Binary To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c) + * [Binary To Hexadecimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_hexadecimal.c) + * [Binary To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_octal.c) + * [C Atoi Str To Integer](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/c_atoi_str_to_integer.c) + * [Decimal To Any Base](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_any_base.c) + * [Decimal To Binary](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_binary.c) + * [Decimal To Binary Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_binary_recursion.c) + * [Decimal To Hexa](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_hexa.c) + * [Decimal To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_octal.c) + * [Decimal To Octal Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_octal_recursion.c) + * [Hexadecimal To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/hexadecimal_to_octal.c) + * [Hexadecimal To Octal2](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/hexadecimal_to_octal2.c) + * [Infix To Postfix](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/infix_to_postfix.c) + * [Infix To Postfix2](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/infix_to_postfix2.c) + * [Int To String](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/int_to_string.c) + * [Octal To Binary](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_binary.c) + * [Octal To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_decimal.c) + * [Octal To Hexadecimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_hexadecimal.c) + * [To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/to_decimal.c) ## Data Structures * Array - * [Carray](https://github.com/TheAlgorithms/C/blob/master/data_structures/array/carray.c) - * [Carray](https://github.com/TheAlgorithms/C/blob/master/data_structures/array/carray.h) - * [Carray Tests](https://github.com/TheAlgorithms/C/blob/master/data_structures/array/carray_tests.c) + * [Carray](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray.c) + * [Carray](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray.h) + * [Carray Tests](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray_tests.c) * Binary Trees - * [Avl Tree](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/avl_tree.c) - * [Binary Search Tree](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/binary_search_tree.c) - * [Create Node](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/create_node.c) - * [Recursive Traversals](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/recursive_traversals.c) - * [Red Black Tree](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/red_black_tree.c) - * [Segment Tree](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/segment_tree.c) - * [Threaded Binary Trees](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/threaded_binary_trees.c) - * [Words Alphabetical](https://github.com/TheAlgorithms/C/blob/master/data_structures/binary_trees/words_alphabetical.c) + * [Avl Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/avl_tree.c) + * [Binary Search Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/binary_search_tree.c) + * [Create Node](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/create_node.c) + * [Recursive Traversals](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/recursive_traversals.c) + * [Red Black Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/red_black_tree.c) + * [Segment Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/segment_tree.c) + * [Threaded Binary Trees](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/threaded_binary_trees.c) + * [Words Alphabetical](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/words_alphabetical.c) * Dictionary - * [Dict](https://github.com/TheAlgorithms/C/blob/master/data_structures/dictionary/dict.c) - * [Dict](https://github.com/TheAlgorithms/C/blob/master/data_structures/dictionary/dict.h) - * [Test Program](https://github.com/TheAlgorithms/C/blob/master/data_structures/dictionary/test_program.c) + * [Dict](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/dict.c) + * [Dict](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/dict.h) + * [Test Program](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/test_program.c) * Dynamic Array - * [Dynamic Array](https://github.com/TheAlgorithms/C/blob/master/data_structures/dynamic_array/dynamic_array.c) - * [Dynamic Array](https://github.com/TheAlgorithms/C/blob/master/data_structures/dynamic_array/dynamic_array.h) - * [Main](https://github.com/TheAlgorithms/C/blob/master/data_structures/dynamic_array/main.c) + * [Dynamic Array](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/dynamic_array.c) + * [Dynamic Array](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/dynamic_array.h) + * [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/main.c) * Graphs - * [Bellman Ford](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bellman_ford.c) - * [Bfs](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bfs.c) - * [Bfs Queue](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/bfs_queue.c) - * [Dfs](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/dfs.c) - * [Dfs Recursive](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/dfs_recursive.c) - * [Dijkstra](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/dijkstra.c) - * [Euler](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/euler.c) - * [Floyd Warshall](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/floyd_warshall.c) - * [Graph](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/graph.c) - * [Graph](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/graph.h) - * [Hamiltonian](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/hamiltonian.c) - * [Kruskal](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/kruskal.c) - * [Queue](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/queue.c) - * [Queue](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/queue.h) - * [Strongly Connected Components](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/strongly_connected_components.c) - * [Topological Sort](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/topological_sort.c) - * [Transitive Closure](https://github.com/TheAlgorithms/C/blob/master/data_structures/graphs/transitive_closure.c) + * [Bellman Ford](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bellman_ford.c) + * [Bfs](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bfs.c) + * [Bfs Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bfs_queue.c) + * [Dfs](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dfs.c) + * [Dfs Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dfs_recursive.c) + * [Dijkstra](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dijkstra.c) + * [Euler](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/euler.c) + * [Floyd Warshall](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/floyd_warshall.c) + * [Graph](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/graph.c) + * [Graph](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/graph.h) + * [Hamiltonian](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/hamiltonian.c) + * [Kruskal](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/kruskal.c) + * [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/queue.c) + * [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/queue.h) + * [Strongly Connected Components](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/strongly_connected_components.c) + * [Topological Sort](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/topological_sort.c) + * [Transitive Closure](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/transitive_closure.c) * Hash Set - * [Hash Set](https://github.com/TheAlgorithms/C/blob/master/data_structures/hash_set/hash_set.c) - * [Hash Set](https://github.com/TheAlgorithms/C/blob/master/data_structures/hash_set/hash_set.h) - * [Main](https://github.com/TheAlgorithms/C/blob/master/data_structures/hash_set/main.c) + * [Hash Set](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/hash_set.c) + * [Hash Set](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/hash_set.h) + * [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/main.c) * Heap - * [Max Heap](https://github.com/TheAlgorithms/C/blob/master/data_structures/heap/max_heap.c) - * [Min Heap](https://github.com/TheAlgorithms/C/blob/master/data_structures/heap/min_heap.c) + * [Max Heap](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/heap/max_heap.c) + * [Min Heap](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/heap/min_heap.c) * Linked List - * [Ascending Priority Queue](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/ascending_priority_queue.c) - * [Circular Linked List](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/circular_linked_list.c) - * [Doubly Linked List](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/doubly_linked_list.c) - * [Merge Linked Lists](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/merge_linked_lists.c) - * [Middle Element In List](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/middle_element_in_list.c) - * [Queue Linked List](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/queue_linked_list.c) - * [Singly Link List Deletion](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/singly_link_list_deletion.c) - * [Stack Using Linked Lists](https://github.com/TheAlgorithms/C/blob/master/data_structures/linked_list/stack_using_linked_lists.c) + * [Ascending Priority Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/ascending_priority_queue.c) + * [Circular Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/circular_linked_list.c) + * [Doubly Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/doubly_linked_list.c) + * [Merge Linked Lists](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/merge_linked_lists.c) + * [Middle Element In List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/middle_element_in_list.c) + * [Queue Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/queue_linked_list.c) + * [Singly Link List Deletion](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/singly_link_list_deletion.c) + * [Stack Using Linked Lists](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/stack_using_linked_lists.c) * List - * [List](https://github.com/TheAlgorithms/C/blob/master/data_structures/list/list.c) - * [List](https://github.com/TheAlgorithms/C/blob/master/data_structures/list/list.h) - * [Main](https://github.com/TheAlgorithms/C/blob/master/data_structures/list/main.c) + * [List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/list.c) + * [List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/list.h) + * [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/main.c) * Queue - * [Include](https://github.com/TheAlgorithms/C/blob/master/data_structures/queue/include.h) - * [Queue](https://github.com/TheAlgorithms/C/blob/master/data_structures/queue/queue.c) - * [Stack](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack.c) + * [Include](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/queue/include.h) + * [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/queue/queue.c) + * [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack.c) * Stack - * [Main](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/main.c) - * [Parenthesis](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/parenthesis.c) - * [Stack](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/stack.c) - * [Stack](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/stack.h) + * [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/main.c) + * [Parenthesis](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/parenthesis.c) + * [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack.c) + * [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack.h) * Stack Linked List - * [Main](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/stack_linked_list/main.c) - * [Stack](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/stack_linked_list/stack.c) - * [Stack](https://github.com/TheAlgorithms/C/blob/master/data_structures/stack/stack_linked_list/stack.h) + * [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/main.c) + * [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/stack.c) + * [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/stack.h) * Trie - * [Trie](https://github.com/TheAlgorithms/C/blob/master/data_structures/trie/trie.c) + * [Trie](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/trie/trie.c) + * [Vector](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c) ## Developer Tools - * [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/master/developer_tools/malloc_dbg.c) - * [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/master/developer_tools/malloc_dbg.h) - * [Min Printf](https://github.com/TheAlgorithms/C/blob/master/developer_tools/min_printf.h) - * [Test Malloc Dbg](https://github.com/TheAlgorithms/C/blob/master/developer_tools/test_malloc_dbg.c) - * [Test Min Printf](https://github.com/TheAlgorithms/C/blob/master/developer_tools/test_min_printf.c) + * [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c) + * [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.h) + * [Min Printf](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/min_printf.h) + * [Test Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_malloc_dbg.c) + * [Test Min Printf](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_min_printf.c) ## Exercism * Acronym - * [Acronym](https://github.com/TheAlgorithms/C/blob/master/exercism/acronym/acronym.c) - * [Acronym](https://github.com/TheAlgorithms/C/blob/master/exercism/acronym/acronym.h) + * [Acronym](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/acronym/acronym.c) + * [Acronym](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/acronym/acronym.h) * Hello World - * [Hello World](https://github.com/TheAlgorithms/C/blob/master/exercism/hello_world/hello_world.c) - * [Hello World](https://github.com/TheAlgorithms/C/blob/master/exercism/hello_world/hello_world.h) + * [Hello World](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/hello_world/hello_world.c) + * [Hello World](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/hello_world/hello_world.h) * Isogram - * [Isogram](https://github.com/TheAlgorithms/C/blob/master/exercism/isogram/isogram.c) - * [Isogram](https://github.com/TheAlgorithms/C/blob/master/exercism/isogram/isogram.h) + * [Isogram](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/isogram/isogram.c) + * [Isogram](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/isogram/isogram.h) * Rna Transcription - * [Rna Transcription](https://github.com/TheAlgorithms/C/blob/master/exercism/rna_transcription/rna_transcription.c) - * [Rna Transcription](https://github.com/TheAlgorithms/C/blob/master/exercism/rna_transcription/rna_transcription.h) + * [Rna Transcription](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/rna_transcription/rna_transcription.c) + * [Rna Transcription](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/rna_transcription/rna_transcription.h) * Word Count - * [Word Count](https://github.com/TheAlgorithms/C/blob/master/exercism/word_count/word_count.c) - * [Word Count](https://github.com/TheAlgorithms/C/blob/master/exercism/word_count/word_count.h) + * [Word Count](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/word_count/word_count.c) + * [Word Count](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/word_count/word_count.h) ## Games - * [Naval Battle](https://github.com/TheAlgorithms/C/blob/master/games/naval_battle.c) - * [Tic Tac Toe](https://github.com/TheAlgorithms/C/blob/master/games/tic_tac_toe.c) + * [Naval Battle](https://github.com/TheAlgorithms/C/blob/HEAD/games/naval_battle.c) + * [Tic Tac Toe](https://github.com/TheAlgorithms/C/blob/HEAD/games/tic_tac_toe.c) ## Geometry - * [Geometry Datatypes](https://github.com/TheAlgorithms/C/blob/master/geometry/geometry_datatypes.h) - * [Quaternions](https://github.com/TheAlgorithms/C/blob/master/geometry/quaternions.c) - * [Vectors 3D](https://github.com/TheAlgorithms/C/blob/master/geometry/vectors_3d.c) + * [Geometry Datatypes](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/geometry_datatypes.h) + * [Quaternions](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/quaternions.c) + * [Vectors 3D](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/vectors_3d.c) ## Graphics - * [Spirograph](https://github.com/TheAlgorithms/C/blob/master/graphics/spirograph.c) + * [Spirograph](https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c) ## Greedy Approach - * [Dijkstra](https://github.com/TheAlgorithms/C/blob/master/greedy_approach/dijkstra.c) - * [Prim](https://github.com/TheAlgorithms/C/blob/master/greedy_approach/prim.c) + * [Dijkstra](https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/dijkstra.c) + * [Prim](https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/prim.c) ## Hash - * [Hash Adler32](https://github.com/TheAlgorithms/C/blob/master/hash/hash_adler32.c) - * [Hash Crc32](https://github.com/TheAlgorithms/C/blob/master/hash/hash_crc32.c) - * [Hash Djb2](https://github.com/TheAlgorithms/C/blob/master/hash/hash_djb2.c) - * [Hash Sdbm](https://github.com/TheAlgorithms/C/blob/master/hash/hash_sdbm.c) - * [Hash Xor8](https://github.com/TheAlgorithms/C/blob/master/hash/hash_xor8.c) + * [Hash Adler32](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c) + * [Hash Crc32](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_crc32.c) + * [Hash Djb2](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_djb2.c) + * [Hash Sdbm](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_sdbm.c) + * [Hash Xor8](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_xor8.c) ## Leetcode * Src - * [1](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1.c) - * [101](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/101.c) - * [104](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/104.c) - * [108](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/108.c) - * [1089](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1089.c) - * [109](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/109.c) - * [11](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/11.c) - * [110](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/110.c) - * [112](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/112.c) - * [118](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/118.c) - * [1184](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1184.c) - * [1189](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1189.c) - * [12](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/12.c) - * [1207](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/1207.c) - * [121](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/121.c) - * [125](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/125.c) - * [13](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/13.c) - * [136](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/136.c) - * [141](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/141.c) - * [142](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/142.c) - * [153](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/153.c) - * [160](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/160.c) - * [169](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/169.c) - * [173](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/173.c) - * [189](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/189.c) - * [190](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/190.c) - * [191](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/191.c) - * [2](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/2.c) - * [20](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/20.c) - * [201](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/201.c) - * [203](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/203.c) - * [206](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/206.c) - * [21](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/21.c) - * [2130](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/2130.c) - * [215](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/215.c) - * [217](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/217.c) - * [226](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/226.c) - * [231](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/231.c) - * [234](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/234.c) - * [24](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/24.c) - * [242](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/242.c) - * [26](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/26.c) - * [268](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/268.c) - * [27](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/27.c) - * [278](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/278.c) - * [28](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/28.c) - * [283](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/283.c) - * [287](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/287.c) - * [29](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/29.c) - * [3](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/3.c) - * [344](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/344.c) - * [35](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/35.c) - * [367](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/367.c) - * [38](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/38.c) - * [387](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/387.c) - * [389](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/389.c) - * [4](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/4.c) - * [404](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/404.c) - * [442](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/442.c) - * [461](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/461.c) - * [476](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/476.c) - * [509](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/509.c) - * [520](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/520.c) - * [53](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/53.c) - * [561](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/561.c) - * [6](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/6.c) - * [617](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/617.c) - * [62](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/62.c) - * [647](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/647.c) - * [66](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/66.c) - * [674](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/674.c) - * [7](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/7.c) - * [700](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/700.c) - * [701](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/701.c) - * [704](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/704.c) - * [709](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/709.c) - * [771](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/771.c) - * [8](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/8.c) - * [82](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/82.c) - * [83](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/83.c) - * [852](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/852.c) - * [876](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/876.c) - * [9](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/9.c) - * [905](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/905.c) - * [917](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/917.c) - * [938](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/938.c) - * [94](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/94.c) - * [965](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/965.c) - * [977](https://github.com/TheAlgorithms/C/blob/master/leetcode/src/977.c) + * [1](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1.c) + * [1008](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1008.c) + * [101](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/101.c) + * [1019](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1019.c) + * [104](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/104.c) + * [108](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/108.c) + * [1089](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1089.c) + * [109](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/109.c) + * [11](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/11.c) + * [110](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/110.c) + * [112](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/112.c) + * [118](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/118.c) + * [1184](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1184.c) + * [1189](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1189.c) + * [119](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/119.c) + * [12](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/12.c) + * [1207](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1207.c) + * [121](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/121.c) + * [125](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/125.c) + * [13](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/13.c) + * [136](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/136.c) + * [141](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/141.c) + * [142](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/142.c) + * [153](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/153.c) + * [160](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/160.c) + * [169](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/169.c) + * [173](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/173.c) + * [189](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/189.c) + * [190](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/190.c) + * [191](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/191.c) + * [2](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2.c) + * [20](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/20.c) + * [201](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/201.c) + * [203](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/203.c) + * [206](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/206.c) + * [21](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/21.c) + * [2130](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2130.c) + * [215](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/215.c) + * [217](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/217.c) + * [226](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/226.c) + * [231](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/231.c) + * [234](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/234.c) + * [24](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/24.c) + * [242](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/242.c) + * [26](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/26.c) + * [268](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/268.c) + * [27](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/27.c) + * [278](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/278.c) + * [28](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/28.c) + * [283](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/283.c) + * [287](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/287.c) + * [29](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/29.c) + * [3](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/3.c) + * [344](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/344.c) + * [35](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/35.c) + * [367](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/367.c) + * [38](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/38.c) + * [387](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/387.c) + * [389](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/389.c) + * [4](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/4.c) + * [404](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/404.c) + * [442](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/442.c) + * [461](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/461.c) + * [476](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/476.c) + * [485](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/485.c) + * [509](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/509.c) + * [520](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/520.c) + * [53](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/53.c) + * [561](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/561.c) + * [6](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/6.c) + * [617](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/617.c) + * [62](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/62.c) + * [63](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/63.c) + * [647](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/647.c) + * [66](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/66.c) + * [674](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/674.c) + * [7](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/7.c) + * [700](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/700.c) + * [701](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/701.c) + * [704](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/704.c) + * [709](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/709.c) + * [771](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/771.c) + * [8](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/8.c) + * [82](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/82.c) + * [83](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/83.c) + * [852](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/852.c) + * [876](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/876.c) + * [9](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/9.c) + * [905](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/905.c) + * [917](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/917.c) + * [938](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/938.c) + * [94](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/94.c) + * [965](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/965.c) + * [977](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/977.c) ## Machine Learning - * [Adaline Learning](https://github.com/TheAlgorithms/C/blob/master/machine_learning/adaline_learning.c) - * [K Means Clustering](https://github.com/TheAlgorithms/C/blob/master/machine_learning/k_means_clustering.c) - * [Kohonen Som Topology](https://github.com/TheAlgorithms/C/blob/master/machine_learning/kohonen_som_topology.c) - * [Kohonen Som Trace](https://github.com/TheAlgorithms/C/blob/master/machine_learning/kohonen_som_trace.c) + * [Adaline Learning](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c) + * [K Means Clustering](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/k_means_clustering.c) + * [Kohonen Som Topology](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_topology.c) + * [Kohonen Som Trace](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_trace.c) ## Misc - * [Armstrong Number](https://github.com/TheAlgorithms/C/blob/master/misc/armstrong_number.c) - * [Cantor Set](https://github.com/TheAlgorithms/C/blob/master/misc/cantor_set.c) - * [Cartesian To Polar](https://github.com/TheAlgorithms/C/blob/master/misc/cartesian_to_polar.c) - * [Catalan](https://github.com/TheAlgorithms/C/blob/master/misc/catalan.c) - * [Collatz](https://github.com/TheAlgorithms/C/blob/master/misc/collatz.c) - * [Demonetization](https://github.com/TheAlgorithms/C/blob/master/misc/demonetization.c) - * [Factorial](https://github.com/TheAlgorithms/C/blob/master/misc/factorial.c) - * [Factorial Large Number](https://github.com/TheAlgorithms/C/blob/master/misc/factorial_large_number.c) - * [Factorial Trailing Zeroes](https://github.com/TheAlgorithms/C/blob/master/misc/factorial_trailing_zeroes.c) - * [Fibonacci](https://github.com/TheAlgorithms/C/blob/master/misc/fibonacci.c) - * [Fibonacci Dp](https://github.com/TheAlgorithms/C/blob/master/misc/fibonacci_dp.c) - * [Fibonacci Fast](https://github.com/TheAlgorithms/C/blob/master/misc/fibonacci_fast.c) - * [Fibonacci Formula](https://github.com/TheAlgorithms/C/blob/master/misc/fibonacci_formula.c) - * [Gcd](https://github.com/TheAlgorithms/C/blob/master/misc/gcd.c) - * [Is Armstrong](https://github.com/TheAlgorithms/C/blob/master/misc/is_armstrong.c) - * [Large Factorials](https://github.com/TheAlgorithms/C/blob/master/misc/large_factorials.c) - * [Lcm](https://github.com/TheAlgorithms/C/blob/master/misc/lcm.c) - * [Lerp](https://github.com/TheAlgorithms/C/blob/master/misc/lerp.c) - * [Lexicographic Permutations](https://github.com/TheAlgorithms/C/blob/master/misc/lexicographic_permutations.c) - * [Longest Subsequence](https://github.com/TheAlgorithms/C/blob/master/misc/longest_subsequence.c) - * [Mirror](https://github.com/TheAlgorithms/C/blob/master/misc/mirror.c) - * [Palindrome](https://github.com/TheAlgorithms/C/blob/master/misc/palindrome.c) - * [Pid](https://github.com/TheAlgorithms/C/blob/master/misc/pid.c) - * [Poly Add](https://github.com/TheAlgorithms/C/blob/master/misc/poly_add.c) - * [Postfix Evaluation](https://github.com/TheAlgorithms/C/blob/master/misc/postfix_evaluation.c) - * [Prime](https://github.com/TheAlgorithms/C/blob/master/misc/prime.c) - * [Prime Factoriziation](https://github.com/TheAlgorithms/C/blob/master/misc/prime_factoriziation.c) - * [Prime Seive](https://github.com/TheAlgorithms/C/blob/master/misc/prime_seive.c) - * [Quartile](https://github.com/TheAlgorithms/C/blob/master/misc/quartile.c) - * [Rselect](https://github.com/TheAlgorithms/C/blob/master/misc/rselect.c) - * [Run Length Encoding](https://github.com/TheAlgorithms/C/blob/master/misc/run_length_encoding.c) - * [Strong Number](https://github.com/TheAlgorithms/C/blob/master/misc/strong_number.c) - * [Sudoku Solver](https://github.com/TheAlgorithms/C/blob/master/misc/sudoku_solver.c) - * [Tower Of Hanoi](https://github.com/TheAlgorithms/C/blob/master/misc/tower_of_hanoi.c) - * [Union Find](https://github.com/TheAlgorithms/C/blob/master/misc/union_find.c) + * [Armstrong Number](https://github.com/TheAlgorithms/C/blob/HEAD/misc/armstrong_number.c) + * [Cantor Set](https://github.com/TheAlgorithms/C/blob/HEAD/misc/cantor_set.c) + * [Cartesian To Polar](https://github.com/TheAlgorithms/C/blob/HEAD/misc/cartesian_to_polar.c) + * [Catalan](https://github.com/TheAlgorithms/C/blob/HEAD/misc/catalan.c) + * [Collatz](https://github.com/TheAlgorithms/C/blob/HEAD/misc/collatz.c) + * [Demonetization](https://github.com/TheAlgorithms/C/blob/HEAD/misc/demonetization.c) + * [Factorial](https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial.c) + * [Factorial Large Number](https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial_large_number.c) + * [Factorial Trailing Zeroes](https://github.com/TheAlgorithms/C/blob/HEAD/misc/factorial_trailing_zeroes.c) + * [Fibonacci](https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci.c) + * [Fibonacci Dp](https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_dp.c) + * [Fibonacci Fast](https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_fast.c) + * [Fibonacci Formula](https://github.com/TheAlgorithms/C/blob/HEAD/misc/fibonacci_formula.c) + * [Gcd](https://github.com/TheAlgorithms/C/blob/HEAD/misc/gcd.c) + * [Is Armstrong](https://github.com/TheAlgorithms/C/blob/HEAD/misc/is_armstrong.c) + * [Large Factorials](https://github.com/TheAlgorithms/C/blob/HEAD/misc/large_factorials.c) + * [Lcm](https://github.com/TheAlgorithms/C/blob/HEAD/misc/lcm.c) + * [Lerp](https://github.com/TheAlgorithms/C/blob/HEAD/misc/lerp.c) + * [Lexicographic Permutations](https://github.com/TheAlgorithms/C/blob/HEAD/misc/lexicographic_permutations.c) + * [Longest Subsequence](https://github.com/TheAlgorithms/C/blob/HEAD/misc/longest_subsequence.c) + * [Mirror](https://github.com/TheAlgorithms/C/blob/HEAD/misc/mirror.c) + * [Palindrome](https://github.com/TheAlgorithms/C/blob/HEAD/misc/palindrome.c) + * [Pid](https://github.com/TheAlgorithms/C/blob/HEAD/misc/pid.c) + * [Poly Add](https://github.com/TheAlgorithms/C/blob/HEAD/misc/poly_add.c) + * [Postfix Evaluation](https://github.com/TheAlgorithms/C/blob/HEAD/misc/postfix_evaluation.c) + * [Prime](https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime.c) + * [Prime Factoriziation](https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime_factoriziation.c) + * [Prime Seive](https://github.com/TheAlgorithms/C/blob/HEAD/misc/prime_seive.c) + * [Quartile](https://github.com/TheAlgorithms/C/blob/HEAD/misc/quartile.c) + * [Rselect](https://github.com/TheAlgorithms/C/blob/HEAD/misc/rselect.c) + * [Run Length Encoding](https://github.com/TheAlgorithms/C/blob/HEAD/misc/run_length_encoding.c) + * [Strong Number](https://github.com/TheAlgorithms/C/blob/HEAD/misc/strong_number.c) + * [Sudoku Solver](https://github.com/TheAlgorithms/C/blob/HEAD/misc/sudoku_solver.c) + * [Tower Of Hanoi](https://github.com/TheAlgorithms/C/blob/HEAD/misc/tower_of_hanoi.c) + * [Union Find](https://github.com/TheAlgorithms/C/blob/HEAD/misc/union_find.c) ## Numerical Methods - * [Durand Kerner Roots](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/durand_kerner_roots.c) - * [Gauss Elimination](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/gauss_elimination.c) - * [Gauss Seidel Method](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/gauss_seidel_method.c) - * [Lagrange Theorem](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/lagrange_theorem.c) - * [Lu Decompose](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/lu_decompose.c) - * [Mean](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/mean.c) - * [Median](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/median.c) - * [Newton Raphson Root](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/newton_raphson_root.c) - * [Ode Forward Euler](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/ode_forward_euler.c) - * [Ode Midpoint Euler](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/ode_midpoint_euler.c) - * [Ode Semi Implicit Euler](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/ode_semi_implicit_euler.c) - * [Qr Decompose](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/qr_decompose.h) - * [Qr Decomposition](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/qr_decomposition.c) - * [Qr Eigen Values](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/qr_eigen_values.c) - * [Realtime Stats](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/realtime_stats.c) - * [Simpsons 1 3Rd Rule](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/simpsons_1_3rd_rule.c) - * [Variance](https://github.com/TheAlgorithms/C/blob/master/numerical_methods/variance.c) + * [Durand Kerner Roots](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c) + * [Gauss Elimination](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/gauss_elimination.c) + * [Gauss Seidel Method](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/gauss_seidel_method.c) + * [Lagrange Theorem](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/lagrange_theorem.c) + * [Lu Decompose](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/lu_decompose.c) + * [Mean](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/mean.c) + * [Median](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/median.c) + * [Newton Raphson Root](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/newton_raphson_root.c) + * [Ode Forward Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_forward_euler.c) + * [Ode Midpoint Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_midpoint_euler.c) + * [Ode Semi Implicit Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_semi_implicit_euler.c) + * [Qr Decompose](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_decompose.h) + * [Qr Decomposition](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_decomposition.c) + * [Qr Eigen Values](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_eigen_values.c) + * [Realtime Stats](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/realtime_stats.c) + * [Simpsons 1 3Rd Rule](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/simpsons_1_3rd_rule.c) + * [Variance](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/variance.c) ## Project Euler * Problem 1 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_1/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_1/sol2.c) - * [Sol3](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_1/sol3.c) - * [Sol4](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_1/sol4.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol2.c) + * [Sol3](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol3.c) + * [Sol4](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol4.c) * Problem 10 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_10/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_10/sol2.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_10/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_10/sol2.c) * Problem 12 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_12/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_12/sol1.c) * Problem 13 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_13/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_13/sol1.c) * Problem 14 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_14/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_14/sol1.c) * Problem 15 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_15/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_15/sol1.c) * Problem 16 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_16/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_16/sol1.c) * Problem 19 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_19/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_19/sol1.c) * Problem 2 - * [So1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_2/so1.c) + * [So1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_2/so1.c) * Problem 20 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_20/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_20/sol1.c) * Problem 21 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_21/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_21/sol1.c) * Problem 22 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_22/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_22/sol1.c) * Problem 23 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_23/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_23/sol2.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_23/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_23/sol2.c) * Problem 25 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_25/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_25/sol1.c) * Problem 26 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_26/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_26/sol1.c) * Problem 3 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_3/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_3/sol2.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_3/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_3/sol2.c) * Problem 4 - * [Sol](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_4/sol.c) + * [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_4/sol.c) * Problem 401 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_401/sol1.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_401/sol1.c) * Problem 5 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_5/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_5/sol2.c) - * [Sol3](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_5/sol3.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol2.c) + * [Sol3](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol3.c) * Problem 6 - * [Sol](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_6/sol.c) + * [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_6/sol.c) * Problem 7 - * [Sol](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_7/sol.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_7/sol2.c) + * [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_7/sol.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_7/sol2.c) * Problem 8 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_8/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_8/sol2.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_8/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_8/sol2.c) * Problem 9 - * [Sol1](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_9/sol1.c) - * [Sol2](https://github.com/TheAlgorithms/C/blob/master/project_euler/problem_9/sol2.c) + * [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_9/sol1.c) + * [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_9/sol2.c) ## Searching - * [Binary Search](https://github.com/TheAlgorithms/C/blob/master/searching/binary_search.c) - * [Exponential Search](https://github.com/TheAlgorithms/C/blob/master/searching/exponential_search.c) - * [Fibonacci Search](https://github.com/TheAlgorithms/C/blob/master/searching/fibonacci_search.c) - * [Floyd Cycle Detection Algorithm](https://github.com/TheAlgorithms/C/blob/master/searching/floyd_cycle_detection_algorithm.c) - * [Interpolation Search](https://github.com/TheAlgorithms/C/blob/master/searching/interpolation_search.c) - * [Jump Search](https://github.com/TheAlgorithms/C/blob/master/searching/jump_search.c) - * [Linear Search](https://github.com/TheAlgorithms/C/blob/master/searching/linear_search.c) - * [Modified Binary Search](https://github.com/TheAlgorithms/C/blob/master/searching/modified_binary_search.c) - * [Other Binary Search](https://github.com/TheAlgorithms/C/blob/master/searching/other_binary_search.c) + * [Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c) + * [Exponential Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/exponential_search.c) + * [Fibonacci Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/fibonacci_search.c) + * [Floyd Cycle Detection Algorithm](https://github.com/TheAlgorithms/C/blob/HEAD/searching/floyd_cycle_detection_algorithm.c) + * [Interpolation Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/interpolation_search.c) + * [Jump Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/jump_search.c) + * [Linear Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/linear_search.c) + * [Modified Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/modified_binary_search.c) + * [Other Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/other_binary_search.c) * Pattern Search - * [Boyer Moore Search](https://github.com/TheAlgorithms/C/blob/master/searching/pattern_search/boyer_moore_search.c) - * [Naive Search](https://github.com/TheAlgorithms/C/blob/master/searching/pattern_search/naive_search.c) - * [Rabin Karp Search](https://github.com/TheAlgorithms/C/blob/master/searching/pattern_search/rabin_karp_search.c) - * [Sentinel Linear Search](https://github.com/TheAlgorithms/C/blob/master/searching/sentinel_linear_search.c) - * [Ternary Search](https://github.com/TheAlgorithms/C/blob/master/searching/ternary_search.c) + * [Boyer Moore Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/boyer_moore_search.c) + * [Naive Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/naive_search.c) + * [Rabin Karp Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/rabin_karp_search.c) + * [Sentinel Linear Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/sentinel_linear_search.c) + * [Ternary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/ternary_search.c) ## Sorting - * [Bead Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/bead_sort.c) - * [Binary Insertion Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/binary_insertion_sort.c) - * [Bogo Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/bogo_sort.c) - * [Bubble Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort.c) - * [Bubble Sort 2](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort_2.c) - * [Bubble Sort Recursion](https://github.com/TheAlgorithms/C/blob/master/sorting/bubble_sort_recursion.c) - * [Bucket Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/bucket_sort.c) - * [Cocktail Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/cocktail_sort.c) - * [Comb Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/comb_sort.c) - * [Counting Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/counting_sort.c) - * [Cycle Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/cycle_sort.c) - * [Gnome Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/gnome_sort.c) - * [Heap Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort.c) - * [Heap Sort 2](https://github.com/TheAlgorithms/C/blob/master/sorting/heap_sort_2.c) - * [Insertion Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort.c) - * [Insertion Sort Recursive](https://github.com/TheAlgorithms/C/blob/master/sorting/insertion_sort_recursive.c) - * [Merge Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c) - * [Merge Sort Nr](https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort_nr.c) - * [Multikey Quick Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/multikey_quick_sort.c) - * [Odd Even Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/odd_even_sort.c) - * [Pancake Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/pancake_sort.c) - * [Partition Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/partition_sort.c) - * [Pigeonhole Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/pigeonhole_sort.c) - * [Quick Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/quick_sort.c) - * [Radix Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/radix_sort.c) - * [Radix Sort 2](https://github.com/TheAlgorithms/C/blob/master/sorting/radix_sort_2.c) - * [Random Quick Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/random_quick_sort.c) - * [Selection Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort.c) - * [Selection Sort Recursive](https://github.com/TheAlgorithms/C/blob/master/sorting/selection_sort_recursive.c) - * [Shaker Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/shaker_sort.c) - * [Shell Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/shell_sort.c) - * [Shell Sort2](https://github.com/TheAlgorithms/C/blob/master/sorting/shell_sort2.c) - * [Stooge Sort](https://github.com/TheAlgorithms/C/blob/master/sorting/stooge_sort.c) + * [Bead Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c) + * [Binary Insertion Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/binary_insertion_sort.c) + * [Bogo Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bogo_sort.c) + * [Bubble Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort.c) + * [Bubble Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort_2.c) + * [Bubble Sort Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort_recursion.c) + * [Bucket Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bucket_sort.c) + * [Cocktail Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/cocktail_sort.c) + * [Comb Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/comb_sort.c) + * [Counting Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/counting_sort.c) + * [Cycle Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/cycle_sort.c) + * [Gnome Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/gnome_sort.c) + * [Heap Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/heap_sort.c) + * [Heap Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/heap_sort_2.c) + * [Insertion Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/insertion_sort.c) + * [Insertion Sort Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/insertion_sort_recursive.c) + * [Merge Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/merge_sort.c) + * [Merge Sort Nr](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/merge_sort_nr.c) + * [Multikey Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/multikey_quick_sort.c) + * [Odd Even Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/odd_even_sort.c) + * [Pancake Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pancake_sort.c) + * [Partition Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/partition_sort.c) + * [Pigeonhole Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pigeonhole_sort.c) + * [Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/quick_sort.c) + * [Radix Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/radix_sort.c) + * [Radix Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/radix_sort_2.c) + * [Random Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/random_quick_sort.c) + * [Selection Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/selection_sort.c) + * [Selection Sort Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/selection_sort_recursive.c) + * [Shaker Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shaker_sort.c) + * [Shell Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shell_sort.c) + * [Shell Sort2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shell_sort2.c) + * [Stooge Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/stooge_sort.c) diff --git a/leetcode/DIRECTORY.md b/leetcode/DIRECTORY.md new file mode 100644 index 00000000..0de9c220 --- /dev/null +++ b/leetcode/DIRECTORY.md @@ -0,0 +1,95 @@ +# LeetCode + +### LeetCode Algorithm + +| # | Title | Solution | Difficulty | +| ---- | ------------------------------------------------------------------------------------------------------------------------------- | ----------------- | ---------- | +| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [C](./src/1.c) | Easy | +| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [C](./src/2.c) | Medium | +| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [C](./src/3.c) | Medium | +| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [C](./src/4.c) | Hard | +| 6 | [ZigZag conversion](https://leetcode.com/problems/zigzag-conversion/) | [C](./src/4.c) | Medium | +| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [C](./src/7.c) | Easy | +| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [C](./src/8.c) | Medium | +| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [C](./src/9.c) | Easy | +| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [C](./src/11.c) | Medium | +| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [C](./src/12.c) | Medium | +| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [C](./src/13.c) | Easy | +| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [C](./src/20.c) | Easy | +| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [C](./src/21.c) | Easy | +| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [C](./src/24.c) | Medium | +| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [C](./src/26.c) | Easy | +| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [C](./src/27.c) | Easy | +| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | [C](./src/28.c) | Easy | +| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [C](./src/29.c) | Medium | +| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [C](./src/35.c) | Easy | +| 38 | [Count and Say](https://leetcode.com/problems/count-and-say/) | [C](./src/38.c) | Easy | +| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [C](./src/53.c) | Easy | +| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths/description/) | [C](./src/62.c) | Medium | +| 66 | [Plus One](https://leetcode.com/problems/plus-one/) | [C](./src/66.c) | Easy | +| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [C](./src/82.c) | Medium | +| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [C](./src/83.c) | Easy | +| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [C](./src/94.c) | Medium | +| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [C](./src/101.c) | Easy | +| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [C](./src/104.c) | Easy | +| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [C](./src/108.c) | Easy | +| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [C](./src/109.c) | Medium | +| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [C](./src/110.c) | Easy | +| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [C](./src/112.c) | Easy | +| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [C](./src/118.c) | Easy | +| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [C](./src/121.c) | Easy | +| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [C](./src/125.c) | Easy | +| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [C](./src/136.c) | Easy | +| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [C](./src/141.c) | Easy | +| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [C](./src/142.c) | Medium | +| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [C](./src/153.c) | Medium | +| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [C](./src/160.c) | Easy | +| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | [C](./src/169.c) | Easy | +| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [C](./src/173.c) | Medium | +| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [C](./src/189.c) | Easy | +| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [C](./src/190.c) | Easy | +| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C](./src/191.c) | Easy | +| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C](./src/201.c) | Medium | +| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [C](./src/203.c) | Easy | +| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C](./src/206.c) | Easy | +| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c) | Medium | +| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c) | Easy | +| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C](./src/226.c) | Easy | +| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C](./src/231.c) | Easy | +| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [C](./src/234.c) | Easy | +| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [C](./src/242.c) | Easy | +| 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [C](./src/268.c) | Easy | +| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [C](./src/278.c) | Easy | +| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [C](./src/283.c) | Easy | +| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [C](./src/287.c) | Medium | +| 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [C](./src/344.c) | Easy | +| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | [C](./src/367.c) | Easy | +| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [C](./src/387.c) | Easy | +| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | [C](./src/389.c) | Easy | +| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [C](./src/404.c) | Easy | +| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | [C](./src/442.c) | Medium | +| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [C](./src/461.c) | Easy | +| 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | [C](./src/476.c) | Easy | +| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [C](./src/509.c) | Easy | +| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | [C](./src/520.c) | Easy | +| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/) | [C](./src/561.c) | Easy | +| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | [C](./src/617.c) | Easy | +| 647 | [Palindromic Substring](https://leetcode.com/problems/palindromic-substrings/) | [C](./src/647.c) | Medium | +| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | [C](./src/674.c) | Easy | +| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [C](./src/700.c) | Easy | +| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [C](./src/701.c) | Medium | +| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [C](./src/704.c) | Easy | +| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case/) | [C](./src/709.c) | Easy | +| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | [C](./src/771.c) | Easy | +| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [C](./src/852.c) | Easy | +| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [C](./src/876.c) | Easy | +| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [C](./src/905.c) | Easy | +| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/) | [C](./src/917.c) | Easy | +| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | [C](./src/938.c) | Easy | +| 965 | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/) | [C](./src/965.c) | Easy | +| 977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [C](./src/977.c) | Easy | +| 1089 | [Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | [C](./src/1089.c) | Easy | +| 1184 | [Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/) | [C](./src/1184.c) | Easy | +| 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) | [C](./src/1189.c) | Easy | +| 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [C](./src/1207.c) | Easy | +| 2130 | [Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/) | [C](./src/2130.c) | Medium | diff --git a/leetcode/README.md b/leetcode/README.md index 1b4f86dd..4d258034 100644 --- a/leetcode/README.md +++ b/leetcode/README.md @@ -1,100 +1,79 @@ -# LeetCode +# πŸ“š Contributing πŸ“š -### LeetCode Algorithm +We're glad you're interested in adding C LeetCode solutions to the repository.\ +Here we'll be explaining how to contribute to LeetCode solutions properly. -| # | Title | Solution | Difficulty | -| ---- | ------------------------------------------------------------------------------------------------------------------------------- | ----------------- | ---------- | -| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [C](./src/1.c) | Easy | -| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [C](./src/2.c) | Medium | -| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [C](./src/3.c) | Medium | -| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [C](./src/4.c) | Hard | -| 6 | [ZigZag conversion](https://leetcode.com/problems/zigzag-conversion/) | [C](./src/4.c) | Medium | -| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [C](./src/7.c) | Easy | -| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [C](./src/8.c) | Medium | -| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [C](./src/9.c) | Easy | -| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [C](./src/11.c) | Medium | -| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [C](./src/12.c) | Medium | -| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [C](./src/13.c) | Easy | -| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [C](./src/20.c) | Easy | -| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [C](./src/21.c) | Easy | -| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [C](./src/24.c) | Medium | -| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [C](./src/26.c) | Easy | -| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [C](./src/27.c) | Easy | -| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | [C](./src/28.c) | Easy | -| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [C](./src/29.c) | Medium | -| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [C](./src/35.c) | Easy | -| 38 | [Count and Say](https://leetcode.com/problems/count-and-say/) | [C](./src/38.c) | Easy | -| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [C](./src/53.c) | Easy | -| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths/description/) | [C](./src/62.c) | Medium | -| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | [C](./src/63.c) | Medium | -| 66 | [Plus One](https://leetcode.com/problems/plus-one/) | [C](./src/66.c) | Easy | -| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [C](./src/82.c) | Medium | -| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [C](./src/83.c) | Easy | -| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [C](./src/94.c) | Medium | -| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [C](./src/101.c) | Easy | -| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [C](./src/104.c) | Easy | -| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [C](./src/108.c) | Easy | -| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [C](./src/109.c) | Medium | -| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [C](./src/110.c) | Easy | -| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [C](./src/112.c) | Easy | -| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [C](./src/118.c) | Easy | -| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | [C](./src/119.c) | Easy | -| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [C](./src/121.c) | Easy | -| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [C](./src/125.c) | Easy | -| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [C](./src/136.c) | Easy | -| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [C](./src/141.c) | Easy | -| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [C](./src/142.c) | Medium | -| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [C](./src/153.c) | Medium | -| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [C](./src/160.c) | Easy | -| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | [C](./src/169.c) | Easy | -| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [C](./src/173.c) | Medium | -| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [C](./src/189.c) | Easy | -| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [C](./src/190.c) | Easy | -| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C](./src/191.c) | Easy | -| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C](./src/201.c) | Medium | -| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [C](./src/203.c) | Easy | -| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C](./src/206.c) | Easy | -| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c) | Medium | -| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c) | Easy | -| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C](./src/226.c) | Easy | -| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C](./src/231.c) | Easy | -| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [C](./src/234.c) | Easy | -| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [C](./src/242.c) | Easy | -| 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [C](./src/268.c) | Easy | -| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [C](./src/278.c) | Easy | -| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [C](./src/283.c) | Easy | -| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [C](./src/287.c) | Medium | -| 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [C](./src/344.c) | Easy | -| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | [C](./src/367.c) | Easy | -| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [C](./src/387.c) | Easy | -| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | [C](./src/389.c) | Easy | -| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [C](./src/404.c) | Easy | -| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | [C](./src/442.c) | Medium | -| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [C](./src/461.c) | Easy | -| 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | [C](./src/476.c) | Easy | -| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | [C](./src/485.c) | Easy | -| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [C](./src/509.c) | Easy | -| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | [C](./src/520.c) | Easy | -| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/) | [C](./src/561.c) | Easy | -| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | [C](./src/617.c) | Easy | -| 647 | [Palindromic Substring](https://leetcode.com/problems/palindromic-substrings/) | [C](./src/647.c) | Medium | -| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | [C](./src/674.c) | Easy | -| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [C](./src/700.c) | Easy | -| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [C](./src/701.c) | Medium | -| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [C](./src/704.c) | Easy | -| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case/) | [C](./src/709.c) | Easy | -| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | [C](./src/771.c) | Easy | -| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [C](./src/852.c) | Easy | -| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [C](./src/876.c) | Easy | -| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [C](./src/905.c) | Easy | -| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/) | [C](./src/917.c) | Easy | -| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | [C](./src/938.c) | Easy | -| 965 | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/) | [C](./src/965.c) | Easy | -| 977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [C](./src/977.c) | Easy | -| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/description/) | [C](./src/1008.c) | Medium | -| 1019 | [Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/) | [C](./src/1019.c) | Medium | -| 1089 | [Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | [C](./src/1089.c) | Easy | -| 1184 | [Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/) | [C](./src/1184.c) | Easy | -| 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) | [C](./src/1189.c) | Easy | -| 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [C](./src/1207.c) | Easy | -| 2130 | [Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/) | [C](./src/2130.c) | Medium | +## πŸ’» Cloning/setting up the project πŸ’» + +First off, you'll need to fork the repository [**here**](https://github.com/TheAlgorithms/C/fork).\ +Then, you'll need to clone the repository to your local machine. + +```bash +git clone https://github.com/your-username/C.git +``` + +After that, you'll need to create a new branch for your solution. + +```bash +git checkout -b solution/your-solution-name +``` + +## πŸ“ Adding a new solution πŸ“ + +All LeetCode problems can be found [**here**](https://leetcode.com/problemset/all/).\ +If you have a solution to any of these problems (which are not being [**repeated**](https://github.com/TheAlgorithms/C/blob/master/leetcode/DIRECTORY.md)), that's great! Here are the steps: + +1. Add a new file in `leetcode/src` with the number of the problem.\ + - For example: if the problem's number is 98, the filename should be `98.c`. +2. Provide a small description of the solution at the top of the file. A function should go below that. For example: + +```c +/** + * Return an array of arrays of size *returnSize. + * The sizes of the arrays are returned as *returnColumnSizes array. + * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). + */ +``` + +3. Do not provide a `main` function. Use the required standalone functions instead. +4. Doxygen documentation isn't used in LeetCode solutions. Simple/small documentation or comments should be fine. +5. Don't include libraries/headers such as `stdio.h`. Your file should be the solution to the problem only. + +### πŸ“œ Adding your new solution to the list πŸ“œ + +Great! You've added your solution. Now, you'll have to add it to `leetcode/DIRECTORY.md`.\ +Please use numerical order. For example: if the solution's number is `98`, add your solution after `97`, if available. + +This is the required format for new solutinos: + +```markdown +... +| | []() | [C](./src/.c) | | +... +``` + +## πŸ“¦ Committing your changes πŸ“¦ + +Once you're done with adding a new LeetCode solution, it's time we make a pull request. + +1. First, stage your changes. + +```bash +git add leetcode/src/98.c # Use `git add .` to stage all changes. +``` + +2. Then, commit your changes. + +```bash +git commit -m "feat: add LeetCode problem 98" -m "Commit description" # Optional +``` + +3. Finally, push your changes to your forked repository. + +```bash +git push origin solution/your-solution-name:solution/your-solution-name +``` + +4. You're done now! You just have to make a [**pull request**](https://github.com/TheAlgorithms/C/compare). πŸŽ‰ + +If you need any help, don't hesitate to ask and join our [**Discord server**](https://the-algorithms.com/discord)! πŸ™‚