Short Problem Definition:
Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reverse of the string S. The string S is funny if the condition Si−Si−1=Ri−Ri−1 is true for every i from 1 to N−1.
Link
Complexity:
time complexity is O(N)
space complexity is O(1)
Execution:
Just follow the instructions.
Solution:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

#!/usr/bin/py def isStrFunny(s): s_len = len (s) idx = 0 while idx < s_len / / 2 : left_diff = abs ( ord (s[idx])  ord (s[idx + 1 ])) right_diff = abs ( ord (s[s_len  idx  1 ])  ord (s[s_len  idx  2 ])) if left_diff ! = right_diff: return False idx + = 1 return True if __name__ = = '__main__' : t = input () for _ in range (t): s = raw_input () if isStrFunny(s): print "Funny" else : print "Not Funny" 