Coditas Technologies Software Developer Intern Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Medium

2 coding questions were given to solve in 45 minutes.

Q1. Left View Of a Binary Tree
You have been given a binary tree of integers. You are supposed to find the left view of the binary tree. The left view of a binary tree is the set of all nodes that are visible ...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 by CodingNinjas
View 2 more answers
Q2. Number of Islands
You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.
An island is a group of 1s (representing land) connected hor...read more
Ans. 
The question boils down to finding the number of connected components in an undirected graph. Now comparing the connected components of an undirected graph with this problem, the node of the graph will be the “1’s” (land) in the matrix. 
BFS or DFS can be used to solve this problem. In each BFS call, a component or a sub-graph is visited. We will call BFS on the next un-visited component. The number of calls to BFS...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

This was a 60 min technical interview round. The interviewer asked me to code 2 programming questions. 
Tip : Practice more to clear DSA problems. Medium level questions will be enough to clear the rounds.

Q1. Topological Sort
A Directed Acyclic Graph (DAG) is a directed graph that contains no cycles.
Topological Sorting of DAG is a linear ordering of vertices such that for every directed edge from vertex ‘u’...read more
Ans. 
Topological sorting of vertices of a Directed Acyclic Graph is an ordering of the vertices v1,v2,v3.....vn in such a way, that if there is an edge directed towards vertex vj from vertex vi , then vi comes before vj. Modified DFS can be used to solve topological sort problem. A stack can be used to implement it. Steps :
1. Make a stack to store the nodes and a Boolean array to mark all visited nodes initialized to false....read more
Answered by CodingNinjas
View 2 more answers
Q2. N-th Node From The End
You are given a Singly Linked List of integers. You have to find the N-th node from end.
For Example
If the given list is (1 -> -2 -> 0 -> 4) and N=2:
Then the 2nd nod...read more
Ans. 
A direct approach is to traverse the entire linked list and calculate its length. Traverse the list again and return the (length-N+1) node. But this approach involves two traversals of the linked list. 
To further optimize the solution, the question can be solved in one traversal only. Two pointers can be used here. Steps :
1. Initialize both the slow pointer and the fast pointer to the head node.
2. First, move fast...read more
Answered by CodingNinjas
View 2 more answers

Simple DSA questions

Q1. Java related questions asked
Add your answer
Q2. System design
Add your answer

Q1. Ghosted by recuriter
Add your answer