Confluent SWE Interview Question 2025 May | Sliding Window | on-campus

Question 1: Find All Anagrams in a String Problem Statement Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An anagram is a word formed by rearranging the letters of another word using all the original letters exactly once. Constraints 1 <= s.length, p.length <= 3 x 104 s and p consist of lowercase English letters only Examples Example 1: Input: s ...