DataEngPrep.tech
QuestionsPracticeAI CoachDashboardPacksBlog
ProLogin
Home/Questions/Python/Coding/Write a Python function to find the first non-repeating character in a string.

Write a Python function to find the first non-repeating character in a string.

Python/Codingeasy0.4 min read

Approach: Two-pass—count chars, then find first with count 1. Code: def first_non_repeating(s): counts = {}; [counts.update({c: counts.get(c, 0) + 1}) for c in s]; return next((c for c in s if counts[c] == 1), None). Or: from collections import Counter; counts = Counter(s);...

🤖 Practice this in AI Interview
Frequency
Low
Asked at 3 companies
Category
179
questions in Python/Coding
Difficulty Split
127E|24M|28H
in this category
Total Bank
1,863
across 7 categories
Asked at these companies
Delivery HeroDunnhumbyFragma Data Systems
Interview Pro Tip

Red Flag: O(n²) solution (nested loops). Pro-Move: 'Counter is readable; for production we'd handle Unicode normalization (NFD) since users expect á and a to match'—shows production edge-case thinking.

Key Concepts Tested
python

Why This Question Matters

This easy-level Python/Coding question appears frequently in data engineering interviews at companies like Delivery Hero, Dunnhumby, Fragma Data Systems. While less common, it tests deeper understanding that distinguishes strong candidates. Mastering the underlying concepts (python) will help you answer variations of this question confidently.

How to Approach This

Start by clearly defining the core concept being asked about. Interviewers want to see that you understand the fundamentals before diving into implementation details. Structure your answer with a definition, then explain the practical application with a concise example.

Expert Answer
87 words

Approach: Two-pass—count chars, then find first with count 1. Code: def first_non_repeating(s): counts = {}; [counts.update({c: counts.get(c, 0) + 1}) for c in s]; return next((c for c in s if counts[c] == 1), None). Or: from collections import Counter; counts = Counter(s); return next((c for c in s if counts[c] == 1), None). Complexity: O(n) time, O(k) space. Why: Single pass can't know if char is unique until full scan. Best practice: Clarify behavior for empty string (None); consider OrderedDict if order matters for first occurrence.

The complete answer continues with detailed implementation patterns, architectural trade-offs, and production-grade considerations covering performance optimization and real-world examples.

This answer is partially locked

Unlock the full expert answer with code examples and trade-offs

Recommended

Start AI Mock Interview

Practice real interviews with AI feedback, track progress, and get interview-ready faster.

  • Unlimited AI mock interviews
  • Instant feedback & scoring
  • Full answers to 1,800+ questions
  • Resume analyzer & SQL playground
Create Free Account

Pro starts at $19/mo - cancel anytime

Just need answers for quick revision?

Download curated PDF interview packs

Interview Packs
R
P
A
S

Trusted by 10,000+ aspiring data engineers

AmazonGoogleDatabricksSnowflakeMeta
Related Study Guide
🐍

PySpark Interview Questions: Complete Guide (2026)

Master 179 python/coding questions with expert answers. Real questions from 97+ companies.

22 min read →

Related Python/Coding Questions

easyWhat are traits in Scala, and how are they different from classes?FreemediumWrite a Python function to check if a string is a palindrome.FreeeasyWhat is the difference between a list and a tuple in Python?FreeeasyExplain the difference between shallow copy and deep copy in Python.FreeeasyWhat are decorators in Python, and how do they work?Free

According to DataEngPrep.tech, this is one of the most frequently asked Python/Coding interview questions, reported at 3 companies. DataEngPrep.tech maintains a curated database of 1,863+ real data engineering interview questions across 7 categories, verified by industry professionals.

← Back to all questionsMore Python/Coding questions →