Gurit India Junior Engineer Production Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

It comprised of general aptitude questions and two coding questions. It was an offline test.

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not attack each other.

• Generate and print valid configurations where queens are placed safely.

• Consider constraints and time limit for efficient solution.

• Exam...read more
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

• Iterate through the array and swap elements based on the values encountered.

• Achieve sorting in a single scan over the array without using any extra space.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

After having a technical discussion about my CV. He gave me two questions to code.

Q1. 
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...read more
Ans. 
Find all unique contiguous substrings of size two from a given string.
• Iterate through the string and extract substrings of size two

• Use a set to store unique substrings

• Return the set as an array of strings
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

• If the two pointers meet at any point, there is a cycle in the linked list.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code. 
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Return the valid combinations as an array of strings.
Answered by AI
Add your answer

The test consisted of 4 DSA questions (1 easy, 2 medium, 1 hard) that had to be completed in 2 hours. They were standard questions from Leetcode and the test was similar to Leetcode's weekly coding contest.

Q1. Simple DSA questions like time complexity to insert in a Hash Map, the difference between singly and doubly linked lists, etc.
Add your answer
Q2. Subarray with sum 0
Ans. 
Find subarray in an array with sum 0
• Iterate through the array and keep track of the running sum

• Store the running sum in a hashmap and check if the same sum has been seen before

• If the sum is 0 or if the running sum is already in the hashmap, a subarray with sum 0 exists
Answered by AI
Add your answer
Q3. Linked List Cycle
Add your answer
Q4. Rainwater trapping proble
Add your answer

Q1. Design a database for a blogging website
Ans. 
Database design for a blogging website
• Create tables for users, blog posts, comments, and categories

• Use primary and foreign keys to establish relationships between tables

• Include fields such as title, content, author, date, and tags

• Implement indexing for faster retrieval of data

• Consider implementing a caching mechanism for improved performance
Answered by AI
Add your answer
Q2. What can be done to balance the load of requests coming to a single server
Ans. 
To balance the load of requests on a single server, one can implement load balancing techniques.
• Implementing a load balancer to distribute incoming requests evenly across multiple servers

• Using round-robin algorithm to route requests to different servers in a sequential manner

• Utilizing server health checks to monitor the performance of each server and adjust the load distribution accordingly
Answered by AI
Add your answer

Q1. Design database for my college
Ans. 
Design a database for a college
• Create tables for students, courses, professors, departments, and grades

• Establish relationships between tables using foreign keys

• Include attributes such as student ID, course ID, professor ID, department ID, and grade

• Consider normalization to reduce redundancy and improve data integrity
Answered by AI
Add your answer
Q2. Pseudo code to validate password
Ans. 
Pseudo code to validate password
• Create a function that takes a password as input

• Check if the password meets the required criteria (e.g. length, special characters)

• Return true if the password is valid, false otherwise
Answered by AI
Add your answer
Q3. Strengths and weakness that can affect my profesional life
Add your answer
Q4. Challenges faced during the projects in my resum and how did I overcome them
Add your answer

5 questions of medium difficulty level covering topics like queue, dynamic programming, binary search, greedy.

Q1. System design. Using a NoSQL document schema. Design a document store schema to store bike model data.
Add your answer

Q1. Willing to relocate to Navi Mumbai. Strengths and weekness General process related to my compatibility with the company.
Add your answer

Q1. Basic questions of related role.
Add your answer

Q1. Deeper technology-related questions and simple coding
Add your answer

Q1. Tell me about your last company experience.
Add your answer
Q2. Explain your role and responsibilities with more in debt so that can understand more of your weightage.
Add your answer

Was bit tough and need to concentrate on work time

Was about coding in any language such as Java python

25 basic aptitude asked from train,time and work

2 coding questions which was basic and medium questions