it started with 2 dsa problems , one was the jump game problem , the other was int to roman conversion , then came the CV discussion , then one hr type question .

Similar to round 1 , 2 dsa questions , one was minimum swaps required to make a string regular bracket sequence , the second was given a binary string , find minimum window containing k ones.