Skip to content

majafrankowska/Leetcode-Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

379 Commits

1048_Longest_String_Chain.java

1048_Longest_String_Chain.java

 
 

1095_Find_in_Mountain_Array.java

1095_Find_in_Mountain_Array.java

 
 

119_Pascal's_Triangle_II.java

119_Pascal's_Triangle_II.java

 
 

1220_Count_Vowels_Permutation.py

1220_Count_Vowels_Permutation.py

 
 

1266_Minimum_Time_Visiting_All_Points.java

1266_Minimum_Time_Visiting_All_Points.java

 
 

1269_Number_of_Ways_to_Stay_in_the_Same_Place_After_Some_Steps.java

1269_Number_of_Ways_to_Stay_in_the_Same_Place_After_Some_Steps.java

 
 

1282_Group_the_People_Given_the_Group_Size_They_Belong_To.cpp

1282_Group_the_People_Given_the_Group_Size_They_Belong_To.cpp

 
 

1337_The_K_Weakest_Rows_in_a_Matrix.java

1337_The_K_Weakest_Rows_in_a_Matrix.java

 
 

1356_Sort_Integers_by_The_Number_of_1_Bits.java

1356_Sort_Integers_by_The_Number_of_1_Bits.java

 
 

1359_Count_All_Valid_Pickup_and_Delivery_Options.java

1359_Count_All_Valid_Pickup_and_Delivery_Options.java

 
 

135_Candy.java

135_Candy.java

 
 

1361_Validate_Binary_Tree_Nodes.java

1361_Validate_Binary_Tree_Nodes.java

 
 

1420_Build_Array_Where_You_Can_Find_The_Maximum_Exactly_K_Comparisons.java

1420_Build_Array_Where_You_Can_Find_The_Maximum_Exactly_K_Comparisons.java

 
 

1424_Diagonal_Traverse_II.java

1424_Diagonal_Traverse_II.java

 
 

1425_Constrained_Subsequence_Sum.java

1425_Constrained_Subsequence_Sum.java

 
 

1441_Build_an_Array_With_Stack_Operations.py

1441_Build_an_Array_With_Stack_Operations.py

 
 

1458_Max_Dot_Product_of_Two_Subsequences.java

1458_Max_Dot_Product_of_Two_Subsequences.java

 
 

1503_Last_Moment_Before_All_Ants_Fall_Out_of_a_Plank.cpp

1503_Last_Moment_Before_All_Ants_Fall_Out_of_a_Plank.cpp

 
 

1535_Find_the_Winner_of_an_Array_Game.java

1535_Find_the_Winner_of_an_Array_Game.java

 
 

1584_Min_Cost_to_Connect_All_Points.py

1584_Min_Cost_to_Connect_All_Points.py

 
 

1624_Largest_Substring_Between_Two_Equal_Characters.java

1624_Largest_Substring_Between_Two_Equal_Characters.java

 
 

1631_Path_With_Minimum_Effort.java

1631_Path_With_Minimum_Effort.java

 
 

1647_Minimum_Deletions_to_Make_Character_Frequencies_Unique.java

1647_Minimum_Deletions_to_Make_Character_Frequencies_Unique.java

 
 

1658_Minimum_Operations_to_Reduce_X_to_Zero.py

1658_Minimum_Operations_to_Reduce_X_to_Zero.py

 
 

1662_Check_If_Two_String_Arrays_are_Equivalent.java

1662_Check_If_Two_String_Arrays_are_Equivalent.java

 
 

1688_Count_of_Matches_in_Tournament.java

1688_Count_of_Matches_in_Tournament.java

 
 

1716_Calculate_Money_in_Leetcode_Bank.java

1716_Calculate_Money_in_Leetcode_Bank.java

 
 

1727_Largest_Submatrix_With_Rearrangements.java

1727_Largest_Submatrix_With_Rearrangements.java

 
 

1743_Restore_the_Array_From_Adjacent_Pairs.py

1743_Restore_the_Array_From_Adjacent_Pairs.py

 
 

1793_Maximum_Score_of_a_Good_Subarray.java

1793_Maximum_Score_of_a_Good_Subarray.java

 
 

