Busy Infotech Software Developer Interview Questions and Answers

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

Please inquire about the fundamentals of computer science, including object-oriented programming, data structures and algorithms, database management systems, and computer networks.

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

Q1. Cs fundamental questions
Add your answer

Q1. Coding + design
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

Q1. Java script, React JS
Add your answer
Q2. Data structures and algorithms
Add your answer

It was the ask mostly about DSA

Questions trees and graphs.