It was an online technical round. It started off with straight 2 DSA and coding problems. I was asked to code it on a document shared by the interviewer.
Sigiloso
t was also a dynamic programming problem. Given a number n, find if n can be formed as a sum of a combination of Fibonacci numbers till n.