Update appNew update is available. Click here to update.
SDE - 1
Flipkart
upvote
share-icon
4 rounds | 8 Coding problems
views
0 views
comment
0 comments
upvote
0 upvotes
Interview preparation journey
expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, JAVA, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 - Practice at least 250 Questions from coding ninjas
Tip 2 - Do some good projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume and be confident.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date20 Jul 2019
Problems3
Distinct Subarrays with at most k odd elements II

You are given an array “ARR” of N integers. Your task is to find the total number of distinct subarrays of A having at most K odd elements.

Note:
view more
Try solving now
Find All Subsets

You are given an array ‘arr’ of ‘N’ distinct integers. Your task is to find all the non-empty subsets of the array.

Note: You can return the subsets in any order, you don’t have to...

view more
Try solving now
Overlapping Intervals

You have been given the start and end times of 'N' intervals. Write a function to check if any two intervals overlap with each other.

Note :
view more
Try solving now
02
Round
Medium
Face to Face
Duration30 minutes
Interview date24 Jul 2029
Problems2
Balanced parentheses

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

view more
Problem approach

consider every bracket and recursively count number of reversals by taking two cases (i) keeping the bracket as it is (ii) reversing the bracket. If we get a balanced expression, we update result if number of steps followed for reaching here is smaller than the minimum so far.

Try solving now
City And Bridges

Ninja got a map in his hand with ‘N’ cities numbered 1 to ‘N’, connected with bridges. He asks his sister to delete some cities from the map.

view more
Try solving now
03
Round
Medium
Face to Face
Duration30 minutes
Interview date24 Jul 2019
Problems2
Convert Sorted Array to BST

You have been given a sorted array of length ‘N’. You need to construct a balanced binary search tree from the array. If there can be more than one possible tree, then you can return any.

N...

view more
Try solving now
Job Sequencing Problem

You are given a N x 2 2-D array 'Jobs' of 'N' jobs where Jobs[i][0] denote the deadline of i-th job and Jobs[i][1] denotes the profit associated with i-th job.

view more
Problem approach

Solution is to generate all subsets of a given set of jobs and check individual subsets for the feasibility of jobs in that subset. Keep track of maximum profit among all feasible subsets.

Try solving now
04
Round
Easy
HR Round
Duration15 minutes
Interview date24 Jul 2019
Problems1
Basic HR Questions

He gave me to write a code in Java using OOP.

Later asked me advantages of abstraction and interfaces.

Later he asked me questions like if I give you 1 million dollar where and how will you use it?

Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Flipkart
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 8 problems
Interviewed by Flipkart
435 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Flipkart
180 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Flipkart
14 views
0 comments
0 upvotes
Companies with similar interview experiencs
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57326 views
15 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
25817 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
18070 views
4 comments
0 upvotes