Phonepe | Software Engineer | Pune [Accpeted]

phonepe logo
phonepe
Software EngineerPune2 yearsOffer
February 22, 202225 reads

Summary

I successfully interviewed for a Software Engineer role at Phonepe in Pune and received an offer. The process involved an online coding assessment, a problem-solving round focused on DSA, and a hiring manager discussion covering projects, system design, and OOPs concepts.

Full Experience

I recently interviewed for a Software Engineer position at Phonepe in Pune, and I'm thrilled to share that I received an offer!

The interview process consisted of three rounds:

  1. Online Coding Assessment: This round was conducted on the CodeSignal platform. The questions were similar to those mentioned in this LeetCode post. I was able to successfully solve all the problems.
  2. Problem Solving/Data Structure Round (1 - 1.5 hours): I interviewed with a senior software developer at Phonepe. The interviewer was very supportive and provided helpful hints whenever I encountered a roadblock. It was crucial to grasp these hints to progress towards the solution. The questions I was asked were related to classic LeetCode problems.
  3. Hiring Manager Round (1.5 hours): My interviewer was an engineering manager. The round began with introductions, followed by a detailed discussion about my current company's projects. We then delved into designing e-commerce websites, similar to Flipkart or Amazon. Finally, I was asked several Java-based questions focusing on OOPs concepts.

Overall, the interview process was extremely smooth. I received an update about my interview schedule approximately three weeks after completing the online assessment. All subsequent rounds were conducted on the same day, and I received the results the very next day.

Interview Questions (3)

Q1
Best Time to Buy and Sell Stock
Data Structures & Algorithms

You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Q2
Best Time to Buy and Sell Stock III
Data Structures & Algorithms

You are given an array prices for which prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve. You may complete at most two transactions.

Q3
Search a 2D Matrix
Data Structures & Algorithms

Write an efficient algorithm that searches for a target value in an m x n integer matrix. This matrix has the following properties: Integers in each row are sorted in ascending order from left to right. The first integer of each row is greater than the last integer of the previous row.

Preparation Tips

For the Data Structures and Algorithms (DSA) rounds, I focused on medium-hard level problems, particularly those involving Dynamic Programming (DP). It's also critical to articulate the time complexity of each solution you propose.

For the Hiring Manager round, I made sure to have a thorough understanding of the projects I was working on at my previous company.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!