| 剑指 Offer II 092 |
将字符串翻转到单调递增 |
C++ |
Medium |
| 剑指 Offer II 091 |
粉刷房子 |
C++ |
Medium |
| 剑指 Offer II 090 |
打家劫舍 II |
C++ |
Medium |
| 剑指 Offer II 089 |
打家劫舍 |
C++ |
Medium |
| 剑指 Offer II 088 |
使用最小花费爬楼梯 |
C++ |
Easy |
| 剑指 Offer II 087 |
复原 IP 地址 |
C++ |
Medium |
| 剑指 Offer II 086 |
分割回文串 |
C++ |
Medium |
| 剑指 Offer II 085 |
括号生成 |
C++ |
Medium |
| 剑指 Offer II 084 |
全排列 II |
C++ |
Medium |
| 剑指 Offer II 083 |
全排列 |
C++ |
Medium |
| 剑指 Offer II 082 |
组合总和 II |
C++ |
Medium |
| 剑指 Offer II 081 |
组合总和 |
C++ |
Medium |
| 剑指 Offer II 080 |
组合 |
C++ |
Medium |
| 剑指 Offer II 079 |
子集 |
C++ |
Medium |
| 剑指 Offer II 078 |
合并 K 个升序链表 |
C++ |
Hard |
| 剑指 Offer II 077 |
排序链表 |
C++ |
Medium |
| 剑指 Offer II 076 |
数组中的第 K 个最大元素 |
C++ |
Medium |
| 剑指 Offer II 075 |
数组的相对排序 |
C++ |
Easy |
| 剑指 Offer II 074 |
合并区间 |
C++ |
Medium |
| 剑指 Offer II 073 |
爱吃香蕉的狒狒 |
C++ |
Medium |
| 剑指 Offer II 072 |
x 的平方根 |
C++ |
Easy |
| 剑指 Offer II 071 |
按权重随机选择 |
C++ |
Medium |
| 剑指 Offer II 070 |
有序数组中的单一元素 |
C++ |
Medium |
| 剑指 Offer II 069 |
山脉数组的峰顶索引 |
C++ |
Easy |
| 剑指 Offer II 068 |
搜索插入位置 |
C++ |
Easy |
| 剑指 Offer II 067 |
数组中两个数的最大异或值 |
C++ |
Medium |
| 剑指 Offer II 066 |
键值映射 |
C++ |
Medium |
| 剑指 Offer II 065 |
单词的压缩编码 |
C++ |
Medium |
| 剑指 Offer II 064 |
实现一个魔法字典 |
C++ |
Medium |
| 剑指 Offer II 063 |
替换单词 |
C++ |
Medium |
| 剑指 Offer II 062 |
实现前缀树 |
C++ |
Medium |
| 剑指 Offer II 061 |
和最小的 k 个数对 |
C++ |
Medium |
| 剑指 Offer II 060 |
出现频率最高的 k 个数字 |
C++ |
Medium |
| 剑指 Offer II 059 |
数据流的第 K 大数值 |
C++ |
Easy |
| 剑指 Offer II 058 |
日程表 |
C++ |
Medium |
| 剑指 Offer II 057 |
值和下标之差都在给定的范围内 |
C++ |
Medium |
| 剑指 Offer II 056 |
二叉搜索树中两个节点之和 |
C++ |
Easy |
| 剑指 Offer II 055 |
二叉搜索树迭代器 |
C++ |
Medium |
| 剑指 Offer II 054 |
所有大于等于节点的值之和 |
C++ |
Medium |
| 剑指 Offer II 053 |
二叉搜索树中的中序后继 |
C++ |
Medium |
| 剑指 Offer II 052 |
展平二叉搜索树 |
C++ |
Easy |
| 剑指 Offer II 051 |
节点之和最大的路径 |
C++ |
Hard |
| 剑指 Offer II 050 |
向下的路径节点之和 |
C++ |
Medium |
| 剑指 Offer II 049 |
从根节点到叶节点的路径数字之和 |
C++ |
Medium |
| 剑指 Offer II 048 |
序列化与反序列化二叉树 |
C++ |
Hard |
| 剑指 Offer II 047 |
二叉树剪枝 |
C++ |
Medium |
| 剑指 Offer II 046 |
二叉树的右侧视图 |
C++ |
Medium |
| 剑指 Offer II 045 |
二叉树最底层最左边的值 |
C++ |
Medium |
| 剑指 Offer II 043 |
往完全二叉树添加节点 |
C++ |
Medium |
| 剑指 Offer II 042 |
最近请求次数 |
C++ |
Easy |
| 剑指 Offer II 041 |
滑动窗口的平均值 |
C++ |
Easy |
| 剑指 Offer II 040 |
矩阵中最大的矩形 |
C++ |
Hard |
| 剑指 Offer II 039 |
直方图最大矩形面积 |
C++ |
Hard |
| 剑指 Offer II 038 |
每日温度 |
C++ |
Medium |
| 剑指 Offer II 037 |
小行星碰撞 |
C++ |
Medium |
| 剑指 Offer II 036 |
后缀表达式 |
C++ |
Medium |
| 剑指 Offer II 035 |
最小时间差 |
C++ |
Medium |
| 剑指 Offer II 034 |
外星语言是否排序 |
C++ |
Medium |
| 剑指 Offer II 033 |
变位词组 |
C++ |
Medium |
| 剑指 Offer II 032 |
有效的变位词 |
C++ |
Easy |
| 剑指 Offer II 031 |
最近最少使用缓存 |
C++ |
Medium |
| 剑指 Offer II 030 |
插入、删除和随机访问都是 O(1) 的容器 |
C++ |
Medium |
| 剑指 Offer II 029 |
排序的循环链表 |
C++ |
Medium |
| 剑指 Offer II 028 |
展平多级双向链表 |
C++ |
Medium |
| 剑指 Offer II 027 |
回文链表 |
C++ |
Easy |
| 剑指 Offer II 025 |
链表中的两数相加 |
C++ |
Medium |
| 剑指 Offer II 022 |
链表中环的入口节点 |
C++ |
Medium |
| 剑指 Offer II 021 |
删除链表的倒数第 n 个结点 |
C++ |
Medium |
| 剑指 Offer II 020 |
回文子字符串的个数 |
C++ |
Medium |
| 剑指 Offer II 019 |
最多删除一个字符得到回文 |
C++ |
Easy |
| 剑指 Offer II 018 |
有效的回文 |
C++ |
Easy |
| 剑指 Offer II 017 |
含有所有字符的最短字符串 |
C++ |
Hard |
| 剑指 Offer II 016 |
不含重复字符的最长子字符串 |
C++ |
Medium |
| 剑指 Offer II 015 |
字符串中的所有变位词 |
C++ |
Medium |
| 剑指 Offer II 014 |
字符串中的变位词 |
C++ |
Medium |
| 剑指 Offer II 012 |
左右两边子数组的和相等 |
C++ |
Medium |
| 剑指 Offer II 011 |
0 和 1 个数相同的子数组 |
C++ |
Medium |
| 剑指 Offer II 010 |
和为 k 的子数组 |
C++ |
Medium |
| 剑指 Offer II 009 |
乘积小于 K 的子数组 |
C++ |
Medium |
| 剑指 Offer II 008 |
和大于等于 target 的最短子数组 |
C++ |
Medium |
| 剑指 Offer II 007 |
数组中和为 0 的三个数 |
C++ |
Medium |
| 剑指 Offer II 006 |
排序数组中两个数字之和 |
C++ |
Medium |
| 剑指 Offer II 005 |
单词长度的最大乘积 |
C++ |
Medium |
| 剑指 Offer II 004 |
只出现一次的数字 |
C++ |
Easy |
| 剑指 Offer II 003 |
前 n 个数字二进制中 1 的个数 |
C++ |
Easy |
| 剑指 Offer II 002 |
二进制加法 |
C++ |
Easy |
| 剑指 Offer II 001 |
整数除法 |
C++ |
Easy |
| 剑指 Offer 66 |
构建乘积数组 |
C++ |
Medium |
| 剑指 Offer 65 |
不用加减乘除做加法 |
C++ |
Easy |
| 剑指 Offer 60 |
n个骰子的点数 |
C++ |
Medium |
| 剑指 Offer 57 |
I. 翻转单词顺序 |
C++ |
Easy |
| 剑指 Offer 57 |
II. 和为s的连续正数序列 |
C++ |
Easy |
| 剑指 Offer 57 |
和为s的两个数字 |
C++ |
Easy |
| 剑指 Offer 56 |
II. 数组中数字出现的次数 II |
C++ |
Medium |
| 剑指 Offer 56 |
I. 数组中数字出现的次数 |
C++ |
Medium |
| 剑指 Offer 55 |
II. 平衡二叉树 |
C++ |
Easy |
| 剑指 Offer 55 |
I. 二叉树的深度 |
C++ |
Easy |
| 剑指 Offer 54 |
二叉搜索树的第k大节点 |
C++ |
Easy |
| 剑指 Offer 53 |
II. 0～n-1中缺失的数字 |
C++ |
Easy |
| 剑指 Offer 53 |
I. 在排序数组中查找数字 I |
C++ |
Easy |
| 剑指 Offer 52 |
两个链表的第一个公共节点 |
C++ |
Easy |
| 剑指 Offer 51 |
数组中的逆序对 |
C++ |
Hard |
| 剑指 Offer 50 |
第一个只出现一次的字符 |
C++ |
Easy |
| 剑指 Offer 49 |
丑数 |
C++ |
Medium |
| 剑指 Offer 48 |
最长不含重复字符的子字符串 |
C++ |
Medium |
| 剑指 Offer 47 |
礼物的最大价值 |
C++ |
Medium |
| 剑指 Offer 46 |
把数字翻译成字符串 |
C++ |
Medium |
| 剑指 Offer 45 |
把数组排成最小的数 |
C++ |
Medium |
| 剑指 Offer 44 |
数字序列中某一位的数字 |
C++ |
Medium |
| 剑指 Offer 43 |
1～n 整数中 1 出现的次数 |
C++ |
Hard |
| 剑指 Offer 42 |
连续子数组的最大和 |
C++ |
Easy |
| 剑指 Offer 41 |
数据流中的中位数 |
C++ |
Hard |
| 剑指 Offer 40 |
最小的k个数 LCOF |
C++ |
Easy |
| 剑指 Offer 39 |
数组中出现次数超过一半的数字 |
C++ |
Easy |
| 剑指 Offer 38 |
字符串的排列 |
C++ |
Medium |
| 剑指 Offer 36 |
二叉搜索树与双向链表 |
C++ |
Medium |
| 剑指 Offer 34 |
二叉树中和为某一值的路径 |
C++ |
Medium |
| 剑指 Offer 06 |
从尾到头打印链表 |
C++ |
Easy |
| 剑指 Offer 05 |
替换空格 |
C++ |
Easy |
| 剑指 Offer 04 |
二维数组中的查找 |
C++ |
Medium |
| 剑指 Offer 03 |
数组中重复的数字 |
C++ |
Easy |
| bytedance-006 |
夏季特惠 |
C++ |
Easy |
| LCR 132 |
砍竹子 II |
C++ |
Medium |
| LCR 119 |
最长连续序列 |
C++ |
Medium |
| LCR 118 |
冗余连接 |
C++ |
Medium |
| LCR 117 |
相似字符串组 |
C++ |
Hard |
| LCR 116 |
省份数量 |
C++ |
Medium |
| LCR 115 |
序列重建 |
C++ |
Medium |
| LCR 114 |
火星词典 |
C++ |
Hard |
| LCR 113 |
课程表 II |
C++ |
Medium |
| LCR 112 |
矩阵中的最长递增路径 |
C++ |
Hard |
| LCR 111 |
除法求值 |
C++ |
Medium |
| LCR 110 |
所有可能的路径 |
C++ |
Medium |
| LCR 109 |
打开转盘锁 |
C++ |
Medium |
| LCR 108 |
单词接龙 |
C++ |
Hard |
| LCR 107 |
01 矩阵 |
C++ |
Medium |
| LCR 106 |
判断二分图 |
C++ |
Medium |
| LCR 105 |
岛屿的最大面积 |
C++ |
Medium |
| LCR 104 |
组合总和 Ⅳ |
C++ |
Medium |
| LCR 103 |
零钱兑换 |
C++ |
Medium |
| LCR 102 |
目标和 |
C++ |
Medium |
| LCR 101 |
分割等和子集 |
C++ |
Easy |
| LCR 100 |
三角形最小路径和 |
C++ |
Medium |
| LCR 099 |
最小路径和 |
C++ |
Medium |
| LCR 098 |
不同路径 |
C++ |
Medium |
| LCR 097 |
不同的子序列 |
C++ |
Hard |
| LCR 096 |
交错字符串 |
C++ |
Medium |
| LCR 095 |
最长公共子序列 |
C++ |
Medium |
| LCR 094 |
分割回文串 II |
C++ |
Hard |
| LCR 093 |
最长的斐波那契子序列的长度 |
C++ |
Medium |
| LCP 74 |
最强祝福力场 |
C++ |
Medium |
| LCP 61 |
气温变化趋势 |
C++ |
Easy |
| LCP 41 |
黑白翻转棋 |
C++ |
Medium |
| LCP 35 |
电动车游城市 |
C++ |
Hard |
| LCP 30 |
魔塔游戏 |
C++ |
Medium |
| LCP 10 |
二叉树任务调度 |
C++ |
Hard |
| LCP 09 |
最小跳跃次数 |
C++ |
Hard |
| LCP 08 |
剧情触发时间 |
C++ |
Medium |
| LCP 07 |
传递信息 |
C++ |
Easy |
| LCP 06 |
拿硬币 |
C++ |
Easy |
| LCP 04 |
Broken Board Dominoes |
C++ |
Hard |
| LCP 03 |
Programmable Robot |
C++ |
Medium |
| LCP 02 |
Deep Dark Fraction |
C++ |
Easy |
| LCP 01 |
Guess Numbers |
C++ |
Easy |
| 17.25 |
Word Rectangle LCCI |
C++ |
Hard |
| 17.24 |
Max Submatrix LCCI |
C++ |
Hard |
| 17.23 |
Max Black Square LCCI |
C++ |
Medium |
| 17.22 |
Word Transformer LCCI |
C++ |
Medium |
| 17.21 |
Volume of Histogram LCCI |
C++ |
Hard |
| 17.20 |
Continuous Median LCCI |
C++ |
Hard |
| 17.19 |
Missing Two LCCI |
C++ |
Hard |
| 17.18 |
Shortest Supersequence LCCI |
C++ |
Medium |
| 17.16 |
The Masseuse LCCI |
C++ |
Easy |
| 17.15 |
Longest Word LCCI |
C++ |
Medium |
| 17.14 |
Smallest K LCCI |
C++ |
Medium |
| 17.13 |
Re-Space LCCI |
C++ |
Medium |
| 17.12 |
BiNode |
C++ |
Easy |
| 17.11 |
Find Closest LCCI |
C++ |
Medium |
| 17.10 |
Find Majority Element LCCI |
C++ |
Easy |
| 17.09 |
Get Kth Magic Number LCCI |
C++ |
Medium |
| 17.08 |
Circus Tower LCCI |
C++ |
Medium |
| 17.07 |
Baby Names LCCI |
C++ |
Medium |
| 17.06 |
Number Of 2s In Range LCCI |
C++ |
Hard |
| 17.05 |
Find Longest Subarray LCCI |
C++ |
Medium |
| 17.04 |
Missing Number LCCI |
C++ |
Easy |
| 17.01 |
Add Without Plus LCCI |
C++ |
Easy |
| 16.26 |
Calculator LCCI |
C++ |
Medium |
| 16.25 |
LRU Cache LCCI |
C++ |
Medium |
| 16.24 |
Pairs With Sum LCCI |
C++ |
Medium |
| 16.22 |
Langtons Ant LCCI |
C++ |
Medium |
| 16.21 |
Sum Swap LCCI |
C++ |
Medium |
| 16.20 |
T9 LCCI |
C++ |
Medium |
| 16.19 |
Pond Sizes LCCI |
C++ |
Medium |
| 16.18 |
Pattern Matching LCCI |
C++ |
Medium |
| 16.17 |
Contiguous Sequence LCCI |
C++ |
Easy |
| 16.16 |
Sub Sort LCCI |
C++ |
Medium |
| 16.15 |
Master Mind LCCI |
C++ |
Easy |
| 16.14 |
Best Line LCCI |
C++ |
Medium |
| 16.13 |
Bisect Squares LCCI |
C++ |
Medium |
| 16.11 |
Diving Board LCCI |
C++ |
Easy |
| 16.10 |
Living People LCCI |
C++ |
Medium |
| 16.09 |
Operations LCCI |
C++ |
Medium |
| 16.08 |
English Int LCCI |
C++ |
Hard |
| 16.07 |
Maximum LCCI |
C++ |
Medium |
| 16.06 |
Smallest Difference LCCI |
C++ |
Medium |
| 16.05 |
Factorial Zeros LCCI |
C++ |
Easy |
| 16.04 |
Tic-Tac-Toe LCCI |
C++ |
Medium |
| 16.03 |
Intersection LCCI |
C++ |
Hard |
| 16.02 |
Words Frequency LCCI |
C++ |
Medium |
| 16.01 |
Swap Numbers LCCI |
C++ |
Medium |
| 10.11 |
Peaks and Valleys LCCI |
C++ |
Medium |
| 10.10 |
Rank from Stream LCCI |
C++ |
Medium |
| 10.09 |
Sorted Matrix Search LCCI |
C++ |
Medium |
| 10.04 |
Sparse Array Search LCCI |
C++ |
Easy |
| 10.03 |
Search Rotate Array LCCI |
C++ |
Medium |
| 10.02 |
Group Anagrams LCCI |
C++ |
Medium |
| 10.01 |
Sorted Merge LCCI |
C++ |
Easy |
| 08.14 |
Boolean Evaluation LCCI |
C++ |
Medium |
| 08.13 |
Pile Box LCCI |
C++ |
Hard |
| 08.12 |
Eight Queens LCCI |
C++ |
Hard |
| 08.11 |
Coin LCCI |
C++ |
Medium |
| 08.10 |
Color Fill LCCI |
C++ |
Easy |
| 08.09 |
Bracket LCCI |
C++ |
Medium |
| 08.08 |
Permutation II LCCI |
C++ |
Medium |
| 08.07 |
Permutation I LCCI |
C++ |
Medium |
| 08.06 |
Hanota LCCI |
C++ |
Medium |
| 08.05 |
Recursive Mulitply LCCI |
C++ |
Medium |
| 08.04 |
Power Set LCCI |
C++ |
Medium |
| 08.03 |
Magic Index LCCI |
C++ |
Easy |
| 08.02 |
Robot in a Grid LCCI |
C++ |
Medium |
| 08.01 |
Three Steps Problem LCCI |
C++ |
Easy |
| 05.08 |
Draw Line LCCI |
C++ |
Medium |
| 05.07 |
Exchange LCCI |
C++ |
Easy |
| 05.06 |
Convert Integer LCCI |
C++ |
Easy |
| 05.04 |
Closed Number LCCI |
C++ |
Medium |
| 05.03 |
Reverse Bits LCCI |
C++ |
Easy |
| 05.02 |
Binary Number to String LCCI |
C++ |
Medium |
| 05.01 |
Insert Into Bits LCCI |
C++ |
Easy |
| 04.12 |
Paths with Sum LCCI |
C++ |
Medium |
| 04.10 |
Check SubTree LCCI |
C++ |
Medium |
| 04.09 |
BST Sequences LCCI |
C++ |
Hard |
| 04.08 |
First Common Ancestor LCCI |
C++ |
Medium |
| 04.06 |
Successor LCCI |
C++ |
Medium |
| 04.05 |
Legal Binary Search Tree LCCI |
C++ |
Medium |
| 02.02 |
Kth Node From End of List LCCI |
C++ |
Easy |
| 02.01 |
Remove Duplicate Node LCCI |
C++ |
Easy |
| 01.09 |
String Rotation LCCI |
C++ |
Easy |
| 01.08 |
Zero Matrix LCCI |
C++ |
Medium |
| 01.02 |
Check Permutation LCCI |
C++ |
Easy |
| 3607 |
Power Grid Maintenance |
C++ |
Medium |
| 3542 |
Minimum Operations to Convert All Elements to Zero |
C++ |
Medium |
| 3516 |
Find Closest Person |
C++ |
Easy |
| 3512 |
Minimum Operations to Make Array Sum Divisible by K |
C++ |
Easy |
| 3321 |
Find X-Sum of All K-Long Subarrays II |
C++ |
Hard |
| 3318 |
Find X-Sum of All K-Long Subarrays I |
C++ |
Easy |
| 3259 |
Maximum Energy Boost From Two Drinks |
C++ |
Medium |
| 3234 |
Count the Number of Substrings With Dominant Ones |
C++ |
Medium |
| 3228 |
Maximum Number of Operations to Move Ones to the End |
C++ |
Medium |
| 3226 |
Number of Bit Changes to Make Two Integers Equal |
C++ |
Easy |
| 3217 |
Delete Nodes From Linked List Present in Array |
C++ |
Medium |
| 3195 |
Find the Minimum Area to Cover All Ones I |
C++ |
Medium |
| 3191 |
Minimum Operations to Make Binary Array Elements Equal to One I |
C++ |
Medium |
| 3190 |
Find Minimum Operations to Make All Elements Divisible by Three |
C++ |
Easy |
| 3185 |
Count Pairs That Form a Complete Day II |
C++ |
Medium |
| 3184 |
Count Pairs That Form a Complete Day I |
C++ |
Easy |
| 3175 |
Find The First Player to win K Games in a Row |
C++ |
Medium |
| 3172 |
Find Subarray With Bitwise OR Closest to K |
C++ |
Hard |
| 3164 |
Find the Number of Good Pairs II |
C++ |
Medium |
| 3162 |
Find the Number of Good Pairs I |
C++ |
Easy |
| 3154 |
Find Number of Ways to Reach the K-th Stair |
C++ |
Medium |
| 3153 |
Sum of Digit Differences of All Pairs |
C++ |
Medium |
| 3152 |
Special Array II |
C++ |
Medium |
| 3151 |
Special Array I |
C++ |
Easy |
| 3148 |
Maximum Difference Score in a Grid |
C++ |
Medium |
| 3145 |
Maximum Difference Score in a Grid |
C++ |
Hard |
| 3144 |
Minimum Substring Partition of Equal Character Frequency |
C++ |
Medium |
| 3142 |
Check if Grid Satisfies Conditions |
C++ |
Easy |
| 3134 |
Find the Median of the Uniqueness Array |
C++ |
Hard |
| 3131 |
Find the Integer Added to Array I |
C++ |
Easy |
| 3117 |
Minimum Sum of Values by Dividing Array |
C++ |
Hard |
| 3115 |
Maximum Prime Difference |
C++ |
Medium |
| 3112 |
Minimum Time to Visit Disappearing Nodes |
C++ |
Medium |
| 3099 |
Harshad Number |
C++ |
Easy |
| 3098 |
Find the Sum of Subsequence Powers |
C++ |
Hard |
| 3027 |
Find the Number of Ways to Place People II |
C++ |
Hard |
| 3007 |
Maximum Number That Sum of the Prices Is Less Than or Equal to K |
C++ |
Medium |
| 2974 |
Minimum Number Game |
C++ |
Easy |
| 2970 |
Count the Number of Incremovable Subarrays I |
C++ |
Easy |
| 2961 |
Double Modular Exponentiation |
C++ |
Medium |
| 2960 |
Count Tested Devices After Test Operations |
C++ |
Easy |
| 2959 |
Number of Possible Sets of Closing Branches |
C++ |
Hard |
| 2951 |
Find the Peaks |
C++ |
Easy |
| 2926 |
Maximum Balanced Subsequence Sum |
C++ |
Hard |
| 2923 |
Find Champion I |
C++ |
Easy |
| 2917 |
Find the K-or of an Array |
C++ |
Easy |
| 2867 |
Count Valid Paths in a Tree |
C++ |
Hard |
| 2864 |
Maximum Odd Binary Number |
C++ |
Easy |
| 2846 |
Minimum Edge Weight Equilibrium Queries in a Tree |
C++ |
Hard |
| 2836 |
Maximize Value of Function in a Ball Passing Game |
C++ |
Hard |
| 2834 |
Find the Minimum Possible Sum of a Beautiful Array |
C++ |
Medium |
| 2828 |
Check if a String Is an Acronym of Words |
C++ |
Easy |
| 2824 |
Count Pairs Whose Sum is Less than Target |
C++ |
Easy |
| 2813 |
Maximum Elegance of a K-Length Subsequence |
C++ |
Hard |
| 2810 |
Faulty Keyboard |
C++ |
Easy |
| 2806 |
Account Balance After Rounded Purchase |
C++ |
Easy |
| 2789 |
Largest Element in an Array after Merge |
C++ |
Hard |
| 2786 |
Visit Array Positions to Maximize Score |
C++ |
Medium |
| 2769 |
Find the Maximum Achievable Number |
C++ |
Easy |
| 2766 |
Relocate Marbles |
C++ |
Medium |
| 2765 |
Longest Alternating Subarray |
C++ |
Easy |
| 2749 |
Minimum Operations to Make the Integer Zero |
C++ |
Medium |
| 2748 |
Number of Beautiful Pairs |
C++ |
Easy |
| 2742 |
Painting the Walls |
C++ |
Hard |
| 2734 |
Lexicographically Smallest String After Substring Operation |
C++ |
Medium |
| 2719 |
Count of Integers |
C++ |
Hard |
| 2713 |
Maximum Strictly Increasing Cells in a Matrix |
C++ |
Hard |
| 2698 |
Find the Punishment Number of an Integer |
C++ |
Medium |
| 2681 |
Power of Heroes |
C++ |
Hard |
| 2679 |
Sum in a Matrix |
C++ |
Medium |
| 2674 |
Frequency Tracker |
C++ |
Medium |
| 2673 |
Make Costs of Paths Equal in a Binary Tree |
C++ |
Medium |
| 2661 |
First Completely Painted Row or Column |
C++ |
Medium |
| 2654 |
Minimum Number of Operations to Make All Array Elements Equal to 1 |
C++ |
Medium |
| 2651 |
Calculate Delayed Arrival Time |
C++ |
Easy |
| 2646 |
Minimize the Total Price of the Trips |
C++ |
Hard |
| 2641 |
Cousins in Binary Tree II |
C++ |
Medium |
| 2639 |
Find the Width of Columns of a Grid |
C++ |
Easy |
| 2611 |
Mice and Cheese |
C++ |
Medium |
| 2609 |
Find the Longest Balanced Substring of a Binary String |
C++ |
Easy |
| 2605 |
Form Smallest Number From Two Digit Arrays |
C++ |
Easy |
| 2603 |
Collect Coins in a Tree |
C++ |
Hard |
| 2600 |
K Items With the Maximum Sum |
C++ |
Easy |
| 2596 |
Check Knight Tour Configuration |
C++ |
Medium |
| 2591 |
Distribute Money to Maximum Children |
C++ |
Easy |
| 2594 |
Minimum Time to Repair Cars |
C++ |
Medium |
| 2586 |
Count the Number of Vowel Strings in Range |
C++ |
Easy |
| 2583 |
Kth Largest Sum in a Binary Tree |
C++ |
Medium |
| 2578 |
Split With Minimum Sum |
C++ |
Easy |
| 2575 |
Find the Divisibility Array of a String |
C++ |
Medium |
| 2569 |
Handling Sum Queries After Update |
C++ |
Hard |
| 2562 |
Find the Array Concatenation Value |
C++ |
Easy |
| 2560 |
House Robber IV |
C++ |
Medium |
| 2559 |
Count Vowel Strings in Ranges |
C++ |
Medium |
| 2551 |
Put Marbles in Bags |
C++ |
Hard |
| 2544 |
Alternating Digit Sum |
C++ |
Easy |
| 2536 |
Increment Submatrices by One |
C++ |
Medium |
| 2532 |
Time to Cross a Bridge |
C++ |
Hard |
| 2530 |
Maximal Score After Applying K Operations |
C++ |
Medium |
| 2529 |
Maximum Count of Positive Integer and Negative Integer |
C++ |
Easy |
| 2520 |
Count the Digits That Divide a Number |
C++ |
Easy |
| 2517 |
Maximum Tastiness of Candy Basket |
C++ |
Medium |
| 2512 |
Reward Top K Students |
C++ |
Medium |
| 2500 |
Delete Greatest Value in Each Row |
C++ |
Easy |
| 2496 |
Maximum Value of a String in an Array |
C++ |
Easy |
| 2490 |
Circular Sentence |
C++ |
Easy |
| 2485 |
Find the Pivot Integer |
C++ |
Easy |
| 2481 |
Minimum Cuts to Divide a Circle |
C++ |
Easy |
| 2477 |
Minimum Fuel Cost to Report to the Capital |
C++ |
Medium |
| 2476 |
Closest Nodes Queries in a Binary Search Tree |
C++ |
Medium |
| 2475 |
Number of Unequal Triplets in Array |
C++ |
Easy |
| 2472 |
Maximum Number of Non-overlapping Palindrome Substrings |
C++ |
Hard |
| 2465 |
Number of Distinct Averages |
C++ |
Easy |
| 2463 |
Minimum Total Distance Traveled |
C++ |
Hard |
| 2460 |
Apply Operations to an Array |
C++ |
Easy |
| 2458 |
Height of Binary Tree After Subtree Removal Queries |
C++ |
Hard |
| 2455 |
Average Value of Even Numbers That Are Divisible by Three |
C++ |
Easy |
| 2451 |
Odd String Difference |
C++ |
Easy |
| 2449 |
Minimum Number of Operations to Make Arrays Similar |
C++ |
Hard |
| 2437 |
Number of Valid Clock Times |
C++ |
Easy |
| 2435 |
Paths in Matrix Whose Sum Is Divisible by K |
C++ |
Hard |
| 2421 |
Number of Good Paths |
C++ |
Hard |
| 2418 |
Sort the People |
C++ |
Easy |
| 2409 |
Count Days Spent Together |
C++ |
Easy |
| 2404 |
Most Frequent Even Element |
C++ |
Easy |
| 2384 |
Largest Palindromic Number |
C++ |
Medium |
| 2373 |
Largest Local Values in a Matrix |
C++ |
Easy |
| 2370 |
Longest Ideal Subsequence |
C++ |
Medium |
| 2369 |
Check if There is a Valid Partition For The Array |
C++ |
Medium |
| 2367 |
Count Special Integers |
C++ |
Hard |
| 2363 |
Merge Similar Items |
C++ |
Easy |
| 2352 |
Equal Row and Column Pairs |
C++ |
Medium |
| 2341 |
Maximum Number of Pairs in Array |
C++ |
Easy |
| 2336 |
Smallest Number in Infinite Set |
C++ |
Medium |
| 2331 |
Evaluate Boolean Binary Tree |
C++ |
Easy |
| 2325 |
Decode the Message |
C++ |
Easy |
| 2322 |
Minimum Score After Removals on a Tree |
C++ |
Hard |
| 2319 |
Check if Matrix Is X-Matrix |
C++ |
Easy |
| 2312 |
Selling Pieces of Wood |
C++ |
Hard |
| 2304 |
Minimum Path Cost in a Grid |
C++ |
Medium |
| 2300 |
Successful Pairs of Spells and Potions |
C++ |
Medium |
| 2288 |
Apply Discount to Prices |
C++ |
Medium |
| 2281 |
Sum of Total Strength of Wizards |
C++ |
Hard |
| 2280 |
Minimum Index of a Valid Split |
C++ |
Medium |
| 2276 |
Count Integers in Intervals |
C++ |
Hard |
| 2258 |
Number of Flowers in Full Bloom |
C++ |
Hard |
| 2257 |
Count Unguarded Cells in the Grid |
C++ |
Medium |
| 2251 |
Number of Flowers in Full Bloom |
C++ |
Hard |
| 2246 |
Longest Path With Different Adjacent Characters |
C++ |
Hard |
| 2244 |
Minimum Rounds to Complete All Tasks |
C++ |
Medium |
| 2240 |
Number of Ways to Buy Pens and Pencils |
C++ |
Medium |
| 2218 |
Maximum Value of K Coins From Piles |
C++ |
Hard |
| 2209 |
Minimum Obstacle Removal to Reach Corner |
C++ |
Hard |
| 2208 |
Minimum Operations to Halve Array Sum |
C++ |
Medium |
| 2200 |
Find All K-Distant Indices in an Array |
C++ |
Easy |
| 2193 |
Minimum Number of Moves to Make Palindrome |
C++ |
Hard |
| 2180 |
Count Integers With Even Digit Sum |
C++ |
Easy |
| 2178 |
Maximum Split of Positive Even Integers |
C++ |
Medium |
| 2169 |
Count Operations to Obtain Zero |
C++ |
Easy |
| 2168 |
Unique Substrings With Equal Digit Frequency |
C++ |
Medium |
| 2166 |
Design Bitset |
C++ |
Medium |
| 2154 |
Keep Multiplying Found Values by Two |
C++ |
Easy |
| 2141 |
Maximum Running Time of N Computers |
C++ |
Hard |
| 2138 |
Divide a String Into Groups of Size k |
C++ |
Easy |
| 2136 |
Earliest Possible Day of Full Bloom |
C++ |
Medium |
| 2132 |
Stamping the Grid |
C++ |
Hard |
| 2129 |
Capitalize the Title |
C++ |
Easy |
| 2127 |
Maximum Employees to Be Invited to a Meeting |
C++ |
Hard |
| 2111 |
Minimum Operations to Make the Array K-Increasing |
C++ |
Hard |
| 2106 |
Maximum Fruits Harvested After at Most K Steps |
C++ |
Hard |
| 2105 |
Watering Plants II |
C++ |
Medium |
| 2092 |
Find All People With Secret |
C++ |
Hard |
| 2081 |
Sum of k-Mirror Numbers |
C++ |
Hard |
| 2079 |
Watering Plants |
C++ |
Medium |
| 2071 |
Maximum Number of Tasks You Can Assign |
C++ |
Hard |
| 2065 |
Maximum Path Quality of a Graph |
C++ |
Hard |
| 2050 |
Parallel Courses III |
C++ |
Hard |
| 2042 |
Check if Numbers Are Ascending in a Sentence |
C++ |
Easy |
| 2034 |
Stock Price Fluctuation |
C++ |
Medium |
| 2016 |
Maximum Difference Between Increasing Elements |
C++ |
Easy |
| 2011 |
Final Value of Variable After Performing Operations |
C++ |
Easy |
| 2009 |
Minimum Number of Operations to Make Array Continuous |
C++ |
Hard |
| 2008 |
Maximum Earnings From Taxi |
C++ |
Medium |
| 2007 |
Find Original Array From Doubled Array |
C++ |
Medium |
| 1994 |
The Number of Good Subsets |
C++ |
Hard |
| 1979 |
Find Greatest Common Divisor of Array |
C++ |
Easy |
| 1971 |
Find if Path Exists in Graph |
C++ |
Easy |
| 1945 |
Sum of Digits of String After Convert |
C++ |
Easy |
| 1931 |
Painting a Grid With Three Different Colors |
C++ |
Hard |
| 1921 |
Eliminate Maximum Number of Monsters |
C++ |
Medium |
| 1911 |
Maximum Alternating Subsequence Sum |
C++ |
Medium |
| 1910 |
Remove All Occurrences of a Substring |
C++ |
Medium |
| 1851 |
Minimum Interval to Include Each Query |
C++ |
Hard |
| 1832 |
Check if the Sentence Is Pangram |
C++ |
Easy |
| 1827 |
Minimum Operations to Make the Array Increasing |
C++ |
Easy |
| 1822 |
Sign of the Product of an Array |
C++ |
Easy |
| 1812 |
Determine Color of a Chessboard Square |
C++ |
Easy |
| 1802 |
Maximum Value at a Given Index in a Bounded Array |
C++ |
Medium |
| 1805 |
Number of Different Integers in a String |
C++ |
Easy |
| 1799 |
Maximize Score After N Operations |
C++ |
Hard |
| 1798 |
Maximum Number of Consecutive Values You Can Make |
C++ |
Medium |
| 1797 |
Design Authentication Manager |
C++ |
Medium |
| 1796 |
Second Largest Digit in a String |
C++ |
Easy |
| 1793 |
Maximum Score of a Good Subarray |
C++ |
Hard |
| 1792 |
Maximum Average Pass Ratio |
C++ |
Medium |
| 1790 |
Check if One String Swap Can Make Strings Equal |
C++ |
Easy |
| 1785 |
Minimum Elements to Add to Form a Given Sum |
C++ |
Medium |
| 1784 |
Check if Binary String Has at Most One Segment of Ones |
C++ |
Easy |
| 1781 |
Sum of Beauty of All Substrings |
C++ |
Medium |
| 1780 |
Check if Number is a Sum of Powers of Three |
C++ |
Medium |
| 1779 |
Find Nearest Point That Has the Same X or Y Coordinate |
C++ |
Easy |
| 1775 |
Equal Sum Arrays With Minimum Number of Operations |
C++ |
Medium |
| 1774 |
Closest Dessert Cost |
C++ |
Medium |
| 1773 |
Count Items Matching a Rule |
C++ |
Easy |
| 1769 |
Minimum Number of Operations to Move All Balls to Each Box |
C++ |
Medium |
| 1768 |
Merge Strings Alternately |
C++ |
Easy |
| 1764 |
Form Array by Concatenating Subarrays of Another Array |
C++ |
Medium |
| 1762 |
Tuple with Same Product |
C++ |
Medium |
| 1761 |
Minimum Degree of a Connected Trio in a Graph |
C++ |
Hard |
| 1760 |
Minimum Limit of Balls in a Bag |
C++ |
Medium |
| 1758 |
Minimum Changes To Make Alternating Binary String |
C++ |
Easy |
| 1755 |
Closest Subsequence Sum |
C++ |
Hard |
| 1753 |
Maximum Score From Removing Stones |
C++ |
Medium |
| 1752 |
Check if Array Is Sorted and Rotated |
C++ |
Easy |
| 1751 |
Maximum Number of Events That Can Be Attended II |
C++ |
Hard |
| 1749 |
Maximum Absolute Sum of Any Subarray |
C++ |
Medium |
| 1742 |
Maximum Number of Balls in a Box |
C++ |
Easy |
| 1732 |
Find the Highest Altitude |
C++ |
Easy |
| 1710 |
Maximum Units on a Truck |
C++ |
Easy |
| 1704 |
Determine if String Halves Are Alike |
C++ |
Easy |
| 1703 |
Minimum Adjacent Swaps for K Consecutive Ones |
C++ |
Hard |
| 1702 |
Maximum Binary String After Change |
C++ |
Medium |
| 1700 |
Number of Students Unable to Eat Lunch |
C++ |
Easy |
| 1697 |
Checking Existence of Edge Length Limited Paths |
C++ |
Hard |
| 1696 |
Jump Game VI |
C++ |
Medium |
| 1694 |
Reformat Phone Number |
C++ |
Easy |
| 1690 |
Stone Game VII |
C++ |
Medium |
| 1687 |
Delivering Boxes from Storage to Ports |
C++ |
Hard |
| 1686 |
Stone Game VI |
C++ |
Medium |
| 1684 |
Count the Number of Consistent Strings |
C++ |
Easy |
| 1678 |
Goal Parser Interpretation |
C++ |
Easy |
| 1675 |
Minimize Deviation in Array |
C++ |
Easy |
| 1669 |
Merge In Between Linked Lists |
C++ |
Medium |
| 1668 |
Maximum Repeating Substring |
C++ |
Easy |
| 1662 |
Check If Two String Arrays are Equivalent |
C++ |
Easy |
| 1659 |
Maximize Grid Happiness |
C++ |
Hard |
| 1657 |
Determine if Two Strings Are Close |
C++ |
Medium |
| 1656 |
Design an Ordered Stream |
C++ |
Easy |
| 1655 |
Distribute Repeating Integers |
C++ |
Hard |
| 1654 |
Minimum Jumps to Reach Home |
C++ |
Medium |
| 1652 |
Defuse the Bomb |
C++ |
Easy |
| 1641 |
Count Sorted Vowel Strings |
C++ |
Medium |
| 1638 |
Count Substrings That Differ by One Character |
C++ |
Medium |
| 1637 |
Widest Vertical Area Between Two Points Containing No Points |
C++ |
Medium |
| 1636 |
Sort Array by Increasing Frequency |
C++ |
Easy |
| 1631 |
Path With Minimum Effort |
C++ |
Medium |
| 1630 |
Arithmetic Subarrays |
C++ |
Medium |
| 1624 |
Largest Substring Between Two Equal Characters |
C++ |
Easy |
| 1620 |
Coordinate With Maximum Network Quality |
C++ |
Medium |
| 1619 |
Mean of Array After Removing Some Elements |
C++ |
Easy |
| 1615 |
Maximal Network Rank |
C++ |
Medium |
| 1604 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
C++ |
Medium |
| 1595 |
Minimum Cost to Connect Two Groups of Points |
C++ |
Hard |
| 1592 |
Rearrange Spaces Between Words |
C++ |
Easy |
| 1590 |
Make Sum Divisible by P |
C++ |
Medium |
| 1582 |
Special Positions in a Binary Matrix |
C++ |
Easy |
| 1578 |
Minimum Time to Make Rope Colorful |
C++ |
Medium |
| 1574 |
Shortest Subarray to be Removed to Make Array Sorted |
C++ |
Medium |
| 1553 |
Minimum Number of Days to Eat N Oranges |
C++ |
Hard |
| 1552 |
Magnetic Force Between Two Balls |
C++ |
Medium |
| 1547 |
Minimum Cost to Cut a Stick |
C++ |
Hard |
| 1521 |
Find a Value of a Mysterious Function Closest to Target |
C++ |
Hard |
| 1513 |
Number of Substrings With Only 1s |
C++ |
Median |
| 1504 |
Count Submatrices With All Ones |
C++ |
Medium |
| 1499 |
Max Value of Equation |
C++ |
Hard |
| 1494 |
Parallel Courses II |
C++ |
Hard |
| 1483 |
Kth Ancestor of a Tree Node |
C++ |
Hard |
| 1475 |
Final Prices With a Special Discount in a Shop |
C++ |
Easy |
| 1473 |
Paint House III |
C++ |
Hard |
| 1470 |
Shuffle the Array |
C++ |
Easy |
| 1466 |
Reorder Routes to Make All Paths Lead to the City Zero |
C++ |
Medium |
| 1465 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
C++ |
Message |
| 1464 |
Maximum Product of Two Elements in an Array |
C++ |
Easy |
| 1463 |
Cherry Pickup II |
C++ |
Hard |
| 1462 |
Course Schedule IV |
C++ |
Medium |
| 1460 |
Make Two Arrays Equal by Reversing Sub-arrays |
C++ |
Easy |
| 1455 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
C++ |
Easy |
| 1450 |
Number of Students Doing Homework at a Given Time |
C++ |
Easy |
| 1441 |
Build an Array With Stack Operations |
C++ |
Medium |
| 1438 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
C++ |
Medium |
| 1437 |
Check If All 1's Are at Least Length K Places Away |
C++ |
Easy |
| 1436 |
Destination City |
C++ |
Easy |
| 1434 |
Number of Ways to Wear Different Hats to Each Other |
C++ |
Hard |
| 1432 |
Max Difference You Can Get From Changing an Integer |
C++ |
medium |
| 1422 |
Maximum Score After Splitting a String |
C++ |
Easy |
| 1417 |
Reformat The String |
C++ |
Easy |
| 1413 |
Minimum Value to Get Positive Step by Step Sum |
C++ |
Easy |
| 1410 |
HTML Entity Parser |
C++ |
Medium |
| 1401 |
Circle and Rectangle Overlapping |
C++ |
Medium |
| 1397 |
Find All Good Strings |
C++ |
Hard |
| 1377 |
Frog Position After T Seconds |
C++ |
Hard |
| 1375 |
Number of Times Binary String Is Prefix-Aligned |
C++ |
Medium |
| 1373 |
Maximum Sum BST in Binary Tree |
C++ |
Hard |
| 1371 |
Find the Longest Substring Containing Vowels in Even Counts |
C++ |
Medium |
| 1368 |
Minimum Cost to Make at Least One Valid Path in a Grid |
C++ |
Hard |
| 1367 |
Linked List in Binary Tree |
C++ |
Medium |
| 1353 |
Maximum Number of Events That Can Be Attended |
C++ |
Medium |
| 1333 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
C++ |
Medium |
| 1329 |
Sort the Matrix Diagonally |
C++ |
Medium |
| 1326 |
Minimum Number of Taps to Open to Water a Garden |
C++ |
Hard |
| 1312 |
Minimum Insertion Steps to Make a String Palindrome |
C++ |
Hard |
| 1302 |
Deepest Leaves Sum |
C++ |
Medium |
| 1282 |
Group the People Given the Group Size They Belong To |
C++ |
Medium |
| 1267 |
Count Servers that Communicate |
C++ |
Medium |
| 1262 |
Greatest Sum Divisible by Three |
C++ |
Medium |
| 1261 |
Find Elements in a Contaminated Binary Tree |
C++ |
Medium |
| 1254 |
Number of Closed Islands |
C++ |
Medium |
| 1253 |
Reconstruct a 2-Row Binary Matrix |
C++ |
Medium |
| 1250 |
Check If It Is a Good Array |
C++ |
Hard |
| 1238 |
Circular Permutation in Binary Representation |
C++ |
Medium |
| 1235 |
Maximum Profit in Job Scheduling |
C++ |
Hard |
| 1234 |
Replace the Substring for Balanced String |
C++ |
Medium |
| 1224 |
Maximum Equal Frequency |
C++ |
Hard |
| 1224 |
Dice Roll Simulation |
C++ |
Hard |
| 1222 |
Queens That Can Attack the King |
C++ |
Medium |
| 1220 |
Count Vowels Permutation |
C++ |
Hard |
| 1210 |
Minimum Moves to Reach Target with Rotations |
C++ |
Hard |
| 1204 |
Tiling a Rectangle with the Fewest Squares |
C++ |
Hard |
| 1187 |
Make Array Strictly Increasing |
C++ |
Hard |
| 1186 |
Maximum Subarray Sum with One Deletion |
C++ |
Medium |
| 1177 |
Can Make Palindrome from Substring |
C++ |
Medium |
| 1171 |
Remove Zero Sum Consecutive Nodes from Linked List |
C++ |
Medium |
| 1170 |
Compare Strings by Frequency of the Smallest Character |
C++ |
Medium |
| 1168 |
Optimize Water Distribution in a Village |
C++ |
Hard |
| 1167 |
Minimum Cost To Connect Sticks🔒 |
C++ |
Medium |
| 1163 |
Last Substring in Lexicographical Order |
C++ |
Hard |
| 1162 |
As Far from Land as Possible |
C++ |
Medium |
| 1157 |
Online Majority Element In Subarray |
C++ |
Hard |
| 1156 |
Swap For Longest Repeated Character Substring |
C++ |
Medium |
| 1155 |
Number of Dice Rolls With Target Sum |
C++ |
Medium |
| 1153 |
String Transforms Into Another String🔒 |
C++ |
Medium |
| 1147 |
Longest Chunked Palindrome Decomposition |
C++ |
Hard |
| 1146 |
Snapshot Array |
C++ |
Medium |
| 1145 |
Binary Tree Coloring Game |
C++ |
Medium |
| 1143 |
Longest Common Subsequence |
C++ |
Medium |
| 1141 |
Decrease Elements To Make Array Zigzag |
C++ |
Medium |
| 1140 |
Stone Game II |
C++ |
Medium |
| 1139 |
Largest 1-Bordered Square |
C++ |
Medium |
| 1137 |
N-th Tribonacci Number |
C++ |
Easy |
| 1129 |
Shortest Path with Alternating Colors |
C++ |
Medium |
| 1125 |
Smallest Sufficient Team |
C++ |
Hard |
| 1124 |
Longest Well-Performing Interval |
C++ |
Medium |
| 1123 |
Remove Sub-Folders from the Filesystem |
C++ |
Medium |
| 1122 |
Relative Sort Array |
C++ |
Easy |
| 1121 |
Divide Array Into Increasing Sequences🔒 |
C++ |
Medium |
| 1120 |
Count Vowels Permutation |
C++ |
Hard |
| 1109 |
Corporate Flight Bookings |
C++ |
Medium |
| 1106 |
Parsing A Boolean Expression |
C++ |
Hard |
| 1105 |
Filling Bookcase Shelves |
C++ |
Medium |
| 1092 |
Shortest Common Supersequence |
C++ |
Hard |
| 1090 |
Largest Values From Labels |
C++ |
Medium |
| 1080 |
Insufficient Nodes in Root to Leaf Paths |
C++ |
Medium |
| 1072 |
Flip Columns For Maximum Number of Equal Rows |
C++ |
Medium |
| 1067 |
Digit Count In Range |
C++ |
Hard |
| 1061 |
Lexicographically Smallest Equivalent String |
C++ |
Medium |
| 1053 |
Previous Permutation With One Swap |
C++ |
Medium |
| 1049 |
Last Stone Weight II |
C++ |
Medium |
| 1048 |
Longest String Chain |
C++ |
Medium |
| 1043 |
Partition Array for Maximum Sum |
C++ |
Medium |
| 1042 |
Flower Planting With No Adjacent |
C++ |
Medium |
| 1041 |
Robot Bounded In Circle |
C++ |
Medium |
| 1039 |
Minimum Score Triangulation of Polygon |
C++ |
Medium |
| 1038 |
Binary Search Tree to Greater Sum Tree |
C++ |
Medium |
| 1031 |
Maximum Sum of Two Non-Overlapping Subarrays |
C++ |
Medium |
| 1029 |
Two City Scheduling |
C++ |
Medium |
| 1028 |
Recover a Tree From Preorder Traversal |
C++ |
Hard |
| 1026 |
Maximum Difference Between Node and Ancestor |
C++ |
Medium |
| 1023 |
Camelcase Matching |
C++ |
Medium |
| 1019 |
Next Greater Node In Linked List |
C++ |
Medium |
| 1018 |
Binary Prefix Divisible By 5 |
C++ |
Easy |
| 1017 |
Convert to Base -2 |
C++ |
Medium |
| 1016 |
Binary String With Substrings Representing 1 To N |
C++ |
Medium |
| 1015 |
Smallest Integer Divisible by K |
C++ |
Medium |
| 1012 |
Numbers With Repeated Digits |
C++ |
Hard |
| 1003 |
Check If Word Is Valid After Substitutions |
C++ |
Medium |
| 1000 |
Minimum Cost to Merge Stones |
C++ |
Hard |
| 0998 |
Maximum Binary Tree II |
C++ |
Medium |
| 0993 |
Cousins in Binary Tree |
C++ |
Easy |
| 0992 |
Subarrays with K Different Integers |
C++ |
Hard |
| 0987 |
Vertical Order Traversal of a Binary Tree |
C++ |
Hard |
| 0983 |
Minimum Cost For Tickets |
C++ |
Medium |
| 0980 |
Unique Paths III |
C++ |
Hard |
| 0979 |
Distribute Coins in Binary Tree |
C++ |
Medium |
| 0975 |
Odd Even Jump |
C++ |
Hard |
| 0970 |
Powerful Integers |
C++ |
Medium |
| 0968 |
Binary Tree Cameras |
C++ |
Hard |
| 0964 |
Validate Stack Sequences |
C++ |
Medium |
| 0962 |
Maximum Width Ramp |
C++ |
Medium |
| 0958 |
Check Completeness of a Binary Tree |
C++ |
Medium |
| 0953 |
Verifying an Alien Dictionary |
C++ |
Easy |
| 0947 |
Most Stones Removed with Same Row or Column |
C++ |
Medium |
| 0940 |
Distinct Subsequences II |
C++ |
Hard |
| 0938 |
Range Sum of BST |
C++ |
Easy |
| 0936 |
Stamping The Sequence |
C++ |
Hard |
| 0934 |
Shortest Bridge |
C++ |
Medium |
| 0933 |
Number of Recent Calls |
C++ |
Easy |
| 0931 |
Minimum Falling Path Sum |
C++ |
Medium |
| 0928 |
Minimize Malware Spread II |
C++ |
Hard |
| 0927 |
Three Equal Parts |
C++ |
Hard |
| 0926 |
Flip String to Monotone Increasing |
C++ |
Medium |
| 0924 |
Minimize Malware Spread |
C++ |
Medium |
| 0922 |
Sort Array By Parity II |
C++ |
Easy |
| 0921 |
Minimum Add to Make Parentheses Valid |
C++ |
Medium |
| 0919 |
Complete Binary Tree Inserter |
C++ |
Medium |
| 0918 |
Maximum Sum Circular Subarray |
C++ |
Medium |
| 0912 |
Sort an Array |
C++ |
Medium |
| 0910 |
Smallest Range II |
C++ |
Medium |
| 0908 |
Smallest Range I |
C++ |
Easy |
| 0907 |
Sum of Subarray Minimums |
C++ |
Medium |
| 0906 |
Super Palindromes |
C++ |
Hard |
| 0904 |
Fruit Into Baskets |
C++ |
Medium |
| 0903 |
Valid Permutations for DI Sequence |
C++ |
Hard |
| 0902 |
Numbers At Most N Given Digit Set |
C++ |
Hard |
| 0901 |
Online Stock Span |
C++ |
Medium |
| 0897 |
Increasing Order Search Tree |
C++ |
Easy |
| 0895 |
Maximum Frequency Stack |
C++ |
Hard |
| 0891 |
Sum of Subsequence Widths |
C++ |
Hard |
| 0889 |
Construct Binary Tree from Preorder and Postorder Traversal |
C++ |
Medium |
| 0887 |
Super Egg Drop |
C++ |
Hard |
| 0886 |
Possible Bipartition |
C++ |
Medium |
| 0882 |
Reachable Nodes In Subdivided Graph |
C++ |
Hard |
| 0881 |
Boats to Save People |
C++ |
Medium |
| 0879 |
Profitable Schemes |
C++ |
Hard |
| 0878 |
Nth Magical Number |
C++ |
Hard |
| 0875 |
Koko Eating Bananas |
C++ |
Medium |
| 0874 |
Walking Robot Simulation |
C++ |
Medium |
| 0873 |
Length of Longest Fibonacci Subsequence |
C++ |
Medium |
| 0871 |
Minimum Number of Refueling Stops |
C++ |
Hard |
| 0870 |
Advantage Shuffle |
C++ |
Medium |
| 0864 |
Shortest Path to Get All Keys |
C++ |
Medium |
| 0862 |
Shortest Subarray with Sum at Least K |
C++ |
Hard |
| 0857 |
Minimum Cost to Hire K Workers |
C++ |
Hard |
| 0856 |
Score of Parentheses |
C++ |
Medium |
| 0854 |
K-Similar Strings |
C++ |
Hard |
| 0852 |
Peak Index in a Mountain Array |
C++ |
Medium |
| 0851 |
Loud and Rich |
C++ |
Medium |
| 0850 |
Rectangle Area II |
C++ |
Hard |
| 0839 |
Similar String Groups |
C++ |
Hard |
| 0828 |
Count Unique Characters of All Substrings of a Given String |
C++ |
Hard |
| 0827 |
Making A Large Island |
C++ |
Hard |
| 0823 |
Binary Trees With Factors |
C++ |
Medium |
| 0820 |
Short Encoding of Words |
C++ |
Medium |
| 0817 |
Linked List Components |
C++ |
Medium |
| 0816 |
Ambiguous Coordinates |
C++ |
Medium |
| 0814 |
Binary Tree Pruning |
C++ |
Medium |
| 0813 |
Largest Sum of Averages |
C++ |
Medium |
| 0811 |
Subdomain Visit Count |
C++ |
Medium |
| 0809 |
Expressive Words |
C++ |
Medium |
| 0808 |
Soup Servings |
C++ |
Medium |
| 0805 |
Split Array With Same Average |
C++ |
Hard |
| 0803 |
Bricks Falling When Hit |
C++ |
Hard |
| 0799 |
Champagne Tower |
C++ |
Medium |
| 0797 |
All Paths From Source to Target |
C++ |
Medium |
| 0793 |
Preimage Size of Factorial Zeroes Function |
C++ |
Hard |
| 0792 |
Number of Matching Subsequences |
C++ |
Medium |
| 0791 |
Custom Sort String |
C++ |
Medium |
| 0795 |
Number of Subarrays with Bounded Maximum |
C++ |
Medium |
| 0790 |
Domino and Tromino Tiling |
C++ |
Medium |
| 0788 |
Rotated Digits |
C++ |
Medium |
| 0787 |
Cheapest Flights Within K Stops |
C++ |
Medium |
| 0785 |
Is Graph Bipartite? |
C++ |
Medium |
| 0784 |
Letter Case Permutation |
C++ |
Medium |
| 0781 |
Rabbits in Forest |
C++ |
Medium |
| 0779 |
K-th Symbol in Grammar |
C++ |
Medium |
| 0778 |
Swim in Rising Water |
C++ |
Hard |
| 0777 |
Swap Adjacent in LR String |
C++ |
Medium |
| 0775 |
Global and Local Inversions |
C++ |
Medium |
| 0772 |
Basic Calculator III🔒 |
C++ |
Hard |
| 0765 |
Couples Holding Hands |
C++ |
Hard |
| 0764 |
Largest Plus Sign |
C++ |
Medium |
| 0763 |
Partition Labels |
C++ |
Medium |
| 0761 |
Special Binary String |
C++ |
Hard |
| 0757 |
Set Intersection Size At Least Two |
C++ |
Hard |
| 0754 |
Reach a Number |
C++ |
Medium |
| 0752 |
Open the Lock |
C++ |
Medium |
| 0746 |
Min Cost Climbing Stairs |
C++ |
Easy |
| 0743 |
Network Delay Time |
C++ |
Hard |
| 0741 |
Cherry Pickup |
C++ |
Hard |
| 0739 |
Daily Temperatures |
C++ |
Medium |
| 0735 |
Asteroid Collision |
C++ |
Medium |
| 0730 |
Count Different Palindromic Subsequences |
C++ |
Hard |
| 0729 |
My Calendar I |
C++ |
Medium |
| 0726 |
Number of Atoms |
C++ |
Hard |
| 0724 |
Find Pivot Index |
C++ |
Easy |
| 0722 |
Remove Comments |
C++ |
Medium |
| 0719 |
Find K-th Smallest Pair Distance |
C++ |
Hard |
| 0718 |
Maximum Length of Repeated Subarray |
C++ |
Medium |
| 0717 |
1-bit and 2-bit Characters |
C++ |
Easy |
| 0714 |
Best Time to Buy and Sell Stock with Transaction Fee |
C++ |
Medium |
| 0711 |
Jewels and Stones |
C++ |
Easy |
| 0708 |
Insert into a Sorted Circular Linked List |
C++ |
Medium |
| 0707 |
Design Linked List |
C++ |
Medium |
| 0706 |
Design HashMap |
C++ |
Easy |
| 0703 |
Kth Largest Element in a Stream |
C++ |
Easy |
| 0699 |
Falling Squares |
C++ |
Hard |
| 0698 |
Partition to K Equal Sum Subsets |
C++ |
Medium |
| 0695 |
Max Area of Island |
C++ |
Medium |
| 0691 |
Stickers to Spell Word |
C++ |
Hard |
| 0690 |
Employee Importance |
C++ |
Medium |
| 0689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
C++ |
Hard |
| 0688 |
Knight Probability in Chessboard |
C++ |
Medium |
| 0687 |
Longest Univalue Path |
C++ |
Medium |
| 0686 |
Repeated String Match |
C++ |
Medium |
| 0684 |
Redundant Connection |
C++ |
Medium |
| 0680 |
Valid Palindrome II |
C++ |
Easy |
| 0677 |
Map Sum Pairs |
C++ |
Medium |
| 0676 |
Implement Magic Dictionary |
C++ |
Medium |
| 0673 |
Number of Longest Increasing Subsequence |
C++ |
Medium |
| 0672 |
Bulb Switcher II |
C++ |
Medium |
| 0670 |
Maximum Swap |
C++ |
Medium |
| 0669 |
Trim a Binary Search Tree |
C++ |
Medium |
| 0664 |
Strange Printer |
C++ |
Hard |
| 0662 |
Maximum Width of Binary Tree |
C++ |
Medium |
| 0658 |
Find K Closest Elements |
C++ |
Medium |
| 0655 |
Print Binary Tree |
C++ |
Medium |
| 0654 |
Maximum Binary Tree |
C++ |
Medium |
| 0653 |
Two Sum IV - Input is a BST |
C++ |
Easy |
| 0652 |
Find Duplicate Subtrees |
C++ |
Medium |
| 0651 |
4 Keys Keyboard |
C++ |
Medium |
| 0648 |
Replace Words |
C++ |
Medium |
| 0647 |
Palindromic Substrings |
C++ |
Medium |
| 0646 |
Maximum Length of Pair Chain |
C++ |
Medium |
| 0641 |
Design Circular Deque |
C++ |
Medium |
| 0640 |
Solve the Equation |
C++ |
Medium |
| 0639 |
Decode Ways II |
C++ |
Hard |
| 0633 |
Sum of Square Numbers |
C++ |
Medium |
| 0632 |
Smallest Range Covering Elements from K Lists |
C++ |
Hard |
| 0630 |
Course Schedule III |
C++ |
Hard |
| 0629 |
K Inverse Pairs Array |
C++ |
Hard |
| 0621 |
Task Scheduler |
C++ |
Medium |
| 0617 |
Merge Two Binary Trees |
C++ |
Easy |
| 0605 |
Can Place Flowers |
C++ |
Easy |
| 0600 |
Non-negative Integers without Consecutive Ones |
C++ |
Hard |
| 0590 |
N-ary Tree Postorder Traversal |
C++ |
Easy |
| 0581 |
Shortest Unsorted Continuous Subarray |
C++ |
Medium |
| 0572 |
Subtree of Another Tree |
C++ |
Easy |
| 0567 |
Permutation in String |
C++ |
Medium |
| 0560 |
Subarray Sum Equals K |
C++ |
Medium |
| 0557 |
Reverse Words in a String III |
C++ |
Easy |
| 0552 |
Student Attendance Record II |
C++ |
Hard |
| 0551 |
Student Attendance Record I |
C++ |
Easy |
| 0547 |
Number of Provinces |
C++ |
Medium |
| 0546 |
Remove Boxes |
C++ |
Hard |
| 0543 |
Diameter of Binary Tree |
C++ |
Easy |
| 0542 |
01 Matrix |
C++ |
Medium |
| 0540 |
Single Element in a Sorted Array |
C++ |
Medium |
| 0539 |
Minimum Time Difference |
C++ |
Medium |
| 0538 |
Convert BST to Greater Tree |
C++ |
Medium |
| 0529 |
Minesweeper |
C++ |
Medium |
| 0528 |
Random Pick with Weight |
C++ |
Medium |
| 0525 |
Contiguous Array |
C++ |
Medium |
| 0522 |
Longest Uncommon Subsequence II |
C++ |
Medium |
| 0518 |
Coin Change II |
C++ |
Medium |
| 0517 |
Super Washing Machines |
C++ |
Hard |
| 0516 |
Longest Palindromic Subsequence |
C++ |
Medium |
| 0514 |
Freedom Trail |
C++ |
Hard |
| 0509 |
Fibonacci Number |
C++ |
Easy |
| 0502 |
IPO |
C++ |
Hard |
| 0486 |
Predict the Winner |
C++ |
Medium |
| 0481 |
Magical String |
C++ |
Medium |
| 0480 |
Sliding Window Median |
C++ |
Hard |
| 0494 |
Target Sum |
C++ |
Medium |
| 0493 |
Reverse Pairs |
C++ |
Hard |
| 0475 |
Heaters |
C++ |
Medium |
| 0474 |
Ones and Zeroes |
C++ |
Medium |
| 0473 |
Matchsticks to Square |
C++ |
Medium |
| 0467 |
Unique Substrings in Wraparound String |
C++ |
Medium |
| 0465 |
Optimal Account Balancing🔒 |
C++ |
Hard |
| 0464 |
Can I Win |
C++ |
Medium |
| 0461 |
Hamming Distance |
C++ |
Easy |
| 0460 |
LFU Cache |
C++ |
Hard |
| 0455 |
Assign Cookies |
C++ |
Easy |
| 0454 |
4Sum II |
C++ |
Medium |
| 0449 |
Serialize and Deserialize BST |
C++ |
Medium |
| 0448 |
Find All Numbers Disappeared in an Array |
C++ |
Easy |
| 0447 |
Number of Boomerangs |
C++ |
Medium |
| 0446 |
Count The Repetitions |
C++ |
Hard |
| 0445 |
Add Two Numbers II |
C++ |
Medium |
| 0444 |
Sequence Reconstruction |
C++ |
Medium |
| 0438 |
Find All Anagrams in a String |
C++ |
Medium |
| 0437 |
Path Sum III |
C++ |
Medium |
| 0436 |
Find Right Interval |
C++ |
Medium |
| 0432 |
All O`one Data Structure |
C++ |
Hard |
| 0430 |
Flatten a Multilevel Doubly Linked List |
C++ |
Medium |
| 0429 |
N-ary Tree Level Order Traversal |
C++ |
Medium |
| 0421 |
Maximum XOR of Two Numbers in an Array |
C++ |
Medium |
| 0419 |
Battleships in a Board |
C++ |
Medium |
| 0416 |
Partition Equal Subset Sum |
C++ |
Medium |
| 0415 |
Add Strings |
C++ |
Easy |
| 0412 |
Fizz Buzz |
C++ |
Easy |
| 0410 |
Split Array Largest Sum |
C++ |
Hard |
| 0409 |
Longest Palindrome |
C++ |
Easy |
| 0407 |
Trapping Rain Water II |
C++ |
Hard |
| 0406 |
Queue Reconstruction by Height |
C++ |
Medium |
| 0402 |
Remove K Digits |
C++ |
Medium |
| 0400 |
Nth Digit |
C++ |
Medium |
| 0399 |
Evaluate Division |
C++ |
Medium |
| 0395 |
Longest Substring with At Least K Repeating Characters |
C++ |
Medium |
| 0394 |
Decode String |
C++ |
Medium |
| 0387 |
First Unique Character in a String |
C++ |
Easy |
| 0386 |
Lexicographical Numbers |
C++ |
Medium |
| 0384 |
Shuffle an Array |
C++ |
Medium |
| 0381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
C++ |
Hard |
| 0380 |
Insert Delete GetRandom O(1) |
C++ |
Medium |
| 0378 |
Kth Smallest Element in a Sorted Matrix |
C++ |
Medium |
| 0377 |
Combination Sum IV |
C++ |
Medium |
| 0373 |
Find K Pairs with Smallest Sums |
C++ |
Medium |
| 0371 |
Sum of Two Integers |
C++ |
Medium |
| 0357 |
Count Numbers with Unique Digits |
C++ |
Medium |
| 0354 |
Russian Doll Envelopes |
C++ |
Hard |
| 0350 |
Intersection of Two Arrays II |
C++ |
Easy |
| 0349 |
Intersection of Two Arrays |
C++ |
Easy |
| 0348 |
Design Tic-Tac-Toe |
C++ |
Medium |
| 0347 |
Top K Frequent Elements |
C++ |
Medium |
| 0346 |
Moving Average from Data Stream |
C++ |
Easy |
| 0344 |
Reverse String |
C++ |
Easy |
| 0343 |
Integer Break |
C++ |
Medium |
| 0341 |
Flatten Nested List Iterator |
C++ |
Medium |
| 0340 |
Longest Substring with At Most K Distinct Characters |
C++ |
Medium |
| 0338 |
Counting Bits |
C++ |
Easy |
| 0337 |
House Robber III |
C++ |
Medium |
| 0334 |
Increasing Triplet Subsequence |
C++ |
Medium |
| 0333 |
Largest BST Subtree🔒 |
C++ |
Medium |
| 0329 |
Longest Increasing Path in a Matrix |
C++ |
Hard |
| 0328 |
Odd Even Linked List |
C++ |
Medium |
| 0327 |
Count of Range Sum |
C++ |
Hard |
| 0326 |
Power of Three |
C++ |
Easy |
| 0324 |
Wiggle Sort II |
C++ |
Medium |
| 0322 |
Coin Change |
C++ |
Medium |
| 0321 |
Create Maximum Number |
C++ |
Hard |
| 0318 |
Maximum Product of Word Lengths |
C++ |
Medium |
| 0316 |
Remove Duplicate Letters |
C++ |
Medium |
| 0315 |
Count of Smaller Numbers After Self |
C++ |
Hard |
| 0312 |
Burst Balloons |
C++ |
Hard |
| 0310 |
Minimum Height Trees |
C++ |
Medium |
| 0309 |
Best Time to Buy and Sell Stock with Cooldown |
C++ |
Medium |
| 0308 |
Range Sum Query 2D - Mutable🔒 |
C++ |
Hard |
| 0307 |
Range Sum Query - Mutable |
C++ |
Medium |
| 0304 |
Range Sum Query 2D - Immutable |
C++ |
Medium |
| 0303 |
Range Sum Query - Immutable |
C++ |
Easy |
| 0301 |
Remove Invalid Parentheses |
C++ |
Hard |
| 0300 |
Longest Increasing Subsequence |
C++ |
Medium |
| 0299 |
Bulls and Cows |
C++ |
Medium |
| 0297 |
Serialize and Deserialize Binary Tree |
C++ |
Hard |
| 0295 |
Find Median from Data Stream |
C++ |
Hard |
| 0292 |
Nim Game |
C++ |
Easy |
| 0289 |
Game of Life |
C++ |
Medium |
| 0287 |
Find the Duplicate Number |
C++ |
Medium |
| 0285 |
Inorder Successor in BST |
C++ |
Medium |
| 0283 |
Move Zeroes |
C++ |
Easy |
| 0279 |
Perfect Squares |
C++ |
Medium |
| 0277 |
Find the Celebrity |
C++ |
Medium |
| 0275 |
H-Index II |
C++ |
Medium |
| 0269 |
Alien Dictionary |
C++ |
Hard |
| 0268 |
Missing Number |
C++ |
Easy |
| 0264 |
Ugly Number II |
C++ |
Medium |
| 0260 |
Single Number III |
C++ |
Medium |
| 0256 |
Paint House🔒 |
C++ |
Medium |
| 0253 |
Meeting Rooms II🔒 |
C++ |
Medium |
| 0251 |
Flatten 2D Vector |
C++ |
Medium |
| 0242 |
Valid Anagram |
C++ |
Easy |
| 0240 |
Search a 2D Matrix II |
C++ |
Medium |
| 0239 |
Sliding Window Maximum |
C++ |
Hard |
| 0238 |
Product of Array Except Self |
C++ |
Medium |
| 0237 |
Delete Node in a Linked List |
C++ |
Medium |
| 0236 |
Lowest Common Ancestor of a Binary Tree |
C++ |
Medium |
| 0235 |
Lowest Common Ancestor of a Binary Search Tree |
C++ |
Medium |
| 0234 |
Palindrome Linked List |
C++ |
Easy |
| 0233 |
Number of Digit One |
C++ |
Hard |
| 0232 |
Implement Queue using Stacks |
C++ |
Easy |
| 0231 |
Power of Two |
C++ |
Easy |
| 0230 |
Kth Smallest Element in a BST |
C++ |
Medium |
| 0229 |
Majority Element II |
C++ |
Medium |
| 0227 |
Basic Calculator II |
C++ |
Medium |
| 0226 |
Invert Binary Tree |
C++ |
Easy |
| 0222 |
Count Complete Tree Nodes |
C++ |
Easy |
| 0221 |
Maximal Square |
C++ |
Medium |
| 0220 |
Contains Duplicate III |
C++ |
Hard |
| 0219 |
Contains Duplicate II |
C++ |
Easy |
| 0218 |
The Skyline Problem |
C++ |
Hard |
| 0217 |
Contains Duplicate |
C++ |
Easy |
| 0215 |
Kth Largest Element in an Array |
C++ |
Medium |
| 0213 |
House Robber II |
C++ |
Medium |
| 0212 |
Word Search II |
C++ |
Hard |
| 0210 |
Course Schedule II |
C++ |
Medium |
| 0209 |
Minimum Size Subarray Sum |
C++ |
Medium |
| 0208 |
Implement Trie (Prefix Tree) |
C++ |
Medium |
| 0207 |
Course Schedule |
C++ |
Medium |
| 0206 |
Reverse Linked List |
C++ |
Easy |
| 0205 |
Isomorphic Strings |
C++ |
Easy |
| 0204 |
Count Primes |
C++ |
Medium |
| 0202 |
Happy Number |
C++ |
Easy |
| 0201 |
Bitwise AND of Numbers Range |
C++ |
Medium |
| 0200 |
Number of Islands |
C++ |
Medium |
| 0199 |
Binary Tree Right Side View |
C++ |
Medium |
| 0198 |
House Robber |
C++ |
Medium |
| 0191 |
Number of 1 Bits |
C++ |
Easy |
| 0190 |
Reverse Bits |
C++ |
Easy |
| 0189 |
Rotate Array |
C++ |
Medium |
| 0188 |
Best Time to Buy and Sell Stock IV |
C++ |
Hard |
| 0179 |
Largest Number |
C++ |
Medium |
| 0173 |
Binary Search Tree Iterator |
C++ |
Medium |
| 0172 |
Factorial Trailing Zeroes |
C++ |
Medium |
| 0171 |
Excel Sheet Column Number |
C++ |
Easy |
| 0169 |
Majority Element |
C++ |
Easy |
| 0167 |
Two Sum II - Input Array Is Sorted |
C++ |
Medium |
| 0166 |
Fraction to Recurring Decimal |
C++ |
Medium |
| 0165 |
Compare Version Numbers |
C++ |
Medium |
| 0163 |
Missing Ranges |
C++ |
Easy |
| 0162 |
Find Peak Element |
C++ |
Medium |
| 0160 |
Intersection of Two Linked Lists |
C++ |
Easy |
| 0155 |
Min Stack |
C++ |
Medium |
| 0154 |
Find Minimum in Rotated Sorted Array II |
C++ |
Hard |
| 0153 |
Find Minimum in Rotated Sorted Array |
C++ |
Medium |
| 0152 |
Maximum Product Subarray |
C++ |
Medium |
| 0150 |
Max Points on a Line |
C++ |
Medium |
| 0149 |
Max Points on a Line |
C++ |
Hard |
| 0148 |
Sort List |
C++ |
Medium |
| 0146 |
LRU Cache |
C++ |
Medium |
| 0145 |
Binary Tree Postorder Traversal |
C++ |
Easy |
| 0144 |
Binary Tree Preorder Traversal |
C++ |
Easy |
| 0143 |
Reorder List |
C++ |
Medium |
| 0142 |
Linked List Cycle II |
C++ |
Medium |
| 0141 |
Linked List Cycle |
C++ |
Easy |
| 0140 |
Word Break II |
C++ |
Hard |
| 0139 |
Word Break |
C++ |
Medium |
| 0138 |
Copy List with Random Pointer |
C++ |
Medium |
| 0136 |
Single Number |
C++ |
Easy |
| 0134 |
Gas Station |
C++ |
Medium |
| 0133 |
Clone Graph |
C++ |
Medium |
| 0132 |
Palindrome Partitioning II |
C++ |
Hard |
| 0131 |
Palindrome Partitioning |
C++ |
Medium |
| 0130 |
Surrounded Regions |
C++ |
Medium |
| 0129 |
Sum Root to Leaf Numbers |
C++ |
Medium |
| 0128 |
Longest Consecutive Sequence |
C++ |
Medium |
| 0127 |
Word Ladder |
C++ |
Hard |
| 0126 |
Word Ladder II |
C++ |
Hard |
| 0125 |
Valid Palindrome |
C++ |
Easy |
| 0124 |
Binary Tree Maximum Path Sum |
C++ |
Hard |
| 0123 |
Best Time to Buy and Sell Stock III |
C++ |
Hard |
| 0122 |
Best Time to Buy and Sell Stock II |
C++ |
Medium |
| 0121 |
Best Time to Buy and Sell Stock |
C++ |
Easy |
| 0120 |
Triangle |
C++ |
Medium |
| 0118 |
Pascal's Triangle |
C++ |
Easy |
| 0116 |
Populating Next Right Pointers in Each Node |
C++ |
Medium |
| 0115 |
Distinct Subsequences |
C++ |
Hard |
| 0114 |
Flatten Binary Tree to Linked List |
C++ |
Medium |
| 0113 |
Path Sum II |
C++ |
Medium |
| 0111 |
Minimum Depth of Binary Tree |
C++ |
Easy |
| 0110 |
Balanced Binary Tree |
C++ |
Easy |
| 0108 |
Convert Sorted Array to Binary Search Tree |
C++ |
Easy |
| 0106 |
Construct Binary Tree from Inorder and Postorder Traversal |
C++ |
Medium |
| 0105 |
Construct Binary Tree from Preorder and Inorder Traversal |
C++ |
Medium |
| 0104 |
Maximum Depth of Binary Tree |
C++ |
Easy |
| 0103 |
Binary Tree Zigzag Level Order Traversal |
C++ |
Medium |
| 0102 |
Binary Tree Level Order Traversal |
C++ |
Medium |
| 0101 |
Symmetric Tree |
C++ |
Easy |
| 0098 |
Validate Binary Search Tree |
C++ |
Medium |
| 0097 |
Interleaving String |
C++ |
Medium |
| 0096 |
Unique Binary Search Trees |
C++ |
Medium |
| 0094 |
Binary Tree Inorder Traversal |
C++ |
Easy |
| 0093 |
Restore IP Addresses |
C++ |
Medium |
| 0092 |
Reverse Linked List II |
C++ |
Medium |
| 0091 |
Decode Ways |
C++ |
Medium |
| 0090 |
Subsets II |
C++ |
Medium |
| 0089 |
Gray Code |
C++ |
Medium |
| 0088 |
Merge Sorted Array |
C++ |
Easy |
| 0087 |
Scramble String |
C++ |
Hard |
| 0085 |
Maximal Rectangle |
C++ |
Hard |
| 0084 |
Largest Rectangle in Histogram |
C++ |
Hard |
| 0081 |
Search in Rotated Sorted Array II |
C++ |
Medium |
| 0080 |
Remove Duplicates from Sorted Array II |
C++ |
Medium |
| 0079 |
Word Search |
C++ |
Medium |
| 0078 |
Subsets |
C++ |
Medium |
| 0077 |
Combinations |
C++ |
Medium |
| 0076 |
Minimum Window Substring |
C++ |
Hard |
| 0075 |
Sort Colors |
C++ |
Medium |
| 0074 |
Search a 2D Matrix |
C++ |
Medium |
| 0073 |
Set Matrix Zeroes |
C++ |
Medium |
| 0072 |
Edit Distance |
C++ |
Hard |
| 0070 |
Climbing Stairs |
C++ |
Easy |
| 0069 |
Sqrt(x) |
C++ |
Easy |
| 0067 |
Add Binary |
C++ |
Easy |
| 0066 |
Plus One |
C++ |
Easy |
| 0064 |
Minimum Path Sum |
C++ |
Medium |
| 0062 |
Unique Paths |
C++ |
Medium |
| 0061 |
Rotate List |
C++ |
Medium |
| 0060 |
Permutation Sequence |
C++ |
Hard |
| 0059 |
Spiral Matrix II |
C++ |
Medium |
| 0058 |
Length of Last Word |
C++ |
Easy |
| 0057 |
Insert Interval |
C++ |
Medium |
| 0056 |
Merge Intervals |
C++ |
Medium |
| 0055 |
Jump Game |
C++ |
Medium |
| 0054 |
Spiral Matrix |
C++ |
Medium |
| 0053 |
Maximum Subarray |
C++ |
Medium |
| 0052 |
N-Queens II |
C++ |
Hard |
| 0050 |
Pow(x, n) |
C++ |
Medium |
| 0049 |
Group Anagrams |
C++ |
Medium |
| 0048 |
Rotate Image |
C++ |
Medium |
| 0047 |
Permutations II |
C++ |
Medium |
| 0046 |
Permutations |
C++ |
Medium |
| 0045 |
Jump Game II |
C++ |
Medium |
| 0044 |
Wildcard Matching |
C++ |
Hard |
| 0043 |
Multiply Strings |
C++ |
Medium |
| 0042 |
Trapping Rain Water |
C++ |
Hard |
| 0041 |
First Missing Positive |
C++ |
Hard |
| 0040 |
Combination Sum II |
C++ |
Medium |
| 0039 |
Combination Sum |
C++ |
Medium |
| 0038 |
Count and Say |
C++ |
Medium |
| 0037 |
Sudoku Solver |
C++ |
Hard |
| 0036 |
Valid Sudoku |
C++ |
Medium |
| 0035 |
Search Insert Position |
C++ |
Easy |
| 0034 |
Find First and Last Position of Element in Sorted Array |
C++ |
Medium |
| 0033 |
Search in Rotated Sorted Array |
C++ |
Medium |
| 0031 |
Next Permutation |
C++ |
Medium |
| 0030 |
Substring with Concatenation of All Words |
C++ |
Hard |
| 0032 |
Longest Valid Parentheses |
C++ |
Hard |
| 0029 |
Divide Two Integers |
C++ |
Medium |
| 0028 |
Find the Index of the First Occurrence in a String |
C++ |
Easy |
| 0026 |
Remove Duplicates from Sorted Array |
C++ |
Easy |
| 0025 |
Reverse Nodes in k-Group |
C++ |
Hard |
| 0023 |
Merge k Sorted Lists |
C++ |
Hard |
| 0022 |
Generate Parentheses |
C++ |
Medium |
| 0021 |
Merge Two Sorted Lists |
C++ |
Easy |
| 0020 |
Valid Parentheses |
C++ |
Easy |
| 0019 |
Remove Nth Node From End of List |
C++ |
Medium |
| 0017 |
Letter Combinations of a Phone Number |
C++ |
Medium |
| 0016 |
3Sum Closest |
C++ |
Medium |
| 0015 |
3Sum |
C++ |
Medium |
| 0014 |
Longest Common Prefix |
C++ |
Easy |
| 0013 |
Roman to Integer |
C++ |
Easy |
| 0012 |
Integer to Roman |
C++ |
Medium |
| 0011 |
Container With Most Water |
C++ |
Medium |
| 0010 |
Regular Expression Matching |
C++ |
Hard |
| 0009 |
Palindrome Number |
C++ |
Easy |
| 0008 |
String to Integer (atoi) |
C++ |
Medium |
| 0007 |
Reverse Integer |
C++ |
Medium |
| 0005 |
Longest Palindromic Substring |
C++ |
Medium |
| 0004 |
Median of Two Sorted Arrays |
C++ |
Hard |
| 0003 |
Longest Substring Without Repeating Characters |
C++ |
Medium |
| 0002 |
Add Two Numbers |
C++ |
Medium |
| 0001 |
Two Sum |
C++ |
Easy |