1544. Make The String Great

-

 Difficulty: Easy

Given a string s of lower and upper case English letters.

A good string is a string which doesn't have two adjacent characters s[i] and s[i + 1] where:

  • 0 <= i <= s.length - 2
  • s[i] is a lower-case letter and s[i + 1] is the same letter but in upper-case or vice-versa.

To make the string good, you can choose two adjacent characters that make the string bad and remove them. You can keep doing this until the string becomes good.

Return the string after making it good. The answer is guaranteed to be unique under the given constraints.

Notice that an empty string is also good.

 

Example 1:

Input: s = "leEeetcode"
Output: "leetcode"
Explanation: In the first step, either you choose i = 1 or i = 2, both will result "leEeetcode" to be reduced to "leetcode".

Example 2:

Input: s = "abBAcC"
Output: ""
Explanation: We have many possible scenarios, and all lead to the same answer. For example:
"abBAcC" --> "aAcC" --> "cC" --> ""
"abBAcC" --> "abBA" --> "aA" --> ""

Example 3:

Input: s = "s"
Output: "s"

Python Solution:

class Solution:
    def makeGood(self, s: str) -> str:
        i=0
        while 1:
            try:
                if (s[i].islower() and s[i+1].isupper() or s[i+1].islower() and s[i].isupper()) and abs(ord(s[i])-ord(s[i+1]))==32:
                    s=s[:i]+s[i+2:]
                    i=0
                else:
                    i+=1
            except:
                break
        return s

Comments

Post a Comment

Popular posts from this blog

35. Search Insert Position

-
Difficulty: Easy   Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with  O(log n)  runtime complexity.   Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2 Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1 Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4 Python Solution: class Solution: def searchInsert(self, nums: List[int], target: int) -> int: if target in nums: return nums.index(target) else: nums.append(target) nums.sort() return nums.index(target)
Read more

118. Pascal's Triangle

-
Image
Difficulty: Easy   Given an integer   numRows , return the first numRows of   Pascal's triangle . In  Pascal's triangle , each number is the sum of the two numbers directly above it as shown:   Example 1: Input: numRows = 5 Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]] Example 2: Input: numRows = 1 Output: [[1]] Python Solution : class Solution: def generate(self, numRows: int) -> List[List[int]]: l=[[1],[1,1]] if numRows==1: return [[1]] else: for _ in range(3,numRows+1): m=[1] for i in range(len(l[-1])-1): m.append(l[-1][i]+l[-1][i+1]) m.append(1) l.append(m) return l
Read more

763. Partition Labels

-
Difficulty: Medium  You are given a string  s . We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating all the parts in order, the resultant string should be  s . Return  a list of integers representing the size of these parts . Example 1: Input: s = "ababcbacadefegdehijhklij" Output: [9,7,8] Explanation: The partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each letter appears in at most one part. A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts. Example 2: Input: s = "eccbbbbdec" Output: [10] Python SOlution: class Solution: def partitionLabels(self, s: str) -> List[int]: l=[0]*26 for i in range(len(s)): l[ord(s[i])-ord('a')]=i start,end=0,0 lst=[] for i
Read more