c0d6DjiInterview Experience
ByteDance FrontEnd Interview
For the LeetCode problem “Licopqibaling,” a recursive solution can pass all test cases. Given a string consisting of 01, find the shortest string containing k number of 1s. If the lengths are the same, find the one repr…
01.5K0
#tiktok