Skip to content
/ leetcode Public

My solutions to LeetCode problems with test cases.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

MarloDelatorre/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

137 Commits
datastructures
datastructures
 
 
.gitignore
.gitignore
 
 
0001_Two_Sum.py
0001_Two_Sum.py
 
 
0002_Add_Two_Numbers.py
0002_Add_Two_Numbers.py
 
 
0003_Longest_Substring_Without_Repeating_Characters.py
0003_Longest_Substring_Without_Repeating_Characters.py
 
 
0007_Reverse_Integer.py
0007_Reverse_Integer.py
 
 
0009_Palindrome_Number.py
0009_Palindrome_Number.py
 
 
0014_Longest_Common_Prefix.py
0014_Longest_Common_Prefix.py
 
 
0017_Letter_Combinations_Of_A_Phone_Number.py
0017_Letter_Combinations_Of_A_Phone_Number.py
 
 
0020_Valid_Parentheses.py
0020_Valid_Parentheses.py
 
 
0021_Merge_Two_Sorted_Lists.py
0021_Merge_Two_Sorted_Lists.py
 
 
0022_Generate_Parentheses.py
0022_Generate_Parentheses.py
 
 
0026_Remove_Duplicates_From_Sorted_Array.py
0026_Remove_Duplicates_From_Sorted_Array.py
 
 
0033_Search_In_Rotated_Sorted_Array.py
0033_Search_In_Rotated_Sorted_Array.py
 
 
0036_Valid_Sudoku.py
0036_Valid_Sudoku.py
 
 
0046_Permutations.py
0046_Permutations.py
 
 
0049_Group_Anagrams.py
0049_Group_Anagrams.py
 
 
0053_Maximum_Subarray.py
0053_Maximum_Subarray.py
 
 
0066_Plus_One.py
0066_Plus_One.py
 
 
0067_Add_Binary.py
0067_Add_Binary.py
 
 
0070_Climbing_Stairs.py
0070_Climbing_Stairs.py
 
 
0073_Set_Matrix_Zeroes.py
0073_Set_Matrix_Zeroes.py
 
 
0074_Search_A_2D_Matrix.py
0074_Search_A_2D_Matrix.py
 
 
0077_Combinations.py
0077_Combinations.py
 
 
0078_Subsets.py
0078_Subsets.py
 
 
0079_Word_Search.py
0079_Word_Search.py
 
 
0083_Remove_Duplicates_From_Sorted_List.py
0083_Remove_Duplicates_From_Sorted_List.py
 
 
0088_Merge_Sorted_Array.py
0088_Merge_Sorted_Array.py
 
 
0094_Binary_Tree_Inorder_Traversal.py
0094_Binary_Tree_Inorder_Traversal.py
 
 
0100_Same_Tree.py
0100_Same_Tree.py
 
 
0101_Symmetric_Tree.py
0101_Symmetric_Tree.py
 
 
0102_Binary_Tree_Level_Order_Traversal.py
0102_Binary_Tree_Level_Order_Traversal.py
 
 
0103_Binary_Tree_Zigzag_Level_Order_Traversal.py
0103_Binary_Tree_Zigzag_Level_Order_Traversal.py
 
 
0104_Maximum_Depth_Of_Binary_Tree.py
0104_Maximum_Depth_Of_Binary_Tree.py
 
 
0107_Binary_Tree_Level_Order_Traversal_II.py
0107_Binary_Tree_Level_Order_Traversal_II.py
 
 
0110_Balanced_Binary_Tree.py
0110_Balanced_Binary_Tree.py
 
 
0111_Minimum_Depth_Of_Binary_Tree.py
0111_Minimum_Depth_Of_Binary_Tree.py
 
 
0112_Path_Sum.py
0112_Path_Sum.py
 
 
0125_Valid_Palindrome.py
0125_Valid_Palindrome.py
 
 
0136_Single_Number.py
0136_Single_Number.py
 
 
0141_Linked_List_Cycle.py
0141_Linked_List_Cycle.py
 
 
0144_Binary_Tree_Preorder_Traversal.py
0144_Binary_Tree_Preorder_Traversal.py
 
 
0145_Binary_Tree_Postorder_Traversal.py
0145_Binary_Tree_Postorder_Traversal.py
 
 
0155_Min_Stack.py
0155_Min_Stack.py
 
 
0160_Intersection_Of_Two_Linked_Lists.py
0160_Intersection_Of_Two_Linked_Lists.py
 
 
0169_Majority_Element.py
0169_Majority_Element.py
 
 
0189_Rotate_Array.py
0189_Rotate_Array.py
 
 
0198_House_Robber.py
0198_House_Robber.py
 
 
0199_Binary_Tree_Right_Side_View.py
0199_Binary_Tree_Right_Side_View.py
 
 
0200_Number_Of_Islands.py
0200_Number_Of_Islands.py
 
 
0203_Remove_Linked_List_Elements.py
0203_Remove_Linked_List_Elements.py
 
 
0204_Count_Primes.py
0204_Count_Primes.py
 
 
0205_Isomorphic_Strings.py
0205_Isomorphic_Strings.py
 
 
0206_Reverse_Linked_List.py
0206_Reverse_Linked_List.py
 
 
0215_Kth_Largest_Element_In_An_Array.py
0215_Kth_Largest_Element_In_An_Array.py
 
 
0217_Contains_Duplicate.py
0217_Contains_Duplicate.py
 
 
0225_Implement_Stack_Using_Queues.py
0225_Implement_Stack_Using_Queues.py
 
 
0226_Invert_Binary_Tree.py
0226_Invert_Binary_Tree.py
 
 
0232_Implement_Queue_Using_Stacks.py
0232_Implement_Queue_Using_Stacks.py
 
 
0234_Palindrome_Linked_List.py
0234_Palindrome_Linked_List.py
 
 
0236_Lowest_Common_Ancestor_Of_A_Binary_Tree.py
0236_Lowest_Common_Ancestor_Of_A_Binary_Tree.py
 
 
0237_Delete_Node_In_A_Linked_List.py
0237_Delete_Node_In_A_Linked_List.py
 
 
0242_Valid_Anagram.py
0242_Valid_Anagram.py
 
 
0243_Shortest_Word_Distance.py
0243_Shortest_Word_Distance.py
 
 
0244_Reverse_String.py
0244_Reverse_String.py
 
 
0252_Meeting_Rooms.py
0252_Meeting_Rooms.py
 
 
0253_Meeting_Rooms_II.py
0253_Meeting_Rooms_II.py
 
 
0266_Palindrome_Permutation.py
0266_Palindrome_Permutation.py
 
 
0267_Binary_Tree_Paths.py
0267_Binary_Tree_Paths.py
 
 
0268_Missing_Number.py
0268_Missing_Number.py
 
 
0278_First_Bad_Version.py
0278_First_Bad_Version.py
 
 
0283_Move_Zeroes.py
0283_Move_Zeroes.py
 
 
0328_Odd_Even_Linked_List.py
0328_Odd_Even_Linked_List.py
 
 
0346_Moving_Average_From_Data_Stream.py
0346_Moving_Average_From_Data_Stream.py
 
 
0347_Top_K_Frequent_Elements.py
0347_Top_K_Frequent_Elements.py
 
 
0349_Intersection_Of_Two_Arrays.py
0349_Intersection_Of_Two_Arrays.py
 
 
0350_Intersection_Of_Two_Arrays_II.py
0350_Intersection_Of_Two_Arrays_II.py
 
 
0387_First_Unique_Character_In_A_String.py
0387_First_Unique_Character_In_A_String.py
 
 
0392_Is_Subsequence.py
0392_Is_Subsequence.py
 
 
0404_Sum_Of_Left_Leaves.py
0404_Sum_Of_Left_Leaves.py
 
 
0412_Fizz_Buzz.py
0412_Fizz_Buzz.py
 
 
0415_Add_Strings.py
0415_Add_Strings.py
 
 
0429_N-ary_Tree_Level_Order_Traversal.py
0429_N-ary_Tree_Level_Order_Traversal.py
 
 
0437_Path_Sum_III.py
0437_Path_Sum_III.py
 
 
0438_Find_All_Anagrams_In_A_String.py
0438_Find_All_Anagrams_In_A_String.py
 
 
0448_Find_All_Numbers_Disappeared_In_An_Array.py
0448_Find_All_Numbers_Disappeared_In_An_Array.py
 
 
0451_Sort_Characters_By_Frequency.py
0451_Sort_Characters_By_Frequency.py
 
 
0463_Island_Perimeter.py
0463_Island_Perimeter.py
 
 
0509_Fibonacci_Number.py
0509_Fibonacci_Number.py
 
 
0543_Diameter_Of_Binary_Tree.py
0543_Diameter_Of_Binary_Tree.py
 
 
0557_Reverse_Words_In_A_String_III.py
0557_Reverse_Words_In_A_String_III.py
 
 
0572_Subtree_Of_Another_Tree.py
0572_Subtree_Of_Another_Tree.py
 
 
0589_N-ary_Tree_Preorder_Traversal.py
0589_N-ary_Tree_Preorder_Traversal.py
 
 
0590_N-ary_Tree_Postorder_Traversal.py
0590_N-ary_Tree_Postorder_Traversal.py
 
 
0605_Can_Place_Flowers.py
0605_Can_Place_Flowers.py
 
 
0617_Merge_Two_Binary_Trees.py
0617_Merge_Two_Binary_Trees.py
 
 
0637_Average_Of_Levels_In_Binary_Tree.py
0637_Average_Of_Levels_In_Binary_Tree.py
 
 
0674_Longest_Continuous_Increasing_Subsequence.py
0674_Longest_Continuous_Increasing_Subsequence.py
 
 
0680_Valid_Palindrome_II.py
0680_Valid_Palindrome_II.py
 
 
0703_Kth_Largest_Element_In_A_Stream.py
0703_Kth_Largest_Element_In_A_Stream.py
 
 

Repository files navigation

LeetCode

My solutions to LeetCode problems with test cases. To run, simply execute the python file (e.g. python3 0001_Two_Sum.py).

About

My solutions to LeetCode problems with test cases.

Resources

Readme
Activity

Stars

1 star

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages