Nggawe Nirman Technologies Lead Software Engineer Interview Questions and Answers

First round was coding test on Coderbyte it was good.

Q1. This round is video technical interview on flowcareer platform
Add your answer
Q2. Coding DSA question was asked on array.
Add your answer

Q1. This round contains mix questions on theory as well as DSA.
Add your answer
Q2. Machine coding question asked on react.js.
Add your answer

Q1. Some basic react.js and node.js questions.
Add your answer
Q2. Questions asked on MongoDB and one DSA question on array asked.
Add your answer

Q1. This round is HR salary discussion round and i got offer.
Add your answer

Advanced Java coding

Q1. Entire core Java arrays and strings
Ans. 
Core Java arrays and strings are fundamental data structures used for storing and manipulating data in Java programming.
• Arrays in Java are used to store multiple values of the same data type in a single variable.

• Strings in Java are objects that represent sequences of characters.

• Arrays and strings in Java are both indexed collections, with arrays being mutable and strings being immutable.

• Example: String[] names = {"Alic
Answered by AI
Add your answer
Q2. Java collections and Framework
Add your answer

Q1. Some coding and framework
Add your answer
Q2. REST assured and API
Add your answer

Q1. Oops related questions
Add your answer
Q2. C language quizzes
Add your answer

Q1. Basics of kotlin, sealed class, viewmodel implementation,
Add your answer
Q2. Caching mechanism
Add your answer

Technical aspects about linked list,trees, stacks

Topic related to humanities

Moderate difficult challenge in control

Q1. Describe your project
Add your answer

1 round of dsa with 2 questions

Q1. 1 system design round
Add your answer
Q2. LLD round for 30 minutes
Add your answer

Q1. Previous project discussion
Add your answer
Q2. Discuss past project, tech stack for 30 mins
Ans. 
Developed a web-based project management tool using React, Node.js, and MongoDB.
• Used React for the front-end development

• Used Node.js for the back-end development

• Used MongoDB for the database management

• Implemented features like task assignment, progress tracking, and file sharing

• Followed Agile methodology for project management
Answered by AI
Add your answer

Q1. Basic hr questions, salary discussion
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. Dijkstra Algorithm
We will run Dijkstra Algorithm for all vertices in this approach and store the minimum distance in an array. Then we can answer the queries using this distance array.
 
Dijkstra Algorithm is one of the most popular algorithms in graph theory. A single-source shortest path algorithm gives the shortest path length to all vertices from a given vertex known as the source vertex. It is a greedy algorith...read more
Answered Anonymously
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
 
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...read more
Answered Anonymously
Add your answer