Flipkart | SDE -1 | 2023 Grad | OFFER
College: NIT
Prior experience: 9 months, SDE1 at small scale startup
Location: Bangalore
Date: March 2024
Process:I have got a google form link for off campus hiring for 2023 grads and filled it.
OA: 1.5hrs | 3 Questions | Medium-Hard
please check this https://leetcode.com/discuss/interview-question/4879741/Flipkart-OA-2023-Grads(I am the author)
Interviews
PSDS Round 1 (1 hr):
Q1-> Trapping rain water problem(Leetcode)
I said the brute force and asked to optimize then used the concept of leftmax and rightmax arrays
I know the most optimized one as well but I didnt say as time is running out and need to cover second question
Asked me to write Pseudo code on google docs
He asked me to reduce space complexity, like i used 2 arrays to store , then i did that
Q2->Rotten Oranges(Leetcode)
Did that using bfs asked time complexities . Asked why bfs only , u can also use dfs and blah.
PSDS Round 2 (1 hr):
Q1-> asked number of pairs in an array such that sum is divisble by k. I said brute force and then used concept of hash map and remainders.
Q2->given a graph , U need to find max total sum of path starting from vertex u to all vertices
This question is vague and not clear as well. I will give example.
u have nodes 1 2 3 4
find dist of 1 to 2 1to 3 1 to 4
add all let sum be a1
find dist from, node 2 to all other ie 2 to 1 2 to 3 2 to 4
sum will be a2
so on...
u need to find max of a1 a2 ... an
I actually got tensed and worried so much in this question
i did dfs keeping track of sum variable
for all nodes
o(V*(V+E))
PS: this question is not clear and unfortunately i did not get test case example
Round 3 (30 min): Hiring Manager Round
Discussed the project I am currently working on in my current organization. Later, some behavorial questions were there.
Some Tips that i thought if i can get before:
(****** v important)-Do all top interview 150 leetcode and neetcode 150 (mixed)(you are expected to solve hard so do hard problems as well)
Time and space complexities are most important, and dont just say the optimized even though you know.
Main Main tip-- please ask a test case and do a dry run for it.(it would help very well trust me)
becoz I did not get any test case for round 2 , so i took so much time ,becoz our brains are generally greedy so we think of testcase that would work.Please have a good communication in codeing rounds, if you are not clear please ask , dont think inside your brain ask the restrictions.
becoz in round 2 graph question the graph may be cyclic, and there may be multiple paths from node to node then what to consider, I felt interviewer is missing some clarity on the question.
Compensation: https://leetcode.com/discuss/compensation/4951942/Flipkart-or-SDE-1or-2023-Grad
One point to mention- Getting selected is mixture of luck and hardwork. We only can do hard work.Dont worry and lets do hard work.