1814_Count_Nice_Pairs_in_an_Array.py

1814_Count_Nice_Pairs_in_an_Array.py

 
 

1838_Frequency_of_the_Most_Frequent_Element.java

1838_Frequency_of_the_Most_Frequent_Element.java

 
 

1845_Seat_Reservation_Manager.java

1845_Seat_Reservation_Manager.java

 
 

1846_Maximum_Element_After_Decreasing_and_Rearranging.java

1846_Maximum_Element_After_Decreasing_and_Rearranging.java

 
 

1877_Minimize_Maximum_Pair_Sum_in_Array.java

1877_Minimize_Maximum_Pair_Sum_in_Array.java

 
 

1887_Reduction_Operations_to_Make_the_Array_Elements_Equal.java

1887_Reduction_Operations_to_Make_the_Array_Elements_Equal.java

 
 

1903_Largest_Odd_Number_in_String.java

1903_Largest_Odd_Number_in_String.java

 
 

191_Number_of_1_Bits.java

191_Number_of_1_Bits.java

 
 

1921_Eliminate_Maximum_Number_of_Monsters.java

1921_Eliminate_Maximum_Number_of_Monsters.java

 
 

1930_Unique_Length-3_Palindromic_Subsequences.java

1930_Unique_Length-3_Palindromic_Subsequences.java

 
 

1980_Find_Unique_Binary_String.java

1980_Find_Unique_Binary_String.java

 
 

2009_Minimum_Number_of_Operations_to_Make_Array_Continuous.py

2009_Minimum_Number_of_Operations_to_Make_Array_Continuous.py

 
 

2038_Remove_Colored_Pieces_if_Both_Neighbors_are_the_Same_Color.java

2038_Remove_Colored_Pieces_if_Both_Neighbors_are_the_Same_Color.java

 
 

2147_Number_of_Ways_to_Divide_a_Long_Corridor.java

2147_Number_of_Ways_to_Divide_a_Long_Corridor.java

 
 

2251_Number_of_Flowers_in_Full_Bloom.java

2251_Number_of_Flowers_in_Full_Bloom.java

 
 

2265_Count_Nodes_Equal_to_Average_of_Subtree.java

2265_Count_Nodes_Equal_to_Average_of_Subtree.java

 
 

229_Majority_Element_II.java

229_Majority_Element_II.java

 
 

2391_Minimum_Amount_of_Time_to_Collect_Garbage.py

2391_Minimum_Amount_of_Time_to_Collect_Garbage.py

 
 

2642_Design_Graph_With_Shortest_Path_Calculator.py

2642_Design_Graph_With_Shortest_Path_Calculator.py

 
 

2742_Painting_the_Walls.java

2742_Painting_the_Walls.java

 
 

2785_Sort_Vowels_in_a_String.java

2785_Sort_Vowels_in_a_String.java

 
 

287_Find_the_Duplicate_Number.java

287_Find_the_Duplicate_Number.java

 
 

316_Remove_Duplicate_Letters.py

316_Remove_Duplicate_Letters.py

 
 

332_Reconstruct_Itinerary.py

332_Reconstruct_Itinerary.py

 
 

337_House_Robber_III.java

337_House_Robber_III.java

 
 

341_Flatten_Nested_List_Iterator.java

341_Flatten_Nested_List_Iterator.java

 
 

342_Power_of_Four.java

342_Power_of_Four.java

 
 

343_Integer_Break.py

343_Integer_Break.py

 
 

34_Find_First_and_Last_Position_of_Element_in_Sorted_Array.cpp

34_Find_First_and_Last_Position_of_Element_in_Sorted_Array.cpp

 
 

377_Combination_Sum_IV.java

377_Combination_Sum_IV.java

 
 

389_Find_the_Difference.java

389_Find_the_Difference.java

 
 

392_Is_Subsequence.java

392_Is_Subsequence.java

 
 

445_Add_Two_Numbers_II.cpp

445_Add_Two_Numbers_II.cpp

 
 

456_132_Pattern.java

456_132_Pattern.java

 
 

458_Poor_Pigs.cpp

458_Poor_Pigs.cpp

 
 

