Honest Little AppsChallenge collections

Focus and Screen Time · 27 original mini-challenges

Careful Scan Choices

27 original untimed scanning questions with clear rules and answers. These are entertainment, not a health or ability assessment.

Choose a response. See the reasoning.

Read the facts, pick the answer that best fits the stated goal, then open the explanation. Start with five or browse the full set. There is no timer or personal assessment; the useful part is understanding the choice.

These are original web companion exercises. They are independent of the app; answers and progress do not transfer. All people and records in the scenarios are fictional. These puzzles do not measure brain age, intelligence or a health condition.

01 / reasoning

Overlapping pairs case 1

Read the symbol string ABABA. Count every occurrence of the adjacent pair AB. Matches may overlap: one symbol is allowed to belong to two matches. No spaces or wraparound connections exist. How many matching pairs occur?

Show the worked answer

A. 2

There are 2 matches when every neighboring two-symbol window is checked. Move forward by one position after each check, including after a match. Skipping a matched pair could miss an overlapping occurrence.

Try next: Mark the starting position of each matching pair.

02 / reasoning

Appears only once case 1

The row is A, B, A, C, D, B. Keep symbols that appear exactly once in the entire row, preserving their original order. Symbols appearing twice must be removed completely rather than kept once. Which option gives the correct retained row?

Show the worked answer

B. C D

Keep C D because each appears once in the full row. Repeated symbols are excluded at every occurrence. Removing duplicates would be a different task because it would still retain one copy of each repeated symbol.

Try next: Tally all symbol frequencies before filtering the row.

03 / reasoning

Interior peaks case 1

The number row is 2, 7, 3, 8, 4. An interior peak is strictly greater than both its immediate neighbors. First and last entries never qualify because they lack two neighbors. How many interior peaks does this row contain?

Show the worked answer

C. 2

The row contains 2 interior peaks. Compare each eligible entry with its left and right neighbors separately; being larger than only one neighbor is insufficient. Endpoints stay excluded even when they are large.

Try next: Circle the actual peak entries and explain one rejected interior entry.

04 / reasoning

Digit positions case 1

Treat 1213211 as a string of separate digits, not as one quantity. Count every position containing the digit 1, including adjacent copies. Do not add the digits or count distinct digit types. How many target positions are present?

Show the worked answer

A. 4

There are 4 positions containing 1. Each printed occurrence contributes one, even beside an identical digit. The question asks for occurrence count, so neither the numerical value of the string nor the digit sum is relevant.

Try next: Rewrite the string with spaces and tally the target positions.

05 / reasoning

Skip after the marker case 1

Scan 2 X 5 7 X 3 8 from left to right. An active X skips the next item entirely; a skipped X has no effect. Add only unskipped number items, and never add X itself. What total remains after applying this scanning rule?

Show the worked answer

B. 17

The retained numbers are 2, 7, 8, totaling 17. A skipped item is never processed, so a skipped X cannot trigger another skip. Track the skip flag before interpreting the next printed item.

Try next: Label each row position as retained, active marker, or skipped.

06 / reasoning

Position parity case 1

The six entries are 3, 8, 4, 6, 2, 9. Count positions starting from one. Add entries in odd positions only, regardless of whether the entry values themselves are odd or even. What is the resulting sum of selected entries?

Show the worked answer

C. 9

The selected entries are 3, 4, 2, which sum to 9. Selection depends on position parity, not value parity. A numerically even entry may qualify when it occupies an allowed position.

Try next: Write position numbers above the values before applying the selection rule.

07 / reasoning

Three-symbol window case 1

Look for BBB inside ABBBA. Check every contiguous three-symbol window, advancing one position at a time. Windows may overlap, but symbols cannot be rearranged or connected across the end of the row. How many exact windows match?

Show the worked answer

A. 1

Exactly 1 window matches BBB. Every candidate consists of three adjacent symbols in their existing order. Sharing the same letters is insufficient if the order or adjacency differs from the requested pattern.

Try next: List every possible three-symbol window before counting the matches.

08 / reasoning

Vowel occurrences case 1

Count vowel occurrences in these words: boat, tree, sky. For this puzzle only A, E, I, O and U count as vowels; Y never counts. Repeated vowels each count separately. What is the total across all three words?

Show the worked answer

B. 4

The three words contribute 2, 2, 0 vowel occurrences, totaling 4. Repeated letters count separately, and the supplied definition excludes Y even when pronunciation might suggest another classification.

Try next: Underline every counted letter and keep a separate subtotal for each word.

09 / reasoning

Reverse without rotating case 1

