Verifone Interview Questions and Answers

It consist of 4 DSA ques and few quiz and opps concept based ques
1st was string based Medium level ques.
2nd was a ques based on 2 pointer
And other 2 was from Vector and Linked list easy ques

Q1. It was stock buy and sell ques on leetcode where we need to find Max profit and what day to buy and sell
Add your answer
Q2. 2d array ques to print natural numbers in spiral form
Ans. 
Print natural numbers in spiral form using a 2D array.
• Create a 2D array with dimensions n x n.

• Initialize variables for row and column boundaries.

• Iterate through the array in a spiral pattern, filling in natural numbers.
Answered by AI
Add your answer
Q3. Hard level linked list ques
Add your answer

Q1. Reverse a string
Ans. 
Reversing a string involves rearranging its characters in the opposite order, which can be done using various programming techniques.
• Using Built-in Functions: Many programming languages have built-in functions to reverse strings. For example, in Python: `reversed_string = original_string[::-1]`.

• Using Loops: You can reverse a string by iterating through it in reverse order. Example in Java: `for (int i = str.length() - ...read more
Answered by AI
Add your answer
Q2. Oops
Add your answer

Exam to test reasoning and aptitude, and speed to answer them

Dsa question easy to medium level

Q1. Just culture fit question, and medium dsa questions
Add your answer
Q2. Print pyramid from Fibonacci sequence
Add your answer
Q3. Linked list sort
Ans. 
Sorting a linked list can be efficiently done using merge sort due to its O(n log n) time complexity.
• Use merge sort as it works well with linked lists due to its divide-and-conquer approach.

• Split the linked list into two halves using the slow and fast pointer technique.

• Recursively sort both halves and then merge them back together.

• Example: For a linked list 4 -> 2 -> 1 -> 3, the sorted list will be 1 -> 2 -...read more
Answered by AI
Add your answer
Q4. Design SQL tables for library management system
Add your answer
Q5. Valid bracket dsa question
Ans. 
Check if a string of brackets is valid by ensuring every opening bracket has a corresponding closing bracket in the correct order.
• Use a stack to keep track of opening brackets. Example: For '({[]})', push '(', '{', '[' onto the stack.

• For each closing bracket, check if it matches the top of the stack. Example: For '}', pop '{' from the stack.

• If the stack is empty at the end, the brackets are valid. Example: '()[]{}' is ...read more
Answered by AI
Add your answer

It’s system generated

Q1. Technical round
Add your answer

Q1. Manager technical round
Add your answer

Q1. Salary discussion
Add your answer