{"id":20492801,"url":"https://github.com/kartikmehta8/implementations","last_synced_at":"2026-06-05T17:32:06.096Z","repository":{"id":178827021,"uuid":"662146464","full_name":"kartikmehta8/implementations","owner":"kartikmehta8","description":"Implementation of Data Structures in C++","archived":false,"fork":false,"pushed_at":"2023-07-24T07:20:39.000Z","size":125,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-16T05:55:22.215Z","etag":null,"topics":["cpp","data-structures"],"latest_commit_sha":null,"homepage":"https://kartikmehta8.github.io/implementations","language":"C++","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kartikmehta8.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-07-04T13:03:22.000Z","updated_at":"2023-07-25T15:35:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"39f9e415-c3cb-447c-ade8-c764bbf76fb6","html_url":"https://github.com/kartikmehta8/implementations","commit_stats":null,"previous_names":["kartikmehta8/implementations"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikmehta8%2Fimplementations","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikmehta8%2Fimplementations/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikmehta8%2Fimplementations/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kartikmehta8%2Fimplementations/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kartikmehta8","download_url":"https://codeload.github.com/kartikmehta8/implementations/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242074037,"owners_count":20067960,"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":["cpp","data-structures"],"created_at":"2024-11-15T17:30:58.820Z","updated_at":"2025-03-05T17:42:35.860Z","avatar_url":"https://github.com/kartikmehta8.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Implementations\n\n### RECURSION LEETCODE\n- [Reverse String](recursion_leetcode/reverse_string.cpp)\n- [Climbing Stairs](recursion_leetcode/climbing_stairs.cpp)\n- [Swap Node In Pairs](recursion_leetcode/swap_node_in_pairs.cpp)\n- [Reverse Link List](recursion_leetcode/reverse_link_list.cpp)\n- [Maximum Depth Of A Binary Tree](recursion_leetcode/maximum_depth_of_a_binary_tree.cpp)\n- [Search In A Binary Search Tree](recursion_leetcode/search_in_a_binary_search_tree.cpp)\n- [Fibonacci Number](recursion_leetcode/fibonacci_number.cpp)\n- [Power N Of X](recursion_leetcode/power_n_of_x.cpp)\n### BINARY TREE\n- [Postorder Traversal](binary_tree/postorder_traversal.cpp)\n- [Diameter Of A Tree](binary_tree/diameter_of_a_tree.cpp)\n- [Preorder Traversal](binary_tree/preorder_traversal.cpp)\n- [Inorder Traversal](binary_tree/inorder_traversal.cpp)\n- [Height Of A Binary Tree](binary_tree/height_of_a_binary_tree.cpp)\n- [All Tree Traversals](binary_tree/all_tree_traversals.cpp)\n- [Level Order Traversal](binary_tree/level_order_traversal.cpp)\n### STACK\n- [Minimum Remove To Make Valid Parenthesis](stack/minimum_remove_to_make_valid_parenthesis.cpp)\n- [Implement Stack](stack/implement_stack.cpp)\n- [Maximum Nesting Depth Of Parenthesis](stack/maximum_nesting_depth_of_parenthesis.cpp)\n- [Next Greater Element 1](stack/next_greater_element_1.cpp)\n- [Minimum Number Of Swaps To Make String Balanced](stack/minimum_number_of_swaps_to_make_string_balanced.cpp)\n- [Minimum Add To Make Parenthesis Valid](stack/minimum_add_to_make_parenthesis_valid.cpp)\n- [Balenced Parenthesis](stack/balenced_parenthesis.cpp)\n### SORTING LEETCODE\n- [Kth Largest Element In An Array](sorting_leetcode/kth_largest_element_in_an_array.cpp)\n- [Sort Colors](sorting_leetcode/sort_colors.cpp)\n- [Top K Frequent Elements](sorting_leetcode/top_k_frequent_elements.cpp)\n- [Sort An Array](sorting_leetcode/sort_an_array.cpp)\n- [Height Checker](sorting_leetcode/height_checker.cpp)\n- [Bubble Sort](sorting_leetcode/bubble_sort.cpp)\n- [Max Gap](sorting_leetcode/max_gap.cpp)\n- [Minimum Absolute Difference](sorting_leetcode/minimum_absolute_difference.cpp)\n- [Insertion Sort](sorting_leetcode/insertion_sort.cpp)\n- [Insertion Sort Array](sorting_leetcode/insertion_sort_array.cpp)\n- [Selection Sort](sorting_leetcode/selection_sort.cpp)\n### STRINGS\n- [Implement Atoi Function](strings/implement_atoi_function.cpp)\n- [Maximum Nesting Depth Of The Parenthesis](strings/maximum_nesting_depth_of_the_parenthesis.cpp)\n- [Longest Common Prefix](strings/longest_common_prefix.cpp)\n- [Rotate String](strings/rotate_string.cpp)\n- [Reverse Words In A String](strings/reverse_words_in_a_string.cpp)\n- [Anagram Pairs](strings/anagram_pairs.cpp)\n- [Largest Odd Number In A String](strings/largest_odd_number_in_a_string.cpp)\n- [Isomorphic Strings](strings/isomorphic_strings.cpp)\n### BINARY SEARCH\n- [Search In A Sorted 2d Matrix](binary_search/search_in_a_sorted_2D_matrix.cpp)\n- [Search In Rotated Sorted Array 1](binary_search/search_in_rotated_sorted_array_1.cpp)\n- [Search In A 2d Matrix](binary_search/search_in_a_2D_matrix.cpp)\n- [Row With Max 1](binary_search/row_with_max_1.cpp)\n- [Find Minimum In Rotated Sorted Array](binary_search/find_minimum_in_rotated_sorted_array.cpp)\n- [Single Element In A Sorted Array](binary_search/single_element_in_a_sorted_array.cpp)\n- [First And Last Occurence Of Element](binary_search/first_and_last_occurence_of_element.cpp)\n- [Binary Search](binary_search/binary_search.cpp)\n- [Search Insert Position](binary_search/search_insert_position.cpp)\n- [Lower Bound](binary_search/lower_bound.cpp)\n- [Search In Rotated Sorted Array 2](binary_search/search_in_rotated_sorted_array_2.cpp)\n- [Square Root Of A Number](binary_search/square_root_of_a_number.cpp)\n- [Number Of Occurences](binary_search/number_of_occurences.cpp)\n- [Upper Bound](binary_search/upper_bound.cpp)\n- [Find How Many Times Array Is Rotated](binary_search/find_how_many_times_array_is_rotated.cpp)\n- [Ceil And Floor](binary_search/ceil_and_floor.cpp)\n### BIT MANIPULATION\n- [Swap Two Numbers](bit_manipulation/swap_two_numbers.cpp)\n- [Divide Two Integers](bit_manipulation/divide_two_integers.cpp)\n- [Count Set Bits](bit_manipulation/count_set_bits.cpp)\n- [Check Kth Bit Is Set Or Not](bit_manipulation/check_kth_bit_is_set_or_not.cpp)\n- [Odd Even](bit_manipulation/odd_even.cpp)\n- [Power Of Two](bit_manipulation/power_of_two.cpp)\n- [Set The Rightmost Unset Bit](bit_manipulation/set_the_rightmost_unset_bit.cpp)\n- [Introduction](bit_manipulation/introduction.cpp)\n### LINK LIST\n- [Length Of Link List](link_list/length_of_link_list.cpp)\n- [Delete Last Node Of Doubly Link List](link_list/delete_last_node_of_doubly_link_list.cpp)\n- [Delete Middle Node Of Link List](link_list/delete_middle_node_of_link_list.cpp)\n- [Insert At End Of Doubly Link List](link_list/insert_at_end_of_doubly_link_list.cpp)\n- [Check If Link List Is Palindrome](link_list/check_if_link_list_is_palindrome.cpp)\n- [Introduction To Doubly Link List](link_list/introduction_to_doubly_link_list.cpp)\n- [Reverse A Doubly Link List](link_list/reverse_a_doubly_link_list.cpp)\n- [Cycle Detection In Singly Link List](link_list/cycle_detection_in_singly_link_list.cpp)\n- [Insert Node At The Beginning](link_list/insert_node_at_the_beginning.cpp)\n- [Delete Last Node](link_list/delete_last_node.cpp)\n- [Middle Of Link List](link_list/middle_of_link_list.cpp)\n- [Iterative Link List Reverse](link_list/iterative_link_list_reverse.cpp)\n- [Search In A Link List](link_list/search_in_a_link_list.cpp)\n- [Introduction To Link List](link_list/introduction_to_link_list.cpp)\n- [Sort Link List](link_list/sort_link_list.cpp)\n- [Find Length Of Loop](link_list/find_length_of_loop.cpp)\n- [Link List Cycle 2](link_list/link_list_cycle_2.cpp)\n### ARRAYS\n- [Largest Element In An Array](arrays/largest_element_in_an_array.cpp)\n- [Missing Number](arrays/missing_number.cpp)\n- [Intersection Of Two Elements](arrays/intersection_of_two_elements.cpp)\n- [Left Rotate Array By 1](arrays/left_rotate_array_by_1.cpp)\n- [Union Of Two Arrays](arrays/union_of_two_arrays.cpp)\n- [Maximum Consecutive Number Of Ones](arrays/maximum_consecutive_number_of_ones.cpp)\n- [Rotate Array By D Places](arrays/rotate_array_by_d_places.cpp)\n- [Kadane Algorithm](arrays/kadane_algorithm.cpp)\n- [Sort An Array Of Zeros Ones Twos](arrays/sort_an_array_of_zeros_ones_twos.cpp)\n- [Remove Duplicates](arrays/remove_duplicates.cpp)\n- [Longest Consecutive Sequence](arrays/longest_consecutive_sequence.cpp)\n- [Rearrange Elements By Sign](arrays/rearrange_elements_by_sign.cpp)\n- [Best Time To Buy And Sell Stock](arrays/best_time_to_buy_and_sell_stock.cpp)\n- [Find The Element That Appear Once](arrays/find_the_element_that_appear_once.cpp)\n- [Check If Array Is Sorted](arrays/check_if_array_is_sorted.cpp)\n- [Move Zeros](arrays/move_zeros.cpp)\n- [Two Sum](arrays/two_sum.cpp)\n- [Next Permutation](arrays/next_permutation.cpp)\n- [Second Largest Element](arrays/second_largest_element.cpp)\n- [Majority Element 1](arrays/majority_element_1.cpp)\n- [Majority Element 2](arrays/majority_element_2.cpp)\n- [Linear Search](arrays/linear_search.cpp)\n- [Leaders In An Array](arrays/leaders_in_an_array.cpp)\n### TRIES\n- [Implement Trie 2](tries/implement_trie_2.cpp)\n- [Implement Trie](tries/implement_trie.cpp)\n### HASHING\n- [Longest Substring Without Repeating Characters](hashing/longest_substring_without_repeating_characters.cpp)\n- [Four Sum](hashing/four_sum.cpp)\n- [Least Recently Used Cache](hashing/least_recently_used_cache.cpp)\n- [Longest Consecutive Sequence](hashing/longest_consecutive_sequence.cpp)\n- [Job Sequencing Problem](hashing/job_sequencing_problem.cpp)\n- [Two Sum](hashing/two_sum.cpp)\n### BASICS\n- [Count Digits](basics/count_digits.cpp)\n- [Sum Of First N Numbers](basics/sum_of_first_n_numbers.cpp)\n- [Check Prime](basics/check_prime.cpp)\n- [Factorial](basics/factorial.cpp)\n- [Else If](basics/else_if.cpp)\n- [Highest Lowest Frequency Elements](basics/highest_lowest_frequency_elements.cpp)\n- [Calculate Gcd](basics/calculate_gcd.cpp)\n- [Switch Case Statement](basics/switch_case_statement.cpp)\n- [Sum Of All Divisors](basics/sum_of_all_divisors.cpp)\n- [Reverse An Array](basics/reverse_an_array.cpp)\n- [N To 1 Without Loop](basics/n_to_1_without_loop.cpp)\n- [Functions](basics/functions.cpp)\n- [Print Fibonacci Series](basics/print_fibonacci_series.cpp)\n- [Data Type](basics/data_type.cpp)\n- [Code Frequency In A Range](basics/code_frequency_in_a_range.cpp)\n- [1 To N Without Loop](basics/1_to_n_without_loop.cpp)\n- [Sum Of Even And Odd](basics/sum_of_even_and_odd.cpp)\n- [Reverse Integer](basics/reverse_integer.cpp)\n- [Armstrong Number](basics/armstrong_number.cpp)\n- [Nth Fibonacci Number](basics/nth_fibonacci_number.cpp)\n- [Print N Times](basics/print_n_times.cpp)\n- [Palindrome Number](basics/palindrome_number.cpp)\n- [Check Palindrome Recursive](basics/check_palindrome_recursive.cpp)\n- [Find Character Case](basics/find_character_case.cpp)\n\n\n\u003ch3\u003e\u003cp align=\"center\"\u003e137 problems solved till July 24, 2023\u003c/p\u003e\u003c/h3\u003e\n\n\u003ch3\u003e\u003cp align=\"center\"\u003eImplemented with ❤️ by \u003ca href=\"https://www.kartikmehta.xyz\"\u003ekartikmehta8\u003c/a\u003e\u003c/p\u003e\u003c/h3\u003e\n\n\u003ch6\u003e\u003cp align=\"center\"\u003eAutomated by GitHub Actions\u003c/p\u003e\u003c/h6\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkartikmehta8%2Fimplementations","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkartikmehta8%2Fimplementations","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkartikmehta8%2Fimplementations/lists"}