4_Median_of_Two_Sorted_Arrays.java

4_Median_of_Two_Sorted_Arrays.java

 
 

501_Find_Mode_in_Binary_Search_Tree.java

501_Find_Mode_in_Binary_Search_Tree.java

 
 

515_Find_Largest_Value_in_Each_Tree Row.java

515_Find_Largest_Value_in_Each_Tree Row.java

 
 

542_01_Matrix.cpp

542_01_Matrix.cpp

 
 

557_Reverse_Words_in_a_String_III.cpp

557_Reverse_Words_in_a_String_III.cpp

 
 

5_Longest_Palindromic_Substring.java

5_Longest_Palindromic_Substring.java

 
 

706_Design_HashMap.java

706_Design_HashMap.java

 
 

746_Min_Cost_Climbing_Stairs.java

746_Min_Cost_Climbing_Stairs.java

 
 

779_K-th_Symbol_in_Grammar.java

779_K-th_Symbol_in_Grammar.java

 
 

799_Champagne_Tower.java

799_Champagne_Tower.java

 
 

815_Bus_Routes.java

815_Bus_Routes.java

 
 

823_Binary_Trees_With_Factors.java

823_Binary_Trees_With_Factors.java

 
 

847_Shortest_Path_Visiting_All_Nodes.java

847_Shortest_Path_Visiting_All_Nodes.java

 
 

880_Decoded_String_at_Index.java

880_Decoded_String_at_Index.java

 
 

896_Monotonic_Array.java

896_Monotonic_Array.java

 
 

905_Sort_Array_By_Parity.java

905_Sort_Array_By_Parity.java

 
 

94_Binary_Tree_Inorder_Traversal.java

94_Binary_Tree_Inorder_Traversal.java

 
 

All_Nodes_Distance_K_in_Binary_Tree.cpp

All_Nodes_Distance_K_in_Binary_Tree.cpp

 
 

All_Possible_Full_Binary_Trees.cpp

All_Possible_Full_Binary_Trees.cpp

 
 

Asteroid_Collision.cpp

Asteroid_Collision.cpp

 
 

Check_if_There_is_a_Valid_Partition_For_The_Array.cpp

Check_if_There_is_a_Valid_Partition_For_The_Array.cpp

 
 

Coin_Change_II.cpp

Coin_Change_II.cpp

 
 

Combinations.cpp

Combinations.cpp

 
 

Copy_List_with_Random_Pointer.java

Copy_List_with_Random_Pointer.java

 
 

Counting_Bits.java

Counting_Bits.java

 
 

Course_Schedule.cpp

Course_Schedule.cpp

 
 

Excel_Sheet_Column_Title.java

Excel_Sheet_Column_Title.java

 
 

Extra_Characters_in_a_String.java

Extra_Characters_in_a_String.java

 
 

F1759_Count_Number_of_Homogenous_Substrings.java

F1759_Count_Number_of_Homogenous_Substrings.java

 
 

Find_Critical_and_Pseudo-Critical_Edges_in_Minimum_Spanning_Tree.java

Find_Critical_and_Pseudo-Critical_Edges_in_Minimum_Spanning_Tree.java

 
 

Find_Eventual_Safe_States.cpp

Find_Eventual_Safe_States.cpp

 
 

Fizz_Buzz.java

Fizz_Buzz.java

 
 

Frog_Jump.java

Frog_Jump.java

 
 

Goat_Latin.java

Goat_Latin.java

 
 

Implement_Stack_using_Queues.java

Implement_Stack_using_Queues.java

 
 

Repository files navigation

Leetcode

Here I store all my solutions in C++, Java and Python to coding problems from Leetcode, there are some random problems but mainly ones from the Monthly Daily Contest Challange. I scored a leetcode challenge monthly badges for 2023: August, September, October and November. You can checkout my profile here -> https://leetcode.com/majafrankowska


Leetcode_logo

About

My solutions to coding problems from Leetcode

leetcode.com/majafrankowska/

Topics

python java leetcode cpp leetcode-solutions interview-questions problem-solving interview-preparation

Resources

Readme
Activity

Stars

2 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages