# PayPal Interview Experience for SDE-1 | On-Campus Virtual 2020

• Difficulty Level : Medium
• Last Updated : 22 Jul, 2021

Round 1( Coding Test): 2 coding questions on hackerrank platform: The questions were similar to i.e., a) Count Vowels Permutation (https://leetcode.com/problems/count-vowels-permutation/), b)Check if any permutation of a large number is divisible by 8 (https://www.geeksforgeeks.org/check-if-any-permutation-of-a-large-number-is-divisible-by-8/).  I solved both the questions and after this test, 13 got selected for the next round i.e., Interview rounds.

Interview rounds: what matters is how well you communicate with the interviewer and explanation of your code

Round 2 (Technical): The interviewer started by asking me to tell me about yourself and then my Internship work and my current projects. After this interviewer moved on to coding questions which included: a) Given a binary tree and a number, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals the given number. Return false if no such path can be found (https://www.geeksforgeeks.org/root-to-leaf-path-sum-equal-to-a-given-number/). b) just modification of the before problem i.e., print all such paths if exists and if not present then return empty. c) Print the middle element in the Singly linked list in single traversal only (https://www.geeksforgeeks.org/write-a-c-function-to-print-the-middle-of-the-linked-list/). d) OOPs concept i.e., he asked to implement HashMap in java with interface class as Map and implement a method for hashCode. I answered all the questions and the time duration was 1 hour. After this round 8 got selected for the next round.

Round 3 (Technical):   a) The question was that given N words (with length take it as constant i.e., not that much large length ) preprocess it by applying data structure and store it. And then Q queries will be given by the user at runtime and Q queries is that to find the occurrence of the given char in that N-words. b) Just modification of the before problem i.e., Output number of occurrences given alphabet and word length (eg: {‘a’,4}) and here word length can vary from 1..L. For both a and b questions discuss the time complexity and space complexity at preprocessing as well as at runtime. c) Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with a sum equal to a given sum (https://www.geeksforgeeks.org/subset-sum-problem-dp-25/). The time duration of 1 hour. I answered all of the questions. For the next round, 5 were selected for the next round.

Round 4 (Hiring Manager): The interviewer asked me about my Internship work and my resume. In the technical part, he asked me about HashMap vs HashTable, Load balancing, Horizontal and vertical scaling. In my resume he asked me about my project and since it was full virtual I asked the interviewer that can I demonstrate my project on my laptop and it was based on Web+machine learning and the interviewer was really impressed by my work. Time duration 45min. After this round, I got selected.

At last, the company selected 4 candidates.

Way of Preparation:  geeksforgeeks, Leetcode, InterviewBit, HackerEarth

Overall Experience: Overall Interview process went smoothly and the interviewers were very friendly.

General Tips for Placement: Be calm and prepare well for DSA, OS, Networking, DBMS, System design, OOPs concepts, and know about your resume very well. Please also see the previous interview encounters (at least recent ones) on geeksforgeeks (Yes, they do help).

My Personal Notes arrow_drop_up