Help Bob Out!

Easy
0/40
profile
Contributed by
6 upvotes
Asked in companies
InfosysBottomline Technologies

Problem statement

Bob has just turned 18 years old and has opened a Bank account. However, since he has just opened his bank account he is not very experienced about the working of banks, therefore he asks for your help. Bob wants to know whether the IFSC Code given by the bank is valid or not, can you help him?

A valid IFSC (Indian Financial System) Code must be of the following format:-

1) The string should be 11 characters long.

2) The first four characters of the IFSC Code should be upper case alphabets.

3) The fifth character should be 0.

4) The last six characters should be alphanumeric.

Detailed explanation ( Input/output format, Notes, Images )
Input Format:
The first line contains an Integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case consists of a string ‘S’ which denotes the IFSC Code.
Output Format:
For each test case print ‘True’ if the IFSC code is valid otherwise print ‘False’.

Output for each test case will be printed in a separate line.
Note:
You are not required to print anything, it has already been taken care of. Just implement the function.
Constraints:
1 <= T <= 10
1 <= |S| <= 100

Time Limit: 1 sec
Sample Input 1:
2
SBIN0125620
AAAA012562*
Sample Output 1:
True
False
Explanation For Sample Output 1:
The given string S satisfies all the 4 above-mentioned conditions, so True is returned.
In the given string S the last character is not an alphanumeric character, so False is returned.
Sample Input 2:
2
SBIN1125620
SBI00
Sample Output 2:
False
False
Explanation For Sample Output 2:
The given string S does not contain 0 in the fifth position, so False is returned.
In the given string S the is not of length 11, so False is returned.
Hint

Check all characters of the given string.

Approaches (2)
Brute Force

To check whether the string is a valid IFSC Code or not we can check every character of the string explicitly and check whether the string is in the correct format or not.

 

Algorithm:-

  1. If the length of the string is not equal to 11, return False.
  2. Else, iterate from the first index to the fourth index.
    1. Check whether the ASCII values of the characters lie between 65 - 90. If not, return False.
  3. If yes, check whether the fifth character is 0 or not. If No return False.
  4. If yes, iterate from the fourth index to the eleventh index.
    1. Check whether the ASCII values of the characters lie between 65 - 90 or 48 - 57. If not, return False. If yes, return True.
Time Complexity

O(1)

 

There is a maximum of 11 iterations for each string. So the overall time complexity is O(1). 

Space Complexity

O(1)

 

Constant extra space is used.

Code Solution
(100% EXP penalty)
Help Bob Out!
Full screen
Console