I applied through university. I interviewed at RoboMQ (Jaipur, Rajasthan)
Interview
In a two-round assessment, the first round comprises subjective questions on tree data structures like the LCA concept and in-order traversal. The second round explores dynamic programming, discussing its core idea and featuring an interview question about efficient Fibonacci sequence calculation using dynamic programming.
Interview questions [1]
Question 1
trees and dynamic programming questions were asked