If you were designing a GC, what approaches to garbage collection do you know besides traversing the reachability graph?
Senior
274
Java
14621
265
What is a deadlock? How does it differ from a race condition? How to avoid deadlock, including when it is impossible to determine the order of lock acquisition in advance?
Senior
269
Implement RecommenderService with methods getTop(User user, int limit) and addDocument(Document document), using in-memory storage.
Senior
203
How much does a pointer weigh? What is it?
Senior
197
Why are stacks and heaps needed? What is the difference?
Senior
189
Why did the test fail with NullPointerException and how to fix it?
Senior
188
What is heap?
Senior
183
How does object deletion occur in Java heap? Tell me about Garbage Collector.
Senior
173
Compare the performance of the following code snippets that copy elements from an Integer array to an int array and vice versa, including the case where new Integer objects are created from int values: ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { x[i] = y[i]; } } ``` ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = x[i]; } } ``` ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = new Integer(x[i]); } } ``` Analyze and explain the differences in performance and behavior among these approaches.
Senior
170
Какой принцип SOLID нарушен в текущей реализации, где сервис жёстко завязан на конкретной реализации хранилища (ArrayList)?
Senior
166
What methods of inter-process communication (IPC) do you know at the Unix operating system interface level?
Senior
166
int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = new Integer(x[i]); } }
Senior
156
What problem arises in a production environment with multi-threaded access to a service (several REST requests in parallel)?
Senior
154
How does a primitive appear in the stack, and how in the heap?
Senior
154
Why is synchronized needed? What would you use to implement a thread-safe counter instead of synchronized?
Senior
153
/ ** * Find two numbers in an array whose sum equals a given number * <p> * Write a function that takes an array of positive unordered numbers as the first argument * and a positive number as the second argument. The function should return true if * there are 2 numbers in the array that sum up to the second argument. * <p> * Input: ([10, 15, 3, 7], 17) * Output: true * /
Senior
153
What are the disadvantages of the current approach of sorting the entire list each time getTop is called?
Senior
153
Decode the abbreviation ACID and explain each property.
Senior
151
What is the fork system call in Unix-like operating systems?
Senior
149
What is the difference between using 'let' and 'also' keywords in programming?
Senior
146