Tinkoff Interview Questions (20)
Practice real interview problems from Tinkoff
| Status | Title | Solution | Practice | Difficulty | Companies | Topics |
|---|---|---|---|---|---|---|
| 3. Longest Substring Without Repeating Characters | Solution | Solve | Medium | Accenture+104 | ||
| 5. Longest Palindromic Substring | Solution | Solve | Medium | Accenture+81 | ||
| 19. Remove Nth Node From End of List | Solution | Solve | Medium | Accenture+17 | ||
| 33. Search in Rotated Sorted Array | Solution | Solve | Medium | Accenture+52 | ||
| 34. Find First and Last Position of Element in Sorted Array | Solution | Solve | Medium | Accenture+28 | ||
| 71. Simplify Path | Solution | Solve | Medium | Amazon+23 | ||
| 155. Min Stack | Solution | Solve | Medium | Adobe+36 | ||
| 200. Number of Islands | Solution | Solve | Medium | Accenture+85 | ||
| 394. Decode String | Solution | Solve | Medium | Activision+39 | ||
| 419. Battleships in a Board | Solution | Solve | Medium | Amazon+7 | ||
| 2694. Event Emitter | Solution | Solve | Medium | Amazon+3 |
About Tinkoff Coding Interviews
Tinkoff is known for building one of the most advanced fintech engineering platforms in Europe. The company operates as a digital-first bank, which means its engineers work on high-scale backend systems, payment infrastructure, mobile platforms, and real-time data processing. Because of this engineering culture, the Tinkoff coding interview strongly emphasizes problem solving, algorithmic thinking, and writing efficient code.
The typical Tinkoff interview process starts with an online coding assessment or recruiter phone screen. Candidates who pass move to one or two technical coding interviews where they solve algorithmic problems while discussing trade-offs and complexity. For mid-level and senior roles, additional rounds may include a system design discussion and a behavioral interview focused on ownership and product thinking.
From analyzing real candidate reports, Tinkoff interviews frequently focus on practical data structure and algorithm problems rather than purely theoretical puzzles. Common topics include:
- Arrays and string manipulation
- Hash tables and frequency counting
- Binary search and sorting
- Graphs and BFS/DFS traversal
- Dynamic programming and greedy optimization
- Stack and queue based problems
The overall difficulty distribution usually mirrors many top fintech companies: roughly 40% easy, 40% medium, and 20% hard problems. Interviewers care not only about getting the correct answer, but also about writing clean code, discussing time and space complexity, and improving a brute-force solution into an optimized one.
FleetCode helps you prepare by collecting 27 real Tinkoff interview questions and organizing them by difficulty and topic. Each problem includes clear explanations and solutions in multiple languages such as Python, Java, and C++. Practicing these patterns will help you recognize the types of algorithmic challenges Tinkoff engineers often use during interviews.
Interview Tips for Tinkoff
Preparing for a Tinkoff coding interview requires both algorithm practice and the ability to communicate your thought process clearly. While the structure can vary by role, most candidates report a consistent interview format focused on practical problem solving.
Typical Tinkoff interview process:
- Recruiter screen (20–30 minutes): A conversation about your experience, projects, and motivation for joining Tinkoff.
- Online coding assessment: Usually 1–2 algorithm problems to be solved within a time limit.
- Technical coding interviews (1–2 rounds, 60 minutes each): Solve DSA problems while explaining your approach and complexity analysis.
- System design interview (for experienced roles): Design scalable backend systems such as payment services, notification pipelines, or transaction processing systems.
- Final discussion or culture fit round: Focus on teamwork, ownership, and engineering decision making.
Most common problem categories at Tinkoff:
- Array and hash map problems involving counting or grouping
- Binary search on sorted datasets
- BFS and DFS on graphs or grids
- Stack-based problems like monotonic stack or expression evaluation
- Dynamic programming for optimization scenarios
A good preparation strategy is to master the core patterns rather than memorizing isolated questions. Start with arrays, hash tables, and two-pointer techniques, then move to trees, graphs, and dynamic programming. Tinkoff interviewers often ask follow-up questions that require optimizing an initial brute-force approach, so practice explaining complexity improvements.
Common mistakes candidates make:
- Jumping straight into coding without clarifying edge cases
- Not discussing time and space complexity
- Ignoring scalability considerations when explaining solutions
- Writing code without testing with sample inputs
Most candidates need about 6–8 weeks of consistent practice to prepare effectively. Aim to solve 2–3 problems per day across key topics and revisit patterns you struggle with. Working through curated sets like the 27 Tinkoff interview problems on FleetCode helps you focus specifically on the styles of questions that appear in real interviews.