Scribd
Upload
563 views

Hashedin

The document outlines the online test, technical rounds, and final rounds for a software engineering interview process, including coding questions on arrays, trees, linked lists, and more. Multiple rounds assessed data structures, algorithms, object-oriented concepts, projects, and language fundamentals. Later rounds focused on more advanced topics like modified Sudoku, stock price optimization, and rearranging repeating arrays.

Uploaded by

sukeerth
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
563 views

Hashedin

The document outlines the online test, technical rounds, and final rounds for a software engineering interview process, including coding questions on arrays, trees, linked lists, and more. Multiple rounds assessed data structures, algorithms, object-oriented concepts, projects, and language fundamentals. Later rounds focused on more advanced topics like modified Sudoku, stock price optimization, and rearranging repeating arrays.

Uploaded by

sukeerth
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Online Test : - duration(90 minutes) - 10 MCQS(dbms,OS,DS,OOPS) and 3 coding


questions.
i. Find the elements in an array whose occurrence is more than N/3 times.
ii. A matrix is given having 0 and 1 find that one cell which we can change from 0
to 1 in order to increase our area consists of cells having 1.
iii. A Binary tree is given we have to find the maximum sum of the nodes but it
can't be having parent-child relationships.
2. Technical round 1(30 minutes): - 1. tell me about yourself
2. what is object oriented programming
3. encapsulation
4. abstraction
5. can we override method from abstract class
6. ques did in test & optimize it
7. Q1: How many time N occurs N times continuously
a = [1,2,3,4,2,2,4,5,6,6,6,6,6,6,6,8,9,0,1]
N= 6
Output = 2

2. Technical Round 2 (1 hour)- 1 brief intro


2 explain project
3 Coding ques: - I love india. it is my country.
I love my country. It is India.
Output - Return :- True
Check the number of occurrences of words in both the sentence is equal or not.
4. Missing and repeated elements in the array
5. Deadlock
6. TCP/IP
7. BCNF

Some question of first round-Print the factorial of a given no (no can go up to 12)
Give an and k where n is n-th digit no for which you have to find the sum k. For
example---n=3 k=6 so there are 21 3-digit no whose digit sum up to
6(105,..123….600)
Find the non-anagrams from the given sentence.
Some questions were to find the output of the program, there were one network ques
to find the no of hosts from given subnet mask. One SQL query was given to find its
o/p.
2nd round-Given arrival time and departure time of trains in the array. find the
minimum no of stations required for the trains.
Given an array of numbers. List the Pythagoras triplets from the array.
e.g.---9,2,3,6,5,4,8,10
O/p--{{3,4,5},{6,8,10}}
We had to do these programs in min time complexity. We had to mention the time and
space complexity and write the program with comments.
3rd round- some basic questions in java, a little bit about my project. Then 2-3
coding ques like-1.) Find the intersection node of the two linked lists. 2.)Given
an array of stock prices. You can sell and buy stock but first, you have to buy to
sell. You have to maximize the profit.
3.)Given an array of characters, reverse the characters of the array without
changing the position of the vowels.
e.g.['m','n','e', 'p']
O/p---['p','n','e','m']
4th round-1.)Modified sudoku problem---The sudoku can be 9X9 or 12X12 or 15X15.
Tell whether the sudoku is valid or not.
2.)Given an array of repeating and non-repeating numbers. Rearrange it in a way
such that no two repeating elements are together. Tell if it is possible or not
possible.
e.g. 2 2 2 1 3 4
O/p---2 1 2 3 2 4
2 2 2 1
O/p---not possible
HR round---They normally asked about my hobbies and told
me about HashedIn university.

1. least number coin required to reach total.


2. Design snake and ladder game (multiplayer).
3 Mirror of tree. etc

n the written test, they asked two write code to implement a binary search tree and
find the average of each level.
They also asked questions based on Array List and Snake and Ladders game.

sudoku game

n tree find the level which has maximum nodes

Write a program to generate a palindrome binary string of length n. There should be


a repeated sequence/ pattern for each interval of size m. The binary string should
start with 1. And there should be maximum number of zeros in the string.
& 5 minutes time was given

You might also like