gitextract_p1x2cpzs/

├── .gitignore
├── 3_segment.cpp
├── Best_Time_To_Buy_And_Sell_Stock_.cpp
├── BitonicSequence.cpp
├── Box_Stacking_Problem.cpp
├── Circular_Kadene.cpp
├── Coin_Changing_1.cpp
├── Coin_Changing_2.cpp
├── Count_All_Increasing_Subsequences.cpp
├── Count_All_Pallindromic_Subsequence.cpp
├── Count_Distinct_Subsequences.cpp
├── Count_Number_of_hops.cpp
├── Count_Pallindromic_SubString_Of_String_gfg.cpp
├── Count_Subsets_of_given_Sum.cpp
├── Count_ways_to_N'th_Stair.cpp
├── Diameter_Of_Binary_Tree.cpp
├── Distinct_Occurences.cpp
├── Edit_Distance.cpp
├── Equal_Sum_Partition.cpp
├── Friends_Pairing_Problem.cpp
├── Get_Minimum_Squares.cpp
├── GoldMine_Problem.cpp
├── Jump_Game_3.cpp
├── Jump_Game_5.cpp
├── Kadane.cpp
├── Knapsack_0_1.cpp
├── Last_Stone_3.cpp
├── Longest_Common_Subsequence.cpp
├── Longest_Common_Substring.cpp
├── Longest_Consequetive_Subsequence.cpp
├── Longest_Decreasing_Subsequence.cpp
├── Longest_Increasing_Subsequence.cpp
├── Longest_Pallindromic_Subsequence.cpp
├── Longest_Pallindromic_Substring.cpp
├── Longest_Repeating_Subsequence.cpp
├── Matrix_Chain_Multiplication.cpp
├── Max_Path_Sum_in_Triangle.cpp
├── Max_path_sum.cpp
├── Maximize_the_cutting.cpp
├── Maximum_Dot_Product_Subsequence.cpp
├── Maximum_Path_Sum_in_Binary_tree.cpp
├── Maximum_Product_Increasing_Subsequence.cpp
├── Maximum_Size_Submatrix_Square.cpp
├── Maximum_Sum_Decreasing_Subsequence.cpp
├── Maximum_Sum_Dividing_Recurssive.cpp
├── Maximum_Sum_Increasing_Subsequence.cpp
├── Maximum_length_of_pairs.cpp
├── Minimum_Ascii_Sum_deletion_To_Make_two_Strings_equal.cpp
├── Minimum_Initial_Points_To_Reach_Destinaion.cpp
├── Minimum_Jumps_To_Reach_End.cpp
├── Minimum_Subset_Sum_Difference.cpp
├── Minm_Cost_To_Fill_Bag.cpp
├── Minm_Deletion_To_Make_Pallindrome.cpp
├── Minm_Insertion_Deletion_Convert.cpp
├── No_Of_Ways_To_Tile.cpp
├── Number_of_ways_to_decode_a_string.cpp
├── Optimal_Strategy_To_Play_A_Game.cpp
├── Path_In_A_Matrix.cpp
├── Print_Longest_Common_Subsequence.cpp
├── Procuct_of_array_except_self.cpp
├── README.md
├── Reach_a_given_score.cpp
├── Rod_Cutting.cpp
├── Russian_Doll_Envelope.cpp
├── Shortest_Common_Supersequence.cpp
├── SubsetSum.cpp
├── Tiling_Problem.cpp
├── Unbounded_Knapsack.cpp
├── Uncrossed_Lines.cpp
├── count_submatrices_with_all_ones.cpp
├── count_subsets_of_given_difference.cpp
├── flip_game_1.cpp
├── flip_game_2.cpp
├── jump_game_2..cpp
├── longest_alternating_subsequence.cpp
├── maximal_square.cpp
├── maximum_product_subarray.cpp
├── maximum_sum_submatrix.cpp
├── minm_number_of_taps_to_open_water.cpp
├── nim_game.cpp
├── nth_catlan_number.cpp
├── num_products.cpp
├── number_of_permutations_such_that_no_three_forms_increasing_sequence.cpp
├── number_of_valid_parenthesis.cpp
├── spoj/
│   ├── ABA12C - Buying Apples!.cpp
│   ├── ACODE - Alphacode.cpp
│   ├── AIBOHP - Aibohphobia.cpp
│   └── ANARC09A - Seinfeld.cpp
├── unique_paths_1.cpp
├── unique_paths_2.cpp
├── video_stiching.cpp
└── zerosAndOnes.cpp