O(n) time and O(1) using Greedy Approach and Max Heap.

Author: 149ps

358. Rearrange String k Distance Apart/358. Rearrange String k Distance Apart.py

@@ -34,6 +34,9 @@ def rearrangeString(self, s: str, k: int) -> str:
         """
         if (max_freq)*(k-1) >= len(s) and len(count) > 1: 
             return ""
+        """
+        In Python, Min heap is created by default. So if we want to build a max heap out of it. We have to take the negative values of the keys.
+        """
         charFreq = [(-v,k) for k,v in count.items()]
         heapq.heapify(charFreq)
         while charFreq: