Jelly, 7(削除) 7 (削除ここまで) 6 bytes
-1 thanks to caird coinheringaahing ! (Use w and filtering to avoiding @.)
rAẇ@5ドルSrAwƇ5L
Input: Start, End, ToFind
How?
rAẇ@5ドルSrAwƇ5L - Main link: Start, End, ToFind
r - range: [Start, ..., End]
A - absolute values
5 - third input: ToFind
ẇ@€ Ƈ - sublistfilter existskeep inthose with(absolute reversedvalues, @rgumentsa) for €achwhich:
w S- first index of sublist (implicit digits of ToFind) in (implicit digits of a)
L - sumlength
The default casting of an integer to an iterable for the sublist existence check casts to a decimal list (not a character list), so negative numbers have a leading negative value (e.g. -122->[-1,2,2] which won't find a sublist of [1,2]) so taking the absolute value first seems like the golfiest solution.
Jelly, 7 bytes
rAẇ@5ドルS
Input: Start, End, ToFind
How?
rAẇ@5ドルS - Main link: Start, End, ToFind
r - range: [Start, ..., End]
A - absolute values
5 - third input: ToFind
ẇ@€ - sublist exists in with reversed @rguments for €ach
S - sum
The default casting of an integer to an iterable for the sublist existence check casts to a decimal list (not a character list), so negative numbers have a leading negative value (e.g. -122->[-1,2,2] which won't find a sublist of [1,2]) so taking the absolute value first seems like the golfiest solution.
Jelly, (削除) 7 (削除ここまで) 6 bytes
-1 thanks to caird coinheringaahing ! (Use w and filtering to avoiding @.)
rAwƇ5L
Input: Start, End, ToFind
How?
rAwƇ5L - Main link: Start, End, ToFind
r - range: [Start, ..., End]
A - absolute values
5 - third input: ToFind
Ƈ - filter keep those (absolute values, a) for which:
w - first index of sublist (implicit digits of ToFind) in (implicit digits of a)
L - length
The default casting of an integer to an iterable for the sublist existence check casts to a decimal list (not a character list), so negative numbers have a leading negative value (e.g. -122->[-1,2,2] which won't find a sublist of [1,2]) so taking the absolute value first seems like the golfiest solution.
Jelly, 7 bytes
rAẇ@5ドルS
Input: Start, End, ToFind
How?
rAẇ@5ドルS - Main link: Start, End, ToFind
r - range: [Start, ..., End]
A - absolute values
5 - third input: ToFind
ẇ@€ - sublist exists in with reversed @rguments for €ach
S - sum
The default casting of an integer to an iterable for the sublist existence check casts to a decimal list (not a character list), so negative numbers have a leading negative value (e.g. -122->[-1,2,2] which won't find a sublist of [1,2]) so taking the absolute value first seems like the golfiest solution.
Jelly, 7 bytes
rAẇ@5ドルS
Input: Start, End, ToFind
How?
rAẇ@5ドルS - Main link: Start, End, ToFind
r - range: [Start, ..., End]
A - absolute values
5 - third input: ToFind
ẇ@€ - sublist exists in with reversed @rguments for €ach
S - sum
The default casting of an integer to an iterable for the sublist existence check casts to a decimal list (not a character list), so negative numbers have a leading negative value (e.g. -122->[-1,2,2] which won't find a sublist of [1,2]) so taking the absolute value first seems like the golfiest solution.