넘치게 채우기

https://leetcode.com/problems/xor-queries-of-a-subarray/description/?envType=daily-question&envId=2024-09-13leetcode - XOR Queries of a Subarray문제 유형 : 비트마스킹, 부분합문제 난이도 : Medium 문제You are given an array arr of positive integers. You are also given the array queries where queries[i] = [lefti, righti].For each query i compute the XOR of elements from lefti to righti (that is, arr[lefti] XOR arr[le..

https://leetcode.com/problems/count-the-number-of-consistent-strings/description/?envType=daily-question&envId=2024-09-12leetcode - Count the Number of Consistent Strings문제 유형 : 문자열 처리문제 난이도 : Easy 문제You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed.Return the number ..

https://leetcode.com/problems/minimum-bit-flips-to-convert-number/description/?envType=daily-question&envId=2024-09-11leetcode - Minimum Bit Flips to Convert Number문제 유형 : 비트마스킹문제 난이도 : Easy 문제A bit flip of a number x is choosing a bit in the binary representation of x and flipping it from either 0 to 1 or 1 to 0.For example, for x = 7, the binary representation is 111 and we may choose any bit ..

https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/?envType=daily-question&envId=2024-09-10leetcode - Insert Greatest Common Divisors in Linked List문제 유형 : 연결리스트문제 난이도 : Medium 문제Given the head of a linked list head, in which each node contains an integer value.Between every pair of adjacent nodes, insert a new node with a value equal to the greatest common ..

https://leetcode.com/problems/spiral-matrix-iv/description/?envType=daily-question&envId=2024-09-04leetcode - Spiral Matrix IV문제 유형 : 행렬, 연결 리스트문제 난이도 : Medium 문제You are given two integers m and n, which represent the dimensions of a matrix.You are also given the head of a linked list of integers.Generate an m x n matrix that contains the integers in the linked list presented in spiral order (cl..

https://leetcode.com/problems/split-linked-list-in-parts/description/?envType=daily-question&envId=2024-09-08leetcode - Split Linked List in Parts문제 유형 : 연결리스트문제 난이도 : Medium 문제Given the head of a singly linked list and an integer k, split the linked list into k consecutive linked list parts.The length of each part should be as equal as possible: no two parts should have a size differing by more..

https://leetcode.com/problems/linked-list-in-binary-tree/description/?envType=daily-question&envId=2024-09-07leetcode - Linked List in Binary Tree문제 유형 : 이진트리, 연결리스트문제 난이도 : Medium 문제Given a binary tree root and a linked list with head as the first node.Return True if all the elements in the linked list starting from the head correspond to some downward path connected in the binary tree otherwis..

https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/description/?envType=daily-question&envId=2024-09-06leetcode - Delete Nodes From Linked List Present in Array문제 유형 : 연결 리스트문제 난이도 : Medium 문제You are given an array of integers nums and the head of a linked list. Return the head of the modified linked list after removing all nodes from the linked list that have a value t..

https://leetcode.com/problems/find-missing-observations/description/?envType=daily-question&envId=2024-09-05leetcode - Find Missing Observations문제 유형 : 구현, 수학문제 난이도 : Medium 문제You have observations of n + m 6-sided dice rolls with each face numbered from 1 to 6. n of the observations went missing, and you only have the observations of m rolls. Fortunately, you have also calculated the average va..

https://leetcode.com/problems/walking-robot-simulation/leetcode - Walking Robot Simulation문제 유형 : 구현, 해시, 이진탐색문제 난이도 : Medium 문제A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot can receive a sequence of these three possible types of commands:-2: Turn left 90 degrees.-1: Turn right 90 degrees.1  k units, one unit at a time.Some of the grid squares are obstacles. The ..