1. Generate all permutations of `s1`. 2. Check if any permutation exists as a substring in `s2`. 1. Create frequency arrays of size 26 (for lowercase letters). 2. Count frequencies of characters in ...

You are given a sorted array of integers, nums, where all integers appear twice except for one. Your task is to find and return the single integer that appears only once.