New update is available. Click here to update.

SDE - 1

Paypal

4 rounds | 10 Coding
problems

464 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS

Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.

Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.

Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.

Tip 2 : Every skill must be mentioned.

Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01

Round

Medium

Online Coding Interview

Duration90 minutes

Interview date11 Aug 2017

Problems2

Minimum Cost Path

view more

Problem approach

Dijkstra's algorithm can be used to solve this problem as we need to find the shortest path between source and destination. Each cell of grid represents a vertex and neighbor cells adjacent vertices.

Dijkstra's algorithm :It basically starts at the source node and it analyzes the graph to find the shortest path between that node and all the other nodes in the graph.

The algorithm ke...

view more

Balanced Parentheses

view more

Problem approach

A stack can be used to solve this question.

We traverse the given string s and if we:

1. see open bracket we put it to stack

2. see closed bracket, then it must be equal to bracket in the top of our stack, so we check it and if it is true, we remove this pair of brackets.

3. In the end, if and only if we have empty stack, we have valid string.

Complexity: time complexity is...

view more

02

Round

Medium

Face to Face

Duration60 minutes

Interview date14 Aug 2017

Problems4

Count characters

view more

Problem approach

Use the inbuilt functions to read a file.

For each line, store the number of characters and the number of words in each line.

At last, return the number of the words of the line with the largest number of characters.

K Largest Element

view more

Problem approach

To solve the question using a max heap, make a max heap of all the elements of the list. Run a loop for k-1 times and remove the top element of the heap. After running the loop, the element at top will be the kth largest element, return that. Time Complexity : O(n + klogn)

The question can also be solved using a min heap.

Approach:

1. Create a min heap class with a capacity of k<...

view more

Networking Question

He asked me how I will check whether I have internet connection in my system?

Problem approach

A ping network test transmits data packets to a specific IP address and either confirms or denies there is connectivity between IP-networked devices. So, ping www.google.com will respond.

Networking Question

What happens when you type a URL in the web browser?

Problem approach

A URL could contain a request for HTML, an image file, or something else entirely.

1. If the content of the inputted URL is fresh and in the cache, then show it.

2.Otherwise, locate the domain's IP address so that a TCP connection can be established. A DNS lookup is performed by the browser.

3. A browser must know the IP address of a URL in order to establish a TCP connection. This is ...

view more

03

Round

Medium

Face to Face

Duration60 minutes

Interview date14 Aug 2017

Problems3

Counting Sort

view more

Problem approach

Radix sort is a sorting method that groups the individual digits of the same place value before sorting the components. After that, arrange the components in ascending/descending order. Radix sort is a sorting method that groups the individual digits of the same place value before sorting the components. After that, arrange the components in ascending/descending order.

Algorithm :

radixSo...

view more

Technical Question

When you search for a particular product in amazon, it displays some of the search results. But, only few particular products which are available in amazon are displayed, not all. How does this happen?

Problem approach

I told Machine Learning.

Follow up questions :

1.What data structure do they use? Hash tables.

2.What will be the key and what will be the values? The product will be the key. The brands will be the values.

Technical Question

Applications of Fibonacci series in real life

Problem approach

Few real life examples are :

Flower petals. The number of petals in a flower consistently follows the Fibonacci sequence. .

Seed heads. The head of a flower is also subject to Fibonaccian processes. .

Spiral galaxies.

Tree branches.

Shells.

04

Round

Easy

HR Round

Duration30 minutes

Interview date14 Aug 2017

Problems1

Basic HR Questions

1. Discussion about my projects.

2. If you don’t get selected for PayPal, what will you do?

Problem approach

Tip 1 : The cross questioning can go intense some time, think before you speak.

Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.

Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team ...

view more

Start a Discussion

Similar interview experiences

Fullstack Developer

4 rounds | 7 problems

Interviewed by Paypal

330 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 9 problems

Interviewed by Paypal

316 views

0 comments

0 upvotes

Software Engineer

3 rounds | 5 problems

Interviewed by Paypal

260 views

0 comments

0 upvotes

Software Developer

2 rounds | 4 problems

Interviewed by Paypal

147 views

0 comments

0 upvotes

Companies with similar interview experiencs

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

56791 views

15 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

25606 views

3 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

17971 views

4 comments

0 upvotes

Popular Interview Experiences: