#python
Read more stories on Hashnode
Articles with this tag
o(n^2) def quad_find(s, n): slen = len(s) for i in range(slen): for j in range(slen-1): if s[i] + s[j+1] == n: ...