Bombardier Transportation Intern Interview Questions and Answers

Javascript, python,ML ,nodejs

Q1. Coding questions
Add your answer
Q2. Fibonacci series
Add your answer
Q3. Merge sort algorithm
Ans. 
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
• Merge sort has a time complexity of O(n log n).

• It works by dividing the array into two halves, sorting each half, and then merging them back together.

• The merge step involves comparing elements from both halves and placing them in the correct order.

• Merge sort is a stable sorting algorithm, mea...read more
Answered by AI
Add your answer

Q1. Balanced parentheses
Add your answer