Filter interviews by
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.
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
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 ...
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 c...
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.
Use a MinHeap to efficiently find the kth largest element in an array.
1. Create a MinHeap of size k to store the largest k elements.
2. Iterate through the array, adding elements to the MinHeap.
3. If the size of the MinHeap exceeds k, remove the smallest element.
4. After processing all elements, the root of the MinHeap is the kth largest element.
Example: For array [3, 2, 1, 5, 6, 4] and k=2, the MinHeap will contai...
Typing www.google.com initiates a series of network requests to load the webpage in your browser.
1. DNS Resolution: The browser queries a DNS server to translate www.google.com into an IP address.
2. TCP Connection: A TCP connection is established with the server using the IP address.
3. HTTP Request: The browser sends an HTTP request to the server for the webpage.
4. Server Response: The server processes the request...
To check internet connectivity, you can use various methods like pinging a website or checking network status.
Use the command 'ping www.google.com' to see if you receive a response.
Check network settings in your operating system for connectivity status.
Use tools like 'traceroute' to diagnose network paths and issues.
In programming, use libraries like 'requests' in Python to attempt a web request.
Find the shortest palindrome in an array of strings using O(n^2) time complexity.
A palindrome reads the same forwards and backwards, e.g., 'racecar'.
Iterate through each string in the array and check if it's a palindrome.
Keep track of the shortest palindrome found during the iteration.
Example: For ['abc', 'a', 'aba', 'xyz'], the shortest palindrome is 'a'.
Use two pointers to check for palindrome properties efficie...
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 ope...
I applied via Approached by Company and was interviewed in Jul 2022. There were 4 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
Find the shortest palindrome in an array of strings using O(n^2) time complexity.
A palindrome reads the same forwards and backwards, e.g., 'racecar'.
Iterate through each string in the array and check if it's a palindrome.
Keep track of the shortest palindrome found during the iteration.
Example: For ['abc', 'a', 'aba', 'xyz'], the shortest palindrome is 'a'.
Use two pointers to check for palindrome properties efficiently.
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...
Typing www.google.com initiates a series of network requests to load the webpage in your browser.
1. DNS Resolution: The browser queries a DNS server to translate www.google.com into an IP address.
2. TCP Connection: A TCP connection is established with the server using the IP address.
3. HTTP Request: The browser sends an HTTP request to the server for the webpage.
4. Server Response: The server processes the request and ...
To check internet connectivity, you can use various methods like pinging a website or checking network status.
Use the command 'ping www.google.com' to see if you receive a response.
Check network settings in your operating system for connectivity status.
Use tools like 'traceroute' to diagnose network paths and issues.
In programming, use libraries like 'requests' in Python to attempt a web request.
Use a MinHeap to efficiently find the kth largest element in an array.
1. Create a MinHeap of size k to store the largest k elements.
2. Iterate through the array, adding elements to the MinHeap.
3. If the size of the MinHeap exceeds k, remove the smallest element.
4. After processing all elements, the root of the MinHeap is the kth largest element.
Example: For array [3, 2, 1, 5, 6, 4] and k=2, the MinHeap will contain [5,...
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
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 3 interview rounds.
Common aptitude questions that are available on online (Example : IndiaBix)
Needs to do coding in Java / Python. Problem solving needs to concentrate.
I have experience in software development, focusing on web applications and collaborative projects using various technologies.
Developed a web application using React and Node.js for a local business, improving their online presence.
Collaborated with a team of developers on a project using Agile methodologies, enhancing my teamwork and communication skills.
Completed an internship where I contributed to a mobile app, gai...
I have experience in software development, focusing on web applications and collaborative projects using various technologies.
Developed a web application using React and Node.js for a local business, improving their online presence.
Collaborated with a team of developers on a project using Agile methodologies, enhancing my teamwork and communication skills.
Interned at a tech company where I assisted in debugging and opt...
I applied via Company Website and was interviewed in Jul 2023. There were 2 interview rounds.
Mainframe support questions about COBOL,JCL,VSAM,gdg
I applied via Naukri.com and was interviewed before Feb 2023. There were 2 interview rounds.
Haker rank coding link
I applied via Naukri.com and was interviewed before May 2023. There were 3 interview rounds.
1 DSA Question and Output based MCQ q
I applied via Company Website and was interviewed before Jan 2021. There were 3 interview rounds.
Routing through a proxy involves configuring the proxy server to forward requests to the destination server.
Configure the proxy server to listen for incoming requests
Configure the proxy server to forward requests to the destination server
Configure the client to use the proxy server for outgoing requests
Use a proxy server to bypass network restrictions or improve performance
Examples: Nginx, Apache, Squid
Some of the top questions asked at the PayPal Software Engineer Level 1 interview -
based on 2 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Software Engineer2
339
salaries
| ₹15 L/yr - ₹45 L/yr |
Software Engineer
325
salaries
| ₹13.5 L/yr - ₹45 L/yr |
Senior Software Engineer
294
salaries
| ₹15.4 L/yr - ₹46.6 L/yr |
Software Engineer III
283
salaries
| ₹20 L/yr - ₹70 L/yr |
Data Scientist
263
salaries
| ₹15 L/yr - ₹65 L/yr |
Paytm
Razorpay
Visa
MasterCard