Myntra's DSA rounds draw from linked lists, arrays, trees, graphs, and dynamic programming — often delivered live over a shared document, with real emphasis on explaining your logic and complexity out loud rather than just arriving at a working answer. The three problems below are real, recently reported (2025–2026) Myntra questions with full solutions.
Given the head of a singly linked list, determine whether the list contains a cycle — i.e., whether some node's next pointer eventually loops back to an earlier node instead of reaching null.
Input: head = 3 -> 2 -> 0 -> -4, with -4's next pointing back to 2
Output: true
Following the list from the head eventually revisits node 2, so a cycle exists.
You are given a sorted array of integers where every element appears exactly twice, except for one element that appears exactly once. Find that single element in O(log n) time.
Input: nums = [1,1,2,3,3,4,4,8,8]
Output: 2
Given an integer array, return all unique triplets [a, b, c] such that a + b + c == 0. The solution set must not contain duplicate triplets.
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
More DSA questions Myntra has asked recently
These topics were reported in verified 2025–2026 Myntra loops. Full problem statements, solutions and explanations for these are part of the Placement-Ready PYQ Kit.
4 more verified DSA questions with full solutions in the full Placement-Ready PYQ Kit
Includes every round they were asked in, from the DSA round through the technical interview.