Java

How is the insertion operation's time complexity evaluated in a TreeMap data structure?

Junior — Middle

Т-БанкOZONТетрасофт

How do the MapStruct and Lombok libraries work together in code generation for mapping and automatic method creation?

What is the main purpose of the flatMap method in data stream processing when using the Stream API?

How is the time complexity of insert, search, and delete operations in a Hashtable data structure determined?

How can you integrate the latest updates from the main development branch into a separate feature branch in Git?

How is logarithmic efficiency of operations ensured?

Which data structure provides faster insertion of an element in the middle: ArrayList or LinkedList?

How do the use of Optional and null checks with if/else differ when handling potential missing values?

Explain the concept of Request Scope in the context of the lifecycle of beans.

Junior — Middle

СБЕРТетрасофт

How is amortized operation complexity in a hash table, approaching O(1), ensured?

How do the flatMap methods in the Optional and Stream classes in Java compare?

Can you explain the working principle of the MapStruct library and how it is used for automatic code generation of object mappings?

Can you give an example of the N+1 problem occurring when using Hibernate?

In which cases is it recommended to use synchronous API calls?

Could you list and describe the different scopes used for beans in Spring?

Junior — Middle

StrokiRight LineAston+7

How is the insertion of an element into the middle of an ArrayList array determined in terms of time complexity?

Junior — Middle

IT OneСБЕР БизнесТетрасофт+4

Explain the N+1 problem that can occur when using Hibernate, and how to avoid it.

What approaches and practices are used when interacting with a database within a microservices architecture?

How is the efficiency of searching for an element in a TreeSet data structure evaluated?

What algorithm is used to determine the position of an element in a TreeMap structure and what is its time complexity?

Junior — Middle

СБЕРТетрасофт