Deep LogicTech India Full Stack Software Developer Interview Questions and Answers

There were around 60 questions and negative marking was also there

Q1. Introduce yourself
Ans. 
I am a Full Stack Developer with experience in front-end and back-end technologies.
• Proficient in HTML, CSS, JavaScript for front-end development

• Skilled in Node.js, Express, MongoDB for back-end development

• Experience with React.js and Angular for building interactive web applications
Answered by AI
Add your answer
Q2. What is diamond problem
Ans. 
Diamond problem is a common issue in multiple inheritance where a class inherits from two classes that have a common ancestor.
• Occurs in languages that support multiple inheritance like C++

• Results in ambiguity when calling methods or accessing attributes from the common ancestor class

• Can be resolved using virtual inheritance or interfaces
Answered by AI
Add your answer
Q3. Run length encoding dsa problem
Ans. 
Run length encoding is a data compression technique that replaces repeated characters with a count and single character.
• Iterate through the input array of strings

• Count the number of consecutive characters in each string

• Replace consecutive characters with count and character
Answered by AI
Add your answer
Q4. Rotate an array by d times
Ans. 
Rotate an array of strings by d times
• Create a new array and copy elements from original array based on rotation index

• Use modulo operator to handle cases where d is greater than array length

• Handle edge cases like empty array or d being negative
Answered by AI
Add your answer

Total 60 question 30 from C/C++ output and 30 from profit-loss, find age and related to ratio

Q1. Dsa coding question, aptitude, oops, rdbms(joins and normalization)
Add your answer
Q2. Rotate materix(nxn) 90 degree
Ans. 
To rotate a matrix 90 degrees, transpose the matrix and then reverse each row.
• Transpose the matrix by swapping matrix[i][j] with matrix[j][i]

• Reverse each row of the transposed matrix to get the final rotated matrix
Answered by AI
Add your answer
Q3. A pattern printing question
Add your answer
Q4. Reverse doubli-linkedlist
Add your answer
Q5. Preorder traversal without using recursion
Ans. 
Iterative solution to perform preorder traversal without using recursion
• Use a stack to keep track of nodes

• Start by pushing the root node onto the stack

• While the stack is not empty, pop a node, visit it, then push its right child followed by its left child onto the stack
Answered by AI
Add your answer

Q1. Introduce yourself
Add your answer
Q2. Why you chose b.tech
Add your answer
Q3. Why you chose cse
Add your answer