Briefly tell about your work experience.
Java
Algorithmic problem: given an integer array, move all zeros to the end, preserving the order of other elements (e.g., [1,0,3,0,1] → [1,3,1,0,0])
How to replace large if-else / switch-case structures with patterns (e.g., Strategy)?
[name] asked: How many partitions should a topic have?
What happens if you implement singleton in a prototype?
What is encapsulation? What is its benefit?
Tell me about the Circuit Breaker you implemented for integration with an external system.
What are readiness and liveness probes in Kubernetes?
What are the ways to make a deep copy of an object?
How to protect against inheritance and overriding of getters (so that colleagues cannot override the getter and remove protective copying)?
What are the implementations of List and how do they differ from each other?
Where inside the method is an int type variable stored?
Why should countStock be synchronous rather than asynchronous?
Have you worked with PostgreSQL and query optimization?
What are you currently looking for when responding to job openings, what do you pay attention to, and what attracts you?
How does the base of the logarithm change when calculating the height of a tree depending on the type of tree?
В чем разница между newFixedThreadPool и ForkJoinPool?
Does the volatile modifier affect the atomicity of primitive type variables in Java?
Why does LLM give a result token by token instead of all at once?
What is the purpose of the volatile modifier in programming and what is its role?