KJ System Software Developer Interview Questions, Process, and Tips

It was an online test for interview

Q1. Tell me about dijistkras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

• It maintains a list of tentative distances to each node and updates them as it explores the graph.

• The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

• Example:...read more
Answered by AI
Add your answer
Q2. Tell me about your projects
Add your answer

Java internals, coding questions 2sum

Q1. Hld of your previous project
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Used React.js for front-end development

• Implemented RESTful APIs for backend using Node.js and Express

• Utilized MongoDB for database storage

• Incorporated authentication and authorization features for user security
Answered by AI
Add your answer
Q2. Question related to self build projects
Add your answer

Q1. Salary negotiation
Add your answer
Q2. Location constrain if any
Ans. 
Open to relocation for the right opportunity
• Willing to relocate for the right job opportunity

• Flexible with location for the right role

• Open to considering different locations for the right position
Answered by AI
Add your answer

Easy to moderate apt test here

Easy to moderate coding questions on array

Q1. Indexing, sqls, queries, triggers
Add your answer
Q2. Php versions, features, explain code
Add your answer

Q1. General discussion based on the experience , salary
Add your answer

25 questions , 1 hour

1 coding , 2 logical question

Q1. For loop , 2 logical
Add your answer
Q2. About final year projrct
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Java, multi threading, singleton

Q1. Why should we hire you
Add your answer
Q2. Exected ctc for job role
Add your answer

It was the ask mostly about DSA