PayPal Software Developer Interview Questions, Process, and Tips for Freshers

Two questions on dynamic programming

This was a behavioural round and was completely non technical

Map question with frequency in a vector

• Q1. Discussion on the test plus a logical puzzle also
  Add Answer

Round duration - 60 Minutes
Round difficulty - Medium

• Q1. Check If The String Is A Palindrome You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, ...read more
  View Answers (3)
• Q2. Square Root (Integral) Given a number N, find its square root. You need to find and print only the integral part of square root of N. For eg. if number given is...read more
  View Answers (2)
• Q3. Min Steps to one using DP You are given a positive integer 'N’. Your task is to find and return the minimum number of steps that 'N' has to take to ...read more
  View Answers (3)

Round duration - 60 Minutes
Round difficulty - Medium

They started Fundamentals of OOP- Inheritance, Polymorphism

• Q1. SQL Qusestions

  SQL queries (basic, nested, and the on containing where,having,group by,order by, like, etc..)
  SQL Joins, and which is the fastest?
  DDL vs DML

  View Answers (1)
• Q2. OS Questions

  What are the benefits of a multiprocessor system?
  Explain demand paging?
  What is virtual memory?
  deadlock

  View Answers (1)
• Q3. Maximum Subarray Sum Given an array of numbers, find the maximum sum of any contiguous subarray of the array. For example, given the array [34, -50, 42, 14, -5,...read more
  View Answers (4)

Round duration - 30 Minutes
Round difficulty - Medium

Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom

• Q1. Basic HR Questions

  Do you have any regrets?

  How do you respond to change?

  View Answers (1)

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

• Q1. Zig Zag Traversal You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the...read more
  View Answers (4)

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

• Q1. Find prime numbers You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N. Note: A prime number is a natural numb...read more
  View Answers (3)
• Q2. Technical Question

  Use of DBMS in my project and explain how i handle the problems

  Add Answer

It had 4 questions of moderate difficulty

• Q1. He went deep into my resume and asked questions from each line of it
  Add Answer
• Q2. Then he asked me that why you have only passed 10/14 test cases in 4th question
  Add Answer
• Q3. I said it was from dp and I had not studied dp properly
  Add Answer

Round duration - 70 Minutes
Round difficulty - Medium

Their were 3 DSA coding questions of medium and hard level. I need to solve them in 70 minutes. Coding questions were of Arrays, Linked list and Binary search trees

• Q1. Reverse Linked List Given a singly linked list of integers. Your task is to return the head of the reversed linked list. For example: The given linked list is 1...read more
  View Answers (6)
• Q2. Sort An Array of 0s, 1s and 2s You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2. Now, your task i...read more
  View Answers (3)

Round duration - 60 Minutes
Round difficulty - Medium

This round was majorly focused on problem solving skills and DSA. Interviewer asked me three DSA questions of medium and hard level. He started with the hard question, he asked me zig-zag binary tree traversal. we discussed the approach than I coded it and explained its Time and space complexity. Than he asked me max sum subarray modified question, I solved it using Kadane algorithm. Than he discussed one of my online assesments question and asked me to further optimize that approach that I used in the online test. Than I optimized that approach and coded that. Than he asked me for any questions and we dropped the call.

• Q1. Spiral Order Traversal of a Binary Tree You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree. For exampl...read more
  View Answers (3)
• Q2. Maximum Subarray Sum Given an array of numbers, find the maximum sum of any contiguous subarray of the array. For example, given the array [34, -50, 42, 14, -5,...read more
  View Answers (4)

Round duration - 40 Minutes
Round difficulty - Medium

This round was mainly focused on operating systems, DBMS and past projects. we started with the introduction. Interviewer asked me explain a functionality of one of my projects that I wrote in my resume, I done that than he started asking OS and DBMS questions. After that we asked me about any bad experience in my past internship, I told that than he asked for any questions to me and we dropped the call and after 2 days I got HR mail that I'm selected.

• Q1. Operating System based Questions

  Questions about scheduling algorithms, dead lock, synchronization etc. were asked.

  Add Answer