Flipkart GRiD is one of India's largest engineering hiring challenges organized by Flipkart to identify talented software engineers, AI engineers, and data scientists across the country.
The competition provides engineering students with an opportunity to compete against thousands of participants while earning a chance to secure:
- Software Development Engineer (SDE) interviews
- Summer Internship opportunities
- Winter Internship opportunities
- Pre-Placement Offers (PPO)
- Full-Time Offers (FTE)
- National recognition
- Certificates for qualifying rounds
Every edition attracts more than one lakh registrations from engineering colleges across India.
This repository is created to help students prepare efficiently for Flipkart GRiD by collecting:
- Previous Year Coding Questions
- Detailed Problem Statements
- Clean Markdown Documentation
- Interview Preparation Material
- Coding Assessment Patterns
- Graph, DP, String and Mathematical Problems
- Frequently Asked Question Types
The goal is to maintain a well-organized collection that closely resembles the actual coding assessment experience.
| No. | Problem | Topic | Difficulty |
|---|---|---|---|
| 1 | Remove Alphabets and Evaluate Mathematical Expression | String, Expression Parsing | Medium |
| 2 | Shortest Path Between Same Coloured Vertices | Graph, Dijkstra | Hard |
| 3 | Maximum Reachable Cells by Robot | Graph Traversal, BFS, DFS | Medium |
| 4 | Village Voyage | Greedy, Circular Array | Medium |
| 5 | Smallest Axis-Aligned Square | Geometry, Hashing | Medium |
| 6 | Count Jumps Across Slippery Logs | Simulation | Medium |
This repository covers a wide range of interview topics including:
- Arrays
- Strings
- Mathematics
- Simulation
- Greedy Algorithms
- Graph Traversal
- Dijkstra's Algorithm
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Geometry
- Hashing
- Dynamic Programming
- Trees
- Binary Search
- Sliding Window
- Stack
- Queue
- Priority Queue
- Prefix Sum
- Backtracking
The coding assessment generally consists of:
| Section | Description |
|---|---|
| Coding Questions | Easy to Hard implementation problems |
| Data Structures | Arrays, Graphs, Trees, Hash Maps |
| Algorithms | BFS, DFS, Dijkstra, DP, Greedy |
| Problem Solving | Mathematical and Logical Questions |
| Optimization | Time and Space Complexity |
Most coding rounds emphasize:
- Correctness
- Edge Case Handling
- Efficient Algorithms
- Clean Code
- Time Complexity Optimization
| Difficulty | Expected Questions |
|---|---|
| Easy | 20% |
| Medium | 55% |
| Hard | 25% |
Most questions are implementation-heavy and test logical thinking more than advanced competitive programming techniques.
To perform well in Flipkart GRiD:
- Strengthen Data Structures fundamentals.
- Practice Graph algorithms regularly.
- Solve implementation-based coding questions.
- Improve debugging speed.
- Learn common Greedy techniques.
- Practice Geometry and Mathematical problems.
- Focus on writing clean and optimized solutions.
- Revise previous year questions multiple times.
Tip
- Read the entire problem carefully before coding.
- Consider edge cases before implementation.
- Optimize only after obtaining a correct solution.
- Test your solution on custom inputs.
- Avoid unnecessary data structures.
- Manage time wisely.
Important
Solving previous year questions is one of the most effective ways to understand the actual difficulty level and coding patterns of Flipkart GRiD.
- Well-formatted problem statements
- GitHub-friendly Markdown
- Accurate sample inputs and outputs
- Explanations
- Graph illustrations where applicable
- Interview-oriented problems
- Coding assessment practice
This repository is suitable for:
- B.Tech Students
- B.E. Students
- M.Tech Students
- M.E. Students
- M.S. Students
- PhD Students
- Students preparing for Software Development Engineer interviews
- Students preparing for internship coding assessments
Flipkart GRiD follows a multi-stage evaluation process to identify highly skilled engineering students across India. Every round acts as a qualifier for the subsequent stage.
| Round | Stage | Description |
|---|---|---|
| 1 | Screening | Academic profile, achievements, resume, and eligibility verification |
| 2 | Coding Assessment | Online proctored coding test conducted on HirePro |
| 3 | Case Study + Code | Solve a real Flipkart business problem by designing and implementing a working solution |
| 4 | National Finals | Top shortlisted candidates compete at Flipkart Headquarters in Bengaluru |
Important
Clearing one round does not guarantee selection for the next stage. Each round has an independent evaluation criterion.
The first round evaluates the participant's profile before the coding assessment.
Evaluation includes:
- Academic consistency
- Projects
- Technical achievements
- Competitive programming profile
- Resume quality
- Overall eligibility
Qualified candidates receive an invitation for the online coding assessment.
The coding assessment is conducted online and is typically 90 minutes long.
It evaluates:
- Data Structures
- Algorithms
- Problem Solving
- Coding Skills
- Time Complexity
- Space Optimization
Typical topics include:
| Topic | Importance |
|---|---|
| Arrays | High |
| Strings | High |
| Hashing | High |
| Graphs | Very High |
| Trees | High |
| Dynamic Programming | Medium |
| Greedy Algorithms | High |
| BFS / DFS | Very High |
| Binary Search | Medium |
| Mathematics | Medium |
| Geometry | Medium |
Tip
Most questions require efficient implementation rather than memorization of complex algorithms.
Candidates shortlisted after the coding assessment receive a real-world Flipkart business problem.
Participants are expected to:
- Understand the business requirement.
- Design an efficient solution.
- Implement the required system.
- Submit clean, production-quality code.
Evaluation focuses on:
- Problem-solving ability
- System design
- Code quality
- Scalability
- Innovation
The best performers from each track are invited to the Flipkart Headquarters in Bengaluru.
During the finals:
- Teams are formed.
- Participants work on a live problem statement.
- A functional prototype is built.
- The final solution is presented before Flipkart engineers and leadership.
This round evaluates both technical and collaborative skills.
Depending on your year of study and performance, Flipkart may offer:
| Opportunity | Eligible Students |
|---|---|
| Summer Internship | Third-Year Students |
| Winter Internship | Fourth-Year Students |
| Full-Time SDE Roles | Final-Year Students |
| PPO Opportunities | Outstanding Interns |
Flipkart GRiD offers multiple technology tracks.
| Track | Focus Area |
|---|---|
| Software Development | Algorithms, Data Structures, System Design |
| AI Engineering | Machine Learning, Deep Learning, AI Applications |
| Data Science | Statistics, Analytics, Machine Learning |
Candidates may apply to one or more tracks based on their interests and eligibility.
Outstanding participants receive:
- Internship interview opportunities
- Full-time interview opportunities
- National recognition
- Certificates
- Top Performer recognition
- Exposure to real-world engineering challenges
Note
Certificates are generally awarded to participants qualifying through multiple competition rounds.
Students from engineering institutions across India are eligible, including:
- B.Tech
- B.E.
- M.Tech
- M.E.
- M.S.
- Ph.D.
- Dual Degree Programs
- Integrated Degree Programs
Throughout the competition, candidates are assessed on:
- Programming
- Logical Thinking
- Problem Solving
- Algorithm Design
- Communication
- Collaboration
- Product Thinking
- Code Quality
- Optimization
- Innovation
A recommended preparation sequence is:
Programming Basics
│
▼
Arrays & Strings
│
▼
Hashing
│
▼
Linked Lists
│
▼
Stacks & Queues
│
▼
Trees
│
▼
Graphs (BFS / DFS / Dijkstra)
│
▼
Greedy Algorithms
│
▼
Dynamic Programming
│
▼
Mock Coding Assessments
│
▼
Interview Preparation
Tip
- Solve previous year questions multiple times.
- Focus on implementation-heavy problems.
- Practice writing bug-free code.
- Improve debugging speed.
- Learn graph algorithms thoroughly.
- Write modular and readable code.
- Analyze time and space complexity before submission.
Warning
During the assessment:
- Read every constraint carefully.
- Handle edge cases.
- Avoid hardcoding outputs.
- Test your solution with custom inputs.
- Submit only after verifying correctness.
| Category | Questions |
|---|---|
| String Processing | Remove Alphabets and Evaluate Mathematical Expression |
| Graph Algorithms | Shortest Path Between Same Coloured Vertices |
| BFS / DFS | Maximum Reachable Cells by Robot |
| Greedy | Village Voyage |
| Geometry | Smallest Axis-Aligned Square |
| Simulation | Count Jumps Across Slippery Logs |
You can solve every question in this repository using:
- C++
- Java
- Python
- C
The coding assessment generally allows multiple programming languages.
Most Flipkart GRiD coding problems expect solutions with optimized complexity.
| Problem Type | Preferred Complexity |
|---|---|
| Arrays | O(N) |
| Strings | O(N) |
| Hashing | O(N) |
| Graph Traversal | O(V + E) |
| Dijkstra | O((V + E) log V) |
| Greedy | O(N) |
| Geometry | O(N²) or better |
Important
A correct solution may still fail hidden test cases if it exceeds the expected time complexity.
Before submitting your solution, verify that it:
- Compiles successfully.
- Handles all edge cases.
- Produces the correct output format.
- Does not print unnecessary text.
- Uses appropriate data structures.
- Works within the given constraints.
| Week | Topics |
|---|---|
| Week 1 | Arrays, Strings, Mathematics |
| Week 2 | Hashing, Sliding Window, Binary Search |
| Week 3 | Linked Lists, Stacks, Queues |
| Week 4 | Trees and BST |
| Week 5 | Graphs (BFS, DFS, Topological Sort) |
| Week 6 | Dijkstra, Union-Find, Shortest Paths |
| Week 7 | Greedy Algorithms |
| Week 8 | Dynamic Programming |
| Week 9 | Previous Year Questions |
| Week 10 | Mock Assessments |
Contributions are always welcome.
If you would like to improve this repository, you can contribute by:
- Adding previous year questions.
- Improving existing documentation.
- Adding optimized solutions.
- Reporting issues.
- Fixing formatting mistakes.
- Improving explanations.
- Adding complexity analysis.
- Adding interview experiences.
The following resources will be added in future updates:
- C++ Solutions
- Java Solutions
- Python Solutions
- Complexity Analysis
- Editorials
- Dry Runs
- Interview Experiences
- Round-wise Notes
- System Design Resources
- HR Interview Questions
- OOP Revision Notes
- SQL Practice Questions
- Aptitude Preparation
- Mock Coding Tests
This repository is intended solely for educational and interview preparation purposes.
All problem statements belong to their respective owners. The content in this repository is maintained to help students understand the coding patterns commonly observed in Flipkart GRiD assessments.
Special thanks to:
- Flipkart
- HirePro
- Previous participants who shared their interview experiences
- The developer community for preserving and discussing coding questions
If you find this repository useful for your preparation, consider giving it a ⭐ to support the project and help other students discover it.
If this repository helps you during your preparation:
- Star the repository.
- Share it with your friends.
- Contribute new questions or improvements.
Your contributions help keep this collection useful and up to date for future Flipkart GRiD participants.

