PayPal | SE - 1 | Chennai | [Offer]

Round 1 : (Hackerearth based test) [Time : 1h15m]

This round had 2 questions.

Q1: Question based on segment trees and range queries(Easy if you know the concept). Gave a brute force solution as was not able to recall the working of segment trees in a short period, got around 50% score. [Leetcode Medium Level]

Q2: Question involving concepts of graph(number of islands) and dp. Solved completely.[Leetcode Hard Level] Result : Cleared

Round 2 : F2F [Time : 45 mins]

General introduction and questions on internship project.

Problem Solving: Q1: Simple binary tree max root to leaf path.[Leetcode Easy Level]. Q2: Modification of above question, max path between any 2 nodes.[Leetcode Hard Level]. Result : Cleared

Round 3 : F2F [Time : 1h]

This was mainly a resume based round. In depth discussion on all my projects, technologies I used and why did I use them over other alternatives, difficulties faced, type of work in current company.

Some discussion on hash maps and other caching techniques.

Finally some questions on databases like indexing, joins, sql vs nosql etc. Result : Cleared

Round 4 : F2F Hiring Manager [Time : 30 mins]

This was mainly to check if I was a good cultural fit. Discussion on current work and internships. Theoretical discussion on recursion and memoization. Result : Cleared

Got a verbal confirmation in about a week and the letter after a month.