SlaveCode LogoSlaveCode.
AcademyRoadmapProblemsSystem Design
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
‌
SlaveCode LogoSlaveCode.

Standardize your coding journey. From basic academy courses and guided roadmaps to advanced system design, company interview prep, and real-time coding arenas. The all-in-one platform to master algorithms and prove your engineering excellence.

Learn & Practice

  • Academy
  • Problems
  • Roadmap
  • System Design

Compete & Tools

  • Arena
  • Contests
  • Compilers

Legal & Support

  • Report an Issue
  • Privacy Policy
  • Terms of Service
  • Contact Us

© 2026 SlaveCode. All rights reserved.

Flipkart

Flipkart Problems

Master the most frequently asked interview questions for this company.

IDTitleDifficultyTopics
632
Hard
ArrayHash Table
934
Medium
ArrayDepth-First Search
42
Hard
ArrayTwo Pointers
1423
Medium
ArraySliding Window
1912
Hard
ArrayHash Table
2952
Medium
ArrayGreedy
1011
Medium
ArrayBinary Search
2093
Medium
GraphHeap (Priority Queue)
1760
Medium
ArrayBinary Search
2019
Hard
ArrayMath
967
Medium
BacktrackingBreadth-First Search
982
Hard
ArrayHash Table
2499
Hard
ArrayHash Table
11
Medium
ArrayTwo Pointers
124
Hard
Dynamic ProgrammingTree
875
Medium
ArrayBinary Search
3
Medium
Hash TableString
735
Medium
ArrayStack
1463
Hard
ArrayDynamic Programming
1703
Hard
ArrayGreedy
1
Easy
ArrayHash Table
420
Hard
StringGreedy
321
Hard
ArrayTwo Pointers
238
Medium
ArrayPrefix Sum
200
Medium
ArrayDepth-First Search
994
Medium
ArrayBreadth-First Search
134
Medium
ArrayGreedy
207
Medium
Depth-First SearchBreadth-First Search
1235
Hard
ArrayBinary Search
84
Hard
ArrayStack
174
Hard
ArrayDynamic Programming
560
Medium
ArrayHash Table
75
Medium
ArrayTwo Pointers
72
Medium
StringDynamic Programming
21
Easy
Linked ListRecursion
416
Medium
ArrayDynamic Programming
4
Hard
ArrayBinary Search
312
Hard
ArrayDynamic Programming
662
Medium
TreeDepth-First Search
719
Hard
ArrayTwo Pointers
91
Medium
StringDynamic Programming
103
Medium
TreeBreadth-First Search
41
Hard
ArrayHash Table
135
Hard
ArrayGreedy
56
Medium
ArraySorting
752
Medium
ArrayHash Table
741
Hard
ArrayDynamic Programming
1383
Hard
ArrayGreedy
1700
Easy
ArrayStack
496
Easy
ArrayHash Table
198
Medium
ArrayDynamic Programming
1366
Medium
ArrayHash Table
675
Hard
ArrayBreadth-First Search
33
Medium
ArrayBinary Search
332
Hard
Depth-First SearchGraph
55
Medium
ArrayDynamic Programming
26
Easy
ArrayTwo Pointers
162
Medium
ArrayBinary Search
85
Hard
ArrayDynamic Programming
236
Medium
TreeDepth-First Search
139
Medium
ArrayHash Table
2385
Medium
Hash TableTree
138
Medium
Hash TableLinked List
486
Medium
ArrayMath
542
Medium
ArrayDynamic Programming
15
Medium
ArrayTwo Pointers
63
Medium
ArrayDynamic Programming
130
Medium
ArrayDepth-First Search
121
Easy
ArrayDynamic Programming
116
Medium
Linked ListTree
169
Easy
ArrayHash Table
100
Easy
TreeDepth-First Search
128
Medium
ArrayHash Table
45
Medium
ArrayDynamic Programming
1048
Medium
ArrayHash Table
863
Medium
Hash TableTree
1105
Medium
ArrayDynamic Programming
113
Medium
BacktrackingTree
424
Medium
Hash TableString
739
Medium
ArrayStack
189
Medium
ArrayMath
871
Hard
ArrayDynamic Programming
1094
Medium
ArraySorting
918
Medium
ArrayDivide and Conquer
939
Medium
ArrayHash Table
480
Hard
ArrayHash Table
452
Medium
ArrayGreedy
983
Medium
ArrayDynamic Programming
437
Medium
TreeDepth-First Search
1046
Easy
ArrayHeap (Priority Queue)
330
Hard
ArrayGreedy
630
Hard
ArrayGreedy
1326
Hard
ArrayDynamic Programming
239
Hard
ArrayQueue
2141
Hard
ArrayBinary Search
1598
Easy
ArrayString
1642
Medium
ArrayGreedy
215
Medium
ArrayDivide and Conquer
199
Medium
TreeDepth-First Search
2551
Hard
ArrayGreedy