Get AmbitionBox App
Faster and better experience!
AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Verifone Backend Engineer Lead Interview Questions and Answers
6 Interview questions
Overloading and overriding are two concepts in object-oriented programming that allow methods to have multiple implementations.
Overloading is when a class has multiple methods with the same name but different parameters.
Overriding is when a subclass provides a different implementation of a method that is already defined in its superclass.
Overloading is resolved at compile-time while overriding is resolved at runti...
Implement Push Function for Queue using Array or ArrayList
Create a function that takes an array or ArrayList and a string as input
Add the string to the end of the array or ArrayList
Return the updated array or ArrayList
I implemented various features including X, Y, and Z.
Implemented feature X which improved system performance by 20%
Developed feature Y which allowed for real-time data analysis
Added feature Z which improved user experience by simplifying the interface
Explanation of OOPS pillars with real-life examples
Abstraction: Hiding implementation details, e.g. using a TV remote without knowing how it works
Encapsulation: Grouping related data and functions, e.g. a car's engine and transmission
Inheritance: Creating new classes from existing ones, e.g. a sports car class inheriting from a car class
Polymorphism: Using a single interface to represent multiple classes, e.g. a s...
HashMap in Java is internally stored as an array of linked lists.
HashMap uses hashing to store key-value pairs
Each key is hashed to an index in the array
If there are collisions, a linked list is used to store multiple values at the same index
The default initial capacity of HashMap is 16 and load factor is 0.75
HashMap is not thread-safe and requires synchronization for concurrent access
Print Fibonacci series
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones
The first two numbers of the series are always 0 and 1
The series can be generated using a loop or recursion
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181
Verifone Backend Engineer Lead Interview Experiences
1 interview found
Anonymous
The duration of this round was around 20 minutes and there were 40 questions in total. This round consisted of standard mathematical, logical aptitude questions. Aptitude questions based on directions, speed and time, profit loss, etc. were asked. Out of 40 questions, around 15 questions were diagram based questions like finding the odd one, predicting the next pattern, etc.
The Second Round is an Online coding test that lasts for around 30 minutes to 1 hour. It was held on the coder byte platform. There were around 5-6 MCQs and 1 Coding Question. MCQ Questions - Predict the output, find errors, Simple language-based questions etc. The Coding Question was from Arrays, Strings, etc. For Example, You are given a string like “ONE PLUS THREE MINUS TWO” and you will have to give output as “TWO”
They will give you a frontend or Backend role based on your performance in Interviews Rounds.
(11 Questions)
- Q1. 1. Heap theoretical questions were asked
- Q2. 2. Linked List theoretical
- Q3. 3. Reverse String was asked
- Q4. 4. Print FIBONACCI series
- Ans.
Print Fibonacci series
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones
The first two numbers of the series are always 0 and 1
The series can be generated using a loop or recursion
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181
- Q5. 5. Make Push Function for Queue, implement it using Array or Arraylist
- Ans.
Implement Push Function for Queue using Array or ArrayList
Create a function that takes an array or ArrayList and a string as input
Add the string to the end of the array or ArrayList
Return the updated array or ArrayList
- Q6. 6. How to make an Arraylist and add 5 numbers in Arraylist
- Ans.
Create an ArrayList and add 5 numbers to it.
Declare an ArrayList variable and initialize it
Use the add() method to add numbers to the ArrayList
Numbers can be of any data type (int, double, etc.)
Example: ArrayList<Integer> numbers = new ArrayList<>(); numbers.add(1);
Make sure to import the ArrayList class
- Q7. 7. How is HASHMAP internally stored in Java?
- Ans.
HashMap in Java is internally stored as an array of linked lists.
HashMap uses hashing to store key-value pairs
Each key is hashed to an index in the array
If there are collisions, a linked list is used to store multiple values at the same index
The default initial capacity of HashMap is 16 and load factor is 0.75
HashMap is not thread-safe and requires synchronization for concurrent access
- Q8. 8. OOPS Pillars were asked
- Q9. 9. Explain each pillar of OOPS with a real-life example
- Ans.
Explanation of OOPS pillars with real-life examples
Abstraction: Hiding implementation details, e.g. using a TV remote without knowing how it works
Encapsulation: Grouping related data and functions, e.g. a car's engine and transmission
Inheritance: Creating new classes from existing ones, e.g. a sports car class inheriting from a car class
Polymorphism: Using a single interface to represent multiple classes, e.g. a shape ...
- Q10. 10. Object and Classes
- Q11. 11. Overloading and Overriding explain with examples
- Ans.
Overloading and overriding are two concepts in object-oriented programming that allow methods to have multiple implementations.
Overloading is when a class has multiple methods with the same name but different parameters.
Overriding is when a subclass provides a different implementation of a method that is already defined in its superclass.
Overloading is resolved at compile-time while overriding is resolved at runtime.
Ex...
(3 Questions)
- Q1. 1. Why did you make this project?
- Q2. 2. What all features did you implement?
- Ans.
I implemented various features including X, Y, and Z.
Implemented feature X which improved system performance by 20%
Developed feature Y which allowed for real-time data analysis
Added feature Z which improved user experience by simplifying the interface
- Q3. 3. How will you handle conflict within the team?
Interview Preparation Tips
- DSA and OOPS
- standard mathematical, logical a
- diagram based questions like fin
- Aptitude questions based on dire
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview in Jun 2017.
Interview Questionnaire
11 Questions
- Q1. How does ajax call work
- Ans.
Ajax calls allow for asynchronous communication between client and server without reloading the page.
Ajax stands for Asynchronous JavaScript and XML
Uses XMLHttpRequest object to send and receive data
Allows for partial page updates without reloading the entire page
Can handle data in various formats such as JSON, XML, HTML, and plain text
Example: $.ajax({url: 'example.com', success: function(data){console.log(data)}});
- Q2. Difference between REST and SOAP
- Ans.
REST is lightweight and uses HTTP while SOAP is XML-based and has more features.
REST uses HTTP methods like GET, POST, PUT, DELETE while SOAP uses XML messaging.
REST is stateless while SOAP can maintain state.
REST is faster and easier to use while SOAP is more secure and reliable.
REST is used for web services while SOAP is used for enterprise-level services.
Example of REST: Twitter API. Example of SOAP: Amazon Web Serv...
- Q3. What is GET and POST
- Ans.
GET and POST are HTTP methods used for sending data to a server.
GET is used to retrieve data from a server
POST is used to submit data to a server
GET requests can be cached and bookmarked
POST requests are not cached and cannot be bookmarked
GET requests have length restrictions
POST requests have no length restrictions
GET requests are less secure than POST requests
- Q4. What is observer pattern
- Ans.
Observer pattern is a design pattern in which an object maintains a list of its dependents and notifies them automatically of any state changes.
Also known as publish-subscribe pattern
Used in event-driven systems
Allows loose coupling between objects
Example: A weather station broadcasts weather updates to multiple displays
Example: A stock market ticker notifies multiple investors of stock price changes
- Q5. What is singleton
- Ans.
Singleton is a design pattern that restricts the instantiation of a class to a single object.
Singleton ensures that only one instance of a class exists in the entire application.
It provides a global point of access to the instance.
Commonly used in scenarios where a single instance needs to coordinate actions across the system.
Example: Database connection manager, logger, configuration manager.
- Q6. What is immutable in java
- Ans.
Immutable in Java refers to objects whose state cannot be changed after creation.
String, Integer, and other wrapper classes are immutable in Java.
Immutable objects are thread-safe and can be shared without synchronization.
To create an immutable class, make all fields final and private, and don't provide setters.
Examples of immutable classes in Java include LocalDate, LocalTime, and LocalDateTime.
- Q7. How do you create immutable in java
- Ans.
Creating immutable in Java
Use final keyword to make variables immutable
Use private constructor to prevent object modification
Use defensive copying to prevent modification of mutable objects
Use enum to create immutable objects
Use String class to create immutable strings
- Q8. Where have you used immutable in java
- Q9. What is dependency injection
- Ans.
Dependency injection is a design pattern that allows objects to receive dependencies rather than creating them internally.
It helps to decouple the code and makes it more testable and maintainable.
It allows for easier swapping of dependencies without changing the code.
There are three types of dependency injection: constructor injection, setter injection, and interface injection.
Example: Instead of creating a database co...
- Q10. What is CORS
- Ans.
CORS stands for Cross-Origin Resource Sharing. It is a security feature implemented in web browsers to restrict access to resources from different origins.
CORS allows web servers to specify which origins are allowed to access its resources
It is implemented using HTTP headers
CORS prevents malicious websites from accessing sensitive data from other websites
Examples of resources that may be restricted by CORS include cook...
- Q11. How do you overcome CORS
- Ans.
CORS can be overcome by configuring the server to allow cross-origin requests.
Configure the server to include the Access-Control-Allow-Origin header
Use JSONP (JSON with Padding) to bypass CORS restrictions
Use a proxy server to make the request on behalf of the client
Use a browser extension to disable CORS restrictions during development
Use a server-side proxy to forward requests to the target server
Interview Preparation Tips
Skills evaluated in this interview
venkatesh
I applied via Campus Placement
Interview Preparation Tips
Experience: Initially test was conducted. But they also considered resume for shortlisting to interview. Even if you do test badly, resume will come to your rescue if it is good enough.
Tips: Test consists of both aptitude and coding. Basic coding skills in C will be sufficient to solve the coding questions.
General Tips: Interviewing people are very friendly during the interview. Concentrate on concepts like linked lists, basic problems on strongs.
Skill Tips: Any basic C programming book.
Skills: Basic Coding, Basic C/C++
Duration: 2.5
College Name: IIT Madras
Motivation: Diverse fields in which company is working.
I applied via Referral
Interview Questionnaire
13 Questions
- Q1. Which is my dream company?
- Q2. What is my biggest achievement till date?
- Ans.
My biggest achievement till date is successfully leading a team to develop and launch a new software product ahead of schedule.
Led a team of developers to create a new software product
Completed the project ahead of schedule
Received positive feedback from clients and stakeholders
- Q3. How would I handle conflicts with my team members?
- Ans.
I would address conflicts directly and respectfully, seeking to understand the root cause and find a mutually beneficial solution.
Listen actively to understand the other person's perspective
Communicate clearly and respectfully
Identify the root cause of the conflict
Brainstorm potential solutions together
Be willing to compromise and find a mutually beneficial solution
- Q4. I have saved money from a year and bought my dream bike. It is the last round of Paypal interview today. I am on my way on the bike and it breaks down in a no parking zone. Suggest a winwin situation so...
- Q5. What is success according to me?
- Ans.
Success is achieving personal goals, feeling fulfilled, and making a positive impact.
Success is subjective and can vary from person to person.
It involves setting and achieving goals, both short-term and long-term.
Feeling fulfilled and content with one's accomplishments is a key aspect of success.
Making a positive impact on others or the world can also be a measure of success.
Success is not just about material wealth or...
- Q6. I was asked to write a code snippet from my project
- Q7. Program to implement Dijkstra’s algorithm
- Ans.
Dijkstra's algorithm finds the shortest path between nodes in a graph.
Create a graph with nodes and edges
Assign a tentative distance to each node
Set the initial node as current and mark it visited
For each neighbor of the current node, calculate the tentative distance
If the tentative distance is less than the current distance, update the distance
Mark the current node as visited and select the unvisited node with the sma...
- Q8. Program to reverse a singly linked list
- Ans.
A program to reverse a singly linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
- Q9. Which algorithm would I use to sort a linked list and why? Subsequently, I was asked to explain the logic of merge sort
- Q10. Suggest as many methods as possible for finding the nth largest element in an unsorted linked list
- Ans.
Methods to find nth largest element in an unsorted linked list
Traverse the linked list and store elements in an array, sort the array and return the nth largest element
Use quickselect algorithm to find the nth largest element in O(n) time complexity
Implement a max heap and extract the nth largest element
Divide the linked list into smaller sublists and recursively find the nth largest element
Use merge sort to sort the l...
- Q11. How would I explain the concept of prime number to an illiterate?
- Ans.
A prime number is a number that is divisible only by 1 and itself.
A prime number has exactly two factors: 1 and itself.
Prime numbers cannot be divided evenly by any other number.
Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, etc.
- Q12. Give a few test cases for a bank transaction
- Ans.
Test cases for a bank transaction
Transaction amount within account balance limit
Transaction amount exceeds account balance limit
Transaction to a valid account number
Transaction to an invalid account number
Transaction with correct transaction code
Transaction with incorrect transaction code
Transaction during bank working hours
Transaction outside bank working hours
- Q13. Design classes for educational institutions in a city
- Ans.
Design classes for educational institutions in a city
Identify the main entities: schools, students, teachers, courses
Create a School class with attributes like name, address, and a list of students and teachers
Create a Student class with attributes like name, age, and a list of courses
Create a Teacher class with attributes like name, specialization, and a list of courses
Create a Course class with attributes like name, ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Jeevan Sankar
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Questions about projects
- Q2. Why Paypal?
- Ans.
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...
- Q3. What does Paypal do?
- Ans.
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...
- Q4. How do you see yourself in 5 years?
- Ans.
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...
Interview Preparation Tips
Experience: One Programming and 15 multiple choice Questions.
Duration: 1 hour 30 minutes
Total Questions: 16
Round: Technical Interview
Experience: All details about projects you have written on resume. Some different implementation of some parts of your project.
Skills: Knowledge about Database Managements Systems, Problem Solving Skills
College Name: IIT Madras
leninkumar babu
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Interview Questionnaire
11 Questions
- Q1. Detecting loop in linked list
- Ans.
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
- Q2. Write code for dfs
- Ans.
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.
- Q3. How to find cycle in graph
- Ans.
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
- Q4. What is hashing and how will you implement?
- Ans.
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.
- Q5. Questions related to to resume
- Q6. No of pairs between 1 and N satisfy relation pow(a,3)+pow(b,3)=pow(c,3)+pow(d,3).a,b,c,d<=N
- Ans.
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
- Q7. -----.php?pid=514
- Q8. Questions related to resume
- Q9. Explain Merge sort
- Ans.
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
- Q10. Why do you want to join in paypal?
- Ans.
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...
- Q11. Explain anything whatever you learned recently?
- Ans.
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
Interview Preparation Tips
Experience: coding question related to palindrome portioning.MCQs related to cs fundamentals
Duration: 1 hour 30 minutes
Skills: General Coding And Problem Solving
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This was an online test for 90 minutes. 2 programming questions and MCQs related to CS fundamentals were asked.
- Q1.
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's
nextpoints back to a previous node in the ... - Ans.
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.
If one of the pointers reaches the end of the list (null), it means there is no cycle.
- Q2.
Palindrome Partitioning II Problem Statement
Given a string ‘str’, find the minimum number of partitions needed such that every segment of the string is a palindrome.
The task is to make cuts in the stri...
- Ans.
Find the minimum number of partitions needed in a string such that every segment is a palindrome.
Iterate through the string and check for palindromes at each possible partition point.
Use dynamic programming to keep track of the minimum cuts needed.
Consider edge cases where the string is already a palindrome or consists of different characters only.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.
- Q1.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal problem on an undirected and disconnected graph to find connected components.
Perform Depth First Search (DFS) on each vertex to find connected components
Use a visited array to keep track of visited vertices
Print the number of connected components and list vertices in ascending order for each component
- Q2.
Cycle Detection in Undirected Graph Problem Statement
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
- Ans.
Detect cycles in an undirected graph with given vertices and edges.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited array to keep track of visited vertices and a parent array to keep track of the parent of each vertex.
If while traversing, you encounter a visited vertex that is not the parent of the current vertex, then a cycle exists.
Consider edge cases like disconnected graphs an...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.
- Q1.
Merge Sort Problem Statement
You are given a sequence of numbers,
ARR. Your task is to return a sorted sequence ofARRin non-descending order using the Merge Sort algorithm.Explanation:
The Merge Sort...
- Ans.
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Implement the Merge Sort algorithm using a Divide and Conquer approach
Recursively divide the input array into two halves until the size of each array is 1
Merge the sorted halves to produce a completely sorted array
Ensure the output is in non-descending order
- Q2.
Maximum Difference Problem Statement
Given an array
ARRofNelements, your task is to find the maximum difference between any two elements inARR.If the maximum difference is even, print EVEN; if it is...
- Ans.
Find the maximum difference between any two elements in an array and determine if it is even or odd.
Iterate through the array to find the maximum and minimum elements
Calculate the difference between the maximum and minimum elements
Check if the difference is even or odd and return the result
- Q3. What is hashing and how can it be implemented?
- Ans.
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
Hashing is used to securely store passwords by converting them into a hash value before storing in a database.
Hashing is used in data structures like hash tables to quickly retrieve data based on a key.
Common hash functions include MD5, SHA-1, and SHA-256.
Hashing can be implemented in programming languages like Python ...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.:
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round where the interviewer asked questions based on Data structures and algorithms.
- Q1.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes.
Use three pointers to keep track of the current, previous, and next nodes.
Update the links between nodes to reverse the list.
Return the head of the reversed linked list.
- Q2.
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
- Ans.
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weights.
Handle disc...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round where the interviewer asked questions based on Data structures and algorithms.
- Q1.
Sort Linked List Based on Actual Values
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...
- Ans.
Sort a Singly Linked List based on actual values instead of absolute values.
Traverse the linked list and store the values in an array.
Sort the array based on actual values.
Update the linked list with the sorted values.
- Q2.
Kth Largest Element Problem
Given an array containing
Ndistinct positive integers and a numberK, determine the Kth largest element in the array.Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
- Ans.
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order to easily find the Kth largest element.
Ensure all elements in the array are distinct for accurate results.
Handle multiple test cases efficiently by iterating through each case.
Round duration - 30 minutes
Round difficulty - Easy
HR Round that lasted for around 30 minutes. The interviewer asked questions to know more about me.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Interview Questionnaire
7 Questions
- Q1. Given an array, Implement Binary search tree
- Ans.
Implement Binary Search Tree using given array of strings.
Sort the array in ascending order
Find the middle element and make it the root of the tree
Recursively create left and right subtrees using the left and right halves of the array
Repeat until all elements are added to the tree
- Q2. Given the above Binary search tree, print in ascending order
- Ans.
Print the given Binary search tree in ascending order
Traverse the left subtree recursively
Print the root node
Traverse the right subtree recursively
- Q3. Given an array of stock prices, find where to buy and where to sell for maximum profit in O(n)
- Ans.
Find buy and sell points for maximum profit in an array of stock prices in O(n)
Iterate through the array and keep track of the minimum price seen so far
Calculate the profit at each index by subtracting the minimum price from the current price
Update the maximum profit and buy/sell points accordingly
Return the buy and sell points for maximum profit
- Q4. Resume based
- Q5. What are three problems Chennai faces?
- Ans.
Chennai faces problems related to water scarcity, traffic congestion, and pollution.
Water scarcity due to inadequate rainfall and poor management of water resources.
Traffic congestion due to the increasing number of vehicles and poor road infrastructure.
Pollution caused by industries, vehicular emissions, and improper waste disposal.
- Q6. Which one would you solve and how and why?
- Ans.
Need more context on the question to provide an answer.
Please provide more information on the problem to be solved.
Without context, it is difficult to provide a solution.
Can you please provide more details on the problem statement?
- Q7. What is most interesting thing about Visa?
Interview Preparation Tips
Experience: 4 Coding questions on Hackerrank platform, one and half hour time. I am not going to reveal the questions here, but one was a basic binary tree implementation and the other three were algorithmic and mathematical problems. They were kinda hard to solve in an hour and half. I could do only 1 and half of the other one. I got 115/300 points on that. I was one of the 16 people selected for the interview.
Tips: It all depends on how well you can focus on the test day. Just practice a lot on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 4
Round: Technical Interview
Experience: The first two questions I was able to do fast enough. I was also asked a few questions on my resume and coding-related internship. The last one, I showed an O(n*n) algorithm first and then modified it to O(n). Around 45 minutes.
Tips: Be thorough on the coding part in your resume. Think out aloud!
Round: Technical + HR Interview
Experience: Just a few normal questions regarding my projects and my favorite course and it's application to Visa. 15 minutes.
Tips: Once again, be thorough on your resume.
Round: HR Interview
Experience: Once again a normal round, just random questions as to whether I am interested and good enough in communication. 15 minutes.
Tips: Don't get shaken. Be ready for all kinds of questions. Especially about Visa relation to what you do
Skills: Smart Coding
College Name: IIT Madras
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. Why would you like to join Visa and why?
- Ans.
I want to join Visa to contribute to innovative payment solutions and be part of a global leader in financial technology.
Visa is at the forefront of digital payment innovation, allowing me to work on cutting-edge technologies.
The company's commitment to security aligns with my passion for developing secure software solutions.
Visa's global presence offers opportunities to collaborate with diverse teams and learn from di...
- Q2. Tell me about yourself
- Ans.
I'm a passionate software engineer with a strong background in full-stack development and a love for problem-solving.
Graduated with a degree in Computer Science from XYZ University.
Worked at ABC Corp, where I developed a web application that improved user engagement by 30%.
Proficient in languages like JavaScript, Python, and Java, with experience in frameworks like React and Django.
Enjoy collaborating in agile teams an...
Interview Preparation Tips
Experience: Coding Questions were fairly standard ones.
Duration: 75 minutes
Total Questions: 42
Round: Interview
Experience: Networks based questions, firewalls, TCP/IP and other OSI layers
Round: Interview
Experience: Coding questions. Asked to code on paper. Questions on Object Oriented Design.
Skills: Networks basics, OOPs basics, Coding Skills
College Name: IIT Guwahati
Motivation: Profiles offered, Package, Location
Verifone Interview FAQs
Tell us how to improve this page.
Verifone Interviews By Designations
- Verifone Software Engineer Interview Questions
- Verifone Software Developer Interview Questions
- Verifone Analyst Interview Questions
- Verifone Software Design Engineer Interview Questions
- Verifone QA Automation Engineer Interview Questions
- Verifone Senior QA Engineer Interview Questions
- Verifone Senior Software Engineer Interview Questions
- Verifone Application Support Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Backend Developer Interview Questions
- Backend Developer Intern Interview Questions
- Node Js Backend Developer Interview Questions
- Backend Java Developer Interview Questions
- Senior Backend Developer Interview Questions
- Backend Developer Lead Interview Questions
- Backend Software Engineer Interview Questions
- Junior Backend Developer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Software Development Engineer
134
salaries
|  ₹6.8 L/yr - ₹17 L/yr |
|
Software Engineer
97
salaries
| ₹6.8 L/yr - ₹11.2 L/yr |
|
Senior Software Engineer
76
salaries
| ₹8.5 L/yr - ₹24 L/yr |
|
Software Developer
53
salaries
| ₹5.7 L/yr - ₹16 L/yr |
|
Software Development Engineer II
52
salaries
| ₹8.4 L/yr - ₹15.6 L/yr |
FIS
Broadridge Financial Solutions
PayPal
MasterCard
- Home >
- Interviews >
- Verifone Interview Questions >
- Verifone Backend Engineer Lead Interview Questions
