Company OAs All Problems Topics Company Insights OA Calendar Interview Experiences Premium

Built by students, for students - practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·

Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start Practicing Go Premium

OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

Contribute OA questions

Companies Problems Topics Interview Experiences

F

Flipkart Grid

sde

Interview Date

13-08-2026

Result

Rejected

Difficulty

Medium

Rounds

01

Drive Type

Off-Campus

Interview Date

13-08-2026

Result

Rejected

Difficulty

Medium

Rounds

01

Drive Type

Off-Campus

Topics asked

DSA

Detailed experience

Find the shortest flight path cost from a source city to a destination city with at most k stops using Bellman-Ford or Dijkstra's algorithm. Given a text string and a search pattern, find the starting index of the first occurrence in linear time using the KMP (Knuth-Morris-Pratt) algorithm. Design a data structure that supports insert, delete, and getRandom elements, each running in average O(1) time complexity.

Posted on - 23 Sept 2026

flipkart-grid-8-0 Interview Experience - sde | OAHelper