aish
BAN USERThe logic is with atmost 2 special character(let assume it to be as k and k=0,1,2). Consider a spl[]={'1','2','3','4','5','6','7','8','9','0','5','#','&','!'} size=14
k=0:
test
k=1:
_test
t_est
te_st
tes_t
test_
We can work out these combinations from i=0 to 5(array size) and fill it from the spl[]
k=2:
case 1: joined (2 blanks together__)
__test
t__est
te__st
tes__t
test__
We can work out these combinations from (i=0 to 6(word test +2 blanks)) and (j=i+1 and j<6) and fill it from the spl[]
case 2: varied
set 1: i=0 is fixed and j=i+2 to 6
_t_est
_t_est
_te_st
_tes_t
_test_
set 2: i=1 is fixed and j=i+2 to 6
t_e_st
t_es_t
t_est_
set 3: i=2 is fixed and j=i+2 to 6
te_s_t
te_st_
set 4: i=3 is fixed and j=i+2 to 6
tes_t_
We can work out these combinations from (i=0 to 3(length of word"test" is 4)) and (j=i+2 to j<6) and fill it from the spl[]
Filling with spl array:
k=0: N/A
k=1: fill index from0 to 13(size is 14)
k=2: fill index1 from0 to 13(size is 14)
fill index2 from0 to 13(size is 14)
24 = (3*8) positive
- aish June 04, 2016168 = (24*7) negative
1008 = (168*6) postive
5040 = (1008*5) negative
Next ?? = (5040*4) positive