Valyoo Technologies Software Engineer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to buy a specific weight of oranges using given cost list.
• Iterate through the cost list and find the minimum cost to achieve the desired weight

• Keep track of the minimum cost while considering available packet weights

• Return -1 if it is not possible to buy exactly W kg of oranges
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 DFS and keep track of the current path and its sum.

• At each node, check if the current sum equals 'K' and add the path to the result if true.

• Continue traversal to the left and right child nodes recursively.

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

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .

Q1. You have two wires of different lengths that take different times to burn. How can you measure a specific amount of time using these two wires?
Ans. 
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
• Burn both wires at the same time, one wire will burn faster than the other.

• Measure the time it takes for the faster burning wire to completely burn.

• Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Answered by AI
Add your answer
Q2. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Medium

This was the technical round, held around at 10 AM IST on Google Meet.
Firstly she greeted me and asked me to tell something about myself, to which I introduced myself, explaining my academic and some projects also.
After that we moved on to the Hackathon project, which was smart cart self-checkout system. I explained the project along with the code, wherever necessary.
Every word you say while explaining should be clear to you.I used Firebase and SQL while explaining my project, to which she asked some questions related to it, 
Then she moved to the DBMS part, types of joins,what is indexing, how to approach if you were to design a payment system.
At last she asked me some Data Structure questions, which were of medium complexity

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list given the position 'K'.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Traverse the list again and remove the node at the calculated position.
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Consider Mr. X, a professional robber who is planning to rob houses along a street. These houses are arranged in a circle, which means the first house is a neighbor to the l...read more
Ans. 
House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.
• Use dynamic programming to keep track of maximum money robbed at each house.

• At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.

• Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interviewer was very frank and cheerful. This was held at 2:30 PM IST on Google Meet.
He firstly greeted me and asked me how I was doing.
How was my previous round, any technical difficulties?
Then he asked me to introduce myself.
He started telling about his journey to Lowe's and his technical background.
Then he asked some HR related questions

Round duration - 60 minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based) 
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.

Q1. 
Nth Fibonacci Number Problem Statement
Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.
N...read more
Ans. 
Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.
• Implement matrix exponentiation to calculate Fibonacci numbers efficiently.

• Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

• Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.

• Optimize the solution to achieve better than O(N) time complexity.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
 

Q1. 
Similar Strings Problem Statement
Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.
Explanation:
String A is similar to stri...read more
Ans. 
Determine if two strings are similar based on given conditions.
• Check if the strings are equal first.

• Then check if the strings can be divided into two halves with similar patterns.

• Return 1 if the strings are similar, 0 otherwise.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.

 

Round duration - 30 minutes
Round difficulty - Medium

This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.


 

Round duration - 20 minutes
Round difficulty - Easy

The platform was Zoom time duration was 20 mins. Asked me to give my introduction.

 

Group discussion