đ„Adobe Interview Experience | CS-1| Noida | âRejection Wasnât the Worst Part â đ€ĄThe Process Was.
Summary
I had an interview experience at Adobe for the Computer Scientist 1 role in Noida. Despite solving technical problems, the process was marked by extreme disorganization, repeated reschedules, an unusual question about my Chrome search history, and an interviewer's resistance to my optimal solution, ultimately ending in rejection and ghosting from HR.
Full Experience
Some interview experiences help you grow. Others help you develop patience. This one helped me question reality.
It began like any other opportunity â a call from HR for the Computer Scientist 1 role. She outlined a standard process: 4â5 technical rounds, including interactions with a Manager and a Director.
I was optimistic. I shouldnât have been.
Round 1: DSA + C++ Fundamentals
The interview was rescheduled by an hour.
It began with some classic C++ theory:
Difference between pointer and reference
What is a stack overflow? Can it happen without recursion?
What is heap memory?
**DSA Problems:
- House Robber â Leetcode**
2) A string-to-integer conversion problem with edge-case handling:
Ignore leading/trailing spaces
Only valid if all characters are digits or a leading '-'
Handle overflows (return INT_MAX if invalid)
Cannot assume fixed integer size (compilor-dependent, some use 2 Bytes some use 4 Bytes of integer)
I solved both, clean and clear.
And then came the plot twist: âCan you please click on your Chrome search bar and show me your recent search history?â
Yes, really.
Apparently, cracking DSA problems live isn't enough. The real test is whether you've Googled too much lately. I half-expected a pop quiz on my Amazon order history next.
Round 2: A Masterclass in Mismanagement
This round wouldâve been funny â if it wasnât real. It was rescheduled four times, each for a different reason:
-
Interviewer had a health issue , rescheduled.
-
I joined on time, waited 30 minutes, no one showed ,HR was unreachable via call or email Hours later: âItâs rescheduled again.â
-
Interviewer was âbusyâ , rescheduled again
-
HR wasnât sure whether the interviewer was busy or not , rescheduled again đ€Ż
It felt like I was part of a mockumentary on corporate disarray.
After all that chaos, the actual round started.
Quick experience chat, then two DSA problems:
1) Count of Smaller Numbers After Self â solved via stack
2) https://leetcode.com/problems/container-with-most-water/description/ â I used the optimal two-pointer approach
What happened next made me question if I was being tested on code â or on my ability to deal with intellectual stubbornness.
The interviewer seemed dead set on a stack-based solution . I explained my approach using multiple test cases, walked through logic, and offered alternate examples. Still, the same questions came again â not with curiosity, but resistance.
It was clear: I hadnât misunderstood the problem â I had outpaced her expectations. And maybe, unintentionally, her ego.
She closed with a lecture on how "interviewers know all approaches" and that "candidates should just listen."
I waited to ask follow-up questions, but she cut the call with a cold âbyeâ and muted herself. I was left speaking into silence â and then, the screen.
Post-Interview: The Final Vanish
Days later, a rejection email quietly landed. I reached out for feedback â the HR literally cut my calls everytime(called multiple HRs). I emailed again. No response. Just⊠silence.
No clarity. No closure. Just a strange emptiness â the kind only a truly broken process can leave behind.
Interview Questions (7)
What is the difference between a pointer and a reference in C++?
What is a stack overflow? Can it happen without recursion?
What is heap memory?
Leetcode problem: House Robber.
A string-to-integer conversion problem with edge-case handling: Ignore leading/trailing spaces. Only valid if all characters are digits or a leading '-'. Handle overflows (return INT_MAX if invalid). Cannot assume fixed integer size (compiler-dependent, some use 2 Bytes, some use 4 Bytes for integer).
Count of Smaller Numbers After Self.