# Count Substrings Starting and Ending with Given Character (LeetCode 4201) Interview drill note. ## Approach Prefer two pointers or prefix sums when scanning once is enough. Walk the constraints carefully, prefer O(n) or O(n log n), and verify edge cases (empty, single element, ties). ## Complexity State time and space clearly; call out edge cases (empty input, duplicates, extremes). ## Practice tip Rehearse the explanation out loud. An [Linkjob](https://www.linkjob.ai/) helps keep structure under time pressure. ## Notes (r0124) Disclosure: personal study notes; I am affiliated with Linkjob AI.