Leetcode 3805. Count Caesar Cipher Pairs | Map | Relative Difference | O(N*L) | Medium

Hi, in this video, I have explained LeetCode problem 3805. Count Caesar Cipher Pairs. 1. Explained the problem statement with examples. 2. Shared brute force approach by generating all possible valid pairs and checking if they are equal or not. Time complexity will be O(N*N*L). 3. Shared optimal approach that if we store the frequency of the relative difference of each word. In this approach time complexity it will be O(N*L). 4. Shared C++ code. Problem Link:- https://leetcode.com/problems/count-caesar-cipher-pairs/description/ Code Link:- https://leetcode.com/problems/count-caesar-cipher-pairs/submissions/1881410459/