The answer is to use `re.findall` with a positive lookahead, as in `len(re.findall(r'(?=AA)', sequence))`. This works because the lookahead `(?=...)` matches the substring at each position without consuming characters, allowing the regex engine to find overlapping occurrences that the built-in `count()` method would miss. On the Certified Associate Python Programmer PCAP exam, this tests your understanding of regular expression assertions and their practical application in data processing tasks like DNA sequence analysis. A common trap is assuming `count()` or a simple loop with `str.find()` will suffice, but those skip overlapping matches by advancing past the matched text. For efficiency, the regex engine’s C implementation handles large sequences far faster than a manual Python loop. Memory tip: think of the lookahead as a “peek” that checks the pattern without stepping forward, so overlapping matches are captured at every starting position.
PCAP Strings Practice Question
This PCAP practice question tests your understanding of strings. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
A data scientist needs to count the occurrences of a substring in a long DNA sequence (e.g., 1 million bases). However, the count must include overlapping occurrences. For example, in 'AAAA', the substring 'AA' appears three times overlapping. The built-in count() method does not count overlapping matches. The scientist needs a function to count overlapping substrings efficiently without using third-party libraries. Which of the following approaches is the most efficient for this task?
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Use re.findall with a positive lookahead: len(re.findall(r'(?=AA)', sequence))
Option C is correct because `re.findall` with a positive lookahead `(?=AA)` matches overlapping occurrences without consuming characters. The lookahead assertion checks for the substring at each position without advancing the match position, so every overlapping occurrence is found. This is more efficient than manual loops because the underlying regex engine is implemented in C and optimized for pattern matching.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✗
Use a for loop with slicing and compare: sum(1 for i in range(len(s)-len(sub)+1) if s[i:i+len(sub)] == sub)
Why it's wrong here
O(n*m) with string slicing overhead.
✗
Use two nested loops to check all possible positions
Why it's wrong here
Inefficient O(n^2) or O(n*m).
✓
Use re.findall with a positive lookahead: len(re.findall(r'(?=AA)', sequence))
Why this is correct
Efficient O(n) for this pattern; regex engine handles overlapping by lookahead.
Related concept
Read the scenario before looking for a memorised answer.
✗
Use a while loop with str.find() and increment the start index by 1
Why it's wrong here
O(n*m) worst-case; may be slow for large strings.
Common exam traps
Common exam trap: answer the scenario, not the keyword
Python Institute often tests the distinction between overlapping and non-overlapping matches, and the trap here is that candidates assume `str.count()` or simple loops are sufficient, not realizing that overlapping matches require a zero-width assertion like lookahead in regex.
Detailed technical explanation
How to think about this question
Positive lookahead `(?=...)` is a zero-width assertion that matches a position where the pattern inside the lookahead is found, without consuming any characters. This allows `re.findall` to find overlapping matches because the regex engine advances by one character after each match (due to the zero-width nature). Under the hood, the regex engine in CPython uses a backtracking NFA implementation, which for simple patterns like `(?=AA)` is very fast, typically O(n) in practice. In real-world bioinformatics, overlapping substring counting is common in motif finding and sequence alignment tasks.
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A cloud solutions architect for a retail company is evaluating services for a new workload. The correct answer here reflects best practice for the specific scenario described — not a general cloud recommendation. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Cloud exam questions reward reading the constraint carefully: the same technology can be right or wrong depending on the use case.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Strings — This question tests Strings — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: Use re.findall with a positive lookahead: len(re.findall(r'(?=AA)', sequence)) — Option C is correct because `re.findall` with a positive lookahead `(?=AA)` matches overlapping occurrences without consuming characters. The lookahead assertion checks for the substring at each position without advancing the match position, so every overlapping occurrence is found. This is more efficient than manual loops because the underlying regex engine is implemented in C and optimized for pattern matching.
What should I do if I get this PCAP question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
This PCAP practice question is part of Courseiva's free Python Institute certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the PCAP exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.