Verifone Software Engineer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

The test was organized online on Amcat and there were 3 coding problems. There were no MCQs in this round.

Q1. 
Ninja Technique Problem Statement
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...read more
Ans. 
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
• Iterate through all substrings of the input string and check if their integer value equals the product of two consecutive integers.

• Use nested loops to generate all possible substrings efficiently.

• Check if the product of two consecutive integers matches the integer value of the substring.

• ...read more
Answered by AI
Add your answer
Q2. 
Find Nodes at a Specific Distance from Target in a Binary Tree
Given a binary tree, a target node within this tree, and an integer K, identify and return all nodes that are exactly K edges away from the t...read more
Ans. 
Find nodes at a specific distance from a target node in a binary tree.
• Traverse the binary tree to find the target node.

• Perform a depth-first search to identify nodes at distance K from the target node.

• Return the values of nodes found at distance K in an array.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round was scheduled by the college Training and Placement team virtually. The interviewer asked me questions pertaining mainly to DSA and we discussed my projects.

Q1. 
Segregate Even and Odd Nodes in a Linked List
You are given the head node of a singly linked list head. Your task is to modify the linked list so that all the even-valued nodes appear before all the odd-v...read more
Ans. 
Reorder a singly linked list so that all even-valued nodes appear before odd-valued nodes while preserving the original order.
• Create two separate linked lists for even and odd nodes

• Traverse the original list and move nodes to respective even or odd lists

• Merge the even and odd lists while maintaining the original order
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Again, the round was virtual. This was a Tech + Managerial round organized by the college T & P cell. The interviewer asked questions related to fundamental subjects such as Operating Systems, Object-oriented programming, and DBMS. There was one coding round at the end.

Q1. 
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...read more
Ans. 
Diagonal traversal of a binary tree involves printing nodes at 135 degree angle in between lines.
• Traverse the tree in a diagonal manner, starting from the root node.

• Maintain a map to store nodes at each diagonal level.

• Print the nodes at each diagonal level in the order of traversal.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Easy

The round was virtual and was organized by the T & P cell of the college. The interviewer asked some behavioural and situation-based questions. There was one puzzle at the end.