Two Strings

Problem Statement :

Given two strings, determine if they share a common substring . A substring may be as small as one character.

For example, the words "a", "and", "art" share the common substring a. The words "be" and "cat" do not share a substring.

Function Description

Complete the function twoStrings in the editor below. It should return a string, either YES or NO based on whether the strings share a common substring.

twoStrings has the following parameter(s):

    s1, s2: two strings to analyze .

Input Format

The first line contains a single integer p, the number of test cases.

The following p pairs of lines are as follows:

   1. The first line contains string  s1
   2. The second line contains string s2.


   s1 and s2 consist of characters in the range ascii[a-z].
   1 <= p <= 10
   1 <= | s1 |, | s2 | <= 10 ^5

Output Format

For each pair of strings, return YES or NO.


Solution :

                            Solution in C :

In C : 

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
    int k;
        char str[110000],btr[110000];
        int cn1[500],cn2[500],i,j,t,a,b;
    return 0;

                        Solution in C++ :

In C++ :

#include <bits/stdc++.h>
using namespace std;
int main()
    int a; cin >> a;
    for (int g=0;g<a; g++)
        string b,c; cin >> b >> c; map <char,int> k; 
        for (int y=0;y<b.length(); y++) k[b[y]]=1; int counter=0; 
        for (int y=0;y<c.length(); y++) 
            if (k[c[y]]) counter=1; 
        if (counter) cout << "YES" << '\n';
        else cout << "NO" << '\n'; 
    }return 0; 

                        Solution in Java :

In Java :

import java.util.*;

public class TwoStrings {

	BufferedReader br;
	PrintWriter out;
	StringTokenizer st;
	boolean eof;

	void solve() throws IOException {
		int t = nextInt();
		outer: while (t-- > 0) {
			char[] a = nextToken().toCharArray();
			char[] b = nextToken().toCharArray();
			boolean[] has = new boolean[26];
			for (char c : a) {
				has[c - 'a'] = true;
			for (char c : b) {
				if (has[c - 'a']) {
					continue outer;

	TwoStrings() throws IOException {
		br = new BufferedReader(new InputStreamReader(;
		out = new PrintWriter(System.out);

	public static void main(String[] args) throws IOException {
		new TwoStrings();

	String nextToken() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				eof = true;
				return null;
		return st.nextToken();

	String nextString() {
		try {
			return br.readLine();
		} catch (IOException e) {
			eof = true;
			return null;

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());

                        Solution in Python : 
In Python3 :

a = int(input())
for i in range(a):
    i = (input())
    j = (input())
    setx = set([a for a in i])
    sety = set([y for y in j])
    if setx.intersection(sety) == set():

View More Similar Problems

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →