Times Internet Java Developer Interview Questions and Answers

Q1. Realted to.multithreading
Add your answer

Q1. Basic java ask quations
Add your answer
Q2. What is java is use
Ans. 
Java is a versatile programming language used for developing a wide range of applications.
• Java is used for developing web applications, mobile apps, desktop applications, and enterprise software.

• It is commonly used in backend development for server-side programming.

• Java is also used in game development, scientific applications, and big data processing.

• Examples include Android apps, banking software, e-commerce platform
Answered by AI
Add your answer
Q3. Java app li cation as
Add your answer
Q4. Your role for that job
Add your answer

Coding of java how to solve eassy quations

Q1. Salary how and which side or osbsb idjs
Add your answer

Learn fundamentals, masted dsa and oop. after create 2 professional projects

Codesignal Round : Implementation based 4 questions. Solved 2.5

Q1. Asked to make a dynamic button component
Add your answer

Q1. Asked to make an API call using debouncing
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

Q1. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS is a traversing algorithm we start traversing from a selected node (starting node) and traverse the graph layer wise thus exploring the neighbor nodes (nodes which are directly connected to source node). And then move towards the next-level neighbor nodes.
Pseudocode :
BFS (G, s) 
Q.push( s ) //Inserting s in queue Q until all its neighbor vertices are marked.
mark s as visited.
while ( Q is not empty)
//Removing th...read more
Answered Anonymously
Add your answer
Q2. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
The DFS algorithm is a recursive algorithm based on the idea of backtracking. It starts with the initial node of the graph G, and then goes to deeper and deeper until we find the goal node or the node which has no children.
Pseudocode :
DFS(G, s):
mark s as visited
for all neighbors v of s in Graph G:
if v is not visited:
DFS-recursive(G, v)
Answered Anonymously
Add your answer
Q3. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
The recursive approach involves direct implementation of mathematical recurrence formula. 
F(n) = F(n-1)+F(n-2)
Pseudocode :
fibonacci(n):
if(n<=1)
return n;
return fibonacci(n-1) + fibonacci(n-2)

This is an exponential approach. 
It can be optimized using dynamic programming. Maintain an array that stores all the calculated fibonacci numbers so far and return the nth fibonacci number at last. This approach will t...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

Q1. 
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...read more
Ans. 
A level order traversal based solution can be presented here. For each level, we need to print the first node i.e. the leftmost node of that level.
Steps :
1. Make a queue of node type and push the root node in the queue. 
2. While the queue is not empty, do :
2.1 Determine the current size of the queue. 
2.2 Run a for loop to traverse all nodes of the current level and do :
2.2.1 Remove the topmost node from the q...read more
Answered Anonymously
Add your answer
Q2. 
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...read more
Ans. 
BFS can be used to solve this question.
Steps :
1. Traverse the whole tree in level order fashion using BFS along with storing the last processed node (curr).
2. Keep a tag at the end of each level to know that a particular level has ended.
3. Whenever a level ends store the last processed node value to the resultant list.
Time Complexity : O(n) [ Since, each node is traversed exactly once ]
Space Complexity : O(w) [ 'w' is
Answered Anonymously
Add your answer
Q3. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
This problem can be solved using recursion. Recursively calculate height of left and right subtrees for each node node and assign height to the node as max of the heights of two children plus 1
Algorithm :
height()
1. If tree is empty , return -1
2. Else
(a) Get the height of left subtree recursively i.e. call height( tree->left-subtree)
(a) Get the height of right subtree recursively i.e. call height( tree->right-subt...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.

Asked a Question about Trees

Q1. Basics about DS, SQL
Add your answer