Stellar Informatics Java Developer Interview Questions and Answers

Faced coderbyte issues

• Q1. Annotations used in Springboot project
  View Answers (1)
• Q2. Core java question on exception handling, methods, OOPS
  Add Answer

• Q1. Don't remember so I have no
  Add Answer
• Q2. I can't remember it
  Add Answer

• Q1. I don't know the res
  Add Answer
• Q2. I can't remember it
  Add Answer

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

• Q1. Validate Binary Tree Nodes You are given ‘N’ binary tree nodes numbered from 0 to N - 1 where node ‘i’ has two children LEFT_CHILD[i] and RIGHT_CODE[i...read more
  View Answers (3)

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

• Q1. Balanced Binary Tree You are given an integer 'H'. Your task is to count and print the maximum number of balanced binary trees possible with height '...read more
  View Answers (4)

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

• Q1. Sort an array in wave form You have been given an unsorted array ‘ARR’. Your task is to sort the array in such a way that the array looks like a wave array. Exa...read more
  View Answers (5)
• Q2. Maximum Sum BST You are given a Binary Tree ‘root’. The given Binary Tree may or may not be a Binary Search Tree(BST) itself. Your task is to find the maximum s...read more
  View Answers (4)

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

• Q1. Pair Sum in BST. You are given a Binary Search Tree (BST) and a target value ‘K’. Your task is to check if there exist two unique elements in the given BST such...read more
  View Answers (6)
• Q2. Print Nodes at Distance K From a Given Node You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such no...read more
  View Answers (4)

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

• Q1. Basic HR Questions In this interviewer asked me about my family, residence and if I will have any issue in relocating to Gurgaon. After 30 minutes of this round...read more
  View Answers (1)

• Q1. Sql Query Sequence and basically asks the SqlServer Releted question and Webform Also.
  Add Answer

Just basic coding which is simple and quite easy for beginners.

• Q1. Introduce yourself and why should I hire you ?
  Add Answer
• Q2. I have given a brief introduction about my schooling, graduation, career and my activities. then I have proved my technical skills and they have wished me with ...read more
  Add Answer

Round duration - 60 minutes
Round difficulty - Easy

• Q1. Path Queries You are given a weighted, undirected graph with ‘V’ vertices numbered from 1 to ‘V’ and ‘E’ bidirectional edges. You have to answer ‘Q’ queries. Ev...read more
  View Answers (2)
• Q2. Merge Sort Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm. ...read more
  View Answers (2)
• Q3. Rat In a Maze: All Paths You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow ...read more
  View Answers (1)