i
Yubi
Filter interviews by
GCD of 2 strings is not a common concept in software engineering.
GCD of 2 strings is not a standard problem in software engineering.
It is more common to find GCD of integers or numbers.
If the strings represent numbers, you can convert them to integers and find the GCD.
I applied via Instahyre and was interviewed before Sep 2023. There were 3 interview rounds.
DP questions 1D DP and Array question
Seeking new challenges and opportunities for growth in a different environment.
Looking for new challenges and opportunities to learn and grow
Interested in working with new technologies or industries
Seeking a better work-life balance or company culture
Want to expand my skill set and experience
I applied via Approached by Company and was interviewed in Aug 2022. There were 2 interview rounds.
Edge score of nodes in a directed graph
Edge score is a measure of the importance of a node in a graph
It is calculated by counting the number of edges that point to or from a node
Nodes with higher edge scores are considered more important
Edge score can be calculated using algorithms like PageRank or HITS
Simulate rotting of oranges in a 2D matrix every second.
Create a queue to store the coordinates of fresh oranges
Iterate through the matrix and add the coordinates of fresh oranges to the queue
Simulate the rotting process by iterating through the queue and rotting adjacent fresh oranges
Keep track of the time taken for all oranges to rot
Return -1 if there are any fresh oranges left after the simulation
DB design for air ticket booking system
Create tables for flights, passengers, bookings, and payments
Use foreign keys to establish relationships between tables
Include fields for flight details, passenger information, and payment details
Consider implementing a caching mechanism for frequently accessed data
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
Minimum of two platforms are required for a train station.
At least two platforms are needed for trains to arrive and depart simultaneously.
Additional platforms may be required depending on the frequency of trains and passenger traffic.
Platforms should be long enough to accommodate the longest trains that will use the station.
The problem is to find the longest substring that is a palindrome in a given string.
A palindrome is a string that reads the same backward as forward.
We can use dynamic programming to solve this problem.
We can start by considering each character as the center of a palindrome and expand outwards to find the longest palindrome.
We can also optimize the solution by using Manacher's algorithm which reduces the time complexit
Yubi interview questions for designations
Use any sorting algorithm to sort the elements of an unsorted array.
Choose an appropriate sorting algorithm based on the size of the array and the type of elements.
Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quick sort, and heap sort.
Implement the chosen algorithm in the programming language of your choice.
Test the sorting function with various input arrays to ensure corre
Find minimum energy required to cross all hurdles without losing life.
Calculate cumulative sum of energy required to cross each hurdle.
Find the minimum cumulative sum and add 1 to it.
If the minimum cumulative sum is negative, return its absolute value + 1.
This is the minimum energy required to cross all hurdles without losing life.
Get interview-ready with Top Yubi Interview Questions
Top trending discussions
I applied via Referral and was interviewed in May 2021. There were 3 interview rounds.
Implement thread safe load balancer.
focus on input validations and cover all corner cases in tests
posted on 28 Oct 2024
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
Search in Rotated sorted array
posted on 13 Feb 2025
I appeared for an interview in Jan 2025.
Max diameter of a tree in Java is the longest path between any two nodes in a tree.
The diameter of a tree can be calculated by finding the longest path between any two nodes in the tree.
This can be done by finding the longest path from the root to a leaf node, and then finding the longest path from another leaf node to the root.
The sum of these two paths gives the diameter of the tree.
based on 2 interviews
Interview experience
based on 12 reviews
Rating in categories
Senior Software Engineer
87
salaries
| ₹14.5 L/yr - ₹36 L/yr |
Associate
76
salaries
| ₹6.7 L/yr - ₹24.4 L/yr |
Software Engineer
75
salaries
| ₹8 L/yr - ₹30 L/yr |
Senior Associate
64
salaries
| ₹7.5 L/yr - ₹30.6 L/yr |
Associate Vice President
30
salaries
| ₹18 L/yr - ₹42 L/yr |
KFintech
Angel One
HighRadius
AGS Transact Technologies