GitHub - Avafly/LeetCodeSolution: My LeetCode solutions in C AND C++. Directly executable, and all dynamically allocated memory can be freed.

My LeetCode solutions in C AND C++.

Directly executable, and all allocated memory can be freed. Most solutions can beat over 60% of submissions in runtime and memory space.

LeetCode is an online platform for practicing and improving coding skills, particularly in the context of technical interviews for software development positions. It offers a wide range of coding problems that cover various topics including algorithms, data structures, databases.

Name		Name	Last commit message	Last commit date
Latest commit History 11 Commits
001.two_sum		001.two_sum
002.add_two_numbers		002.add_two_numbers
003.Longest_Substring_Without_Repeating_Characters		003.Longest_Substring_Without_Repeating_Characters
004.Median_of_Two_Sorted_Arrays		004.Median_of_Two_Sorted_Arrays
005.Longest_Palindromic_Substring		005.Longest_Palindromic_Substring
006.Zigzag_Conversion		006.Zigzag_Conversion
007.Reverse_Integer		007.Reverse_Integer
008.atoi		008.atoi
009.Palindrome_Number		009.Palindrome_Number
010.Regular_Expression_Matching		010.Regular_Expression_Matching
011.Container_With_Most_Water		011.Container_With_Most_Water
012.Integer_to_Roman		012.Integer_to_Roman
013.Roman_to_Integer		013.Roman_to_Integer
014.Longest_Common_Prefix		014.Longest_Common_Prefix
015.3Sum		015.3Sum
016.3Sum_Closest		016.3Sum_Closest
017.Letter_Combinations_of_a_Phone_Number		017.Letter_Combinations_of_a_Phone_Number
018.4Sum		018.4Sum
019.Remove_Nth_Node_From_End_of_List		019.Remove_Nth_Node_From_End_of_List
020.Valid_Parentheses		020.Valid_Parentheses
021.Merge_Two_Sorted_Lists		021.Merge_Two_Sorted_Lists
022.Generate_Parentheses		022.Generate_Parentheses
023.Merge_k_Sorted_Lists		023.Merge_k_Sorted_Lists
024.Swap_Nodes_in_Pairs		024.Swap_Nodes_in_Pairs
025.Reverse_Nodes_in_k.Group		025.Reverse_Nodes_in_k.Group
026.Remove_Duplicates_from_Sorted_Array		026.Remove_Duplicates_from_Sorted_Array
027.Remove_Element		027.Remove_Element
028.Find_the_Index_of_the_First_Occurrence_in_a_String		028.Find_the_Index_of_the_First_Occurrence_in_a_String
029.Divide_Two_Integers		029.Divide_Two_Integers
030.Substring_with_Concatenation_of_All_Words		030.Substring_with_Concatenation_of_All_Words
031.Next_Permutation		031.Next_Permutation
032.Longest_Valid_Parentheses		032.Longest_Valid_Parentheses
033.Search_in_Rotated_Sorted_Array		033.Search_in_Rotated_Sorted_Array
034.Find_First_and_Last_Position_of_Element_in_Sorted_Array		034.Find_First_and_Last_Position_of_Element_in_Sorted_Array
035.Search_Insert_Position		035.Search_Insert_Position
036.Valid_Sudoku		036.Valid_Sudoku
037.Sudoku_Solver		037.Sudoku_Solver
038.Count_and_Say		038.Count_and_Say
039.Combination_Sum		039.Combination_Sum
040.Combination_Sum_II		040.Combination_Sum_II
041.First_Missing_Positive		041.First_Missing_Positive
042.Trapping_Rain_Water		042.Trapping_Rain_Water
043.Multiply_Strings		043.Multiply_Strings
044.Wildcard_Matching		044.Wildcard_Matching
045.Jump_Game_II		045.Jump_Game_II
046.Permutations		046.Permutations
047.Permutations_II		047.Permutations_II
048.Rotate_Image		048.Rotate_Image
049.Group_Anagrams		049.Group_Anagrams
050.Pow(x,n)		050.Pow(x,n)
051.N-Queens		051.N-Queens
052.N-Queens_II		052.N-Queens_II
053.Maximum_Subarray		053.Maximum_Subarray
054.Spiral_Matrix		054.Spiral_Matrix
055.Jump_Game		055.Jump_Game
056.Merge_Intervals		056.Merge_Intervals
057.Insert_Interval		057.Insert_Interval
058.Length_of_Last_Word		058.Length_of_Last_Word
059.Spiral_Matrix_II		059.Spiral_Matrix_II
060.Permutation_Sequence		060.Permutation_Sequence
061.Rotate_List		061.Rotate_List
062.Unique_Paths		062.Unique_Paths
063.Unique_Paths_II		063.Unique_Paths_II
064.Minimum_Path_Sum		064.Minimum_Path_Sum
065.Valid_Number		065.Valid_Number
066.Plus_One		066.Plus_One
067.Add_Binary		067.Add_Binary
068.Text_Justification		068.Text_Justification
069.Sqrt_x		069.Sqrt_x
070.Climbing_Stairs		070.Climbing_Stairs
071.Simplify_Path		071.Simplify_Path
072.Edit_Distance		072.Edit_Distance
073.Set_Matrix_Zeroes		073.Set_Matrix_Zeroes
074.Search_a_2D_Matrix		074.Search_a_2D_Matrix
075.Sort_Colors		075.Sort_Colors
076.Minimum_Window_Substring		076.Minimum_Window_Substring
077.Combinations		077.Combinations
078.Subsets		078.Subsets
079.Word_Search		079.Word_Search
080.Remove_Duplicates_from_Sorted_Array_II		080.Remove_Duplicates_from_Sorted_Array_II
081.Search_in_Rotated_Sorted_Array_II		081.Search_in_Rotated_Sorted_Array_II
082.Remove_Duplicates_from_Sorted_List_II		082.Remove_Duplicates_from_Sorted_List_II
083.Remove_Duplicates_from_Sorted_List		083.Remove_Duplicates_from_Sorted_List
084.Largest_Rectangle_in_Histogram		084.Largest_Rectangle_in_Histogram
085.Maximal_Rectangle		085.Maximal_Rectangle
086.Partition_List		086.Partition_List
087.Scramble_String		087.Scramble_String
088.Merge_Sorted_Array		088.Merge_Sorted_Array
089.Gray_Code		089.Gray_Code
090.Subsets_II		090.Subsets_II
091.Decode_Ways		091.Decode_Ways
092.Reverse_Linked_List_II		092.Reverse_Linked_List_II
093.Restore_IP_Addresses		093.Restore_IP_Addresses
094.Binary_Tree_Inorder_Traversal		094.Binary_Tree_Inorder_Traversal
095.Unique_Binary_Search_Trees_II		095.Unique_Binary_Search_Trees_II
096.Unique_Binary_Search_Trees		096.Unique_Binary_Search_Trees
097.Interleaving_String		097.Interleaving_String
098.Validate_Binary_Search_Tree		098.Validate_Binary_Search_Tree
099.Recover_Binary_Search_Tree		099.Recover_Binary_Search_Tree
100.Same_Tree		100.Same_Tree

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

About

Uh oh!

Releases

Packages

Languages

Avafly/LeetCodeSolution

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages