Open In App

PayPal Interview Experience | SDE 1 (On-Campus)

Last Updated : 18 Aug, 2020
Improve
Improve
Like Article
Like
Save
Share
Report

Online Assessment: 2 Questions – 120 Minutes

Question 1 – Coloring nx3 board with 3 colors

An automated painting system needs a program that can paint an n x 3 grid in red, green and blue such that no row or column contains cells that are all the same color. Determine the number of valid patterns that can be painted given n rows. Since the number of patterns can be large, return the value modulo (10^9 + 7)

Sample Input: n = 4
Sample Output: 296490

Link (Same question): https://math.stackexchange.com/questions/3215805/coloring-a-3-times-n-board-using-3-colors

Question 2 – Social Media Connections

Social media connections can serve as a means of recognizing relationships among a group of people. These relationships can be represented as an undirected graph where edges join related people. A group of n social media friends is uniquely numbered from 1 to friend_nodes. The group of friends is expressed as a graph with friend_edges undirected edges, where each pair of best_friends is directly connected by an edge. A trio is defined as a group of three best friends. The friendship score for a person in a trio is defined as the number of best friends that person has outside the trio. The friendship sum for a trio is the sum of the trio’s friendship scores.

Given friendship connection data, create an undirected graph, and determine the minimum friendship sum for all trios of best friends in the group. If no such trio exists, return -1

Example Input:
friend_nodes = 6
friend_edges = 6
friends_from = [1, 2, 2, 3, 4, 5]
friends_to = [2, 4, 5, 5, 5, 6]
Example Output: 3

Explanation:

Trio formed is among {2, 4, 5}
Friends of 2 other than 4,5 are {1} => total count = 1
Friends of 4 other than 2,5 are {} => total count = 0
Friends of 5 other than 2,4 are {3, 6} => total count = 2
Sum of total count = 3

Technical Round 1

1. Split array into subarray with given conditions.

  • All the characters in each of the splitted subarray must not be in another subarray
  • Sample Input – “aabacadfgrdtyu”
  • Sample Output – {“aabaca”, “dfgrd”, “tyu”}

2. Are the given 2 intervals intersecting? (fully optimized)

  • Sample Input – [2, 5], [4, 7]
  • Sample Output – True
  • Sample Input – [2, 3], [4, 7]
  • Sample Output – False

Technical Round 2:

1. Find the word that comes more than 1 time in a string (Case Insensitive)

(Output the first occurrence of the word)

Sample Input - "Paypal is a good company but PayPal hires more than once"
Sample Output - ["Paypal"]

2. Any sorting algo (bubble sort) with time complexity, then optimize or use some faster algo with time complexity

  • Started with bubble sort – O(n^2) time
  • Finalised with merge sort – O(nlogn) time
  • Some other basic Computer Science questions on OS, DBMS, SQL etc
  • Some questions based on my resume and my projects.
  • Some more HR type questions

Final Round:

  • K frogs are there with a number assigned. There is 1 long queue with numbers from 1 to n. Frog with number 2 can visit 2, 4,6,8… And so with other frogs. What are the numbers in the queue that won’t be visited after all the frogs have done their visit?
  • A grid is present with many balloons. You have 1 arrow. What is the max no of balloons that u can shoot with that arrow? The angle of the shoot can be anything from 0 to 360 degrees.
  • Similar Question: https://www.geeksforgeeks.org/count-maximum-points-on-same-line/

