https://github.com/kartikmehta8/implementations
Implementation of Data Structures in C++
https://github.com/kartikmehta8/implementations
cpp data-structures
Last synced: 3 months ago
JSON representation
Implementation of Data Structures in C++
- Host: GitHub
- URL: https://github.com/kartikmehta8/implementations
- Owner: kartikmehta8
- Created: 2023-07-04T13:03:22.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2023-07-24T07:20:39.000Z (almost 2 years ago)
- Last Synced: 2025-01-16T05:55:22.215Z (4 months ago)
- Topics: cpp, data-structures
- Language: C++
- Homepage: https://kartikmehta8.github.io/implementations
- Size: 122 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Implementations
### RECURSION LEETCODE
- [Reverse String](recursion_leetcode/reverse_string.cpp)
- [Climbing Stairs](recursion_leetcode/climbing_stairs.cpp)
- [Swap Node In Pairs](recursion_leetcode/swap_node_in_pairs.cpp)
- [Reverse Link List](recursion_leetcode/reverse_link_list.cpp)
- [Maximum Depth Of A Binary Tree](recursion_leetcode/maximum_depth_of_a_binary_tree.cpp)
- [Search In A Binary Search Tree](recursion_leetcode/search_in_a_binary_search_tree.cpp)
- [Fibonacci Number](recursion_leetcode/fibonacci_number.cpp)
- [Power N Of X](recursion_leetcode/power_n_of_x.cpp)
### BINARY TREE
- [Postorder Traversal](binary_tree/postorder_traversal.cpp)
- [Diameter Of A Tree](binary_tree/diameter_of_a_tree.cpp)
- [Preorder Traversal](binary_tree/preorder_traversal.cpp)
- [Inorder Traversal](binary_tree/inorder_traversal.cpp)
- [Height Of A Binary Tree](binary_tree/height_of_a_binary_tree.cpp)
- [All Tree Traversals](binary_tree/all_tree_traversals.cpp)
- [Level Order Traversal](binary_tree/level_order_traversal.cpp)
### STACK
- [Minimum Remove To Make Valid Parenthesis](stack/minimum_remove_to_make_valid_parenthesis.cpp)
- [Implement Stack](stack/implement_stack.cpp)
- [Maximum Nesting Depth Of Parenthesis](stack/maximum_nesting_depth_of_parenthesis.cpp)
- [Next Greater Element 1](stack/next_greater_element_1.cpp)
- [Minimum Number Of Swaps To Make String Balanced](stack/minimum_number_of_swaps_to_make_string_balanced.cpp)
- [Minimum Add To Make Parenthesis Valid](stack/minimum_add_to_make_parenthesis_valid.cpp)
- [Balenced Parenthesis](stack/balenced_parenthesis.cpp)
### SORTING LEETCODE
- [Kth Largest Element In An Array](sorting_leetcode/kth_largest_element_in_an_array.cpp)
- [Sort Colors](sorting_leetcode/sort_colors.cpp)
- [Top K Frequent Elements](sorting_leetcode/top_k_frequent_elements.cpp)
- [Sort An Array](sorting_leetcode/sort_an_array.cpp)
- [Height Checker](sorting_leetcode/height_checker.cpp)
- [Bubble Sort](sorting_leetcode/bubble_sort.cpp)
- [Max Gap](sorting_leetcode/max_gap.cpp)
- [Minimum Absolute Difference](sorting_leetcode/minimum_absolute_difference.cpp)
- [Insertion Sort](sorting_leetcode/insertion_sort.cpp)
- [Insertion Sort Array](sorting_leetcode/insertion_sort_array.cpp)
- [Selection Sort](sorting_leetcode/selection_sort.cpp)
### STRINGS
- [Implement Atoi Function](strings/implement_atoi_function.cpp)
- [Maximum Nesting Depth Of The Parenthesis](strings/maximum_nesting_depth_of_the_parenthesis.cpp)
- [Longest Common Prefix](strings/longest_common_prefix.cpp)
- [Rotate String](strings/rotate_string.cpp)
- [Reverse Words In A String](strings/reverse_words_in_a_string.cpp)
- [Anagram Pairs](strings/anagram_pairs.cpp)
- [Largest Odd Number In A String](strings/largest_odd_number_in_a_string.cpp)
- [Isomorphic Strings](strings/isomorphic_strings.cpp)
### BINARY SEARCH
- [Search In A Sorted 2d Matrix](binary_search/search_in_a_sorted_2D_matrix.cpp)
- [Search In Rotated Sorted Array 1](binary_search/search_in_rotated_sorted_array_1.cpp)
- [Search In A 2d Matrix](binary_search/search_in_a_2D_matrix.cpp)
- [Row With Max 1](binary_search/row_with_max_1.cpp)
- [Find Minimum In Rotated Sorted Array](binary_search/find_minimum_in_rotated_sorted_array.cpp)
- [Single Element In A Sorted Array](binary_search/single_element_in_a_sorted_array.cpp)
- [First And Last Occurence Of Element](binary_search/first_and_last_occurence_of_element.cpp)
- [Binary Search](binary_search/binary_search.cpp)
- [Search Insert Position](binary_search/search_insert_position.cpp)
- [Lower Bound](binary_search/lower_bound.cpp)
- [Search In Rotated Sorted Array 2](binary_search/search_in_rotated_sorted_array_2.cpp)
- [Square Root Of A Number](binary_search/square_root_of_a_number.cpp)
- [Number Of Occurences](binary_search/number_of_occurences.cpp)
- [Upper Bound](binary_search/upper_bound.cpp)
- [Find How Many Times Array Is Rotated](binary_search/find_how_many_times_array_is_rotated.cpp)
- [Ceil And Floor](binary_search/ceil_and_floor.cpp)
### BIT MANIPULATION
- [Swap Two Numbers](bit_manipulation/swap_two_numbers.cpp)
- [Divide Two Integers](bit_manipulation/divide_two_integers.cpp)
- [Count Set Bits](bit_manipulation/count_set_bits.cpp)
- [Check Kth Bit Is Set Or Not](bit_manipulation/check_kth_bit_is_set_or_not.cpp)
- [Odd Even](bit_manipulation/odd_even.cpp)
- [Power Of Two](bit_manipulation/power_of_two.cpp)
- [Set The Rightmost Unset Bit](bit_manipulation/set_the_rightmost_unset_bit.cpp)
- [Introduction](bit_manipulation/introduction.cpp)
### LINK LIST
- [Length Of Link List](link_list/length_of_link_list.cpp)
- [Delete Last Node Of Doubly Link List](link_list/delete_last_node_of_doubly_link_list.cpp)
- [Delete Middle Node Of Link List](link_list/delete_middle_node_of_link_list.cpp)
- [Insert At End Of Doubly Link List](link_list/insert_at_end_of_doubly_link_list.cpp)
- [Check If Link List Is Palindrome](link_list/check_if_link_list_is_palindrome.cpp)
- [Introduction To Doubly Link List](link_list/introduction_to_doubly_link_list.cpp)
- [Reverse A Doubly Link List](link_list/reverse_a_doubly_link_list.cpp)
- [Cycle Detection In Singly Link List](link_list/cycle_detection_in_singly_link_list.cpp)
- [Insert Node At The Beginning](link_list/insert_node_at_the_beginning.cpp)
- [Delete Last Node](link_list/delete_last_node.cpp)
- [Middle Of Link List](link_list/middle_of_link_list.cpp)
- [Iterative Link List Reverse](link_list/iterative_link_list_reverse.cpp)
- [Search In A Link List](link_list/search_in_a_link_list.cpp)
- [Introduction To Link List](link_list/introduction_to_link_list.cpp)
- [Sort Link List](link_list/sort_link_list.cpp)
- [Find Length Of Loop](link_list/find_length_of_loop.cpp)
- [Link List Cycle 2](link_list/link_list_cycle_2.cpp)
### ARRAYS
- [Largest Element In An Array](arrays/largest_element_in_an_array.cpp)
- [Missing Number](arrays/missing_number.cpp)
- [Intersection Of Two Elements](arrays/intersection_of_two_elements.cpp)
- [Left Rotate Array By 1](arrays/left_rotate_array_by_1.cpp)
- [Union Of Two Arrays](arrays/union_of_two_arrays.cpp)
- [Maximum Consecutive Number Of Ones](arrays/maximum_consecutive_number_of_ones.cpp)
- [Rotate Array By D Places](arrays/rotate_array_by_d_places.cpp)
- [Kadane Algorithm](arrays/kadane_algorithm.cpp)
- [Sort An Array Of Zeros Ones Twos](arrays/sort_an_array_of_zeros_ones_twos.cpp)
- [Remove Duplicates](arrays/remove_duplicates.cpp)
- [Longest Consecutive Sequence](arrays/longest_consecutive_sequence.cpp)
- [Rearrange Elements By Sign](arrays/rearrange_elements_by_sign.cpp)
- [Best Time To Buy And Sell Stock](arrays/best_time_to_buy_and_sell_stock.cpp)
- [Find The Element That Appear Once](arrays/find_the_element_that_appear_once.cpp)
- [Check If Array Is Sorted](arrays/check_if_array_is_sorted.cpp)
- [Move Zeros](arrays/move_zeros.cpp)
- [Two Sum](arrays/two_sum.cpp)
- [Next Permutation](arrays/next_permutation.cpp)
- [Second Largest Element](arrays/second_largest_element.cpp)
- [Majority Element 1](arrays/majority_element_1.cpp)
- [Majority Element 2](arrays/majority_element_2.cpp)
- [Linear Search](arrays/linear_search.cpp)
- [Leaders In An Array](arrays/leaders_in_an_array.cpp)
### TRIES
- [Implement Trie 2](tries/implement_trie_2.cpp)
- [Implement Trie](tries/implement_trie.cpp)
### HASHING
- [Longest Substring Without Repeating Characters](hashing/longest_substring_without_repeating_characters.cpp)
- [Four Sum](hashing/four_sum.cpp)
- [Least Recently Used Cache](hashing/least_recently_used_cache.cpp)
- [Longest Consecutive Sequence](hashing/longest_consecutive_sequence.cpp)
- [Job Sequencing Problem](hashing/job_sequencing_problem.cpp)
- [Two Sum](hashing/two_sum.cpp)
### BASICS
- [Count Digits](basics/count_digits.cpp)
- [Sum Of First N Numbers](basics/sum_of_first_n_numbers.cpp)
- [Check Prime](basics/check_prime.cpp)
- [Factorial](basics/factorial.cpp)
- [Else If](basics/else_if.cpp)
- [Highest Lowest Frequency Elements](basics/highest_lowest_frequency_elements.cpp)
- [Calculate Gcd](basics/calculate_gcd.cpp)
- [Switch Case Statement](basics/switch_case_statement.cpp)
- [Sum Of All Divisors](basics/sum_of_all_divisors.cpp)
- [Reverse An Array](basics/reverse_an_array.cpp)
- [N To 1 Without Loop](basics/n_to_1_without_loop.cpp)
- [Functions](basics/functions.cpp)
- [Print Fibonacci Series](basics/print_fibonacci_series.cpp)
- [Data Type](basics/data_type.cpp)
- [Code Frequency In A Range](basics/code_frequency_in_a_range.cpp)
- [1 To N Without Loop](basics/1_to_n_without_loop.cpp)
- [Sum Of Even And Odd](basics/sum_of_even_and_odd.cpp)
- [Reverse Integer](basics/reverse_integer.cpp)
- [Armstrong Number](basics/armstrong_number.cpp)
- [Nth Fibonacci Number](basics/nth_fibonacci_number.cpp)
- [Print N Times](basics/print_n_times.cpp)
- [Palindrome Number](basics/palindrome_number.cpp)
- [Check Palindrome Recursive](basics/check_palindrome_recursive.cpp)
- [Find Character Case](basics/find_character_case.cpp)
137 problems solved till July 24, 2023
Implemented with ❤️ by kartikmehta8
Automated by GitHub Actions