LeetCode 진행 레이더

문제목록

전체 문제의 필터 데이터를 불러오는 중입니다

닉네임을 모르겠다면 관리자에게 문의하세요.

#문제난이도상태언어풀이 일시링크
3851
Maximum Requests Without Violating the Limit
medium
보통시작 전--
3852
Smallest Pair With Different Frequencies
easy
쉬움시작 전--
3853
Merge Close Characters
medium
보통시작 전--
3854
Minimum Operations to Make Array Parity Alternating
medium
보통시작 전--
3855
Sum of K-Digit Numbers in a Range
hard
어려움시작 전--
3856
Trim Trailing Vowels
easy
쉬움시작 전--
3857
Minimum Cost to Split into Ones
medium
보통시작 전--
3858
Minimum Bitwise OR From Grid
medium
보통시작 전--
3859
Count Subarrays With K Distinct Integers
hard
어려움시작 전--
3860
Unique Email Groups
medium
보통시작 전--
3861
Minimum Capacity Box
easy
쉬움시작 전--
3862
Find the Smallest Balanced Index
medium
보통시작 전--
3863
Minimum Operations to Sort a String
medium
보통시작 전--
3864
Minimum Cost to Partition a Binary String
hard
어려움시작 전--
3865
Reverse K Subarrays
medium
보통시작 전--
3866
First Unique Even Element
easy
쉬움시작 전--
3867
Sum of GCD of Formed Pairs
medium
보통시작 전--
3868
Minimum Cost to Equalize Arrays Using Swaps
medium
보통시작 전--
3869
Count Fancy Numbers in a Range
hard
어려움시작 전--
3870
Count Commas in Range
easy
쉬움시작 전--
3871
Count Commas in Range II
medium
보통시작 전--
3872
Longest Arithmetic Sequence After Changing At Most One Element
medium
보통시작 전--
3873
Maximum Points Activated with One Addition
hard
어려움시작 전--
3874
Valid Subarrays With Exactly One Peak
medium
보통시작 전--
3875
Construct Uniform Parity Array I
easy
쉬움시작 전--
3876
Construct Uniform Parity Array II
medium
보통시작 전--
3877
Minimum Removals to Achieve Target XOR
medium
보통시작 전--
3878
Count Good Subarrays
hard
어려움시작 전--
3879
Maximum Distinct Path Sum in a Binary Tree
medium
보통시작 전--
3880
Minimum Absolute Difference Between Two Values
easy
쉬움시작 전--
3881
Direction Assignments with Exactly K Visible People
medium
보통시작 전--
3882
Minimum XOR Path in a Grid
medium
보통시작 전--
3883
Count Non Decreasing Arrays With Given Digit Sums
hard
어려움시작 전--
3884
First Matching Character From Both Ends
easy
쉬움시작 전--
3885
Design Event Manager
medium
보통시작 전--
3886
Sum of Sortable Integers
hard
어려움시작 전--
3887
Incremental Even-Weighted Cycle Queries
hard
어려움시작 전--
3888
Minimum Operations to Make All Grid Elements Equal
hard
어려움시작 전--
3889
Mirror Frequency Distance
medium
보통시작 전--
3890
Integers With Multiple Sum of Two Cubes
medium
보통시작 전--
3891
Minimum Increase to Maximize Special Indices
medium
보통시작 전--
3892
Minimum Operations to Achieve At Least K Peaks
hard
어려움시작 전--
3893
Maximum Team Size with Overlapping Intervals
medium
보통시작 전--
3894
Traffic Signal Color
easy
쉬움시작 전--
3895
Count Digit Appearances
medium
보통시작 전--
3896
Minimum Operations to Transform Array into Alternating Prime
medium
보통시작 전--
3897
Maximum Value of Concatenated Binary Segments
hard
어려움시작 전--
3898
Find the Degree of Each Vertex
easy
쉬움시작 전--
3899
Angles of a Triangle
medium
보통시작 전--
3900
Longest Balanced Substring After One Swap
medium
보통시작 전--