Skip to content
/ LeetCode-Solutions-Java Public

This repository contains the solutions for LeetCode problems in Java

License

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

mkhuzaima/LeetCode-Solutions-Java

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

315 Commits

.github/workflows

.github/workflows

 
 

.gitignore

.gitignore

 
 

0001_Two_Sum.java

0001_Two_Sum.java

 
 

0003_Longest_Substring_Without_Repeating_Characters.java

0003_Longest_Substring_Without_Repeating_Characters.java

 
 

0008_String-to-Integer-atoi.java

0008_String-to-Integer-atoi.java

 
 

0009_Palindrome_Number.java

0009_Palindrome_Number.java

 
 

0011_Container_With_Most_Water.java

0011_Container_With_Most_Water.java

 
 

0019_Remove_Nth_Node_From_End_of_List.java

0019_Remove_Nth_Node_From_End_of_List.java

 
 

0020_Valid_Parentheses.java

0020_Valid_Parentheses.java

 
 

0021_Merge_Two_Sorted_Lists.java

0021_Merge_Two_Sorted_Lists.java

 
 

0023_Merge_k_Sorted_Lists.java

0023_Merge_k_Sorted_Lists.java

 
 

0032_Longest_Valid_Parentheses.java

0032_Longest_Valid_Parentheses.java

 
 

0034_Find_First_and_Last_Position_of_Element_in_Sorted_Array.java

0034_Find_First_and_Last_Position_of_Element_in_Sorted_Array.java

 
 

0037_Sudoku_Solver.java

0037_Sudoku_Solver.java

 
 

0042_Trapping_Rain_Water.java

0042_Trapping_Rain_Water.java

 
 

0057_Insert_Interval.java

0057_Insert_Interval.java

 
 

0064_Minimum_Path_Sum.java

0064_Minimum_Path_Sum.java

 
 

0079_Word_Search.java

0079_Word_Search.java

 
 

0091_Decode_Ways.java

0091_Decode_Ways.java

 
 

0094_Binary_Tree_Inorder_Traversal.java

0094_Binary_Tree_Inorder_Traversal.java

 
 

0095_Unique_Binary_Search_Trees_II.java

0095_Unique_Binary_Search_Trees_II.java

 
 

0096_Unique_Binary_Search_Trees.java

0096_Unique_Binary_Search_Trees.java

 
 

0098_Validate_Binary_Search_Tree.java

0098_Validate_Binary_Search_Tree.java

 
 

0099_Recover_Binary_Search_Tree.java

0099_Recover_Binary_Search_Tree.java

 
 

0100_Same_Tree.java

0100_Same_Tree.java

 
 

0101_Symmetric_Tree.java

0101_Symmetric_Tree.java

 
 

0102_Binary_Tree_Level_Order_Traversal.java

0102_Binary_Tree_Level_Order_Traversal.java

 
 

0103_Binary_Tree_Zigzag_Level_Order_Traversal.java

0103_Binary_Tree_Zigzag_Level_Order_Traversal.java

 
 

0111_Minimum_Depth_of_Binary_Tree.java

0111_Minimum_Depth_of_Binary_Tree.java

 
 

0128_Longest_Consecutive_Sequence.java

0128_Longest_Consecutive_Sequence.java

 
 

0129_Sum_Root_to_Leaf_Numbers.java

0129_Sum_Root_to_Leaf_Numbers.java

 
 

0133_Clone_Graph,java

0133_Clone_Graph,java

 
 

0142_Linked_List_Cycle_II.java

0142_Linked_List_Cycle_II.java

 
 

0199_Binary_Tree_Right_Side_View.java

0199_Binary_Tree_Right_Side_View.java

 
 

0200_Number_of_Islands.java

0200_Number_of_Islands.java

 
 

0205_Isomorphic_Strings.java

0205_Isomorphic_Strings.java

 
 

0208_Implement_Trie.java

0208_Implement_Trie.java

 
 

0211_Design_Add_and_Search_Words_Data_Structure.java

0211_Design_Add_and_Search_Words_Data_Structure.java

 
 

0212_Word_Search_II.java

0212_Word_Search_II.java

 
 

0226_Invert_Binary_Tree.java

0226_Invert_Binary_Tree.java

 
 

