Chase Bank Software Engineer Intern Interview Questions and Answers

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

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

It was quantitative aptitude test with some coding questions

Q1. This round was to majorly check our confidence and communication style. I was asked to explain the projects that I have done..then some general analytical based questions that were non technical.
Add your answer
Q2. Why didn't you want to pursue higher studies?
Add your answer
Q3. Tell me about urself and the projects you have done
Add your answer

Q1. How to find out prime number
Ans. 
Prime numbers are numbers that are only divisible by 1 and themselves.
• Start by checking if the number is less than 2, as prime numbers start from 2.

• Iterate from 2 to the square root of the number and check if the number is divisible by any of these numbers.

• If the number is not divisible by any number in the range, then it is a prime number.
Answered by AI
Add your answer

It had more than 30 aptitude questions and 2 coding questions

Q1. It was totally a tech round all questions were from Data structure, dbms, java, computer networking
Add your answer

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer