Leetcode 75

String Compression – LeetCode Solution in Java Problem Overview Given an array of characters chars, compress it in place using the following rules: If a character appears only once consecutively, keep it as it is. If a character appears multiple times consecutively, replace the group with the character followed by its frequency. If the frequency

Difficulty: Hard Language: Java Topics: Arrays, Two Pointers, Binary SearchOptimal Time Complexity: O(log(min(m, n)))Optimal Space Complexity: O(1) Introduction Median of Two Sorted Arrays is LeetCode Problem #4 and is one of the most popular binary-search problems asked in coding interviews. At first, the problem looks simple. We have two sorted arrays, so we might think:

Brute Force: Algorithm Find the shorter string among str1 and str2, without loss of generality, let it be str1. Start with base = str1, and check if both str1 and str2 are made of multiples of base. If so, return base. Otherwise, we shall try a shorter string by removing the last character from base. If we have checked all prefix strings without finding the GCD string,