The first round was an online test that analyzed the students from a coding perspective. There were eligibility criteria set by the company for the first round you need to be in the 3rd year, branch CSE, with 7.5 CGPA above, you can sit in the first round.
The round was conducted on an online platform (AMCAT) and consisted of 1 section and the time allotted was 1.5 hrs. There were 3 coding questions.
The first question was based on Graphs DFS. It was simply related to finding the no. of elements in different components.
The second question was the standard KMP algorithm question. The only twist is that if the letter is in uppercase then it can be considered equal to lowercase.
The third question was also based on the graph. Given a weighted undirected graph, you have to find the shortest distance between source and destination given you can remove k edges from the path.
Domande di colloquio [1]
Domanda 1
Given two integer arrays A and B of size N.
There are N gas stations along a circular route, where the amount of gas at station i is A[i].
You have a car with an unlimited gas tank and it costs B[i] of gas to travel from station i
to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.
Return the minimum starting gas station’s index if you can travel around the circuit once, otherwise return -1.
You can only travel in one direction. i to i+1, i+2, … n-1, 0, 1, 2.. Completing the circuit means starting at i and
ending up at i again.
Ho sostenuto un colloquio presso Flipkart (Bengaluru)
Colloquio
WouldBasics of Machine Learning, Since i'm not an ML guy, got cooked. suggest not having ML stuff that you have "applied" but rather only things you know the maths on
Domande di colloquio [1]
Domanda 1
Why is logistic loss between 0 and 1.
What is PPO, why do we need reinforcement-learning.
Some complicated RL term I never came across
2 DSA rounds, 1st round easy leetcode questions, second round easy-medium questions. Explain your approach and ask for hints if required. Questions are related to arrays, double linked list, stack, queue. Basic understanding of adding removing and deleting from data structures is good.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Flipkart (Bengaluru) nel mese di lug 2024
Colloquio
It consisted of 3 questions in the online assessment. 2 questions were from dp and one question asked was word search where some constraint were given and u can move up dowm left right and diagonal.