VeriPark Associate Software Engineer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 90 minutes . Both the questions were of easy to medium difficulty .

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
Calculate the Nth Fibonacci number efficiently using dynamic programming.
• Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

• Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.

• Time complexity can be optimized to O(N) using dynamic programming.

• Example: For N = 5, the 5th Fibonacci number is 5.
Answered by AI
Add your answer
Q2. 
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...read more
Ans. 
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
• Traverse the binary tree using depth-first search (DFS) and keep track of the current path and its sum.

• When reaching a leaf node, check if the sum equals 'K' and add the path to the result.

• Continue DFS traversal for both left and right children, passing updated path and sum.

• Return the list of paths that sum up to 'K'.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DSA round where I was asked to solve 1 question and also code it in a production ready manner . I was also asked 2 puzzles in this round to check my problem solving skills . This round ended with some basic concepts from DBMS and I was also asked some queries related to SQL .

Q1. 
Reverse Stack with Recursion
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...read more
Ans. 
Reverse a given stack of integers using recursion without using extra space or loop constructs.
• Use recursion to pop all elements from the original stack and store them in function call stack.

• Once the stack is empty, push the elements back in reverse order using recursion.

• Base case of recursion should be when the original stack is empty.
Answered by AI
Add your answer
Q2. You have a racetrack with 25 horses. What is the fastest way to determine the top 3 fastest horses, given that you can only race 5 horses at a time?
Ans. 
Race horses in groups of 5, then race the winners to determine the top 3 fastest horses.
• Divide the 25 horses into 5 groups of 5 horses each.

• Race the horses in each group to determine the fastest horse in each group.

• Race the winners from each group to determine the top 3 fastest horses.
Answered by AI
Add your answer
Q3. How can you measure exactly 4 liters of water using only a 3-liter can and a 5-liter can?
Add your answer
Q4. What is meant by normalization and denormalization?
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Denormalization is the opposite process, adding redundancy to improve read performance.
• Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy.

• Denormalization involves combining tables to reduce the number of joins needed for queries, improv...read more
Answered by AI
Add your answer
Q5. What is the difference between a primary key and a unique key in a database management system?
Ans. 
Primary key uniquely identifies a record in a table, while unique key ensures no duplicate values in a column.
• Primary key is used to uniquely identify each record in a table

• Primary key does not allow NULL values

• Unique key ensures that all values in a column are unique

• Unique key allows NULL values, except for the column with unique constraint

• A table can have only one primary key, but multiple unique keys
Answered by AI
Add your answer
Q6. Can you explain the concepts of Left Outer Join and Right Outer Join in DBMS?
Ans. 
Left Outer Join includes all records from the left table and matching records from the right table. Right Outer Join includes all records from the right table and matching records from the left table.
• Left Outer Join returns all records from the left table and the matched records from the right table. Unmatched records from the right table will have NULL values.

• Right Outer Join returns all records from the right table a...read more
Answered by AI
Add your answer
Q7. How do you find the second highest salary in a table?
Ans. 
To find the second highest salary in a table, you can use a SQL query with the ORDER BY and LIMIT clauses.
• Use a SQL query to select the distinct salaries in descending order: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC

• Use the LIMIT clause to retrieve the second row: LIMIT 1,1

• Combine both queries to find the second highest salary: SELECT DISTINCT salary FROM table_name ORDER BY salary DESC LIMIT 1,1
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was a typical HR round with some standard Behavioral questions like my interests, weaknesses, strengths, family background, why Amdocs, CEO of Amdocs etc.

Q1. What is something about you that is not included in your resume?
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Yes consist of two code and questions MCQ of ds ,algo,Linz,shell,English and DBMS
Test happens with your webcam access.

Q1. 
Nth Fibonacci Number Problem
Calculate the Nth term in the Fibonacci sequence using the formula: F(n) = F(n-1) + F(n-2) where F(1) = F(2) = 1.
Given a number N, determine the Nth Fibonacci number.
Input...read more
Ans. 
Calculate the Nth Fibonacci number using the given formula and constraints.
• Implement a function to calculate the Nth Fibonacci number using the formula F(n) = F(n-1) + F(n-2) with base cases F(1) = F(2) = 1.

• Use dynamic programming or recursion to efficiently compute the Fibonacci number for large N values.

• Ensure the input N is within the constraints 1 <= N <= 10000.

• Example: For N = 5, the output should be 5 as th
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

Late night around at 8 pm 
Environmental is positive.
Interviewer made me feel positive

Q1. 
Priority Queue Implementation
Ninja is tasked with implementing a priority queue using the Heap data structure. Since Ninja is busy with tournament preparations, your help is requested to complete this ta...read more
Ans. 
Implement a priority queue using Heap data structure with functions like push, pop, getMaxElement, and isEmpty.
• Implement push() function to insert element into the priority queue.

• Implement pop() function to delete the largest element from the queue.

• Implement getMaxElement() function to return the largest element.

• Implement isEmpty() function to check if the queue is empty.
Answered by AI
Add your answer
Q2. You have 3 bulbs outside a room and 3 switches inside the room. The challenge is to determine which switch controls which bulb, with the constraint that you can only enter the bulb room once.
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Morning time
Positive environment
Nice interviewer

Basic Aptitude test which includes quantitative verbal and logical reasoning

2 questions on programming language and 2 on sql