only 2 rounds interview
Round 1 :
Q1 : Given tree is bst or not
Q2 : https://www.geeksforgeeks.org/rearrange-characters-string-no-two-adjacent/
Round 2:
Q1 : https://www.geeksforgeeks.org/find-subarray-with-given-sum-in-array-of-integers/
Q2 : https://www.geeksforgeeks.org/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/
Q3 : https://www.geeksforgeeks.org/stock-buy-sell/

1. You have to convert base 2 number into base 6 constraint : length of array <1000

2. You have to find sum of product of cool subset : cool subset is having number of odd element even total size of subset is k constraint size of array <1000;

3. you have to find number of numbers of exact digit n whose digit sum is compact number. compact number is the number which is made by the given x, y for ex if x and y are 2 and 3 respectively then 22, 33, 23, 32 are compact numbers. x<=9 y<=9 n<=1000