A label reads ABCD. Reverse the complete order of its symbols so the last becomes first, the next-to-last becomes second, and so on. Do not rotate the label or change any symbol. Which option is the exact reversal?

Show the worked answer

C. DCBA

The exact reversal is DCBA. Reading the original from its final position backward preserves every symbol while reversing every positional relationship. Moving only the first or last symbol would perform a rotation instead.

Try next: Reverse your chosen answer again and compare it with the original.

10 / reasoning

Overlapping pairs case 2

Read the symbol string AAAAA. Count every occurrence of the adjacent pair AA. Matches may overlap: one symbol is allowed to belong to two matches. No spaces or wraparound connections exist. How many matching pairs occur?

Show the worked answer

A. 4

There are 4 matches when every neighboring two-symbol window is checked. Move forward by one position after each check, including after a match. Skipping a matched pair could miss an overlapping occurrence.

Try next: Mark the starting position of each matching pair.

11 / reasoning

Appears only once case 2

The row is P, Q, R, P, S, T. Keep symbols that appear exactly once in the entire row, preserving their original order. Symbols appearing twice must be removed completely rather than kept once. Which option gives the correct retained row?

Show the worked answer

B. Q R S T

Keep Q R S T because each appears once in the full row. Repeated symbols are excluded at every occurrence. Removing duplicates would be a different task because it would still retain one copy of each repeated symbol.

Try next: Tally all symbol frequencies before filtering the row.

12 / reasoning

Interior peaks case 2

The number row is 6, 2, 9, 3, 7. An interior peak is strictly greater than both its immediate neighbors. First and last entries never qualify because they lack two neighbors. How many interior peaks does this row contain?

Show the worked answer

C. 1

The row contains 1 interior peaks. Compare each eligible entry with its left and right neighbors separately; being larger than only one neighbor is insufficient. Endpoints stay excluded even when they are large.

Try next: Circle the actual peak entries and explain one rejected interior entry.

13 / reasoning

Digit positions case 2

Treat 4044404 as a string of separate digits, not as one quantity. Count every position containing the digit 4, including adjacent copies. Do not add the digits or count distinct digit types. How many target positions are present?

Show the worked answer

A. 5

There are 5 positions containing 4. Each printed occurrence contributes one, even beside an identical digit. The question asks for occurrence count, so neither the numerical value of the string nor the digit sum is relevant.

Try next: Rewrite the string with spaces and tally the target positions.

14 / reasoning

Skip after the marker case 2

Scan X 4 6 X 2 9 1 from left to right. An active X skips the next item entirely; a skipped X has no effect. Add only unskipped number items, and never add X itself. What total remains after applying this scanning rule?

Show the worked answer

B. 16

The retained numbers are 6, 9, 1, totaling 16. A skipped item is never processed, so a skipped X cannot trigger another skip. Track the skip flag before interpreting the next printed item.

Try next: Label each row position as retained, active marker, or skipped.

15 / reasoning

Position parity case 2

The six entries are 5, 1, 7, 2, 4, 8. Count positions starting from one. Add entries in even positions only, regardless of whether the entry values themselves are odd or even. What is the resulting sum of selected entries?

Show the worked answer

C. 11

The selected entries are 1, 2, 8, which sum to 11. Selection depends on position parity, not value parity. A numerically even entry may qualify when it occupies an allowed position.

Try next: Write position numbers above the values before applying the selection rule.

16 / reasoning

Three-symbol window case 2

Look for AAA inside AAABBB. Check every contiguous three-symbol window, advancing one position at a time. Windows may overlap, but symbols cannot be rearranged or connected across the end of the row. How many exact windows match?

Show the worked answer

A. 1

Exactly 1 window matches AAA. Every candidate consists of three adjacent symbols in their existing order. Sharing the same letters is insufficient if the order or adjacency differs from the requested pattern.

Try next: List every possible three-symbol window before counting the matches.

17 / reasoning

Vowel occurrences case 2

Count vowel occurrences in these words: rain, moon, why. For this puzzle only A, E, I, O and U count as vowels; Y never counts. Repeated vowels each count separately. What is the total across all three words?

Show the worked answer

B. 4

The three words contribute 2, 2, 0 vowel occurrences, totaling 4. Repeated letters count separately, and the supplied definition excludes Y even when pronunciation might suggest another classification.

Try next: Underline every counted letter and keep a separate subtotal for each word.

18 / reasoning

Reverse without rotating case 2

A label reads PQRST. Reverse the complete order of its symbols so the last becomes first, the next-to-last becomes second, and so on. Do not rotate the label or change any symbol. Which option is the exact reversal?

Show the worked answer

C. TSRQP

