make my life better

https://leetcode.com/problems/longest-palindromic-substring/ Given a string s, return the longest palindromic class Solution: def longestPalindrome(self, s: str) -> str: r: int = 0 c: int = 0 maxLen = 1 result = s[0] s = '#' + '#'.join(s) + '#' dp = [0 for _ in range(len(s))] for idx in range(len(dp)): if idx =0 and idx + dp[idx] + 1..

https://leetcode.com/problems/removing-minimum-and-maximum-from-arrayYou are given a 0-indexed array of distinct integers nums.There is an element in nums that has the lowest value and an element that has the highest value. We call them the minimum and maximum respectively. Your goal is to remove both these elements from the array.A deletion is defined as either removing an element from the fron..

https://leetcode.com/problems/repeated-dna-sequences/description/ The DNA sequence is composed of a series of nucleotides abbreviated as 'A', 'C', 'G', and 'T'.For example, "ACGAATTCCG" is a DNA sequence.When studying DNA, it is useful to identify repeated sequences within the DNA.Given a string s that represents a DNA sequence, return all the 10-letter-long sequences (substrings) that occur mor..

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.Return true if you can finish all courses. Otherwise, return false..

https://leetcode.com/problems/group-anagrams/description/ Given an array of strings strs, group the anagrams together. You can return the answer in any order. class Solution: def groupAnagrams(self, strs: List[str]) -> List[List[str]]: result = defaultdict(list) for str in strs: anamgram = "".join(sorted(str)) result[anamgram].append(str) ret..

https://leetcode.com/problems/find-original-array-from-doubled-array/ An integer array original is transformed into a doubled array changed by appending twice the value of every element in original, and then randomly shuffling the resulting array.Given an array changed, return original if changed is a doubled array. If changed is not a doubled array, return an empty array. The elements in origin..

https://leetcode.com/problems/single-threaded-cpu/description/ You are given n tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means that the i​​​​​​th task will be available to process at enqueueTimei and will take processingTimei to finish processing.You have a single-threaded CPU that can process at most one task at a tim..

https://leetcode.com/problems/new-21-game/ Alice plays the following game, loosely based on the card game "21".Alice starts with 0 points and draws numbers while she has less than k points. During each draw, she gains an integer number of points randomly from the range [1, maxPts], where maxPts is an integer. Each draw is independent and the outcomes have equal probabilities.Alice stops drawing ..

[Problem]HintYou are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb.The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes t..

[Problem]You start at the cell (rStart, cStart) of an rows x cols grid facing east. The northwest corner is at the first row and column in the grid, and the southeast corner is at the last row and column.You will walk in a clockwise spiral shape to visit every position in this grid. Whenever you move outside the grid's boundary, we continue our walk outside the grid (but may return to the grid b..