Question 1

Explain the difference between shallow copy and deep copy in Python.

Accepted Answer

Shallow (copy.copy()): New top-level object; nested objects are references. Nested mutations affect original. Deep (copy.deepcopy()): Recursive copy; fully independent. Why it matters: Shallow is O(n) for top level only; deep is O(n) for entire structure—can be slow for large nested dicts. Use shallow when: No nested mutables or shared refs OK. Use deep when: Need full isolation (e.g., config that will be modified)....

Question 2

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

Accepted Answer

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....

Question 3

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

Accepted Answer

**Approach**: Two-pass—first pass counts characters; second pass finds first with count 1. Preserves order of first occurrence. **Code**: def first_non_repeating(s): counts = {}; for c in s: counts[c] = counts.get(c, 0) + 1; return next((c for c in s if counts[c] == 1), None). Alternative with Counter: def first_non_repeating(s): from collections import Counter; cnt = Counter(s); return next((c for c in s if cnt[c] == 1), None). **Complexity**: O(n) time, O(k) space (k = unique chars)....

Dunnhumby Python Interview Questions

Difficulty Breakdown

Key Topics Covered

How to Use This Guide

Companies asking these questions

All 3 Questions

More Interview Prep Guides

Unlock All Expert Answers