The exact reversal is TSRQP. Reading the original from its final position backward preserves every symbol while reversing every positional relationship. Moving only the first or last symbol would perform a rotation instead.

Try next: Reverse your chosen answer again and compare it with the original.

19 / reasoning

Overlapping pairs case 3

Read the symbol string BBABBAB. Count every occurrence of the adjacent pair BB. Matches may overlap: one symbol is allowed to belong to two matches. No spaces or wraparound connections exist. How many matching pairs occur?

Show the worked answer

A. 2

There are 2 matches when every neighboring two-symbol window is checked. Move forward by one position after each check, including after a match. Skipping a matched pair could miss an overlapping occurrence.

Try next: Mark the starting position of each matching pair.

20 / reasoning

Appears only once case 3

The row is M, N, M, O, N, P. Keep symbols that appear exactly once in the entire row, preserving their original order. Symbols appearing twice must be removed completely rather than kept once. Which option gives the correct retained row?

Show the worked answer

B. O P

Keep O P because each appears once in the full row. Repeated symbols are excluded at every occurrence. Removing duplicates would be a different task because it would still retain one copy of each repeated symbol.

Try next: Tally all symbol frequencies before filtering the row.

21 / reasoning

Interior peaks case 3

The number row is 1, 4, 6, 3, 2. An interior peak is strictly greater than both its immediate neighbors. First and last entries never qualify because they lack two neighbors. How many interior peaks does this row contain?

Show the worked answer

C. 1

The row contains 1 interior peaks. Compare each eligible entry with its left and right neighbors separately; being larger than only one neighbor is insufficient. Endpoints stay excluded even when they are large.

Try next: Circle the actual peak entries and explain one rejected interior entry.

22 / reasoning

Digit positions case 3

Treat 7071707 as a string of separate digits, not as one quantity. Count every position containing the digit 7, including adjacent copies. Do not add the digits or count distinct digit types. How many target positions are present?

Show the worked answer

A. 4

There are 4 positions containing 7. Each printed occurrence contributes one, even beside an identical digit. The question asks for occurrence count, so neither the numerical value of the string nor the digit sum is relevant.

Try next: Rewrite the string with spaces and tally the target positions.

23 / reasoning

Skip after the marker case 3

Scan 3 X X 4 5 X 7 from left to right. An active X skips the next item entirely; a skipped X has no effect. Add only unskipped number items, and never add X itself. What total remains after applying this scanning rule?

Show the worked answer

B. 12

The retained numbers are 3, 4, 5, totaling 12. A skipped item is never processed, so a skipped X cannot trigger another skip. Track the skip flag before interpreting the next printed item.

Try next: Label each row position as retained, active marker, or skipped.

24 / reasoning

Position parity case 3

The six entries are 2, 6, 9, 3, 5, 7. Count positions starting from one. Add entries in odd positions only, regardless of whether the entry values themselves are odd or even. What is the resulting sum of selected entries?

Show the worked answer

C. 16

The selected entries are 2, 9, 5, which sum to 16. Selection depends on position parity, not value parity. A numerically even entry may qualify when it occupies an allowed position.

Try next: Write position numbers above the values before applying the selection rule.

25 / reasoning

Three-symbol window case 3

Look for AAA inside BAAABA. Check every contiguous three-symbol window, advancing one position at a time. Windows may overlap, but symbols cannot be rearranged or connected across the end of the row. How many exact windows match?

Show the worked answer

A. 1

Exactly 1 window matches AAA. Every candidate consists of three adjacent symbols in their existing order. Sharing the same letters is insufficient if the order or adjacency differs from the requested pattern.

Try next: List every possible three-symbol window before counting the matches.

26 / reasoning

Vowel occurrences case 3

Count vowel occurrences in these words: seed, cloud, dry. For this puzzle only A, E, I, O and U count as vowels; Y never counts. Repeated vowels each count separately. What is the total across all three words?

Show the worked answer

B. 4

The three words contribute 2, 2, 0 vowel occurrences, totaling 4. Repeated letters count separately, and the supplied definition excludes Y even when pronunciation might suggest another classification.

Try next: Underline every counted letter and keep a separate subtotal for each word.

27 / reasoning

Reverse without rotating case 3

A label reads LMNOPQ. Reverse the complete order of its symbols so the last becomes first, the next-to-last becomes second, and so on. Do not rotate the label or change any symbol. Which option is the exact reversal?

Show the worked answer

C. QPONML

The exact reversal is QPONML. Reading the original from its final position backward preserves every symbol while reversing every positional relationship. Moving only the first or last symbol would perform a rotation instead.

Try next: Reverse your chosen answer again and compare it with the original.