Filter interviews by
Be the first one to contribute and help others!
I applied via Monster and was interviewed in Dec 2017. There was 1 interview round.
I was interviewed in Mar 2017.
I am a detail-oriented business analyst with experience in data analysis and project management.
Experienced in data analysis and project management
Detail-oriented and analytical mindset
Strong communication and interpersonal skills
Proficient in various analytical tools such as Excel, SQL, and Tableau
I am not familiar with your company.
I have not had the opportunity to research your company yet.
I would appreciate it if you could provide me with more information about your company.
I am open to learning more about your company and its goals.
I have the skills, experience, and passion to excel in this role and contribute to the success of the company.
I have a strong background in data analysis and problem-solving, which are essential skills for a business analyst.
I have experience working with various stakeholders, including clients, developers, and project managers, to ensure successful project delivery.
I am a quick learner and adaptable to new technologie...
Marketing strategies are plans and tactics implemented by businesses to promote their products or services and reach their target audience.
Identifying target audience and market segmentation
Creating a unique value proposition
Developing a marketing mix (product, price, place, promotion)
Utilizing digital marketing channels (social media, email marketing, SEO)
Implementing content marketing and storytelling
Building brand a...
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Paypal is a leading online payment platform with a strong reputation and global presence.
Paypal is a well-established and trusted online payment platform used by millions of users worldwide.
It offers secure and convenient payment options for both individuals and businesses.
Paypal has a strong focus on innovation and technology, making it an exciting place to work for software engineers.
Working at Paypal provides opport...
Paypal is a digital payment platform that allows individuals and businesses to make online transactions.
Paypal provides a secure way to send and receive money online.
It allows users to link their bank accounts, credit cards, or debit cards to their Paypal account.
Users can make payments to merchants or individuals using their Paypal balance or linked payment methods.
Paypal offers buyer and seller protection, dispute re...
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Continuing to enhance my technical skills and knowledge through ongoing learning and certifications
Taking on more leadership responsibilities and mentoring junior team members
Contributing to the development of cutting-edge software solutions
Building strong relationships with colleagues and stakeholders to drive pr
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Detecting loop in a linked list
Use two pointers, one moving one node at a time and the other moving two nodes at a time
If there is a loop, the two pointers will eventually meet
If any of the pointers reach the end of the list, there is no loop
DFS (Depth-First Search) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS uses a stack to keep track of visited nodes and explore adjacent nodes.
It can be implemented recursively or iteratively.
DFS is useful for solving problems like finding connected components, detecting cycles, and solving mazes.
To find a cycle in a graph, use depth-first search (DFS) and keep track of visited nodes.
Implement DFS algorithm to traverse the graph
Maintain a visited array to keep track of visited nodes
If a visited node is encountered again during DFS, a cycle exists
Hashing is a process of converting data into a fixed-size numerical value called a hash code.
Hashing is used to quickly retrieve data from large datasets.
It is commonly used in data structures like hash tables and hash maps.
Hash functions should be fast, deterministic, and produce unique hash codes for different inputs.
Examples of hash functions include MD5, SHA-1, and SHA-256.
The question asks for the number of pairs between 1 and N that satisfy a specific mathematical relation.
The relation is pow(a,3) + pow(b,3) = pow(c,3) + pow(d,3)
The values of a, b, c, and d should be less than or equal to N
Count the number of pairs that satisfy the relation
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
Repeat until the entire array is sorted
I want to join PayPal because of its innovative technology, global impact, and strong company culture.
Innovative technology - PayPal is known for its cutting-edge technology and digital payment solutions.
Global impact - Working at PayPal would allow me to contribute to a company that has a worldwide reach and influence.
Strong company culture - I value a company that prioritizes diversity, inclusion, and employee well-b...
I recently learned about the benefits of using Docker for containerization.
Docker allows for easy packaging and deployment of applications
It helps in creating consistent environments across different platforms
Docker containers are lightweight and efficient
Example: I used Docker to containerize a microservices architecture for a recent project
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Find subset of numbers in array that sum up to zero.
Use a nested loop to iterate through all possible subsets.
Calculate the sum of each subset and check if it equals zero.
Store the subset if the sum is zero.
Optimize the solution by using a hash set to store the cumulative sum of elements.
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.
BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.
It uses a queue data structure to keep track of the vertices to be visited.
BFS guarantees that it visits all the vertices of a connected graph.
It can be used to find the shortest path between two
In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.
Continuously improving my technical skills through learning and hands-on experience
Taking on leadership roles and mentoring junior developers
Contributing to the development of cutting-edge software solutions
Building strong relationships with clients and stakeholders
Staying updated with the latest indu...
I applied via Campus Placement
Executive
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Thomas Cook
Centrumdirect
Weizmann Forex
Paul Merchants