Sobes.tech

Is a primitive object field stored in the heap or in the stack?

Senior
189

There is a backend and a UI. The stack is standard: Java, Spring, React, Postgres. Task: Design a REST endpoint that needs to fetch data from 3 sources and deliver it to the UI, while ensuring maximum possible throughput and minimal response time (max/min criteria based on our specific conditions, since essentially, there is no silver bullet here and we need to find a compromise). It is known that the expected peak RPS for this REST endpoint will be 200. Details about the sources: 1st source - our database, query takes about 3 seconds. 2nd source - a related REST service, degrades to 2 minutes under 100 RPS, in normal mode responds in 5 seconds. We cannot change the behavior of this source on their side. 3rd source - a related REST service, randomly (no discernible pattern) returns 503, in normal mode response takes 10 seconds. We cannot change the behavior of this source on their side.

Middle+
189

How to ensure reliable invoice delivery if an external service might fail?

189

Tell me about equals and hashCode: the contract, why hashCode is needed

Senior
189

Tell us about transaction isolation levels and the anomalies they address.

Senior
189

If there is data cache, how can you determine that the cause of OOM is specifically due to it?

189

If there were no such infrastructure (like Prometheus), and there were only Kafka and a database, would the database be able to record all these messages under a load of one hundred thousand messages per second?

189

What was the domain of the application: fintech or something else?

Senior
189

What is the purpose of ClassLoader?

Senior
189

Who orchestrated the entire process — who understood what message needed to be sent to Kafka and to initiate the calculation?

Senior
189

For what tasks have you used agents according to your experience?

189

How to organize a common TestContainer for multiple test classes without stopping between them?

Senior
189

//Given an array of numbers where all numbers except one have a pair, //find the number that appears only once // <= [1, 0, 3, -2, 9, 9, 1, -2, 0] // => 3 int find(int[] arr){ //TODO }

Senior
189

Briefly tell about your work experience.

Middle+
189

How to replace large if-else / switch-case structures with patterns (e.g., Strategy)?

Senior
189
/730