AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
PayPal Solution Engineer Interview Questions and Answers
PayPal Solution Engineer Interview Experiences
1 interview found
Anonymous
Selected
I applied via Referral and was interviewed before Apr 2022. There were 3 interview rounds.
(1 Question)
- Q1. Cloud concepts and scenarios
(1 Question)
- Q1. System architecture concepts and troubleshooting
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It was held in the evening around 4 pm. The camera was on during the test to invigilate the activity of students. On any doubtful action, warning was given. Platform was easy to code in.
- Q1.
Replace 0s Problem Statement
You are given a matrix where every element is either a 1 or a 0. The task is to replace 0 with 1 if it is surrounded by 1s. A 0 (or a set of 0s) is considered to be surrounded...
- Ans.
Given a matrix of 1s and 0s, replace 0s surrounded by 1s with 1s.
Iterate through the matrix and check each 0 surrounded by 1s.
If a 0 is surrounded by 1s, replace it with 1.
Update the matrix in place without printing or returning it.
- Q2.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
- Ans.
The task is to determine the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.
Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.
Handle base cases such as making change for 0 or using only the smal...
- Q3.
Minimum Subset Sum Difference Problem
Given an array of non-negative integers, your task is to partition this array into two subsets such that the absolute difference between the sums of the subsets is mi...
- Ans.
Given an array, partition it into two subsets to minimize the absolute difference between their sums.
Use dynamic programming to calculate all possible subset sums.
Iterate through the subset sums to find the minimum absolute difference.
Consider all possible partitions of the array elements.
Example: For input [1, 6, 11, 5], the minimum absolute difference is 1.
Example: For input [1, 2, 3], the minimum absolute difference
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It was held in the morning around 11:30 am. The interview was scheduled on google meet. The interviewer was quite friendly. He started by a brief introduction. This round was mostly based on Data structures and algorithms. At the end he asked some concepts of OOPs and Operating System.
- Q1.
String Transformation Problem
Given a string (
STR) of lengthN, you are tasked to create a new string through the following method:Select the smallest character from the first
Kcharacters ofSTR, remov... - Ans.
Given a string and an integer K, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.
Iterate through the input string, selecting the smallest character from the first K characters each time.
Remove the selected character from the input string and append it to the new string.
Continue this process until the input ...
- Q2.
SpecialStack Design Problem
Design a stack that efficiently supports the getMin() operation in O(1) time with O(1) extra space. This stack should include the following operations: push(), pop(), top(), is...
- Ans.
Design a stack that supports getMin() operation in O(1) time with O(1) extra space using inbuilt stack data structure.
Use two stacks - one to store the actual data and another to store the minimum value at each level.
When pushing a new element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop the top element from the minimum stack if it matches t...
- Q3.
Geometric Progression Subsequences Problem Statement
Given an array of ‘N’ integers, determine the number of subsequences of length 3 that form a geometric progression with a specified common ratio ‘R’.
...
- Ans.
Count the number of subsequences of length 3 forming a geometric progression with a specified common ratio in an array of integers.
Iterate through the array and for each element, check for possible subsequences of length 3 with the given common ratio.
Use a hashmap to store the count of possible subsequences for each element as the middle element.
Return the total count of subsequences modulo 10^9 + 7.
Example: For input ...
- Q4. What are the conditions for a deadlock to occur?
- Ans.
Deadlock occurs when two or more processes are waiting for each other to release resources, resulting in a standstill.
Two or more processes must be holding resources and waiting for resources held by other processes
Processes cannot proceed because they are stuck in a circular wait
Resources cannot be forcibly released by the operating system
Examples: Process A holds Resource 1 and waits for Resource 2, while Process B h
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
It was held in the afternoon around 3pm. The interviewer was quite friendly. She started with my introduction. She asked 2-3 problems related to data structures and then asked about python libraries which I used in my projects.
- Q1.
Group Anagrams Problem Statement
Given an array or list of strings called
inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth... - Ans.
Group anagrams in an array of strings based on their characters.
Iterate through each string in the input array/list.
For each string, sort the characters alphabetically to create a key for grouping.
Use a hashmap to group strings with the same key.
Return the grouped anagrams as separate arrays of strings.
- Q2.
Kth Smallest Element Problem Statement
You are provided with an array of integers
ARRof sizeNand an integerK. Your task is to find and return theK-th smallest value present in the array. All elements... - Ans.
Find the K-th smallest element in a given array of distinct integers.
Sort the array in ascending order.
Return the element at index K-1 from the sorted array.
Handle edge cases like K being out of bounds or array being empty.
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
It was held in the evening around 6 pm. The interviewer started with a brief introduction of me. He asked about my projects and then asked some concepts of Operating System and problems related to data structures. I had projects of Machine Learning and Deep learning. Discussion about projects continued for about 25 minutes.
- Q1.
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
- Ans.
Return the middle element of a singly linked list, or the one farther from the head node if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Interview Preparation Tips
Tip 1 : Practice problems related to data structures and algorithms
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : You should have a deep knowledge of your projects and related technology.
Tip 1 : It should not be more than a page.
Tip 2 : It should be precise and university projects or prior experience like industrial training or internship should be mentioned.
Skills evaluated in this interview
I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.
I dont remember exact questions but they are like leetcode easy and medium
(2 Questions)
- Q1. How web/internet works?
- Ans.
The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.
Devices connect to the internet through ISPs
Data is transmitted through packets using TCP/IP protocols
Web browsers use HTTP/HTTPS protocols to request and receive web pages
DNS servers translate domain names to IP addresses
Web servers host web pages and respond to requests
Search engines use web cr
- Q2. Coding questions with complete explanation
(1 Question)
- Q1. Coding and managerial round similar to round 2
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 70 minutes
Round difficulty - Easy
The first round was the Online Coding Round of 70 minutes with 3 problems of 3 marks, 3 marks, and 4 marks respectively.
The first two questions were easy and the third one was a bit tricky. The round started at 6 PM.
Anyone who is practicing continuously could have solved these questions easily within the time limit. The test cases were also not so hard and distinct. I coded in C++ language.
The questions asked were-
1. Minimum insertions required to make a string palindrome
2. To find the distance of the closest leaf from a node with given data.
3. Add two numbers represented by linked lists
22 students were selected for the next round.
- Q1.
Minimum Insertions to Make a String Palindrome
Determine the minimal number of characters needed to insert into a given string
STRto transform it into a palindrome.Example:
Input:
STR = "abcaa"
Outp...
- Ans.
The task is to find the minimum number of characters needed to insert into a given string to make it a palindrome.
Use dynamic programming to find the longest palindromic subsequence of the given string.
Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum insertions required.
Handle edge cases like an empty string or a string that is already a palindrome.
Exa...
- Q2.
Closest Leaf in a Binary Tree
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...
- Ans.
Find the minimum distance from a given node to the nearest leaf node in a binary tree.
Traverse the binary tree from the given node 'X' to find the nearest leaf node using BFS or DFS.
Keep track of the distance from 'X' to each leaf node encountered during traversal.
Return the minimum distance found as the output.
- Q3.
Adding Two Linked Lists
Given two singly linked lists, with each list representing a positive number without leading zeros, your task is to add these two numbers and return the result in the form of a new...
- Ans.
Add two numbers represented by linked lists and return the result as a new linked list.
Traverse both linked lists simultaneously while adding corresponding elements and carry over the sum if needed
Handle cases where one linked list is longer than the other
Create a new linked list to store the sum of the two numbers
(3 Questions)
Round duration - 80 minutes
Round difficulty - Easy
It was a technical interview. The platform used was google meet for online video calling. The interviewer first introduced himself then asked me to introduce myself. He also asked about my well-being amid the Covid-19 pandemic. He asked me 3 problems from data structures. He put a lot of focus on my project. We discussed about my project for about 20 mins. He asked various questions related to my project and I answered them confidently. After 70-75 mins he said that interview was over and that I may ask him anything. I asked him to give me feedback about my resume and my project. He gave me advice to improve my resume and the interview was over. The first technical interview was easy and was not so challenging as I was prepared.
- Q1.
All Pairs with Target Sum
Given an array of integers
ARRwith length 'N' and an integer 'Target', the task is to find all unique pairs of elements that add up to the 'Target'.Input:
First line: Integer... - Ans.
Find all unique pairs of elements in an array that add up to a given target sum.
Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the pairs of elements that add up to the target sum.
- Q2.
Quick Sort Problem Statement
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...
- Ans.
Implement quick sort algorithm to sort an array of integers in ascending order.
Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.
Recursively apply quick sort on the subarrays until the entire array is sorted.
Time complexity can be optimized to NlogN for worst-case scenarios.
- Q3.
Merge Sort Task
Given a sequence of numbers, denoted as
ARR, your task is to return a sorted sequence ofARRin non-descending order using the Merge Sort algorithm.Example:
Explanation:
The Merge Sort...
- Ans.
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Implement the Merge Sort algorithm which involves dividing the array into two halves, sorting each half, and then merging them back together.
Recursively call the Merge Sort function on each half of the array until the base case of having a single element in the array is reached.
Merge the sorted halves back together in a new array in no...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was also a technical round. The interviewer focused on data structures and resume. Apart from some basic questions about my resume, he asked majorly about data structures and algorithms. The interview was an hour long and he asked only 2 problems. Both of them were from trees. In this round, he focused if I can change my approach if a slight change is made in the question. Like he asked me to write code for inorder traversal. Obviously, I used a recursive approach. He then asked me to use the iterative method to find inorder traversal of the tree.
The questions he asked were-
1. Inorder traversal (both recursive and iterative method)
2. Level Order Traversal
( For obvious reasons I knew level order traversal very well. I coded it swiftly, so he asked me to write code for Zig-Zag traversal)
- Q1.
Inorder Successor in a Binary Tree
Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal....
- Ans.
Find the inorder successor of a given node in a binary tree.
Perform an inorder traversal of the binary tree to find the successor of the given node.
If the given node has a right child, the successor will be the leftmost node in the right subtree.
If the given node does not have a right child, backtrack to the parent nodes to find the successor.
- Q2.
Zigzag Traversal of Binary Tree
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
Note:
In zigzag order, level 1 is printed from left to right... - Ans.
Implement a function to print the zigzag traversal of a binary tree.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to switch between printing nodes from left to right and right to left at each level.
Store nodes at each level in a list and reverse the list if the flag is set to print in zigzag order.
Round duration - 50 minutes
Round difficulty - Medium
This was the final round of the Interview process. My interview was scheduled for 7.30 PM. It started at approximately 7.40 PM. The main focus of the interviewer was on my projects and my skills. He asked me many questions regarding my project like what problems I faced, what did you learn from this, apart from developing skills what else did you learn while developing the project, why did you use this tech instead of this, security features, scalability of the project and many more. I answered almost every question as perfectly as I can. Later he asked me some basic questions from NodeJS (as I am a full stack developer). In the end, he asked a puzzle. I didn't know the solution to the puzzle but we discussed it and I figured out the solution.
Interview Preparation Tips
Tip 1 : Properly grasp Data Structures and Algorithms from basics.
Tip 2 : Learn about Time complexity
Tip 3 : Be honest and walk through your thought process to the interviewer.
Tip 4 : Its always good to be presentable and have good communications skills
Tip 1 : Never Lie on your resume. Only write what you have done and what you know.
Tip 2 : It's good to have one or two projects on your resume. Mention the tech stack you used and a brief description of the project. It will be best if you host/upload your project on the cloud.
Tip 3 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Tip 4 : You're more than a 1-page resume. But your resume should not be more than a page
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. What is solid principles
- Ans.
SOLID principles are a set of five design principles for writing maintainable and scalable code.
S - Single Responsibility Principle
O - Open/Closed Principle
L - Liskov Substitution Principle
I - Interface Segregation Principle
D - Dependency Inversion Principle
- Q2. What are internal working of has set
- Ans.
HashSet is a collection that stores unique elements by using a hash table.
Elements are stored based on their hash code
Uses hashCode() and equals() methods to check for duplicates
Does not maintain insertion order
Allows null values
Example: HashSet
set = new HashSet<>(); set.add("apple"); set.add("banana");
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result
Interview Preparation Tips
Interview Questionnaire
6 Questions
- Q1. Strings
- Q2. Java 8 features like lamba expressions stream API
- Q3. Collections
- Q4. Autoboxing and Unboxing
- Q5. Generics
- Q6. String manipulation problems
- Ans.
String manipulation problems involve modifying or analyzing strings of characters.
Use built-in string methods like substring, replace, and split.
Regular expressions can be powerful tools for pattern matching and manipulation.
Be mindful of edge cases like empty strings and null values.
Consider the time and space complexity of your solution.
Practice with coding challenges on websites like LeetCode and HackerRank.
Skills evaluated in this interview
Interview Preparation Tips
Tips: Have a good grasp of DS algo, java, etc.(Here CGPA doesn't matter)
General Tips: Do’s and Don’ts :
1. Be confident and to be confident prepare well.
2. Set the priority of your companies
3. Don't start preparation at end. Don't ignore the content of resume.
Be confident and start preparation as soon as possible.
College Name: IIT Kanpur
Pranav Bhat Thirthahalli
Interview Questionnaire
14 Questions
- Q1. What is race condition and how can it be eliminated
- Ans.
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
- Q2. What is JCube?
- Ans.
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
- Q3. What is regression testing?
- Ans.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new
- Q4. Discussion on different sorting techniques
- Q5. Discussion on SQL and SQL optimisaion
- Q6. Software engineering principles
- Ans.
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development
- Q7. Java and OOP's question
- Q8. Define Singleton class
- Ans.
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
- Q9. Explain Testing principles and Design principles
- Ans.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
- Q10. Types of machine learning and methods and examples, they may give you a situation and ask you which technique is good and why
- Q11. Why choose you for VISA?
- Ans.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
- Q12. Which profile is good for you?
- Ans.
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
- Q13. About the work culture at VISA Inc
- Q14. If u already have a placement, why this company
- Ans.
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Interview Preparation Tips
Experience: Online Test on mettl.com
- 2 coding questions ( 15*2 = 30 marks ) - Moderate level
- 10 MCQs on Programming and Java ( 1*10 = 10)
- 6 MCQs on Machine Learning and Hadoop ( 1*6 = 6 )
- 6 MCQs on Computer Networks ( 1*6 = 6 )
- 6 MCQs on Computer Infrastructure and Architecture ( 1*6 = 6)
- 6 MCQs on Application security and Cryptography ( 1*6 = 6)
15 shortlisted from here including 8 B.Techs and 7 M.Techs for F2F interviews, which were taken by VISA employees from their US and Singapore offices( since they don't have any office at India ).
Round: Technical Interview
Experience: They may give you a situation and ask you to explain which Software engineering principles will you use. They ask you how will you explain the concept of stacks and queues to a 7 year old, or to a granny, so as to encourage programming(like seriously ? )
General Tips: Nothing as such, since this was my second on-campus placement, I had good experience of interviews.
Keep your fundamentals in all computer science subjects open. Unlike other companies they don't focus much on coding alone. The only other company which also looks at perfection in all computer science aspects is Xerox Research Center India.
Challenging and Equally rewarding, but seriously a unique experience with no much tension
Skills:
College Name: NIT Surathkal
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Discussion on my internships and course projects.
- Q2. My field of interest, how well have I fared in it.
- Q3. Design a mvc controller system where given a url, I am able to invoke the right controller. Eg, given "xyz.com/a/b/c", I should be able to invoke c controller by going through a and b
- Q4. Design autocomplete in IDEs
- Ans.
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
- Q5. What is my weakness
- Ans.
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
- Q6. Given 2 game scenarios for basketball, and given p as the probability of making a basket in an attempt, I have to understand the condition where game1 would be preferable over game2. In first game, I have ...
- Ans.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
- Q7. Given a dictionary of words, I have to go from one word to another in least number of transitions where a transition is a defined as changing any letter of the current word such that the new word is also i...
Interview Preparation Tips
Experience: The test was on hackerrank.
Tips: * Fast coding and problem solving required
* Time crunch
* The test is valued a LOT in the hiring process
Duration: 120 minutes
Total Questions: 4
Round: Technical Interview
Experience: Question 1 : He tried to take the discussion to web based technologies to which I straightly told I don’t know. Not sure if that was a good decision. Nevertheless, he went over my resume a lot of times and asked about various projects.
Question 2 : Discussed the various projects related to it.
Question 3 : He asked this question because I had worked on django during my FB internship. I proposed a tree based structure. xyz.com/a/b/c ---> b is child of a, c is child of b.
Question 4 : Next he moved to a very interesting question. Given a simple text editor, I want to facilitate autocomplete feature. We discussed about syntactic methods using language specific keywords. I suggested a trie based implementation which he liked. Later he asked me to improve and redirected me to using scope of the variables, and grammar of the language. We discussed about all the steps I did in language translators lab (macrojava -> minijava -> typechecking -> miniIR -> microIR -> miniRA ->Mips) where we built a Java compiler in Java. We later hopped back to original question and I suggested that we can use grammar to to store multiple (nested kind of) tries for different scope. He asked me how would I define “scope”. He gave me a scenario which helped me come up with the nested trie structure
int a;
{
int b;
{
int c; //a b c can be used
}
{
int d; //a b d can be used
}
}
He then asked me details of how I would code. I said we could use the respective visitors and maintain the current trie root for scope. He liked it but I missed at 2 places :
1. He asked me about token generation used in a compiler and I said flex and bison. I was expected to elaborate a bit.
2. He asked me how the grammar is generated and how the visitors are invoked. I couldn’t explain properly because I was not thorough with it.
Tips: * Keep smiling in the interviews.
* My interviewer had hopped from Microsoft to Visa. We had a short detailed discussion on how the transition was and what drove him to do that.
* It’s always good to know about the company to pick up interesting discussions, read up latest articles and news
* The interviewers want to see if you are passionate about what they are building. Their PPT (Pre Placement Talk) was also focussed majorly on the technologies they are building.
* If you take a question in a direction, make sure you are very very thorough with it. I took it in the direction of compilers, but couldn't make the transition seamlessly because I wasn't thorough with a lot of things (like token generation, visitor invocation).
* Not sure if telling upfront that you don't know about web technologies when you are applying for a profile that might need it is a good idea or not.
Round: Technical Interview
Experience: I think he was a senior person and spoke very passionately about the work that is happening in visa Bangalore office.
Question 1 : I said maybe I should have learnt a little about web based technologies. I think he was looking for a more generic answer.
Question 2 : I went ahead with calculating the expected score where my score random variable = 1 with probability p, and 0 with probability (1-p). I conditioned that expected score of game1 > game2 which would give me the range of p. I goofed up the equations twice but he said he liked my approach and I was just there
Question 3 : I suggested building a graph where a node is a word and an edge means a transition, and then performing BFS. He said that was obvious and that he was more interested in knowing how I build the graph. I suggested a method to reduce the number of string comparisons by storing a count vector with each word. Count vector is a 26 length vector where count[i] = number of times that letter occurs in the word. I would do string comparison to identify neighbours only if the difference in count vectors in 2. Eg, cot = cat - a + o. String comparison is still needed because of false positives. Eg, oct = cat - a + o but cat -> oct is not a valid transition. He liked my approach and asked me to code, discussed the complexity.
Tips: * Don't be naive around a senior engineer. Be confident.
* Explain your approach before going ahead solving it. I missed that in Q1 and for a long time he didn't know what I was heading towards.
* Write clean code, practice coding on paper to make sure you write compilable code. Shabby code is a turn off.
* Show passion for the company you are applying for.
General Tips: * Be friendly and keep smiling.
* Know about the company, well in detail. Recent news, articles, acquisitions, organisational changes, new offices, new product, etc.
* Know about the volume the company handles, certain mind boggling figures, what the company *does not* do
* If you are introducing yourself as an expert in a certain field, be prepared for questions like "How will you contribute to our company with your expertise" type of questions.
* Be very very thorough with every single thing you write on your resume. A small point you weren't sure about might become the basis of your whole interview. Don't write things you are unsure of, or have worked very little on.
Skill Tips: * I think I didn’t take Visa very seriously. I was assuming they won’t take a undergrad and they won’t take me because I have 0 knowledge in web based technologies. I might have acted a little cocky.
* They had nice pie diagrams which shows that they had done thorough research about each and every candidate based on resume and the coding test.
* They value the coding test a lot.
* Be very thorough with the projects you write on resume. They will give you a problem which won't be straightforward and will map onto one of your course projects. You are expected to do the mapping seamlessly. Every bit of the discussion you have with the interviewer can be your next problem.
* Brush up on web based technologies if you can.
* There will be a HR round as well if you clear the technical interviews.
Skills: Maths(esp Probability), Design, Passion, Web Technologies, Technical Skill And Speaking Skill, Coding Skills
College Name: IIT Madras
Motivation: * Been the leader since more than half a century, been through the technological revolution.
* Revolutionising payments architecture. Building something of greatest need, so elegant and optimised, yet producing such consistent performance.
* Keeping up with the need of the generation by introducing features which are brand new. Eg, “all-purpose credit card”.
* Loved their PPT (Pre Placement Talk). Volume of the data and processing is IMMENSE. Billions of transactions in a year voluming up to trillions. More than 200 countries in the world --> these stats are HUGE.
* Fraud detection is a space I would have loved to work on given that I come from a Data Mining background.
Funny Moments: Chucked out before HR round :P
Skills evaluated in this interview
PayPal Interview FAQs
Tell us how to improve this page.
PayPal Interviews By Designations
- PayPal Software Engineer Interview Questions
- PayPal Data Scientist Interview Questions
- PayPal Software Developer Interview Questions
- PayPal Senior Software Engineer Interview Questions
- PayPal Risk Analyst Interview Questions
- PayPal Data Analyst Interview Questions
- PayPal Software Engineer2 Interview Questions
- PayPal SDE-2 Interview Questions
- Show more
Interview Questions for Popular Designations
- Solution Architect Interview Questions
- Senior Solution Architect Interview Questions
- Solution Consultant Interview Questions
- Solution Specialist Interview Questions
- Solution Developer Interview Questions
- Associate Solution Lead Interview Questions
- AWS Solution Architect Interview Questions
- Solution Integrator Interview Questions
- Show more
PayPal Solution Engineer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
PayPal Solution Engineer Reviews and Ratings
based on 1 review
Rating in categories
|
Software Engineer2
308
salaries
|  ₹13.2 L/yr - ₹45 L/yr |
|
Software Engineer
260
salaries
| ₹12 L/yr - ₹50 L/yr |
|
Software Engineer III
227
salaries
| ₹17 L/yr - ₹70 L/yr |
|
Senior Software Engineer
222
salaries
| ₹14.4 L/yr - ₹52.1 L/yr |
|
Data Scientist
176
salaries
| ₹17 L/yr - ₹50 L/yr |
Paytm
Razorpay
Visa
MasterCard
- Home >
- Interviews >
- PayPal Interview Questions >
- PayPal Solution Engineer Interview Questions
