Upstox Software Development Engineer (SDE) interview questions

Knapsack, binary search tree, DP

ques 1 :- dsa; a binary number is a goodsequence if its follows these two conditions (i)number of 1's and 0's are equal. (ii) all prefixes of that binary number(eg: for binary number 1100 prefixes are 1,11,110,1100) must have number of 1's>= number of 0's given a binarynumber check whether its adjacent subsequences(10010101 here 1001 and 0101 are adjacent subsequences) are goodsequences then swap that sequences and return the longest one among the such swapped sequences" ques 2 :-react implementation- search and filter fetch api according to the user input and list it