Flipkart — Online Coding: Pattern, Syllabus & Mock Test
Flipkart — Online Coding pattern: 3 questions in 90 minutes across 1 section. Sample questions, a preparation guide and a free timed mock.
- Pattern: Flipkart
- Duration: 90 minutes
- Questions: 3
- Timing: Free — move between sections until the paper's clock ends
- Negative marking: None
Three problems in ninety minutes, and complexity is judged, not just correctness.
- Pure coding
- Complexity is assessed
- Low clear rate
Sections
| Section | Questions | Time | Kind | Marks each |
|---|---|---|---|---|
| Coding | 3 | 90 min | Coding | 10 |
Flipkart — Online Coding syllabus
Coding: Flipkart coding questions 63 problems
Instructions
Flipkart's first round is three coding problems in ninety minutes on a proctored platform. There is no aptitude or reasoning section at all.
- All test cases must pass for a problem to count as solved in the real round, and time and space complexity are assessed alongside correctness.
- The reported clear rate is around ten to fifteen per cent, so treat a partial score here as normal.
- Arrays, strings, trees, graphs, hashing, sliding window, recursion and dynamic programming.
The machine-coding round that follows, where you build a small runnable program from a specification, is a different exercise and is not modelled.
How to prepare for this pattern
A guide to the Flipkart online coding round pattern: three problems in ninety minutes, where complexity is judged as well as correctness.
What the paper looks like
One section: Coding, three problems of medium difficulty in 90 minutes on a shared clock, with free movement between them. There is no aptitude or reasoning section. In the real round every test case must pass for a problem to count as solved, and time and space complexity are assessed alongside correctness. This mock scores each problem out of ten on the test cases passed, with no negative marking, so a partial score shows here; treat it as a sign of what still needs work. The paper is not adaptive. Three problems in 90 minutes is the main report, and some batches add a debugging block. The machine-coding round that follows, where you build a small runnable program from a specification, is a different exercise and is not modelled.
How to prepare, section by section
- Coding. The reported topics are arrays, strings, trees, graphs, hashing, sliding window, recursion and dynamic programming. Work the hubs for each: Arrays, Strings, Hash Table, Sliding Window, Recursion and Dynamic Programming, with Depth-First Search, Breadth-First Search and Graph for the tree and graph problems. Because all test cases must pass, the large hidden inputs are what fail most solutions: for every problem you practise, work out the complexity the constraints allow before writing, and do not stop at a solution that only passes the examples. The DSA roadmap orders these topics so that each stage builds on the last.
- Language. Know your language's hash map, set, sorting and queue by heart; the Java, C++, Python and JavaScript study plans cover them.
On the day
Thirty minutes a problem is the even split. Read all three, then start with the one whose efficient solution you can see. Since a problem in the real round counts only when every test case passes, one fully correct solution is worth more than three partial ones, so finish and verify each before moving on. Check the edge cases the hidden tests are likely to hold: empty input, a single element, duplicates and the maximum size. If a solution is correct but too slow, the constraints usually tell you by how much, and that points to the technique you need.
This mock is modelled on Flipkart's published first-round pattern, in which the absence of an aptitude section is explicit; CodeKairo is not affiliated with Flipkart.
About this pattern
Well documented, and the absence of an aptitude section is explicit in the sources. Three problems in 90 minutes is the main report; some batches add a debugging block.
Modelled on the published pattern; not affiliated with Flipkart. Every sitting draws a fresh paper from the aptitude bank and the problem catalogue.