There are many round but first coding round was probably the toughest you have to do CP to solve this. I would say it was Leetcode hard. Do code chef , codeforces and all. It was on hacker rank platform
It consisted of 3 rounds but I was eliminated in round 1. The question is a twist on the concept of graphs. I gave the interviewer the logic but was unable to code it.
Interview questions [1]
Question 1
Given currency conversions, find out whether there is an arbitrage in them.
There was one questions related to graphs (strongly connected component), one from DP and third one of simple maths(Base conversion). Interview was of medium difficulty level. Brush up your basic DS along with special focus on graphs and DP.
Interview questions [1]
Question 1
There was one questions related to graphs (strongly connected component), one from DP and third one of simple maths(Base conversion)