LeetCode-COMMON-INTERVIEW-QUESTIONS-Python

My Solutions to LeetCode COMMON INTERVIEW QUESTIONS are listed as follows (9 Chapters) (using Python)

Chapter 1 Array String

• 1_Two_Sum_Easy
• 3_Longest_Substring_Without_Repeating_Characters_Medium
• 5_Longest_Palindromic_Substring_Medium
• 8_String_to_Integer_atoi_Medium
• 28_Implement_strStr_Easy
• 65_Valid_Number_Hard
• 125_Valid_Palindrome_Easy
• 151_Reverse_Words_in_a_String_Medium
• 167_Two_Sum_II_Input_array_is_sorted_Easy

Chapter 2 Math

• 7_Reverse_Integer_Easy.py
• 9_Palindrome_Number_Easy
• 66_Plus_One_Easy

Chapter 3 Linked_List

• 2_Add_Two_Numbers_Medium
• 21_Merge_Two_Sorted_Lists_Easy
• 24_Swap_Nodes_in_Pairs_Medium

Chapter 4 Binary _Tree

• 98_Validate_Binary_Search_Tree_Medium
• 104_Maximum_Depth_of_Binary_Tree_Easy
• 108_Convert_Sorted_Array_to_Binary_Search_Tree_Easy
• 110_Balanced_Binary_Tree_Easy
• 111_Minimum_Depth_of_Binary_Tree_Easy

Chapter 5 Bit Manipulation

• 136_Single_Number_Easy
• 137_Single_Number_II_Medium

Chapter 6 Misc

• 12_Integer_to_Roman_Medium
• 13_Roman_to_Integer_Easy
• 54_Spiral_Matrix_Medium

Chapter 7 Stack

• 20_Valid_Parentheses_Easy
• 150_Evaluate_Reverse_Polish_Notation_Medium
• 155_Min_Stack_Easy

Chapter 8 Dynamic Programming

• 62_Unique_Paths_Medium
• 70_Climbing_Stairs_Easy
• 152_Maximum_Product_Subarray_Medium_dynamic_programming
• 152_Maximum_Product_Subarray_Medium_brute_force

Chapter 9 Binary Search

• 35_Search_Insert_Position_Easy
• 153_Find_Minimum_in_Rotated_Sorted_Array_Medium_O_n
• 153_Find_Minimum_in_Rotated_Sorted_Array_Medium_O_lgn

Reference

• 50 COMMON INTERVIEW QUESTIONS