prob 1: \nhttps://algo.monster/problems/amazon_oa_find_all_combination_of_numbers_sum_to_target\nShould be O(N^3).  I did not pass the tests per TLE\n\n\nprob 2:\nhttps://leetcode.com/discuss/interview-question/1148760/items-in-containers-amazon-oa\n\\* and | problem.  Given a string with \\* and | and 2 arrays of startIndices and endIndices, output an array of the number of compartments (between 2 sticks)\n`*|**|` has 1 compartment with 2 \\*.\nDoable in O(N) time.\n\n**Update**\nhttps://leetcode.com/discuss/interview-question/1180017/Amazon-OA/1171249\nhttps://leetcode.com/discuss/interview-question/1180017/Amazon-OA/1171090

prob 1: \nhttps://algo.monster/problems/amazon_oa_find_all_combination_of_numbers_sum_to_target\nShould be O(N^3).  I did not pass the tests per TLE\n\n\nprob 2