Filter interviews by
I applied via Approached by Company and was interviewed in Jul 2022. There were 3 interview rounds.
2 Leetcode medium question for 1 hr. 1st was of string manipulation and 2nd was of Dynamic Programming. I don’t remember the exact question.
I applied via Campus Placement and was interviewed before Feb 2023. There were 4 interview rounds.
Online coding round. It has Data structure and algo based questions
I appeared for an interview in Aug 2017.
The program reads a file and selects the first 3 lines. It then identifies the longest line and counts the number of words in that line.
Read the file using appropriate file handling methods
Store the first 3 lines in an array of strings
Iterate through the array to find the longest line
Count the number of words in the longest line using string manipulation methods
The question is about finding the shortest path in a 3x3 matrix with weighted edges.
This is a graph traversal problem.
Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest path.
Assign weights to the edges and calculate the sum of weights for each possible path.
Choose the path with the smallest sum of weights as the shortest path.
The Fibonacci series can be applied in day-to-day life for various purposes.
Financial planning: Fibonacci numbers can be used to calculate investment growth and determine optimal investment strategies.
Architecture and design: Fibonacci ratios can be used to create aesthetically pleasing designs and layouts.
Nature and biology: Fibonacci patterns can be observed in the growth of plants, arrangement of leaves, and formati...
Amazon displays only a subset of search results based on various factors like relevance, popularity, and user preferences.
Amazon uses algorithms to determine which products to display in search results.
Factors considered include product relevance, customer reviews, sales rank, and availability.
Machine learning techniques may be used to personalize search results based on user behavior and preferences.
Amazon also consid...
Hash tables are a data structure that uses a hash function to map keys to values, providing efficient lookup, insertion, and deletion.
Hash tables use a hash function to convert keys into array indices.
They provide constant-time average case complexity for search, insert, and delete operations.
Collisions can occur when different keys map to the same index, which can be resolved using techniques like chaining or open add...
The product will be the key and the brands will be the values.
The key in this case refers to the unique identifier for each product.
The values are the different brands associated with each product.
For example, if the product is a smartphone, the key could be the model number and the values could be the different brands that manufacture that model.
Radix sort is a sorting algorithm that sorts integers by processing individual digits from least significant to most significant.
Radix sort is a non-comparative sorting algorithm.
It sorts numbers by grouping them based on each digit's value.
It is commonly used for sorting strings in lexicographic order.
Radix sort has linear time complexity, making it efficient for large datasets.
Radix sort has a running time of O(nk), where n is the number of elements and k is the length of the longest element.
Radix sort is a non-comparative sorting algorithm that sorts elements by their individual digits or characters.
It works by distributing the elements into 10 buckets based on the value of the least significant digit, then repeatedly redistributing them based on the next significant digit.
The process conti...
O(nk) is better than O(n) for large data and hash tables.
O(nk) is better because it takes into account the size of the data and the number of keys.
For large data and hash tables, the size of n will be large, making O(nk) more efficient.
O(n) assumes a constant number of keys, which may not be the case in practice.
Amazon may have chosen O(nk) for better scalability and performance.
I have worked on various projects including a web application for tracking fitness goals and a mobile app for managing personal finances.
Developed a web application using React and Node.js to track fitness goals and progress
Created a mobile app using Flutter to manage personal finances and budgeting
Collaborated with a team to implement features, fix bugs, and optimize performance
If not selected for PayPal, I will continue applying to other companies, improve my skills, and network with professionals in the industry.
Continue applying to other tech companies for similar roles
Work on improving technical skills through online courses or personal projects
Network with professionals in the industry through events or online platforms like LinkedIn
What people are saying about PayPal
I applied via Campus Placement and was interviewed before Mar 2021. There were 2 interview rounds.
Normal aptitude questions
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
Convert the string to lowercase and remove all symbols and whitespaces.
Reverse the modified string and compare it with the original string.
If they are equal, then the string is a palindrome.
If not, then the string is not a palindrome.
Given a number N
, calculate its square root and output the integer part only.
18
4
The square root of 18 is approximate...
The task is to find the integral part of the square root of a given number.
Use the built-in square root function to find the square root of the number.
Convert the result to an integer by rounding down or using the floor function.
Print the integer part of the square root as the output.
Given a positive integer N
, your task is to determine the minimum number of steps required to reduce N
to 1.
1) Subtract 1 from it: n = n -...
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
Use dynamic programming to solve the problem efficiently.
Create an array to store the minimum steps required for each number from 1 to N.
Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.
Return the minimum steps for N.
Round duration - 60 Minutes
Round difficulty - Medium
They started Fundamentals of OOP- Inheritance, Polymorphism
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
Initialize two variables, maxSum and currentSum, both set to the first element of the array.
Iterate through the array from the second element.
For each element, update currentSum by adding the element to it.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
After iterating ...
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
Tip 1 : Solve atleast 200 problems
Tip 2 : Focus on all data structures
Tip 3 : Build some good projects
Tip 1 : Keep it precise and concise.
Tip 2 : Build your resume yourself according your skills
I applied via Campus Placement and was interviewed before Oct 2020. There were 4 interview rounds.
Check if a tree is binary or not
Write code for advance surrying in js
Implement custom hook for api call
I applied via LinkedIn and was interviewed before Jan 2024. There were 2 interview rounds.
Some of the top questions asked at the PayPal Software Engineer Level 1 interview -
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Software Engineer2
310
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
256
salaries
| ₹12 L/yr - ₹47.5 L/yr |
Software Engineer III
226
salaries
| ₹17 L/yr - ₹70 L/yr |
Senior Software Engineer
214
salaries
| ₹14.9 L/yr - ₹52.2 L/yr |
Data Scientist
173
salaries
| ₹16.9 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard