First round technical interview: 1 hour.

The interviewer was very calm and started with easy to medium questions. A good understanding of Spring Boot and advanced Java concepts, such as collections, is recommended.

I was asked to write a program to find all array segments (from index i to j) whose sum is 0, without changing the order of the elements in the array. The solution should have a time complexity of O(n).

Dynamic Programming on Arrays/Lists.

Asked to write a program to find a set of array segments (from index i to j) whose sum is 0 in an array, without changing the order of elements. Solve in O(n).

Java/Spring Boot basic questions:

• Lambda Expressions
• BiFunction
• Comparable/Comparator