Trapping Water 17.5. Change ), You are commenting using your Twitter account. 32. Container with most water 17.4. :) ... Find the Difference - LeetCode 389 Python - Duration: 2:52. LeetCode – Permutations II (Java) Related Problem: Permutation . Alien Dictionary (Hard) 270. Count the frequency of each character. Easy #10 Regular Expression Matching. For example, Permutations II. Easy python with `set()` to track unique permutation. For example: Given s = "aabb", return ["abba", "baab"]. This is my solution in java. Example 2: Input:s1= "ab" s2 = "eidboaoo" Output: False Generally, we are required to generate a permutation or some sequence recursion is the key to go. Thanks. Fill in your details below or click an icon to log in: You are commenting using your WordPress.com account. For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and [2,1,1]. Once a matching pair is found the number is... Can you please explain why you take d = maxH - minH? If you have a comment with lots of < and >, you could add the major part of your comment into a
` YOUR COMMENTS `
section. Medium #6 ZigZag Conversion. Permutations. Given a string, determine if a permutation of the string could form a palindrome. Please put your code into a
`YOUR CODE`