Technumen Technical Lead Interview Questions and Answers

Q1. How does spring injects dependencies
Ans. 
Spring injects dependencies through inversion of control and dependency injection.
• Spring uses inversion of control to manage objects and their dependencies.

• Dependencies are injected into a class through constructor injection, setter injection, or field injection.

• Spring container is responsible for creating and managing objects and their dependencies.

• Example: @Autowired annotation is used for dependency injection in Spr
Answered by AI
Add your answer
Q2. How does Hibernate connects to DB
Ans. 
Hibernate connects to the database using JDBC (Java Database Connectivity) API.
• Hibernate uses JDBC API to establish a connection to the database.

• It uses JDBC drivers to communicate with the database.

• Hibernate configuration file contains database connection details.

• SessionFactory in Hibernate is responsible for creating sessions and managing connections.
Answered by AI
Add your answer

Q1. How to secure your APIs
Ans. 
Securing APIs involves using authentication, authorization, encryption, and monitoring.
• Implement authentication mechanisms such as OAuth, JWT, or API keys

• Use authorization to control access to APIs based on roles and permissions

• Encrypt data transmission using HTTPS/TLS to prevent eavesdropping

• Implement rate limiting and throttling to prevent abuse and DDoS attacks

• Regularly monitor API traffic and logs for suspicious ac
Answered by AI
Add your answer
Q2. How can you configure multiple DBs in your application
Ans. 
Multiple DBs can be configured in an application by using database connection pooling, configuring multiple data sources, and managing transactions across databases.
• Use database connection pooling to efficiently manage connections to multiple databases

• Configure multiple data sources in the application to connect to different databases

• Implement transaction management to ensure data consistency across multiple databases
Answered by AI
Add your answer

Q1. Family Background and Career History
Add your answer
Q2. Salary Expectations
Add your answer

Worst experience company is not so good

Q1. What is object oriented programming
Ans. 
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
• OOP focuses on creating objects that interact with each other to solve problems

• Encapsulation, inheritance, and polymorphism are key principles of OOP

• Examples of OOP languages include Java, C++, and Python
Answered by AI
Add your answer
Q2. Questions on data structute
Add your answer

Q1. About batch processing
Add your answer
Q2. About exception handling
Add your answer

Q1. About project discussion in details
Add your answer
Q2. Aws services mainly
Add your answer

Q1. Handling a team
Add your answer
Q2. Micro service architecture
Add your answer

Q1. About personal things
Add your answer
Q2. About financial thing
Add your answer

Q1. They first ask me about my project then ask more how it was working ,and more deep questions on that to understand how much I know about the project I worked on .
Add your answer
Q2. Spring Authentitation and Authorization,And Kubernetes
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

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 without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

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

• Generate all valid configurations and print them out.
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 array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

The first round of the interview includes Data Structures and Algorithms (DSA).

The second round of interviews involves a project.