ᴊɪɴᴜ﹖ᴅɪɴᴏ﹗

Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Constraints: ▷ The number of nodes in the list is in the range [1, 105]. ▷ 0

You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Constraints: ▷ 1

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation. Constraints: ▷ 2

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Constraints: ▷ 3 right and nums[right] == nums[right-1]: right -= 1 left += 1 right -= 1 return results

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Constraints: ▷ n == height.length ▷ 1

Given a string s, return the longest palindromic substring in s. Constraints: ▷ 1 str: # two-pointer expansion function def expand(left: int, right: int) -> str: while left >= 0 and right < len(s) and s[left] == s[right]: left -= 1 right += 1 return s[left + 1:right] # return if there are no options if len(s) < 2 or s == s[::-1]: return s result = '' # move sliding window to right for i in range..

You are given an array of logs. Each log is a space-delimited string of words, where the first word is the identifier. There are two types of logs: ▷ Letter-logs: All words (except the identifier) consist of lowercase English letters. ▷ Digit-logs: All words (except the identifier) consist of digits. Reorder these logs so that: ▷ The letter-logs come before all digit-logs. ▷ The letter-logs are ..

Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. * anagram: 문자를 재배열하여 다른 뜻을 가진 단어로 바꾸는 것 Example: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","..

Given a string paragraph and a string array of the banned words banned, return the most frequent word that is not banned. It is guaranteed there is at least one word that is not banned, and that the answer is unique. The words in paragraph are case-insensitive and the answer should be returned in lowercase. Example: Input: paragraph = "Bob hit a ball, the hit BALL flew far after it was hit.", ba..

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise. * palindrome: 역순으로 읽어도 같은 말이나 구절, 숫자 등을 의미한다. Example: Input: s = "A man, a plan, a canal: Pana..