1) Basic Array problem, easy question, to find if X array can be divided into two halves such that each half has atleast K sum 2) Basic String Matching, Can be solved in O(n^2) the constraints allow it 3) prefix suffix 4) sliding window
Check out your Company Bowl for anonymous work chats.