NJ Technologies Java Full Stack Developer Interview Questions and Answers

Q1. What you do? Description with analysis
Ans. 
I am a Java Developer responsible for designing, developing, and maintaining Java applications.
• Design and develop Java applications

• Write clean, efficient, and maintainable code

• Collaborate with team members to troubleshoot and solve technical issues
Answered by AI
Add your answer

Q1. Java,sql,python
Add your answer

Q1. What is your goal
Add your answer

Round duration - 120 minutes
Round difficulty - Hard

This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.

Q1. 
Hourglass Pattern Problem Statement
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
Input:
The first and only line of input contains an integer, denoting the value of N.
Out...read more
Ans. 
Print an hourglass pattern based on the given integer 'N'.
• Read the integer 'N' as input

• Print the top half of the hourglass pattern with decreasing numbers

• Print the bottom half of the hourglass pattern with increasing numbers

• Handle the constraints for 'N' values between 1 and 50
Answered by AI
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal in a disconnected graph starting from vertex 0.
• Use BFS algorithm to traverse the graph starting from vertex 0.

• Explore neighbor nodes first before moving to the next level neighbors.

• Consider bidirectional edges in an undirected graph.

• Output the BFS traversal sequence for each test case in a separate line.

• Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
Answered by AI
Add your answer
Q3. 
Sort a Stack Problem Statement
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...read more
Ans. 
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
• Use one additional stack to assist in sorting the elements.

• Pop elements from the input stack and push them onto the auxiliary stack in sorted order.

• Keep track of the current minimum element to maintain ascending order.

• Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.

Q1. 
Next Smaller Palindrome Problem Statement
You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.
Example:
Input:
T...read more
Ans. 
Find the largest palindrome number strictly less than a given palindrome number.
• Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.

• Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.

• If the number has an odd length, simply mirror the first half to create the largest...read more
Answered by AI
Add your answer
Q2. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process.

• Track the time taken to rot all fresh oranges.

• Return -1 if all fresh oranges cannot be rotten.

• Handle edge cases like empty grid or no fresh oranges.
Answered by AI
Add your answer

Implement tail -f command

Q1. Kafka partitions
Add your answer
Q2. Elasticsearch queries
Add your answer

Q1. Why Browserstack?
Ans. 
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
• Provides access to a wide range of browsers and devices for testing

• Allows for parallel testing to save time and increase efficiency

• Integrates with popular testing frameworks like Selenium and Appium

• Offers features like screenshots, video recordings, and debugging tools

• Used by companies like Microsoft, Twitter, and Airbnb for t...read more
Answered by AI
Add your answer
Q2. Any challenge you faced at current company?
Ans. 
Yes, I faced a challenge in integrating a new third-party API with our existing system.
• Had to understand the documentation of the API thoroughly

• Encountered compatibility issues with our system

• Worked closely with the API provider to troubleshoot and resolve issues
Answered by AI
Add your answer

The aptitude test was in online mode. There were 20 mcq questions and 5 coding questions ranging from easy to hard

After the Aptitude test, the gd was kept in offline mode ( at office ), the topic was "the pros and cons of online classes

Q1. In the 1st technical round, basic questions regarding the languages which i have mentioned in resume was asked. I mentioned python and C in my resume and a coding problem was asked to solve and to further ...read more
Add your answer

Q1. In the second technical OOPS concepts and DSA questions were asked
Add your answer

Aptitude test such as profit and loss , blood relations

Questions on string and map

Q1. Questions like will you be able to work after your assigned time
Add your answer

Basic questions of dbms ,os

Q1. Delete middle node of linked list
Ans. 
To delete the middle node of a linked list, we can iterate through the list to find the middle node and then remove it by adjusting the pointers.
• Iterate through the linked list to find the middle node by using two pointers - one moving one node at a time and the other moving two nodes at a time.

• Once the middle node is found, adjust the pointers to skip over the middle node and connect the nodes before and after it.

• Hand...read more
Answered by AI
Add your answer
Q2. N queen problem
Add your answer

Q1. Coding question on DSA
Add your answer
Q2. Design pattern followed by basic java questions
Add your answer

Q1. Design patterns in java
Ans. 
Design patterns in Java are reusable solutions to common problems in software design.
• Design patterns help in creating flexible, maintainable, and scalable code.

• Some common design patterns in Java include Singleton, Factory, Observer, and Strategy.

• Each design pattern has its own purpose and can be applied in different scenarios.

• Design patterns promote code reusability and help in organizing code in a structured manner.
Answered by AI
Add your answer
Q2. Database designing and java8
Add your answer

Logical reasoning ,verbal aptitude , two java program and html
duration 1hr

Hand written java coding 5 problem statement oops, String, Arrays and others

Q1. About infiniti software solution
Add your answer
Q2. Questions in java
Add your answer