OCBC Bank Senior Software Engineer Interview Questions and Answers

Q1. Tell me about yourself
Add your answer

Q1. Basic Java and react question
Add your answer

Q1. Little technical and project oriented question
Add your answer

Basic hacker rank problem

Q1. Asked few questions on react and java
Add your answer

General knowledge and development skills and new things..

Q1. Difference between list and tuple
Ans. 
List is mutable, tuple is immutable in Python.
• List can be modified after creation, tuple cannot.

• List uses square brackets [], tuple uses parentheses ().

• List is used for collections of items that may change, tuple for fixed collections.

• Example: list - [1, 2, 3], tuple - (1, 2, 3)
Answered by AI
Add your answer

Behavioural and culture fit

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer

HackerEarth / Hacker rank Test

Q1. Find the lowest cost when given days you want to use metro if you have cost of a day 1 ,7 and 30 day pass. DP Problem
Ans. 
Using dynamic programming to find the lowest cost for metro passes based on given days.
• Create an array to store the minimum cost for each day.

• Iterate through each day and calculate the minimum cost based on 1, 7, or 30 day pass.

• Update the minimum cost for each day using dynamic programming.

• Return the minimum cost for the total number of days needed.
Answered by AI
Add your answer

Q1. Normal HR Questions
Add your answer