TraviYo Dot Net Core Developer Interview Questions, Process, and Tips

There was an OA on hackerearth of an hour. In that there were 20 MCQs and two DSA questions easy to medium on Heap, Hashmap and Subarray

Q1. Asked about previous worked project in last company
Add your answer
Q2. Asked one medium DSA question (DNA sequencing) and asked to design some schema
Add your answer
Q3. Asked one puzzle If there are 1000 bottles and one is poisonous, a rat will diw after one hour of drinking and you have only one hour to find out which bottle is poisonous, How many minimum rats you need ?
Add your answer

Q1. Leetcode Medium Question -- Container most water
Add your answer

Q1. LLD, Design patterns, Operating system
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Timing was 10:00 AM. Platform was good.

Q1. 
Subarray With Given Sum Problem Statement
Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis...read more
Ans. 
Given an array of integers, find a subarray with a given sum S.
• Iterate through the array while keeping track of the current sum and start index.

• Use a hashmap to store the sum and its corresponding index.

• If the current sum - S is found in the hashmap, a subarray with sum S exists.

• Return the start index and current index as the end index.
Answered by AI
Add your answer
Q2. 
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...read more
Ans. 
Recursively remove consecutive duplicate characters from a string.
• Use recursion to check if the current character is the same as the next character, if so skip the next character

• Base case: if string length is 1, return the string

• Example: Input: 'aabbc' Output: 'abc'
Answered by AI
Add your answer

There are three sections: -
1. Quants
2. English
3. Reasoning
All sections are accessible medium but you have maintained the speed and accuracy.
after that coding snippet are in java/python.

Code snippets are there in coding sections.

Based on JavaScript and Java.

A task based on JavaScript.

There will be 3 coding questions. They are of medium and hard level.

Q1. Sort array consisting 0's 1's and 2's without inbuilt functions
Ans. 
Sort an array of 0's, 1's, and 2's without using inbuilt functions.
• Use three pointers to keep track of the last index of 0's, 1's, and 2's

• Iterate through the array and swap elements based on their value

• Continue until all elements are sorted
Answered by AI
View 1 more answer

Q1. Os cn related questions
Add your answer

Q1. Java questions and general hr questions
Add your answer