Challenge Prit’s solution (defn two-strings [s1 s2] "Complexity: O(nm), (= n (count s1)), (= m (count s2)) TOC: ~30m" (if (some true? (map (fn [[k _]] (contains? (frequencies s1) k)) (frequencies s2))) "YES" "NO") ;; looked up some true? online )
Hackerrank
Hackerrank
Hackerrank
Challenge Prit’s solution (defn two-strings [s1 s2] "Complexity: O(nm), (= n (count s1)), (= m (count s2)) TOC: ~30m" (if (some true? (map (fn [[k _]] (contains? (frequencies s1) k)) (frequencies s2))) "YES" "NO") ;; looked up some true? online )