Sobes.tech

Which of your completed projects or tasks was the most memorable or interesting for you?

Junior — Middle
174

How is the efficiency of an algorithm determined in terms of execution time and resource usage?

Junior — Middle
168

What new topics or skills have you recently studied for your professional growth?

Junior — Middle
165

Is it possible to extend functionality through inheritance of structures?

Junior — Middle
162

What is the computational complexity of the duplicate removal task? Why? How does HashSet work internally?

Middle
159

Explain the concept of a hash table and how it is used for storing data

Junior — Middle
158

Are you willing to temporarily relocate for the probation period?

Junior — Middle
158

What are the advantages and disadvantages of using the 'final' keyword in Java?

Junior — Middle
156

What is the optimal execution plan for the query to get the employee with the highest salary and their department?

Middle
156

What position are you considering for your professional activity?

Junior — Middle
155

var buf = new Queue<T>(); foreach (T i in source) { buf.Enqueue(i); if (buf.Count > n) yield return buf.Dequeue(); } // source.Count == 11 var x = FilterLast(source, 3).Take(4);

Middle+
153

How does yield work? Why was the yield keyword introduced? How does lazy execution of IEnumerable work?

Middle+
153

What is dependency inversion principle (SOLID principle)?

Middle
151

How to implement user redirection from mobile devices to a mobile subdomain (like VKontakte)?

Middle
150

Can you explain the principle of how a hash table works and how quick data access is achieved?

Junior — Middle
150

What is a query execution plan?

Middle
150

What motivates you to look for a new position in this field?

Junior — Middle
148

How much memory is allocated when creating a new HashSet?

Middle
147

What happens inside the SQL server when a query is executed? How is the result obtained from the query text?

Middle
147

Computational complexity of operations: analyze the complexity of HashSet and List (Contains + Add) loops. Why is List not just an array? How does List manage its size? What is the amortized complexity of adding to a List?

Middle+
146
/4