Brane Enterprises Software Developer Interview Questions, Process, and Tips

Q1. Longest consecutive sequence
Ans. 
Find the length of the longest consecutive sequence in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in ascending order.

• Iterate through the sorted array and keep track of the longest consecutive sequence.

• Return the length of the longest consecutive sequence.
Answered by AI
Add your answer
Q2. Time Complexity of all sorting algorithms
Ans. 
Sorting algorithms have different time complexities.
• Time complexity refers to the amount of time it takes for an algorithm to run as the input size increases.

• Some common sorting algorithms and their time complexities are: Bubble Sort (O(n^2)), Insertion Sort (O(n^2)), Selection Sort (O(n^2)), Merge Sort (O(n log n)), Quick Sort (O(n log n)), Heap Sort (O(n log n)).

• The time complexity of an algorithm helps in understand...read more
Answered by AI
Add your answer

Q1. React js and full stack
Add your answer
Q2. Java scirpt and golang
Add your answer
Q3. Mango db also microservices
Add your answer

There was all aptitude topics covered almost , 2coding questions, english

Q1. It was a technical interview, where i was asked about my introduction, oops concepts, sql, codes related to linked list
Add your answer
Q2. In the second technical interview it was oops again and also the coding questions related to linkedlist and trees which was asked more optimised for every solution i gave..
Add your answer

Q1. Tell if a binary tree is BST or not
Ans. 
Check if a binary tree is a Binary Search Tree (BST) or not
• In a BST, the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key

• Perform an in-order traversal of the binary tree and check if the resulting array is sorted

• Keep track of the minimum and maximum values allowed for each node while traversing the tree
Answered by AI
Add your answer
Q2. Three sum problem
Add your answer

Q1. Concepts of OOPs. Gave a code to read and implement a function with a given input using OOPs concept.
Add your answer
Q2. Reverse a linked list
Ans. 
Reverse a singly linked list and return the reversed list.
• Iterate through the linked list and reverse the pointers

• Use three pointers to keep track of current, previous, and next nodes

• Update the head pointer to the last node as the new head
Answered by AI
Add your answer

2 DSA questions for coding round

Q1. Introduce yourself
Ans. 
I am a software developer with 5 years of experience in Java, Python, and SQL.
• 5 years of experience in Java, Python, and SQL

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Discussion of projects
Add your answer
Q3. 2 DSA questions
Add your answer

Q1. Introduce yourself
Ans. 
I am a software developer with 5 years of experience in Java, Python, and SQL.
• 5 years of experience in Java, Python, and SQL

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Discussion of projects and company
Add your answer
Q3. 2 DSA questions
Add your answer

It was good and basic questions were asked.

It was good and basic coding questions were asked.

Q1. Data structures, Java nd some codes were asked
Add your answer

Q1. Data structures, time complexities, os and cn were asked
Add your answer