Etraveli Group Interview Questions and Answers for Freshers

Q1. Data Structures and Theoretical Java and SQL concepts like - views, indexes, DML
Add your answer

Programs on Sorting and Search Algorithms and Core Java

Q1. What are the types of data.
Ans. 
Types of data include numerical, categorical, ordinal, and binary.
• Numerical data includes continuous and discrete values, such as height and age.

• Categorical data includes non-numeric values, such as colors and types of fruit.

• Ordinal data includes values with a specific order, such as rankings and ratings.

• Binary data includes only two possible values, such as true/false and yes/no.
Answered by AI
Add your answer

Q1. Core : DBMS , oops in depth coding: basic DSA questions based on Arrays, String.
Add your answer

Q1. He asked me graph questions ( medium level ) based on a node to root, and min cost to target. note: if you really want to crack the yata.com interview practice graph question and they ask a leetcode questi...read more
Add your answer

General reasoning and Mathmatics Aptitude

Q1. Core Java and Coding questions
Add your answer

Q1. To find the kth minimum element from BST
Ans. 
To find the kth minimum element from a Binary Search Tree (BST)
• Perform an in-order traversal of the BST to get elements in sorted order

• Return the kth element from the sorted list

• Time complexity: O(n) where n is the number of nodes in the BST
Answered by AI
Add your answer
Q2. Basic OOPs question like inheritance encapsulation
Add your answer

Q1. In a BST two numbers are swapped find swapped nos.
Ans. 
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
• Perform inorder traversal of the BST

• Keep track of the previous node while traversing

• If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
Answered by AI
Add your answer
Q2. What you did in college projects
Add your answer

Q1. Puzzles: find the fastest 3 horses in 25 horse race with a race and 5 horses can be run at a time
Add your answer
Q2. Weakness and strength. how a friend will describe you
Add your answer

Linked list, tree, queues

Q1. Merge linked list
Add your answer
Q2. Minimum jump question
Add your answer
Q3. Coin switch problem
Ans. 
Coin switch problem involves determining the minimum number of coin flips to make all coins face the same direction.
• Start from one end and count the number of flips needed to make all coins face the same direction

• Consider the edge cases where the first and last coins are different

• Optimize by flipping only when necessary
Answered by AI
Add your answer

Q1. Salary discussion
Add your answer

2 Coding Questions (Hard Level) followed by 20 MCQ (CS Fundamentals)

Q1. Given n starting with all 1 find the kth number example: n = 3, k= 4 1 1 1
Ans. 
Given n starting with all 1, find the kth number.
• The kth number is obtained by incrementing the binary representation of n.

• Repeat until k-1 increments are done.

• Return the final value of n.
Answered by AI
Add your answer
Q2. Question similar to level order traversal in binary tree
Add your answer

Q1. Reverse Linked List, Water Bucket Problem, Reverse Each word in a sentence
Add your answer

Q1. OOPs, Database, Networking
Add your answer