Code Brew Labs Software Engineer Interview Questions and Answers

Question based on array string linkedlist

Dp, trees and basic time complexity

Q1. Tell me about your self
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

It consists of two questions one is easy and another have medium level

Q1. Interview panel consist of 3 persons and asked about OOPS concepts and implementation in C++
Add your answer
Q2. Asked about use of #define.
Add your answer

40 question some were output question and many questions on Oops concept.

Q1. Basic concept of pointer, automata, operating systems
Add your answer

Includes basic aptitude question with additional questions based on coding languages fundamentals.....

Q1. Question were based on oops concepts. My next question was write a code of binary search and explain it and lastly I was asked an aptitude question ...
Add your answer
Q2. Write a code of binary search and explain it
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide the array into two halves

• Compare the target value with the middle element

• If the target value matches the middle element, return its position

• If the target value is less than the middle element, search the left half of the array

• If the target value is greater than the middle element, search the right half of the arra...read more
Answered by AI
Add your answer

There are basic aptitude questions for freshers level

Q1. Oops concepts, basics of sql
Add your answer
Q2. Basics of programming language
Add your answer

Basic coding questions with some aptitude questions

Q1. Object oriented programming
Add your answer
Q2. ArrayList deleting even numbers
Add your answer