Goconnect | Feb 5th | Alphabet Wheel Decryption | Common Substring

Question 1: Common Substring Problem Statement: You are given two arrays of strings, a and b, of equal length. For each index i: Compare a[i] and b[i]. Check whether the two strings share at least one common substring. (a substring is any non-empty sequence of consecutive characters). Your task is to: Print "YES" if the pair shares a common substring. Print "NO" if it does not. (Output should be written to stdout (e.g., console.log in Javascript)). Example: Suppose a = ...