Techjockey Infotech Pvt.Ltd. Intern Interview Questions and Answers

Q1. How set is implemented?
Ans. 
A set is implemented as a data structure that stores unique elements with no specific order.
• A set does not allow duplicate elements.

• Sets are commonly implemented using hash tables or binary search trees.

• Examples of set implementations include HashSet in Java and std::set in C++.
Answered by AI
Add your answer
Q2. How unordered set is implemented?
Ans. 
Unordered set is typically implemented using hash tables.
• Uses hash tables to store elements with unique keys

• Provides constant time complexity for insertion, deletion, and lookup operations

• Does not maintain any specific order of elements
Answered by AI
Add your answer

Easy level Basics were asked

Stacks queue leetcode easy level

Q1. Basic project discussion
Add your answer
Q2. Skills used in project
Ans. 
Used skills include Java, SQL, Spring Boot, RESTful APIs, and Git.
• Java programming for backend development

• SQL for database management

• Spring Boot for creating web applications

• RESTful APIs for communication between systems

• Git for version control
Answered by AI
Add your answer

Backend spring boot app assignment for hospital management

Array and string based medium complexity questions

Q1. Aptitude questions and behavioural
Add your answer
Q2. Sql questions based on join.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. DFS
The idea is to do a depth-first search to find all the cycles which are formed and calculate the length of the largest cycle. We are treating the array as a graph of directed edges. Whenever we get into any of the cells in the cycle, using dfs we will visit all the subsequent cells in the cycle. Out of all the cycles, we will return the cycle of maximum length.
The steps are as follows:
• Initialize a boolean array ‘vis...read more
Answered Anonymously
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered Anonymously
Add your answer

The hot topic in News / random topic like word "zero

Q1. "domain knowledge test, past experience, company fit and hr ques everything
Add your answer

Q1. Company fit test and judging the personality of the candidate
Add your answer