# Tag Archives: Flipkart

Total 3 Rounds:  Machine Coding Round (120 min) Problem Solving and Data Structures (60 – 90 min) Hiring Manager Round (45 min) Round 1(Machine Coding… Read More
Launchpad is a one-of-a-kind Internship program offered by Ekart, Flipkart’s supply chain arm and one of India’s largest e-commerce enterprises. It is an opportunity for… Read More
I applied through Employee Referral. The whole process was completed in a single day(Saturday). There were 4 openings and 20 students were shortlisted for the… Read More
Total 3 Round Machine Coding Round (120 min) Problem Solving and Data Structures (60 – 90 min) Hiring Manager Round (45 min) Round 1(Machine Coding… Read More
Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More
Given a linked list where every node represents a linked list and contains two pointers of its type:  Pointer to next node in the main… Read More