2730. Find the Longest Semi-Repetitive Substring
You are given a 0-indexed string
sthat consists of digits from0to9.A string
tis called a semi-repetitive if there is at most one consecutive pair of the same digits insidet.Return the length of the longest semi-repetitive substring inside
s.A substring is a contiguous non-empty sequence of characters within a string.
2729. Check if The Number is Fascinating
You are given an integer
nthat consists of exactly3digits.We call the number
nfascinating if, after the following modification, the resulting number contains all the digits from1to9exactly once and does not contain any0‘s:
- Concatenate
nwith the numbers2 * nand3 * n.Return
trueifnis fascinating, orfalseotherwise.Concatenating two numbers means joining them together. For example, the concatenation of
121and371is121371.