This is practice code for interview problems From Algoexpert as practice for the interviews Four Number Sum Subarray sort Longest Range minimum Rewards zig zag traverse Same BST Max path Sum Maximum increasing subsequence