ADOBE SDE 3 FRONTEND (NOIDA) INTERVIEW
Summary
I interviewed for an SDE-3 Frontend position at Adobe Noida. The process involved three technical rounds covering HTML/CSS, DSA (custom stack with O(1) deletion), and a managerial round with a logic puzzle. Despite clearing all rounds, I received a rejection without feedback.
Full Experience
Adobe SDE-3 Frontend Interview Experience (4 YOE, 75 LPA Expected)
Total Rounds: 3 (All in one go, then Manager Round later) Mode: Entirely virtual – no calls, no role clarity, minimal communication
Recruiter Outreach: Got a cold email from Adobe’s recruiter asking for basic info – CTC, current location, experience, etc., and if I was available that Friday. No intro call, no JD shared, no explanation of the process or expectations.
My Profile:
4+ Years of Experience
Frontend-heavy background
Expected CTC: 75 LPA Previous CTC: 60 LPA
🧪 Technical Rounds (Back-to-back, same day): 1️⃣ HTML/CSS Round (8 mins) Had to recreate a simple figure using plain HTML & CSS. Straightforward if you’ve done basic layouting – wrapped this up quickly.
2️⃣ DSA Round – Leetcode Medium Build a custom Stack with support for deletion at any position in O(1) time. ➡️ Required a Doubly Linked List Solid DSA knowledge and quick debugging helped me solve it within time.
Managerial Round (Delayed & Rescheduled multiple times) Took place several days later due to availability issues.
Discussed my resume briefly.
Ended with a fun logic puzzle about finding the top 3 fastest horses with limited race tracks – standard version of the problem.
Outcome
After clearing all rounds and waiting for updates – got a rejection. No explanation. No feedback. No follow-up call. Nothing.
📝 Final Thoughts:
-
No JD or role clarity upfront.
-
Rejection without reasoning, after completing everything, felt very disrespectful to the candidate’s time from such a big organization
Interview Questions (3)
Had to recreate a simple figure using plain HTML & CSS.
Build a custom Stack with support for deletion at any position in O(1) time. Required a Doubly Linked List.
A fun logic puzzle about finding the top 3 fastest horses with limited race tracks – a standard version of the problem.