{"id":19306988,"url":"https://github.com/shaharashe/leetcode","last_synced_at":"2025-02-24T02:42:04.011Z","repository":{"id":163380597,"uuid":"638875833","full_name":"ShaharAshe/LeetCode","owner":"ShaharAshe","description":"A collection of my LeetCode solutions, showcasing problem-solving skills and algorithmic techniques.","archived":false,"fork":false,"pushed_at":"2025-02-16T09:06:35.000Z","size":966,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-16T10:20:00.855Z","etag":null,"topics":["algorithm","algorithm-challenges","algorithms","algorithms-and-data-structures","data-structures","leetcode","leetcode-bash","leetcode-c","leetcode-cpp","leetcode-csharp","leetcode-java","leetcode-javascript","leetcode-practice","leetcode-python","leetcode-python3","leetcode-questions","leetcode-solutions","leetcode-sql","math","mathematics"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/shahar_30/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ShaharAshe.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-10T09:42:23.000Z","updated_at":"2025-02-16T09:06:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"f3665295-5365-4f8b-a5f2-f808dbaf8b9b","html_url":"https://github.com/ShaharAshe/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShaharAshe%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShaharAshe%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShaharAshe%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShaharAshe%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ShaharAshe","download_url":"https://codeload.github.com/ShaharAshe/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240408992,"owners_count":19796788,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithm-challenges","algorithms","algorithms-and-data-structures","data-structures","leetcode","leetcode-bash","leetcode-c","leetcode-cpp","leetcode-csharp","leetcode-java","leetcode-javascript","leetcode-practice","leetcode-python","leetcode-python3","leetcode-questions","leetcode-solutions","leetcode-sql","math","mathematics"],"created_at":"2024-11-10T00:09:09.758Z","updated_at":"2025-02-24T02:42:03.914Z","avatar_url":"https://github.com/ShaharAshe.png","language":"C++","readme":"\u003e # [LeetCode](https://leetcode.com/u/shahar_30/) [![LICENSE](https://img.shields.io/badge/license-MIT-yellow.svg)](./LICENSE)\n\u003e\n\u003e | Difficulty | Count |\n\u003e |------------|-------|\n\u003e | ✅ Easy | 59 |\n\u003e | ⚡ Medium | 60 |\n\u003e | 🔥 Hard | 11 |\n\u003e | ⭐ **Total** | **130** |\n\u003e\n\u003e #\n\u003e\n\u003e ![C++](https://img.shields.io/badge/C%2B%2B-105-blue?logo=c%2B%2B\u0026logoColor=white)\n\u003e ![C](https://img.shields.io/badge/C-4-gray?logo=c\u0026logoColor=white)\n\u003e ![Python](https://img.shields.io/badge/Python-22-yellow?logo=python\u0026logoColor=white)\n\u003e ![Java](https://img.shields.io/badge/Java-7-red?logo=java\u0026logoColor=white)\n\u003e ![C#](https://img.shields.io/badge/C%23-1-purple?logo=csharp\u0026logoColor=white)\n\u003e ![JavaScript](https://img.shields.io/badge/JavaScript-1-f7df1e?logo=javascript\u0026logoColor=black)\n\u003e ![MySQL](https://img.shields.io/badge/MySQL-13-4479A1?logo=mysql\u0026logoColor=white)\n\u003e ![PostgreSQL](https://img.shields.io/badge/PostgreSQL-13-336791?logo=postgresql\u0026logoColor=white)\n\u003e ![Bash](https://img.shields.io/badge/Bash-1-4EAA25?logo=gnubash\u0026logoColor=white)\n\u003e \n\u003e ---\n\u003e\n\u003e\u003e [**General**](./)\n\u003e\u003e\u003e - ✅ [1 - Two Sum](./leetcode-1-Two_Sum/) / [Cpp](./leetcode-1-Two_Sum/leetcode-1-Two_Sum.cpp) / [C#](./leetcode-1-Two_Sum/leetcode-1-Two_Sum.cs) / [Python](./leetcode-1-Two_Sum/leetcode-1-Two_Sum.py)\n\u003e\u003e\u003e - ⚡ [2 - Add Two Numbers](./leetcode-2-Add_Two_Numbers/) / [Cpp](./leetcode-2-Add_Two_Numbers/leetcode-2-Add_Two_Numbers.cpp) / [python](./leetcode-2-Add_Two_Numbers/leetcode-2-Add_Two_Numbers.py)\n\u003e\u003e\u003e - ⚡ [3 - Longest Substring Without Repeating Characters](./leetcode-3-Longest_Substring_Without_Repeating_Characters/) / [Cpp](./leetcode-3-Longest_Substring_Without_Repeating_Characters/leetcode-3-Longest_Substring_Without_Repeating_Characters.cpp) / [Python](./leetcode-3-Longest_Substring_Without_Repeating_Characters/leetcode-3-Longest_Substring_Without_Repeating_Characters.py)\n\u003e\u003e\u003e - ⚡ [6 - Zigzag Conversion](./leetcode-6-Zigzag_Conversion/) / [Cpp - V1](./leetcode-6-Zigzag_Conversion/leetcode-6-Zigzag_Conversion-V1.cpp) / [Cpp - V2](./leetcode-6-Zigzag_Conversion/leetcode-6-Zigzag_Conversion-V2.cpp)\n\u003e\u003e\u003e - ⚡ [8 - String to Integer](./leetcode-8-String_to_Integer/) / [Cpp](./leetcode-8-String_to_Integer/leetcode-8-String_to_Integer.cpp)\n\u003e\u003e\u003e - ✅ [9 - Palindrome Number](./leetcode-9-Palindrome_Number/) / [Python](./leetcode-9-Palindrome_Number/leetcode-9-Palindrome_Number.py)\n\u003e\u003e\u003e - ⚡ [11 - Container With Most Water](./leetcode-11-Container_With_Most_Water/) / [Cpp](./leetcode-11-Container_With_Most_Water/leetcode-11-Container_With_Most_Water.cpp)\n\u003e\u003e\u003e - ⚡ [12 - Integer to Roman](./leetcode-12-Integer_to_Roman/) / [Python](./leetcode-12-Integer_to_Roman/leetcode-12-Integer_to_Roman.py)\n\u003e\u003e\u003e - ✅ [13 - Roman to Integer](./leetcode-13-Roman_to_Integer/) / [Cpp](./leetcode-13-Roman_to_Integer/leetcode-13-Roman_to_Integer.cpp) / [Python](./leetcode-13-Roman_to_Integer/leetcode-13-Roman_to_Integer.py)\n\u003e\u003e\u003e - ✅ [14 - Longest Common Prefix](./leetcode-14-Longest_Common_Prefix/) / [Cpp](./leetcode-14-Longest_Common_Prefix/leetcode-14-Longest_Common_Prefix.cpp)\n\u003e\u003e\u003e - ⚡ [15 - 3Sum](./leetcode-15-3Sum/) / [Java](./leetcode-15-3Sum/leetcode_15_3Sum.java) / [Python](./leetcode-15-3Sum/leetcode_15_3Sum.py)\n\u003e\u003e\u003e - ⚡ [19 - Remove Nth Node From End of List](./leetcode-19-Remove_Nth_Node_From_End_of_List/) / [Cpp](./leetcode-19-Remove_Nth_Node_From_End_of_List/leetcode-19-Remove_Nth_Node_From_End_of_List.cpp)\n\u003e\u003e\u003e - ✅ [20 - Valid Parentheses](./leetcode-20-Valid_Parentheses/) / [Cpp - V1](./leetcode-20-Valid_Parentheses/leetcode-20-Valid_Parentheses_V1.cpp) / [Cpp - V2](./leetcode-20-Valid_Parentheses/leetcode-20-Valid_Parentheses_v2.cpp) / [Python - V1](./leetcode-20-Valid_Parentheses/leetcode-20-Valid_Parentheses%20-%20V1.py) / [Python - V2](./leetcode-20-Valid_Parentheses/leetcode-20-Valid_Parentheses%20-%20V2.py)\n\u003e\u003e\u003e - ✅ [21 - Merge Two Sorted Lists](./leetcode-21-Merge_Two_Sorted_Lists/) / [Cpp](./leetcode-21-Merge_Two_Sorted_Lists/leetcode-21-Merge_Two_Sorted_Lists.cpp) / [Python](./leetcode-21-Merge_Two_Sorted_Lists/leetcode-21-Merge_Two_Sorted_Lists.py)\n\u003e\u003e\u003e - 🔥 [25 - Reverse Nodes in k-Group](./leetcode-25-Reverse_Nodes_in_k-Group/) / [Cpp](./leetcode-25-Reverse_Nodes_in_k-Group/leetcode-25-Reverse_Nodes_in_k-Group.cpp)\n\u003e\u003e\u003e - ✅ [26 - Remove Duplicates from Sorted Array](./leetcode-26-Remove_Duplicates_from_Sorted_Array/) / [C](./leetcode-26-Remove_Duplicates_from_Sorted_Array/leetcode-26-Remove_Duplicates_from_Sorted_Array.c)\n\u003e\u003e\u003e - ✅ [27 - Remove Element](./leetcode-27-Remove_Element/) / [C](./leetcode-27-Remove_Element/leetcode-27-Remove_Element.c) / [Cpp - V1](./leetcode-27-Remove_Element/leetcode-27-Remove_Element-V1.cpp) / [Cpp - V2](./leetcode-27-Remove_Element/leetcode-27-Remove_Element-V2.cpp)\n\u003e\u003e\u003e - ✅ [28 - Find the Index of the First Occurrence in a String](./leetcode-28-Find_the_Index_of_the_First_Occurrence_in_a_String/) / [Cpp](./leetcode-28-Find_the_Index_of_the_First_Occurrence_in_a_String/leetcode-28-Find_the_Index_of_the_First_Occurrence_in_a_String.cpp)\n\u003e\u003e\u003e - 🔥 [30 - Substring with Concatenation of All Words](./leetcode-30-Substring_with_Concatenation_of_All_Words/) / [Cpp](./leetcode-30-Substring_with_Concatenation_of_All_Words/leetcode-30-Substring_with_Concatenation_of_All_Words.cpp)\n\u003e\u003e\u003e - ⚡ [36 - Valid Sudoku](./leetcode-36-Valid_Sudoku/) / [Cpp](./leetcode-36-Valid_Sudoku/leetcode-36-Valid_Sudoku.cpp) / [Python](./leetcode-36-Valid_Sudoku/leetcode-36-Valid_Sudoku.py)\n\u003e\u003e\u003e - ⚡ [40 - Combination Sum II](./leetcode-40-Combination_Sum_II/) / [Cpp](./leetcode-40-Combination_Sum_II/leetcode-40-Combination_Sum_II.cpp)\n\u003e\u003e\u003e - 🔥 [41 - First Missing Positive](./leetcode-41-First_Missing_Positive/) / [Cpp](./leetcode-41-First_Missing_Positive/leetcode-41-First_Missing_Positive.cpp)\n\u003e\u003e\u003e - 🔥 [42 - Trapping Rain Water](./leetcode-42-Trapping_Rain_Water/) / [Cpp](./leetcode-42-Trapping_Rain_Water/leetcode-42-Trapping_Rain_Water.cpp)\n\u003e\u003e\u003e - ⚡ [45 - Jump Game II](./leetcode-45-Jump_Game_II/) / [Cpp](./leetcode-45-Jump_Game_II/leetcode-45-Jump_Game_II.cpp)\n\u003e\u003e\u003e - ⚡ [48 - Rotate Image](./leetcode-48-Rotate_Image/) / [Cpp](./leetcode-48-Rotate_Image/leetcode-48-Rotate_Image.cpp)\n\u003e\u003e\u003e - ⚡ [49 - Group Anagrams](./leetcode-49-Group_Anagrams/) / [Cpp](./leetcode-49-Group_Anagrams/leetcode-49-Group_Anagrams.cpp)\n\u003e\u003e\u003e - ⚡ [54 - Spiral Matrix](./leetcode-54-Spiral_Matrix/) / [Cpp](./leetcode-54-Spiral_Matrix/leetcode-54-Spiral_Matrix.cpp)\n\u003e\u003e\u003e - ⚡ [55 - Jump Game](./leetcode-55-Jump_Game/) / [Cpp](./leetcode-55-Jump_Game/leetcode-55-Jump_Game.cpp)\n\u003e\u003e\u003e - ⚡ [56 - Merge Intervals](./leetcode-56-Merge_Intervals/) / [Cpp](./leetcode-56-Merge_Intervals/leetcode-56-Merge_Intervals.cpp)\n\u003e\u003e\u003e - ⚡ [57 - Insert Interval](./leetcode-57-Insert_Interval/) / [Cpp - V1](./leetcode-57-Insert_Interval/leetcode-57-Insert_Interval-V1.cpp) / [Cpp - V2](./leetcode-57-Insert_Interval/leetcode-57-Insert_Interval-V2.cpp)\n\u003e\u003e\u003e - ✅ [58 - Length of Last Word](./leetcode-58-Length_of_Last_Word/) / [Cpp](./leetcode-58-Length_of_Last_Word/leetcode-58-Length_of_Last_Word.cpp)\n\u003e\u003e\u003e - ⚡ [61 - Rotate List](./leetcode-61-Rotate_List/) / [Cpp](./leetcode-61-Rotate_List/leetcode-61-Rotate_List.cpp)\n\u003e\u003e\u003e - 🔥 [68 - Text Justification](./leetcode-68-Text_Justification/) / [Cpp](./leetcode-68-Text_Justification/leetcode-68-Text_Justification.cpp)\n\u003e\u003e\u003e - ✅ [69 - Sqrt(x)](./leetcode-69-Sqrt(x)/) / [Cpp](./leetcode-69-Sqrt(x)/leetcode-69-Sqrt_x.cpp)\n\u003e\u003e\u003e - ⚡ [71 - Simplify Path](./leetcode-71-Simplify_Path/) / [Cpp - V1](./leetcode-71-Simplify_Path/leetcode-71-Simplify_Path-V1.cpp) / [Cpp - V2](./leetcode-71-Simplify_Path/leetcode-71-Simplify_Path-V2.cpp)\n\u003e\u003e\u003e - ⚡ [73 - Set Matrix Zeroes](./leetcode-73-Set_Matrix_Zeroes/) / [Cpp - V1](./leetcode-73-Set_Matrix_Zeroes/leetcode-73-Set_Matrix_Zeroes-V1.cpp) / [Cpp - V2](./leetcode-73-Set_Matrix_Zeroes/leetcode-73-Set_Matrix_Zeroes-V2.cpp)\n\u003e\u003e\u003e - 🔥 [76 - Minimum Window Substring](./leetcode-76-Minimum_Window_Substring/) / [Cpp](./leetcode-76-Minimum_Window_Substring/leetcode-76-Minimum_Window_Substring.cpp)\n\u003e\u003e\u003e - ⚡ [80 - Remove Duplicates from Sorted Array II](./leetcode-80-Remove_Duplicates_from_Sorted_Array_II/) / [Cpp](./leetcode-80-Remove_Duplicates_from_Sorted_Array_II/leetcode-80-Remove_Duplicates_from_Sorted_Array_II.cpp)\n\u003e\u003e\u003e - ⚡ [82 - Remove Duplicates from Sorted List II](./leetcode-82-Remove_Duplicates_from_Sorted_List_II/) / [Cpp](./leetcode-82-Remove_Duplicates_from_Sorted_List_II/leetcode-82-Remove_Duplicates_from_Sorted_List_II.cpp)\n\u003e\u003e\u003e - ⚡ [86 - Partition List](./leetcode-86-Partition_List/) / [Cpp](./leetcode-86-Partition_List/leetcode-86-Partition_List.cpp)\n\u003e\u003e\u003e - ✅ [88 - Merge Sorted Array](./leetcode-88-Merge_Sorted_Array/) / [Cpp](./leetcode-88-Merge_Sorted_Array/leetcode-88-Merge_Sorted_Array.cpp)\n\u003e\u003e\u003e - ⚡ [92 - Reverse Linked List II](./leetcode-92-Reverse_Linked_List_II/) / [Cpp](./leetcode-92-Reverse_Linked_List_II/leetcode-92-Reverse_Linked_List_II.cpp)\n\u003e\u003e\u003e - ✅ [94 - Binary Tree Inorder Traversal](./leetcode-94-Binary_Tree_Inorder_Traversal/) / [Cpp](./leetcode-94-Binary_Tree_Inorder_Traversal/leetcode-94-Binary_Tree_Inorder_Traversal.cpp)\n\u003e\u003e\u003e - ✅ [100 - Same Tree](./leetcode-100-Same_Tree/) / [Cpp](./leetcode-100-Same_Tree/leetcode-100-Same_Tree.cpp) / [Python](./leetcode-100-Same_Tree/leetcode-100-Same_Tree.py) / [Java](./leetcode-100-Same_Tree/leetcode_100_Same_Tree.java)\n\u003e\u003e\u003e - ✅ [101 - Symmetric Tree](./leetcode-101-Symmetric_Tree/) / [Java](./leetcode-101-Symmetric_Tree/leetcode_101_Symmetric_Tree.java)\n\u003e\u003e\u003e - ✅ [104 - Maximum Depth of Binary Tree](./leetcode-104-Maximum_Depth_of_Binary_Tree/) / [Cpp](./leetcode-104-Maximum_Depth_of_Binary_Tree/leetcode-104-Maximum_Depth_of_Binary_Tree.cpp) / [Python](./leetcode-104-Maximum_Depth_of_Binary_Tree/leetcode-104-Maximum_Depth_of_Binary_Tree.py)\n\u003e\u003e\u003e - ⚡ [105 - Construct Binary Tree from Preorder and Inorder Traversal](./leetcode-105-Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal/) / [Java](./leetcode-105-Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal/leetcode_105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.java)\n\u003e\u003e\u003e - ⚡ [106 - Construct Binary Tree from Inorder and Postorder Traversal](./leetcode-106-Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal/) / [Java](./leetcode-106-Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal/leetcode_106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.java)\n\u003e\u003e\u003e - ✅ [112 - Path Sum](./leetcode-112-Path_Sum/) / [Cpp](./leetcode-112-Path_Sum/leetcode-112-Path_Sum.cpp)\n\u003e\u003e\u003e - ⚡ [114 - Flatten Binary Tree to Linked List](./leetcode-114-Flatten_Binary_Tree_to_Linked_List/) / [Cpp](./leetcode-114-Flatten_Binary_Tree_to_Linked_List/leetcode-114-Flatten_Binary_Tree_to_Linked_List.cpp)\n\u003e\u003e\u003e - ⚡ [117 - Populating Next Right Pointers in Each Node II](./leetcode-117-Populating_Next_Right_Pointers_in_Each_Node_II/) / [Java](./leetcode-117-Populating_Next_Right_Pointers_in_Each_Node_II/leetcode_117_Populating_Next_Right_Pointers_in_Each_Node_II.java)\n\u003e\u003e\u003e - ✅ [121 - Best Time to Buy and Sell Stock](./leetcode-121-Best_Time_to_Buy_and_Sell_Stock/) / [Cpp](./leetcode-121-Best_Time_to_Buy_and_Sell_Stock/leetcode-121-Best_Time_to_Buy_and_Sell_Stock.cpp)\n\u003e\u003e\u003e - ⚡ [122 - Best Time to Buy and Sell Stock II](./leetcode-122-Best_Time_to_Buy_and_Sell_Stock_II/) / [Cpp](./leetcode-122-Best_Time_to_Buy_and_Sell_Stock_II/leetcode-122-Best_Time_to_Buy_and_Sell_Stock_II.cpp)\n\u003e\u003e\u003e - 🔥 [124 - Binary Tree Maximum Path Sum](./leetcode-124-Binary_Tree_Maximum_Path_Sum/) / [Cpp](./leetcode-124-Binary_Tree_Maximum_Path_Sum/leetcode-124-Binary_Tree_Maximum_Path_Sum.cpp)\n\u003e\u003e\u003e - ✅ [125 - Valid Palindrome](./leetcode-125-Valid_Palindrome/) / [Cpp](./leetcode-125-Valid_Palindrome/leetcode-125-Valid_Palindrome.cpp) / [Python](./leetcode-125-Valid_Palindrome/leetcode-125-Valid_Palindrome.py)\n\u003e\u003e\u003e - ⚡ [128 - Longest Consecutive Sequence](./leetcode-128-Longest_Consecutive_Sequence/) / [Cpp](./leetcode-128-Longest_Consecutive_Sequence/leetcode-128-Longest_Consecutive_Sequence.cpp)\n\u003e\u003e\u003e - ⚡ [129 - Sum Root to Leaf Numbers](./leetcode-129-Sum_Root_to_Leaf_Numbers/) / [Cpp](./leetcode-129-Sum_Root_to_Leaf_Numbers/leetcode-129-Sum_Root_to_Leaf_Numbers.cpp)\n\u003e\u003e\u003e - ⚡ [134 - Gas Station](./leetcode-134-Gas_Station/) / [Cpp](./leetcode-134-Gas_Station/leetcode-134-Gas_Station.cpp)\n\u003e\u003e\u003e - 🔥 [135 - Candy](./leetcode-135-Candy/) / [Cpp](./leetcode-135-Candy/leetcode-135-Candy.cpp)\n\u003e\u003e\u003e - ⚡ [138 - Copy List with Random Pointer](./leetcode-138-Copy_List_with_Random_Pointer/) / [Cpp](./leetcode-138-Copy_List_with_Random_Pointer/leetcode-138-Copy_List_with_Random_Pointer.cpp)\n\u003e\u003e\u003e - ✅ [141 - Linked List Cycle](./leetcode-141-Linked_List_Cycle/) / [Cpp](./leetcode-141-Linked_List_Cycle/leetcode-141-Linked_List_Cycle.cpp) / [Python](./leetcode-141-Linked_List_Cycle/leetcode-141-Linked_List_Cycle.py)\n\u003e\u003e\u003e - ✅ [145 - Binary Tree Postorder Traversal](./leetcode-145-Binary_Tree_Postorder_Traversal/) / [Cpp](./leetcode-145-Binary_Tree_Postorder_Traversal/leetcode-145-Binary_Tree_Postorder_Traversal.cpp)\n\u003e\u003e\u003e - ⚡ [146 - LRU Cache](./leetcode-146-LRU_Cache/) / [Cpp](./leetcode-146-LRU_Cache/leetcode-146-LRU_Cache.cpp)\n\u003e\u003e\u003e - ⚡ [150 - Evaluate Reverse Polish Notation](./leetcode-150-Evaluate_Reverse_Polish_Notation/) / [Cpp](./leetcode-150-Evaluate_Reverse_Polish_Notation/leetcode-150-Evaluate_Reverse_Polish_Notation.cpp)\n\u003e\u003e\u003e - ⚡ [151 - Reverse Words in a String](./leetcode-151-Reverse_Words_in_a_String/) / [Cpp](./leetcode-151-Reverse_Words_in_a_String/leetcode-151-Reverse_Words_in_a_String.cpp)\n\u003e\u003e\u003e - ⚡ [167 - Two Sum II - Input Array Is Sorted](./leetcode-167-Two_Sum_II_-_Input_Array_Is_Sorted/) / [Cpp](./leetcode-167-Two_Sum_II_-_Input_Array_Is_Sorted/leetcode-167-Two_Sum_II_-_Input_Array_Is_Sorted.cpp)\n\u003e\u003e\u003e - ✅ [169 - Majority Element](./leetcode-169-Majority_Element/) / [Cpp](./leetcode-169-Majority_Element/leetcode-169-Majority_Element.cpp) / [Python](./leetcode-169-Majority_Element/leetcode-169-Majority_Element.py)\n\u003e\u003e\u003e - ⚡ [173 - Binary Search Tree Iterator](./leetcode-173-Binary_Search_Tree_Iterator/) / [Cpp](./leetcode-173-Binary_Search_Tree_Iterator/leetcode-173-Binary_Search_Tree_Iterator.cpp)\n\u003e\u003e\u003e - ⚡ [189 - Rotate Array](./leetcode-189-Rotate_Array/) / [Cpp](./leetcode-189-Rotate_Array/leetcode-189-Rotate_Array.cpp)\n\u003e\u003e\u003e - ✅ [195 - Tenth Line](./leetcode-195-Tenth_Line/) / [Bash](./leetcode-195-Tenth_Line/leetcode-195-Tenth_Line.sh)\n\u003e\u003e\u003e - ✅ [197 - Rising Temperature](./leetcode-197-Rising_Temperature/) / [MySQL](./leetcode-197-Rising_Temperature/leetcode-197-Rising_Temperature-MySQL.sql) / [PostgreSQL](./leetcode-197-Rising_Temperature/leetcode-197-Rising_Temperature-PostgreSQL.sql)\n\u003e\u003e\u003e - ⚡ [199 - Binary Tree Right Side View](./leetcode-199-Binary_Tree_Right_Side_View/) / [Cpp](./leetcode-199-Binary_Tree_Right_Side_View/leetcode-199-Binary_Tree_Right_Side_View.cpp)\n\u003e\u003e\u003e - ⚡ [200 - Number of Islands](./leetcode-200-Number_of_Islands/) / [Cpp](./leetcode-200-Number_of_Islands/leetcode-200-Number_of_Islands.cpp)\n\u003e\u003e\u003e - ✅ [202 - Happy Number](./leetcode-202-Happy_Number/) / [Cpp](./leetcode-202-Happy_Number/leetcode-202-Happy_Number.cpp)\n\u003e\u003e\u003e - ✅ [205 - Isomorphic Strings](./leetcode-205-Isomorphic_Strings/) / [Cpp](./leetcode-205-Isomorphic_Strings/leetcode-205-Isomorphic_Strings.cpp)\n\u003e\u003e\u003e - ⚡ [209 - Minimum Size Subarray_Sum](./leetcode-209-Minimum_Size_Subarray_Sum/) / [Cpp](./leetcode-209-Minimum_Size_Subarray_Sum/leetcode-209-Minimum_Size_Subarray_Sum.cpp) / [Python](./leetcode-209-Minimum_Size_Subarray_Sum/leetcode-209-Minimum_Size_Subarray_Sum.py)\n\u003e\u003e\u003e - ⚡ [215 - Kth Largest Element in an Array](./leetcode-215-Kth_Largest_Element_in_an_Array/) / [Python](./leetcode-215-Kth_Largest_Element_in_an_Array/leetcode-215-Kth_Largest_Element_in_an_Array.py)\n\u003e\u003e\u003e - ✅ [219 - Contains Duplicate II](./leetcode-219-Contains_Duplicate_II/) / [Cpp](./leetcode-219-Contains_Duplicate_II/leetcode-219-Contains_Duplicate_II.cpp)\n\u003e\u003e\u003e - 🔥 [224 - Basic Calculator](./leetcode-224-Basic_Calculator/) / [Cpp](./leetcode-224-Basic_Calculator/leetcode-224-Basic_Calculator.cpp)\n\u003e\u003e\u003e - ✅ [226 - Invert Binary Tree](./leetcode-226-Invert_Binary_Tree/) / [Cpp](./leetcode-226-Invert_Binary_Tree/leetcode-226-Invert_Binary_Tree.cpp)\n\u003e\u003e\u003e - ✅ [228 - Summary Ranges](./leetcode-228-SummaryRanges/) / [Cpp](./leetcode-228-SummaryRanges/leetcode-228-SummaryRanges.cpp) / [Java](./leetcode-228-SummaryRanges/leetcode_228_SummaryRanges.java)\n\u003e\u003e\u003e - ✅ [234 - Palindrome Linked List](./leetcode-234-Palindrome_Linked_List/) / [Cpp - V1](./leetcode-234-Palindrome_Linked_List/leetcode-234-Palindrome_Linked_List-V1.cpp) / [Cpp - V2](./leetcode-234-Palindrome_Linked_List/leetcode-234-Palindrome_Linked_List-V2.cpp)\n\u003e\u003e\u003e - ⚡ [238 - Product of Array Except Self](./leetcode-238-Product_of_Array_Except_Self/) / [Cpp](./leetcode-238-Product_of_Array_Except_Self/leetcode-238-Product_of_Array_Except_Self.cpp)\n\u003e\u003e\u003e - ✅ [242 - Valid Anagram](./leetcode-242-Valid_Anagram/) / [Python](./leetcode-242-Valid_Anagram/leetcode-242-Valid_Anagram.py)\n\u003e\u003e\u003e - ⚡ [264 - Ugly Number II](./leetcode-264-Ugly_Number_II/) / [Cpp](./leetcode-264-Ugly_Number_II/leetcode-264-Ugly_Number_II.cpp)\n\u003e\u003e\u003e - ⚡ [274 - H-Index](./leetcode-274-H-Index/) / [Cpp](./leetcode-274-H-Index/leetcode-274-H-Index.cpp)\n\u003e\u003e\u003e - ✅ [278 - First Bad Version](./leetcode-278-First_Bad_Version/) / [Cpp](./leetcode-278-First_Bad_Version/leetcode-278-First_Bad_Version.cpp)\n\u003e\u003e\u003e - ⚡ [289 - Game of Life](./leetcode-289-Game_of_Life/) / [Cpp](./leetcode-289-Game_of_Life/leetcode-289-Game_of_Life.cpp)\n\u003e\u003e\u003e - ✅ [290 - Word Pattern](./leetcode-290-Word_Pattern/) / [Cpp](./leetcode-290-Word_Pattern/leetcode-290-Word_Pattern.cpp)\n\u003e\u003e\u003e - ⚡ [380 - Insert Delete GetRandom](./leetcode-380-Insert_Delete_GetRandom/) / [Cpp - V1](./leetcode-380-Insert_Delete_GetRandom/leetcode-380-Insert_Delete_GetRandom-V1.cpp) / [Cpp - V2](./leetcode-380-Insert_Delete_GetRandom/leetcode-380-Insert_Delete_GetRandom-V2.cpp)\n\u003e\u003e\u003e - ✅ [383 - Ransom Note](./leetcode-383-Ransom_Note/) / [Cpp](./leetcode-383-Ransom_Note/leetcode-383-Ransom_Note.cpp) / [Python](./leetcode-383-Ransom_Note/leetcode-383-Ransom_Note.py)\n\u003e\u003e\u003e - ✅ [392 - Is Subsequence](./leetcode-392-Is_Subsequence/) / [Cpp](./leetcode-392-Is_Subsequence/leetcode-392-Is_Subsequence.cpp) / [Python](./leetcode-392-Is_Subsequence/leetcode-392-Is_Subsequence.py)\n\u003e\u003e\u003e - ⚡ [452 - Minimum Number of Arrows to Burst Balloons](./leetcode-452-Minimum_Number_of_Arrows_to_Burst_Balloons/) / [Cpp](./leetcode-452-Minimum_Number_of_Arrows_to_Burst_Balloons/leetcode-452-Minimum_Number_of_Arrows_to_Burst_Balloons.cpp)\n\u003e\u003e\u003e - ✅ [509 - Fibonacci Number](./leetcode-509-Fibonacci_Number/) / [C](./leetcode-509-Fibonacci_Number/leetcode-509-Fibonacci_Number.c)\n\u003e\u003e\u003e - ✅ [530 - Minimum Absolute Difference in BST](./leetcode-530-Minimum_Absolute_Difference_in_BST/) / [Cpp](./leetcode-530-Minimum_Absolute_Difference_in_BST/leetcode-530-Minimum_Absolute_Difference_in_BST.cpp)\n\u003e\u003e\u003e - ⚡ [570 - Managers with at Least 5 Direct Reports](./leetcode-570-Managers_with_at_Least_5_Direct_Reports/) / [MySQL](./leetcode-570-Managers_with_at_Least_5_Direct_Reports/leetcode-570-Managers_with_at_Least_5_Direct_Reports-MySQL.sql) / [PostgreSQL](./leetcode-570-Managers_with_at_Least_5_Direct_Reports/leetcode-570-Managers_with_at_Least_5_Direct_Reports-PostgreSQL.sql)\n\u003e\u003e\u003e - ✅ [577 - Employee Bonus](./leetcode-577-Employee_Bonus/) / [MySQL](./leetcode-577-Employee_Bonus/leetcode-577-Employee_Bonus-MySQL.sql) / [PostgreSQL](./leetcode-577-Employee_Bonus/leetcode-577-Employee_Bonus-PostgreSQL.sql)\n\u003e\u003e\u003e - ✅ [584 - Find Customer Referee](./leetcode-584-Find_Customer_Referee/) / [Sql](./leetcode-584-Find_Customer_Referee/leetcode-584-Find_Customer_Referee.sql)\n\u003e\u003e\u003e - ✅ [590 - N-ary Tree Postorder Traversal](./leetcode-590-N-ary_Tree_Postorder_Traversal/) / [Cpp](./leetcode-590-N-ary_Tree_Postorder_Traversal/leetcode-590-N-ary_Tree_Postorder_Traversal.cpp)\n\u003e\u003e\u003e - ✅ [595 - Big Countries](./leetcode-595-Big_Countries/) / [Sql](./leetcode-595-Big_Countries/leetcode-595-Big_Countries.sql)\n\u003e\u003e\u003e - ⚡ [624 - Maximum Distance in Arrays](./leetcode-624-Maximum_Distance_in_Arrays/) / [Cpp](./leetcode-624-Maximum_Distance_in_Arrays/leetcode-624-Maximum_Distance_in_Arrays.cpp)\n\u003e\u003e\u003e - ⚡ [650 - 2 Keys Keyboard](./leetcode-650-2_Keys_Keyboard/) / [Python](./leetcode-650-2_Keys_Keyboard/leetcode-650-2_Keys_Keyboard.py)\n\u003e\u003e\u003e - ✅ [703 - Kth Largest Element in a Stream](./leetcode-703-Kth_Largest_Element_in_a_Stream/) / [Cpp - V1](./leetcode-703-Kth_Largest_Element_in_a_Stream/leetcode-703-Kth_Largest_Element_in_a_Stream-V1.cpp) / [Cpp - V2](./leetcode-703-Kth_Largest_Element_in_a_Stream/leetcode-703-Kth_Largest_Element_in_a_Stream-V2.cpp)\n\u003e\u003e\u003e - 🔥 [719 - Find K-th Smallest Pair Distance](./leetcode-719-Find_K-th_Smallest_Pair_Distance/) / [Cpp](./leetcode-719-Find_K-th_Smallest_Pair_Distance/leetcode-719-Find_K-th_Smallest_Pair_Distance.cpp)\n\u003e\u003e\u003e - ⚡ [840 - Magic Squares In Grid](./leetcode-840-Magic_Squares_In_Grid/) / [Cpp](./leetcode-840-Magic_Squares_In_Grid/leetcode-840-Magic_Squares_In_Grid.cpp)\n\u003e\u003e\u003e - ✅ [860 - Lemonade Change](./leetcode-860-Lemonade_Change/) / [Cpp](./leetcode-860-Lemonade_Change/leetcode-860-Lemonade_Change.cpp)\n\u003e\u003e\u003e - ⚡ [885 - Spiral Matrix III](./leetcode-885-Spiral_Matrix_III/) / [Cpp](./leetcode-885-Spiral_Matrix_III/leetcode-885-Spiral_Matrix_III.cpp)\n\u003e\u003e\u003e - ⚡ [959 - Regions Cut By Slashes](./leetcode-959-Regions_Cut_By_Slashes/) / [Cpp - V1](./leetcode-959-Regions_Cut_By_Slashes/leetcode-959-Regions_Cut_By_Slashes-V1.cpp) / [Cpp - V2](./leetcode-959-Regions_Cut_By_Slashes/leetcode-959-Regions_Cut_By_Slashes-V2.cpp)\n\u003e\u003e\u003e - ✅ [1068 - Product Sales Analysis I](./leetcode-1068-Product_Sales_Analysis_I/) / [Sql](./leetcode-1068-Product_Sales_Analysis_I/leetcode-1068-Product_Sales_Analysis_I.sql)\n\u003e\u003e\u003e - ✅ [1148 - Article Views I](./leetcode-1148-Article_Views_I/) / [Sql](./leetcode-1148-Article_Views_I/leetcode-1148-Article_Views_I.sql)\n\u003e\u003e\u003e - ✅ [1280 - Students and Examinations](./leetcode-1280-Students_and_Examinations/) / [MySQL](./leetcode-1280-Students_and_Examinations/leetcode-1280-Students_and_Examinations-MySQL.sql) / [PostgreSQL](./leetcode-1280-Students_and_Examinations/leetcode-1280-Students_and_Examinations-PostgreSQL.sql)\n\u003e\u003e\u003e - ✅ [1378 - Replace Employee ID With The Unique Identifier](./leetcode-1378-Replace_Employee_ID_With_The_Unique_Identifier/) / [Sql](./leetcode-1378-Replace_Employee_ID_With_The_Unique_Identifier/leetcode-1378-Replace_Employee_ID_With_The_Unique_Identifier.sql)\n\u003e\u003e\u003e - ⚡ [1514 - Path with Maximum Probability](./leetcode-1514-Path_with_Maximum_Probability/) / [Cpp](./leetcode-1514-Path_with_Maximum_Probability/leetcode-1514-Path_with_Maximum_Probability.cpp)\n\u003e\u003e\u003e - 🔥 [1568 - Minimum Number of Days to Disconnect Island](./leetcode-1568-Minimum_Number_of_Days_to_Disconnect_Island/) / [Python](./leetcode-1568-Minimum_Number_of_Days_to_Disconnect_Island/leetcode-1568-Minimum_Number_of_Days_to_Disconnect_Island.py)\n\u003e\u003e\u003e - ✅ [1581 - Customer Who Visited but Did Not Make Any Transactions](./leetcode-1581-Customer_Who_Visited_but_Did_Not_Make_Any_Transactions/) / [Sql](./leetcode-1581-Customer_Who_Visited_but_Did_Not_Make_Any_Transactions/leetcode-1581-Customer_Who_Visited_but_Did_Not_Make_Any_Transactions.sql)\n\u003e\u003e\u003e - ✅ [1661 - Average Time of Process per Machine](./leetcode-1661-Average_Time_of_Process_per_Machine/) / [MySQL](./leetcode-1661-Average_Time_of_Process_per_Machine/leetcode-1661-Average_Time_of_Process_per_Machine-MySQL.sql) / [PostgreSQL](./leetcode-1661-Average_Time_of_Process_per_Machine/leetcode-1661-Average_Time_of_Process_per_Machine-PostgreSQL.sql)\n\u003e\u003e\u003e - ✅ [1683 - Invalid Tweets](./leetcode-1683-Invalid_Tweets/) / [Sql](./leetcode-1683-Invalid_Tweets/leetcode-1683-Invalid_Tweets.sql)\n\u003e\u003e\u003e - ✅ [1757 - Recyclable and Low Fat Products](./leetcode-1757-Recyclable_and_Low_Fat_Products/) / [Sql](./leetcode-1757-Recyclable_and_Low_Fat_Products/leetcode-1757-Recyclable_and_Low_Fat_Products.sql)\n\u003e\u003e\u003e - ⚡ [1894 - Find the Student that Will Replace the Chalk](./leetcode-1894-Find_the_Student_that_Will_Replace_the_Chalk/) / [Cpp](./leetcode-1894-Find_the_Student_that_Will_Replace_the_Chalk/leetcode-1894-Find_the_Student_that_Will_Replace_the_Chalk.cpp)\n\u003e\u003e\u003e - ⚡ [1937 - Maximum Number of Points with Cost](./leetcode-1937-Maximum_Number_of_Points_with_Cost/) / [Cpp](./leetcode-1937-Maximum_Number_of_Points_with_Cost/leetcode-1937-Maximum_Number_of_Points_with_Cost.cpp)\n\u003e\u003e\u003e - ✅ [1945 - Sum of Digits of String After Convert](./leetcode-1945-Sum_of_Digits_of_String_After_Convert/) / [Cpp](./leetcode-1945-Sum_of_Digits_of_String_After_Convert/leetcode-1945-Sum_of_Digits_of_String_After_Convert.cpp)\n\u003e\u003e\u003e - ✅ [2022 - Convert 1D Array Into 2D Array](./leetcode-2022-Convert_1D_Array_Into_2D_Array/) / [Cpp](./leetcode-2022-Convert_1D_Array_Into_2D_Array/leetcode-2022-Convert_1D_Array_Into_2D_Array.cpp)\n\u003e\u003e\u003e - ⚡ [2390 - Removing Stars From a String](./leetcode-2390-Removing_Stars_From_a_String/) / [Cpp](./leetcode-2390-Removing_Stars_From_a_String/leetcode-2390-Removing_Stars_From_a_String.cpp)\n\u003e\u003e\u003e - ✅ [2574 - Left and Right Sum Differences](./leetcode-2574-Left_and_Right_Sum_Differences/) / [Cpp](./leetcode-2574-Left_and_Right_Sum_Differences/leetcode-2574-Left_and_Right_Sum_Differences.cpp)\n\u003e\u003e\u003e - ✅ [2667 - Create Hello World Function](./leetcode-2667-Create_Hello_World_Function/) / [JavaScript](./leetcode-2667-Create_Hello_World_Function/leetcode-2667-Create_Hello_World_Function.js)\n\u003e\u003e\u003e - ✅ [2696 - Minimum String Length After Removing Substrings](./leetcode-2696-Minimum_String_Length_After_Removing_Substrings/) / [Cpp](./leetcode-2696-Minimum_String_Length_After_Removing_Substrings/leetcode-2696-Minimum_String_Length_After_Removing_Substrings.cpp)\n\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshaharashe%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshaharashe%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshaharashe%2Fleetcode/lists"}