Brane Enterprises Interview Questions, Process, and Tips

Q1. Medium leetcode
Add your answer
Q2. Easy leetcode question asked
Add your answer

Q1. Medium leetcode
Add your answer
Q2. Medium lewtcode
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. Tell me about urself
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

Practice standard questions

Q1. Search in rotated sorted array
Ans. 
Search for a target element in a rotated sorted array.
• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two sorted subarrays based on the pivot point.

• Perform binary search on the appropriate subarray to find the target element.
Answered by AI
Add your answer
Q2. Trim a bst in leet code
Ans. 
Trim a binary search tree by removing nodes outside a given range.
• Start by checking if the root node is within the given range.

• If the root node is outside the range, trim it by recursively trimming its left or right subtree.

• If the root node is within the range, recursively trim its left and right subtrees.
Answered by AI
Add your answer

Q1. Basic questions on resume back propagation , gradient descent , activation functions and what is the significance why resnet , vanishing gradient poroblem
Add your answer

Q1. Angular architecture
Add your answer