leetcode/problems/rearrange-string-k-distance-apart at v1.6.5 · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
rearrange_string_k_distance_apart.go		rearrange_string_k_distance_apart.go
rearrange_string_k_distance_apart_test.go		rearrange_string_k_distance_apart_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

Given a non-empty string s and an integer k, rearrange the string such that the same characters are at least distance k from each other.

All input strings are given in lowercase letters. If it is not possible to rearrange the string, return an empty string "".

Example 1:

Input: s = "aabbcc", k = 3
Output: "abcabc" 
Explanation: The same letters are at least distance 3 from each other.

Example 2:

Input: s = "aaabc", k = 3
Output: "" 
Explanation: It is not possible to rearrange the string.

Example 3:

Input: s = "aaadbbcc", k = 2
Output: "abacabcd"
Explanation: The same letters are at least distance 2 from each other.