Given a list and bucket size, write an algorithm which returns a list of lists each of which contains [bucket size] number of items. It's not guaranteed that the bucket size will evenly divide into the length of the list. How can you unit test this? What are the base/edge cases?
How does Python pass arguments - value or reference? What is a Python decorator? Write a Python function that receives an integer n and outputs the list of squares of numbers from 1 to n.
Technical: What is the main difference between a language like Python and a language such as C? Why Deutsche is moving its systems to Google Cloud? Experience with different coding languages? How Deutsche goes about adopting different technologies? How Deutsche chooses which technologies to invest in? Why I chose Deutsche over banks running similar programmes? Why that programme? Spring into Banking - Technology, Data and Innovation Why are you interested in technology within the banking sector? Explain the role of Big Data within Deutsche? Security and Multi-factor authentication and its use within Deutsche. Competencies Walk me through your resume/ Tell me about yourself? What is one thing not on your application that we should know about? How would friends and family define you as a person? / Your best traits.
A person traverses a path between from a city A to city B starting at 8am and finishing at 2pm. The next day, he goes back from B to A, on the same exact path starting at 8am and finishing at 2pm. Is there a time of day, such that the person is on the same spot on day one and day two?
Implement list comprehension in Python. (Assume they are simple ones-nothing fancy)
Implement a deadlock in any programming language.
2 eggs and a building problem. A building has height n and you have 2 eggs. At a certain floor N, an egg dropped from this floor will break. Find a strategy to find the floor N at which eggs will start breaking, while minimizing the number of drops. Note that the key is that you have 2 eggs.
Various competency based and other questions were asked - where do you see yourself in 5 years, why JPM, etc
Given an unsorted list of size n-1 that contains all but one number between 1 and n, write an algorithm that will detect the missing number. Can you do this in constant time? What about if there were k numbers?
1. How is a heap constructed, what happens when one removes a value from a heap - describe the inner rotations. 2. Describe the structure of a virtual table in multiple inheritance in c++
Viewing 1 - 10 interview questions