'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Topics

# Overlapping ABBA

Easy
0/40
Average time to solve is 10m
Contributed by

## Problem statement

Anish is given a string S and has been asked to determine if the given string S contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).

As a friend of Anish, your task is to return “True” if the string S contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order) otherwise return “False” (without quotes).

Example:-
``````The string “ABBA” has two non-overlapping substrings “AB” and “BA” respectively. So “True” will be printed(without quotes).
``````
Detailed explanation ( Input/output format, Notes, Images )
Constraints :
``````1 <= T <= 10
1 <= |S| <= 10^4
The string S contains uppercase Latin letters only.
Time Limit = 1 sec
``````
Sample Input 1 :
``````2
ABA
BACFAB
``````
Sample Output 1 :
``````False
True
``````
Explanation for Sample Output 1 :
``````In the first test case, there are no two non-overlapping substrings, so “False” is printed.

In the second test case, there are two non-overlapping substrings (BACFAB), so “True” is printed.
``````
Sample Input 2 :
``````2
ABBA
AXBYBXA
``````
Sample Output 2 :
``````True
False
``````
Console