Brane Enterprises 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. Evolution of NLP
Ans. 
NLP has evolved from rule-based systems to machine learning models, enabling more accurate and nuanced language processing.
• NLP started with rule-based systems like ELIZA in the 1960s

• Advancements in machine learning led to the development of statistical NLP models like Hidden Markov Models and Conditional Random Fields

• Recent breakthroughs in deep learning have revolutionized NLP with models like BERT and GPT-3

• NLP applic...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

Maths, Logical Reasoning

Q1. Why are you interested?
Add your answer
Q2. Are you interested in coding?
Ans. 
Yes, I am interested in coding as it allows me to solve problems creatively and continuously learn new skills.
• I enjoy the challenge of writing efficient code

• I like to explore new technologies and frameworks

• Coding helps me think logically and analytically
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