My all rounds were good and solved most of the questions in one attempt. 3rd round was worst and was not able to solve any questions : (

My suggestions:

  • Don’t fake anything either in your resume or with your projects.
  • Be honest in your resume and don’t mention things you don’t know
  • Projects are an important part of the resume. Don’t mention projects done by your friends/ taken from GitHub
  • Have a good understanding of OS, DBMS, Network, etc (core CS subjects)
  • Be positive and have confidence in yourself

All the best for your interviews.


Previous Article
Next Article

Similar Reads

PayPal Interview Experience for SDE-1 | Off-Campus 2021
PayPal conducted an online campus challenge in 2020, that had programming questions to be solved. Though I wasn't able to clear the challenge, I received an email from the recruitment team after a year, if I was interested in interviewing. There were 3 rounds: Round 1(Problem-Solving - Technical Round 1): It was a 60-minute interview on MS Teams. T
2 min read
PayPal Interview Experience for SDE-1 (On-Campus)
Eligibility criteria: Percentage Criteria in X and XII: 85% or 8.5 CGPAPursuing Degree: 90% or 9.0 CGPANo Standing Arrears Round 1: Coding roundTime: 2hr This was a coding round conducted on the HackerEarth platform. There were 2 coding questions: Given a N*M chessboard and each non-empty cell contains either of the three pieces B, R and Q. B can m
4 min read
PayPal Interview Experience for SDE (On-Campus)
Online Test: It had two questions. One was named abandoned City and was needed to be solved using Binary search. It was a medium-level difficulty question.The second question was a hard-level question that contained a string. For Eg. a? bc?? a. We have to find the number of possible combinations of words after filling the question mark with letters
2 min read
PayPal Interview Experience for SDE Intern (On-Campus) 2023
Selection process: Resume shortlisting: For this, I will say a decent GPA (preferably 8+) will get you shortlisted for the on-campus placement. Online Assessment (Coding Round + MCQs): Time: 90 mins. Pattern: 1 medium leetcode level question + 10-15 MCQ based on Javascript/Web Development-related questions. I was able to solve all of them. Question
2 min read
PayPal Interview Experience for SDE 1 | On-Campus 2021
Eligibility criteria: Percentage Criteria in X and XII: 85% or 8.5 CGPAPursuing Degree: 85% or 8.5 CGPANo Standing Arrears Round 1: Online Assessment Time: 2 hours This was a coding round conducted on the HackerEarth platform. It consisted of 2 coding questions. Given a n*m chessboard and each non-empty cell contains either of the three pieces B, R
4 min read
PayPal Interview Experience for SDE-1 | On-Campus Virtual 2020
Round 1( Coding Test): 2 coding questions on hackerrank platform: The questions were similar to i.e., a) Count Vowels Permutation (https://www.geeksforgeeks.org/count-all-possible-n-length-vowel-permutations-that-can-be-generated-based-on-the-given-conditions/), b)Check if any permutation of a large number is divisible by 8 (https://www.geeksforgee
3 min read
PayPal Interview Experience for SDE II
Round 1(Data Structures & Algorithms): Self Introduction (5 min) After that, they asked the below Find the element that occurs more than once(https://www.geeksforgeeks.org/array-elements-that-appear-more-than-once/)Find all elements that appear more than n/k times in an array.(https://www.geeksforgeeks.org/print-all-array-elements-appearing-mor
2 min read
PayPal Interview Experience for SDE -2 (3.4 Years Experienced)
Hi All, Hope everyone is doing well. I'm sharing my experience with Paypal. Round 1(HackerEarth Test): 2 questions 1.5 hrs https://www.hackerearth.com/problem/algorithm/beautiful-numbers-05de0f51-101121ca/Based on 2D array I solved both of them one is partially and other is fully. Round 2(DSA Round) Left View of Binary treeMinimum swaps required to
2 min read
PayPal Interview Experience for SDE-2 (3.6 Years Experienced)
I have applied for the SDE-2 role through Instahyre. Got a call from HR and then a test link was sent to me. Round 1(Online Assessment): Online Assessment on HackerEarth. There were three DS-Algo questions. Questions are categorized based on various levels: Easy, Medium, and Hard.I have solved 2 questions with all test cases being passed and one pa
2 min read
PayPal Interview Experience for SDE-3
There was a total of 3 rounds of interviews. Round 1(Online Test): I got a Hacker earth test link. There were 3 questions of easy and medium. The problem in this test is we need to get input, parse it and then write the code logic. I spent more time on getting the input and parsing it rather than working on the logic alone. One of the 3 questions h
1 min read
Practice Tags :