0228_Summary_Ranges.java

0228_Summary_Ranges.java

 
 

0382_Linked_List_Random_Node.java

0382_Linked_List_Random_Node.java

 
 

0404_Sum_of_Left_Leaves.java

0404_Sum_of_Left_Leaves.java

 
 

0501_Find_Mode_in_Binary_Search_Tree.java

0501_Find_Mode_in_Binary_Search_Tree.java

 
 

0513_Find_Bottom_Left_Tree_Value.java

0513_Find_Bottom_Left_Tree_Value.java

 
 

0540_Single_Element_in_a_Sorted_Array.java

0540_Single_Element_in_a_Sorted_Array.java

 
 

0547_Number_of_Provinces.java

0547_Number_of_Provinces.java

 
 

0617_Merge_Two_Binary_Trees.java

0617_Merge_Two_Binary_Trees.java

 
 

0653_Two_Sum_IV_Input_is_a_BST.java

0653_Two_Sum_IV_Input_is_a_BST.java

 
 

0744_Find_Smallest_Letter_Greater_Than_Target.java

0744_Find_Smallest_Letter_Greater_Than_Target.java

 
 

0746_Min_Cost_Climbing_Stairs.java

0746_Min_Cost_Climbing_Stairs.java

 
 

0852_Peak_Index_in_a_Mountain_Array.java

0852_Peak_Index_in_a_Mountain_Array.java

 
 

0926_Flip_String_to_Monotone_Increasing.java

0926_Flip_String_to_Monotone_Increasing.java

 
 

0958_Check_Completeness_of_a_Binary_Tree.java

0958_Check_Completeness_of_a_Binary_Tree.java

 
 

0983_Minimum_Cost_For_Tickets.java

0983_Minimum_Cost_For_Tickets.java

 
 

0994_Rotting_Oranges.java

0994_Rotting_Oranges.java

 
 

1011_Capacity_To_Ship_Packages_Within_D_Days.java

1011_Capacity_To_Ship_Packages_Within_D_Days.java

 
 

1061_Lexicographically_Smallest_Equivalent_String.java

1061_Lexicographically_Smallest_Equivalent_String.java

 
 

1094_Car_Pooling.java

1094_Car_Pooling.java

 
 

1095_Find_in_Mountain_Array.java

1095_Find_in_Mountain_Array.java

 
 

1146_Snapshot_Array.java

1146_Snapshot_Array.java

 
 

1160_Find_Words_That_Can_Be_Formed_by_Characters.java

1160_Find_Words_That_Can_Be_Formed_by_Characters.java

 
 

1266_Minimum_Time_Visiting_All_Points.java

1266_Minimum_Time_Visiting_All_Points.java

 
 

1287_Element_Appearing_More_Than_25%_In_Sorted_Array.java

1287_Element_Appearing_More_Than_25%_In_Sorted_Array.java

 
 

1302_Deepest_Leaves_Sum.java

1302_Deepest_Leaves_Sum.java

 
 

1305_All_Elements_in_Two_Binary_Search_Trees.java

1305_All_Elements_in_Two_Binary_Search_Trees.java

 
 

1319_Number_of_Operations_to_Make_Network_Connected.java

1319_Number_of_Operations_to_Make_Network_Connected.java

 
 

1361_Validate_Binary_Tree_Nodes.java

1361_Validate_Binary_Tree_Nodes.java

 
 

1372_Longest_ZigZag_Path_in_a_Binary_Tree.java

1372_Longest_ZigZag_Path_in_a_Binary_Tree.java

 
 

1382_Balance_a_Binary_Search_Tree.java

1382_Balance_a_Binary_Search_Tree.java

 
 

1441_Build_an_Array_With_Stack_Operations.java

1441_Build_an_Array_With_Stack_Operations.java

 
 

1457_Pseudo-Palindromic_Paths_in_a_Binary_Tree.java

1457_Pseudo-Palindromic_Paths_in_a_Binary_Tree.java

 
 

1464_Maximum_Product_of_Two_Elements_in_an_Array.java

1464_Maximum_Product_of_Two_Elements_in_an_Array.java

 
 

1466_Reorder_Routes_to_Make_All_Paths_Lead_to_the_City_Zero.java

