Amazing tech stack. Good challenges. Good product offering. Good tech infrastructure. Great energy and peers. Rapidly changing environment. Leadership is open to feedback and seems like they will act on it.
Lack of alignment in some organizations.
Lots of re-organizations.
Not all managers are fair. Favorites and friends benefit.
Managers are not technical, don't know enough about candidates, and performance is in their hands as they represent you in calibration.
Culture is more about deliveries over employee well-being.
You are expected to stretch indirectly through peer pressure.
Highly competitive environment.
It's now time to focus on sustainable revenue generation.
An Uber recruiter reached out to me via LinkedIn. We then had a 30-minute call in the same week to discuss the position. A week later, I had another 30-minute call with a different recruiter to go through the interview process. They emailed me a lot
The interview process took a few months, with many date changes due to internal company issues. The first "phone screening" was a Zoom call. The question was a LeetCode medium-hard problem involving a matrix-based maze, similar to an island problem,
The phone screen lasted about 30 minutes and began with general questions about my background before diving into technical topics. I was asked to solve a DSA question on finding the top K frequent elements, discussing both the min-heap and bucket-sor
An Uber recruiter reached out to me via LinkedIn. We then had a 30-minute call in the same week to discuss the position. A week later, I had another 30-minute call with a different recruiter to go through the interview process. They emailed me a lot
The interview process took a few months, with many date changes due to internal company issues. The first "phone screening" was a Zoom call. The question was a LeetCode medium-hard problem involving a matrix-based maze, similar to an island problem,
The phone screen lasted about 30 minutes and began with general questions about my background before diving into technical topics. I was asked to solve a DSA question on finding the top K frequent elements, discussing both the min-heap and bucket-sor