Brane Enterprises Associate Solution Lead Interview Questions, Process, and Tips

Q1. What business processes are you aware of and explain them
Ans. 
Business processes are a set of activities that organizations perform to achieve their goals.
• Sales process - involves identifying potential customers, qualifying them, and closing deals

• Supply chain process - involves the flow of goods and services from suppliers to customers

• Human resources process - involves recruiting, hiring, training, and managing employees

• Financial process - involves managing financial transactions...read more
Answered by AI
Add your answer
Q2. Questions based on work experience
Add your answer
Q3. Normal and abnormal costs, standard costing, break even point and majorly accounting related questions
Add your answer

Q1. Work ex questions
Add your answer
Q2. Questions on business processes
Add your answer

Q1. Why do you want to join Brane
Ans. 
I am excited to join Brane because of its innovative approach to solving complex business problems.
• I am impressed by Brane's reputation in the industry for delivering high-quality solutions

• I am excited about the opportunity to work with a talented team of professionals

• I believe that Brane's focus on innovation and creativity aligns with my own values and career goals
Answered by AI
Add your answer
Q2. Strengths and weaknesses
Add your answer

Q1. Questionss on blockchain basics
Add your answer
Q2. Regarding ethereum blockchian
Add your answer

Q1. Merge Two sorted Linked List
Ans. 
Merge two sorted linked lists into a single sorted linked list.
• Create a new linked list to store the merged result.

• Compare the values of the nodes from both input lists and add the smaller value to the result list.

• Move the pointer of the list with the smaller value to the next node and continue until both input lists are empty.
Answered by AI
Add your answer
Q2. Merge sort Sorting Algo
Add your answer

Q1. Leetcode medium on graph
Add your answer
Q2. Longest Increasing Subsequnce
Ans. 
Find the length of the longest increasing subsequence in an array.
• Use dynamic programming to keep track of the longest increasing subsequence ending at each index.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence ending at each index based on previous values.

• Return the maximum value in ...read more
Answered by AI
Add your answer

Q1. Tell about your self
Add your answer
Q2. What difficulties u came through in internship
Add your answer

Q1. Not available, sorry about that
Add your answer

Some critical thinking and then project queries

Q1. Not available, sorry about that
Add your answer

Q1. Not available, sorry about that
Add your answer