Paypal | SWE 1 | New grad | Offer

Anonymous User

1715

The entire process consisted of 4 rounds comprising of a online assesment , 2 tech interviews and one technical + managerial round.

Online Assesment

Online Assesment consisted of two questions.The cutoff for the next round was one question with some threshold in CGPA.

First Question

Given the positions of rook,queen,bishop in a chess board, find the number of ways they can move such that they don't collide with each other.
Note : If you start moving a piece in a direction you cannot change the direction of that piece at a later point of time.Also there can be multiple queens,rooks,bishops in the same board

Second question

Given a string with characters and ?, find the number of ways to create a string such that the 
i) first and last character match
ii) no two adjacent characters match
? can be replaced by any valid alphabet from a-z

Technical Round 1

The interviewer was very friendly and supportive.This round consisted of two DS/Algo questions as follows

First Question

Given a number n, find the next greater element than N such that the number is a multiple of N and has digits of only 0 and 9

For example if N=6, Answer is 90 as 90 has digits both 9 and 0 and is multiple of 6 and is greater than 6.

Note : The answer may either contain only 9s or only 0s also

Second Question

https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/

Explained and coded the best possible approach for both the questions.

Technical Round 2

The interviewer was very friendly and supportive throughout the interview.This round consisted of two DS/Algo questions and some discussion based on my resume.

First Question

Given two points A(x,y),B(x1,y1) and (x1>x, y1>y) print all possible path from A to B.
Note : You can either move up or right

Second question

https://leetcode.com/problems/maximum-product-subarray/

Explained the approach and coded in both the solutions within the stipulated time.

Technical+Managerial Round 3

This was a technical + managerial round.This interview comprised of one DS/Algo question and some managerial questions.

Given n balloons in space (ignore the force of gravity) find the maximum number of balloons that can be shot in one single arrow.The positions of the balloons will be given in the form of (x,y) co-ordinates.

I told a similar approach as this question in here.I assumed each balloon as a point in space and found the slope which appears the maximum number of times.

After that some managerial questions were asked and some questions based on my resume.

Comments (4)