1466_Reorder_Routes_to_Make_All_Paths_Lead_to_the_City_Zero.java

 
 

1472_Design_Browser_History.java

1472_Design_Browser_History.java

 
 

1503_Last_Moment_Before_All_Ants_Fall_Out_of_a_Plank.java

1503_Last_Moment_Before_All_Ants_Fall_Out_of_a_Plank.java

 
 

1535_Find_the_Winner_of_an_Array_Game.java

1535_Find_the_Winner_of_an_Array_Game.java

 
 

1609_Even_Odd_Tree.java

1609_Even_Odd_Tree.java

 
 

1675_Minimize_Deviation_in_Array.java

1675_Minimize_Deviation_in_Array.java

 
 

1768_Merge_Strings_Alternately.java

1768_Merge_Strings_Alternately.java

 
 

1863_Sum_of_All_Subset_XOR_Totals.java

1863_Sum_of_All_Subset_XOR_Totals.java

 
 

1887_Reduction_Operations_to_Make_the_Array_Elements_Equal.java

1887_Reduction_Operations_to_Make_the_Array_Elements_Equal.java

 
 

1913_Maximum_Product_Difference_Between_Two_Pairs.java

1913_Maximum_Product_Difference_Between_Two_Pairs.java

 
 

1921_Eliminate_Maximum_Number_of_Monsters.java

1921_Eliminate_Maximum_Number_of_Monsters.java

 
 

2037_Minimum_Number_of_Moves_to_Seat_Everyone.java

2037_Minimum_Number_of_Moves_to_Seat_Everyone.java

 
 

2038_Remove_Colored_Pieces_if_Both_Neighbors_are_the_Same_Color.java

2038_Remove_Colored_Pieces_if_Both_Neighbors_are_the_Same_Color.java

 
 

2090_K_Radius_Subarray_Averages.java

2090_K_Radius_Subarray_Averages.java

 
 

2220_Minimum_Bit_Flips_to_Convert_Number.java

2220_Minimum_Bit_Flips_to_Convert_Number.java

 
 

2246_Longest_Path_With_Different_Adjacent_Characters.java

2246_Longest_Path_With_Different_Adjacent_Characters.java

 
 

2265_Count_Nodes_Equal_to_Average_of_Subtree.java

2265_Count_Nodes_Equal_to_Average_of_Subtree.java

 
 

2316_Count_Unreachable_Pairs_of_Nodes_in_an_Undirected_Graph.java

2316_Count_Unreachable_Pairs_of_Nodes_in_an_Undirected_Graph.java

 
 

2326_Spiral_Matrix_IV.java

2326_Spiral_Matrix_IV.java

 
 

2331_Evaluate_Boolean_Binary_Tree.java

2331_Evaluate_Boolean_Binary_Tree.java

 
 

2348_Number_of_Zero-Filled_Subarrays.java

2348_Number_of_Zero-Filled_Subarrays.java

 
 

2352_Equal_Row_and_Column_Pairs.java

2352_Equal_Row_and_Column_Pairs.java

 
 

2353_Design_a_Food_Rating_System.java

2353_Design_a_Food_Rating_System.java

 
 

2360_Longest_Cycle_in_a_Graph.java

2360_Longest_Cycle_in_a_Graph.java

 
 

2405_Optimal_Partition_of_String.java

2405_Optimal_Partition_of_String.java

 
 

2760_Longest_Even_Odd_Subarray_With_Threshold.java

2760_Longest_Even_Odd_Subarray_With_Threshold.java

 
 

2957_Remove_Adjacent_Almost-Equal_Characters.java

2957_Remove_Adjacent_Almost-Equal_Characters.java

 
 

Repository files navigation

LeetCode-Solutions

Leetcode stats

Header Template

// id: {problemId}
// Name: {problemName}
// link: {problemLink}
// Difficulty: {problemDifficulty}

About

This repository contains the solutions for LeetCode problems in Java

Topics

java algorithm algorithms leetcode graph-algorithms competitive-programming leetcode-solutions dynamic-programming hacktoberfest leetcode-java leetcode-algorithms algorithms-and-data-structures java-algorithms leetcode-solutions-java

Resources

Readme

License

MIT license
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages