Brane Enterprises Interview Questions, Process, and Tips for Freshers

Q1. Ind As related, case study based, difference between DTA and DTL, leadership role related question, problem solving ability
Add your answer
Q2. 5 revenue recognition process, accounting entry for accrual and prepaid . year end adjustment entries. they have given different scenarios and want answer on that generally overall CA related knowledge req...read more
Add your answer

Mcqs on os,dbms,cn oops,dsa

Q1. Diameter of tree,2 sum, sliding window
Ans. 
The question covers topics like tree diameter, 2 sum problem, and sliding window technique.
• For the diameter of a tree, you can use depth-first search (DFS) or breadth-first search (BFS) to find the longest path between any two nodes.

• The 2 sum problem involves finding two numbers in an array that add up to a given target. You can use a hash table or two pointers approach to solve it efficiently.

• Sliding window technique ...read more
Answered by AI
Add your answer
Q2. Diameterof tree
Add your answer
Q3. Two sum
Add your answer
Q4. Slding window
Add your answer

Q1. Sort array of 0,1,2 oops quesions
Ans. 
Sort an array of 0s, 1s, and 2s in ascending order.
• Use the Dutch National Flag algorithm to sort the array in a single pass.

• Maintain three pointers: low, mid, and high.

• Swap elements based on their values and move the pointers accordingly.
Answered by AI
Add your answer

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

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

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

Q1. Rotten oranges question can be found on leetcode
Add your answer

Q1. Trie data structure implementation
Ans. 
Trie is a tree data structure used for efficient retrieval of key-value pairs.
• Trie is typically used for storing and searching strings efficiently.

• Each node in a trie represents a single character of a string.

• Trie allows for prefix search, making it useful for autocomplete features.

• Common operations on a trie include insertion, deletion, and search.

• Example: Trie data structure can be used to implement a dictionary with
Answered by AI
Add your answer