Python

Propose an algorithm to find the number replaced by 0 in an array of 100 randomly arranged numbers from 1 to 100. Estimate the time and space complexity.

Tell us how deeply you understood how Python works under the hood.

How does deep copying (`deepcopy`) of an object with cyclic references work, for example, an object 'person' has a reference to a spouse, and the spouse has a reverse reference to the husband?

Tell about your experience working on a project.

Write an SQL query that returns only those combinations of `name` and `last_name` from the `users` table that occur exactly once.