<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Lokesh Ghule on Medium]]></title>
        <description><![CDATA[Stories by Lokesh Ghule on Medium]]></description>
        <link>https://medium.com/@lokeshghule?source=rss-a9689b9de451------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*ssElRtofe0AG2WdHowWFWw.jpeg</url>
            <title>Stories by Lokesh Ghule on Medium</title>
            <link>https://medium.com/@lokeshghule?source=rss-a9689b9de451------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 04:20:05 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@lokeshghule/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[PhonePe Interview Experience — Full-time SDE Role 2023]]></title>
            <link>https://medium.com/@lokeshghule/phonepe-interview-experience-full-time-sde-role-2023-153c8af336ac?source=rss-a9689b9de451------2</link>
            <guid isPermaLink="false">https://medium.com/p/153c8af336ac</guid>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[campus-placements]]></category>
            <dc:creator><![CDATA[Lokesh Ghule]]></dc:creator>
            <pubDate>Tue, 02 Aug 2022 10:26:41 GMT</pubDate>
            <atom:updated>2022-08-05T08:21:36.099Z</atom:updated>
            <content:encoded><![CDATA[<h3>PhonePe Interview Experience — Full-Time SDE Role 2023</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/774/1*RQHZZJZCld3uvJS2tF67fg.png" /></figure><p>My Resume: <a href="https://drive.google.com/file/d/1QuFJ1q27rknF60paMaOKcMurfCsGcaLT/view">Link</a></p><p>I’m from the Pune Institute of Computer Technology, Pune. My branch is Information Technology. PhonePe visits our college every year to hire for full-time SDE roles. So it was an on-campus opportunity. The entire hiring process was conducted smoothly in a single day by PhonePe recruiters. The steps in the process were as follows:</p><h3><strong><em>Online coding round :</em></strong></h3><p>Duration: 90 minutes.</p><p>Total Questions: 4</p><ol><li>Given an array of numbers (Arr) and cost array (Cost) for each number. We have to obtain the Arr[i] by summing up a single prime number multiple times. The total cost of using a prime number x times is x*Cost[i]. Find the minimum sum of the total cost of all numbers. <br>eg. Arr[i] = 10 , cost[i] = 6 .<br>7 + 3 = 10 is not valid as we have to use the same prime number multiple times.<br>2 + 2 + 2 + 2 + 2 = 10 is valid and Cost in this case is 5 * 6 = 30.<br>5 + 5 = 10 is valid and Cost in this case is 2 * 6 = 12. (minimum cost).</li><li>Given an array of positive integers , find the max value of ( Gcd(arr[0],arr[1]) + Gcd(arr[1],arr[2]) + ………. + Gcd(arr[n-2],arr[n-1]) ). You may rearrange the array in any order.</li><li>Given an array of dependencies of functions. For eg .{ -1 , -1 , 1 , 1 , 3} in this array index 1st and 2nd function can execute at any time ( that’s the meaning of -1) . But the 3rd and 4th functions can execute only after the execution of the 1st function. 5th Function can only execute after the 3rd function. <br>Find the total number of ways to execute all functions.</li><li>Given two arrays ( let’s say A and B). We have to form a group of elements. If we choose i-th element then we can include atmost A[i] elements with index less than i and atmost B[i] elements with index greater than i in the group. Find number of maximum possible elements we can include in the group. Eg . A = { 1 , 2 , 0, 3} and<br> ………….. B = { 2, 2 , 0, 1} <br>We can include 1st, 2nd, and 4th elements to get answer 3.<br>note: not necessary to pick consecutive elements only.</li></ol><p>I was able to solve 1st question completely and 2nd question partially. Got shortlisted for the second round along with 10 other applicants.</p><h3>First Technical Interview Round (30–35 minutes) :</h3><p>It was a one-to-one interview based on DSA problems. The interviewer asked me two questions and it was a two-sided conversation for approach. There was no need to code actually on IDE. I was supposed to explain my approach and write a pseudo code on paper.</p><ol><li>Maximum subarray sum of a circular array. The array may contain positive or negative elements. eg. for Arr = { 2 , -4 , 3 , -5 , 1 , 3 } , Answer = 6.<br>I progressed from a brute force approach to an optimal approach using O(n) space and time. After dry running my approach on multiple test cases, he was satisfied.</li><li>The interviewer first asked me about the diameter of the binary tree. But I was unaware of it. Then he explained to me the diameter of the binary tree and asked me to write a pseudo code to find the diameter of an N-ary tree. I was able to solve it in O(n) time.</li></ol><p>I advanced to the next round along with 5 other applicants.</p><h3>Second Technical Interview Round (40 minutes) :</h3><p>Same as the 1st technical round but the questions were slightly difficult.</p><ol><li>Given an array ( size N) of lengths of chocolate bars. A chocolate bar can be split but can’t be attached to one another. We have to distribute chocolate bars to K students. Each student must get a chocolate bar of equal length. Find the maximum length of chocolate bar suitable for distribution.<br>My approach: Binary search on the answer.<br>TC: O(nlogn)</li><li>Given a binary search tree. Two random nodes are swapped causing the distortion in properties of the BST. Find those nodes.<br>Solved in O(n) time. After dry running my approach on many test cases interviewer was satisfied.</li></ol><h3>Third HR interview round (40 minutes) :</h3><p>A deep discussion on Computer networks- how data packets travel, how HTML and TCP/UDP actually work, where and how a code gets stored and executed, etc. Actually, I was not good with Computer networks but the Interviewer helped me wherever I got stuck while explaining.<br>I felt a little down after this.</p><p>Then I was asked to explain the diamond problem in OOP. How protected and private members behave in inheritance.</p><p>Two puzzles :</p><ol><li>There are 12 identical-looking mice. One of them is faster and the rest are of the same speed. Given 4 cakes to feed them. We can pause and resume their eating any time in between and arrange or rearrange their groups at any time. Find the faster mouse. I was able to solve it all by myself.</li><li>Given 3 <strong>wrongly labeled</strong> containers- Red, Green, and Red + Green combined. They contain balls of only Red color, only Green color and combined. Fix the labels by picking out the minimum possible balls. I was able to solve it using 2 balls. Solved in 1 ball after the interviewer hinted.<br>I was feeling good again after these puzzles.</li></ol><h3>Verdict :</h3><p>Got selected !! They asked us to wait for half an hour and then felicitated us with goodies. A total 4 of us made it to the final list.</p><h3>Conclusion :</h3><p>It was like dream come true. I can definitely state that Competitive Programming was the primary cause of all of this.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=153c8af336ac" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>