Algorithm
724. Find Pivot Index #Easy #Cumulative_sum Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly
Algorithm
Minimum Time to make rope colorful #greedy #medium Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the ith balloon. Alice wants the rope to be colorful. She does not want two consecutive balloons to be of
Algorithm
#LeetCode_75 There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have. Return a boolean array result of length n, where
Algorithm
Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring). The score after splitting a string is the number of zeros in the left substring plus the number of ones in the right
Algorithm
#Easy For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times). Given two strings str1 and str2, return the largest string x such that x divides both str1 and
Algorithm
You are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money, which represents your initial amount of money. You must buy exactly two chocolates in such a way that you still have some non-negative leftover money. You
Algorithm
An image smoother is a filter of the size 3 x 3 that can be applied to each cell of an image by rounding down the average of the cell and the eight surrounding cells (i.e., the average of the nine cells in the blue smoother). If one or
Algorithm
Given two strings s and t, return true if t is an anagram of s, and false otherwise. 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. First solv LeetCode - The World’
book
'SQLD 과외노트' 이벤트에 당첨되어서 해당 책을 받게 되었다. 유투브의 정미나 선생님의 채널에서 20명을 선정하는데 거기에 들다니... 흐흐 반드시 내년 첫 시험에 합격해버리리라...흐흐. 내년 첫 SQLD 시험은 보이는 것 처럼 3월 9일이다. 지금부터 준비하면 3개월 좀 넘게 남았음으로 아주 충분하다. 첫 인상 책을 처음 받고 느낀 점은 책
Algorithm
You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path outgoing to another city. It is guaranteed that the graph of paths forms a line without any
Algorithm
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: Constraints : 1 <= numRows <= 30 As soon as i see this problem, pop up a idea...Recursive.
Algorithm
Problem concept Given an m x n binary matrix mat, return the number of special positions in mat. A position (i, j) is called special if mat[i][j] == 1 and all other elements in row i and column j are 0 (rows and columns are 0-indexed). * Input: mat = [[1,