Kumar K’s Post

View profile for Kumar K, graphic

SDE @ Amazon(Prv) | All India Rank 12 in Google CodeJam'21 | 558 students of mine have cracked 10+ LPA! | Mentored 1000+ students | Drop a message on 8879355057 for DSA/Dev Training | World Rank 368 in Google Kickstart

Amazon offers a best CTC + Challenging Work to freshers and working professionals for their SDE Role! In October , multiple working professionals and 2025-2026 grads underwent Amazon OA to get shortlisted for SDE Role. Amazon is one of those companies which asks interesting and challenging 𝐃𝐒𝐀 questions to their candidates in OA rounds; this year they asked total of 15 different OA problems and all of them are a super hard nut to crack - mostly revolving around high level Dynamic Programming + Hashing + Bit Manipulation :) Generally students face issue to crack OA rounds of top-tech companies because of their relying on standard DSA sheets and only doing 200-500 easy standard DSA problems - to tackle OA - you need to develop critical thinking and problem solving skills and be ready to tackle new hard and unseen DSA questions! Amazon SDE OA Problem asked on Oct 25 -> Name of the Problem - 𝐏𝐚𝐫𝐭𝐢𝐭𝐢𝐨𝐧𝐬. Crux of the problem :- In the image below. We will solve this problem in our FAANG OA + DSA Training - Master-class on weekend. Link to our FAANG OA + DSA Training group in the comments. #kumark #coding

  • No alternative text description for this image
Kumar K

SDE @ Amazon(Prv) | All India Rank 12 in Google CodeJam'21 | 558 students of mine have cracked 10+ LPA! | Mentored 1000+ students | Drop a message on 8879355057 for DSA/Dev Training | World Rank 368 in Google Kickstart

1mo
Satyam Singh

Full Stack Developer | Microsoft Certified AI Engineer | Building AI-Powered SaaS for Startups | AI Tools & Solutions Expert | Freelancer | CSE 25

1mo

Today I solved the same question and I was not able to pass 2 test cases only :( I tried everything and I ran out of time so I submitted it with the same code

Like
Reply
Aman Kumar Singh

Pre-Final Year Student at VIT Bhopal| Former Deck Cadet In Fleet Management Ltd. | Team Lead @MozillaFirefoxVITBhopal

1mo

I got this question for Amazon OA yesterday. I was able to solve the first question in 15-20 mins. But this was something that shooked me up for near about 1 hr. Altho i tried using the getMaximumPartitions function that calculates the maximum number of contiguous subarrays in the performance list such that the bitwise AND of each subarray equals zero. Initally just 7/15 test cases got passed but by the end i somehow managed to pass all the test cases.

manas uniyal

Research Intern and a full stack web developer

1mo

So brother is it not for 24 grads ?

Like
Reply
Shreyas Supekar

Learning DSA in C++ || Proficient in Python || Passionate about Tech Innovation👨💻

1mo

Binary Search??

Like
Reply
Rudra pratap Singh

Student at Signa group of professional studies dharmangadpur kanpur nagar

1mo

I'm interested

See more comments

To view or add a comment, sign in

Explore topics