- basic / README
- basic / summary
- basic / searching / BinarySearch / README
- basic / sorting / BubbleSort / README
- basic / sorting / CountingSort / README
- basic / sorting / HeapSort / README
- basic / sorting / InsertionSort / README
- basic / sorting / MergeSort / README
- basic / sorting / QuickSort / README
- basic / sorting / SelectionSort / README
- basic / sorting / ShellSort / README
- lcci / README
- lcci / summary
- lcci / summary_en
- lcci / 01.01.Is Unique / README
- lcci / 01.02.Check Permutation / README
- lcci / 01.03.String to URL / README
- lcci / 01.04.Palindrome Permutation / README
- lcci / 01.05.One Away / README
- lcci / 01.06.Compress String / README
- lcci / 01.07.Rotate Matrix / README
- lcci / 01.08.Zero Matrix / README
- lcci / 01.09.String Rotation / README
- lcci / 02.01.Remove Duplicate Node / README
- lcci / 02.02.Kth Node From End of List / README
- lcci / 02.03.Delete Middle Node / README
- lcci / 02.04.Partition List / README
- lcci / 02.05.Sum Lists / README
- lcci / 02.06.Palindrome Linked List / README
- lcci / 02.07.Intersection of Two Linked Lists / README
- lcci / 02.08.Linked List Cycle / README
- lcci / 03.01.Three in One / README
- lcci / 03.02.Min Stack / README
- lcci / 03.03.Stack of Plates / README
- lcci / 03.04.Implement Queue using Stacks / README
- lcci / 03.05.Sort of Stacks / README
- lcci / 03.06.Animal Shelter / README
- lcci / 04.01.Route Between Nodes / README
- lcci / 04.02.Minimum Height Tree / README
- lcci / 04.03.List of Depth / README
- lcci / 04.04.Check Balance / README
- lcci / 04.05.Legal Binary Search Tree / README
- lcci / 04.06.Successor / README
- lcci / 04.08.First Common Ancestor / README
- lcci / 04.09.BST Sequences / README
- lcci / 04.10.Check SubTree / README
- lcci / 04.12.Paths with Sum / README
- lcci / 05.01.Insert Into Bits / README
- lcci / 05.02.Binary Number to String / README
- lcci / 05.03.Reverse Bits / README
- lcci / 05.04.Closed Number / README
- lcci / 05.06.Convert Integer / README
- lcci / 05.07.Exchange / README
- lcci / 05.08.Draw Line / README
- lcci / 08.01.Three Steps Problem / README
- lcci / 08.02.Robot in a Grid / README
- lcci / 08.03.Magic Index / README
- lcci / 08.04.Power Set / README
- lcci / 08.05.Recursive Mulitply / README
- lcci / 08.06.Hanota / README
- lcci / 08.07.Permutation I / README
- lcci / 08.08.Permutation II / README
- lcci / 08.09.Bracket / README
- lcci / 08.10.Color Fill / README
- lcci / 08.11.Coin / README
- lcci / 08.12.Eight Queens / README
- lcci / 08.13.Pile Box / README
- lcci / 08.14.Boolean Evaluation / README
- lcci / 10.01.Sorted Merge / README
- lcci / 10.02.Group Anagrams / README
- lcci / 10.03.Search Rotate Array / README
- lcci / 10.05.Sparse Array Search / README
- lcci / 10.09.Sorted Matrix Search / README
- lcci / 10.10.Rank from Stream / README
- lcci / 10.11.Peaks and Valleys / README
- lcci / 16.01.Swap Numbers / README
- lcci / 16.02.Words Frequency / README
- lcci / 16.03.Intersection / README
- lcci / 16.04.Tic-Tac-Toe / README
- lcci / 16.05.Factorial Zeros / README
- lcci / 16.06.Smallest Difference / README
- lcci / 16.07.Maximum / README
- lcci / 16.08.English Int / README
- lcci / 16.09.Operations / README
- lcci / 16.10.Living People / README
- lcci / 16.11.Diving Board / README
- lcci / 16.13.Bisect Squares / README
- lcci / 16.14.Best Line / README
- lcci / 16.15.Master Mind / README
- lcci / 16.16.Sub Sort / README
- lcci / 16.17.Contiguous Sequence / README
- lcci / 16.18.Pattern Matching / README
- lcci / 16.19.Pond Sizes / README
- lcci / 16.20.T9 / README
- lcci / 16.21.Sum Swap / README
- lcci / 16.22.Langtons Ant / README
- lcci / 16.24.Pairs With Sum / README
- lcci / 16.25.LRU Cache / README
- lcci / 16.26.Calculator / README
- lcci / 17.01.Add Without Plus / README
- lcci / 17.04.Missing Number / README
- lcci / 17.05.Find Longest Subarray / README
- lcci / 17.06.Number Of 2s In Range / README
- lcci / 17.07.Baby Names / README
- lcci / 17.08.Circus Tower / README
- lcci / 17.09.Get Kth Magic Number / README
- lcci / 17.10.Find Majority Element / README
- lcci / 17.11.Find Closest / README
- lcci / 17.12.BiNode / README
- lcci / 17.13.Re-Space / README
- lcci / 17.14.Smallest K / README
- lcci / 17.15.Longest Word / README
- lcci / 17.16.The Masseuse / README
- lcci / 17.17.Multi Search / README
- lcci / 17.18.Shortest Supersequence / README
- lcci / 17.19.Missing Two / README
- lcci / 17.20.Continuous Median / README
- lcci / 17.21.Volume of Histogram / README
- lcci / 17.22.Word Transformer / README
- lcci / 17.23.Max Black Square / README
- lcci / 17.24.Max Submatrix / README
- lcci / 17.25.Word Rectangle / README
- lcci / 17.26.Sparse Similarity / README
- lcof / README
- lcof / README_TEMPLATE
- lcof / summary
- lcof / summary_en
- lcof / 面试题03. 数组中重复的数字 / README
- lcof / 面试题04. 二维数组中的查找 / README
- lcof / 面试题05. 替换空格 / README
- lcof / 面试题06. 从尾到头打印链表 / README
- lcof / 面试题07. 重建二叉树 / README
- lcof / 面试题09. 用两个栈实现队列 / README
- lcof / 面试题10- I. 斐波那契数列 / README
- lcof / 面试题10- II. 青蛙跳台阶问题 / README
- lcof / 面试题11. 旋转数组的最小数字 / README
- lcof / 面试题12. 矩阵中的路径 / README
- lcof / 面试题13. 机器人的运动范围 / README
- lcof / 面试题14- I. 剪绳子 / README
- lcof / 面试题14- II. 剪绳子 II / README
- lcof / 面试题15. 二进制中1的个数 / README
- lcof / 面试题16. 数值的整数次方 / README
- lcof / 面试题17. 打印从1到最大的n位数 / README
- lcof / 面试题18. 删除链表的节点 / README
- lcof / 面试题19. 正则表达式匹配 / README
- lcof / 面试题20. 表示数值的字符串 / README
- lcof / 面试题21. 调整数组顺序使奇数位于偶数前面 / README
- lcof / 面试题22. 链表中倒数第k个节点 / README
- lcof / 面试题24. 反转链表 / README
- lcof / 面试题25. 合并两个排序的链表 / README
- lcof / 面试题26. 树的子结构 / README
- lcof / 面试题27. 二叉树的镜像 / README
- lcof / 面试题28. 对称的二叉树 / README
- lcof / 面试题29. 顺时针打印矩阵 / README
- lcof / 面试题30. 包含min函数的栈 / README
- lcof / 面试题31. 栈的压入、弹出序列 / README
- lcof / 面试题32 - I. 从上到下打印二叉树 / README
- lcof / 面试题32 - II. 从上到下打印二叉树 II / README
- lcof / 面试题32 - III. 从上到下打印二叉树 III / README
- lcof / 面试题33. 二叉搜索树的后序遍历序列 / README
- lcof / 面试题34. 二叉树中和为某一值的路径 / README
- lcof / 面试题35. 复杂链表的复制 / README
- lcof / 面试题36. 二叉搜索树与双向链表 / README
- lcof / 面试题37. 序列化二叉树 / README
- lcof / 面试题38. 字符串的排列 / README
- lcof / 面试题39. 数组中出现次数超过一半的数字 / README
- lcof / 面试题40. 最小的k个数 / README
- lcof / 面试题41. 数据流中的中位数 / README
- lcof / 面试题42. 连续子数组的最大和 / README
- lcof / 面试题43. 1~n整数中1出现的次数 / README
- lcof / 面试题44. 数字序列中某一位的数字 / README
- lcof / 面试题45. 把数组排成最小的数 / README
- lcof / 面试题46. 把数字翻译成字符串 / README
- lcof / 面试题47. 礼物的最大价值 / README
- lcof / 面试题48. 最长不含重复字符的子字符串 / README
- lcof / 面试题49. 丑数 / README
- lcof / 面试题50. 第一个只出现一次的字符 / README
- lcof / 面试题51. 数组中的逆序对 / README
- lcof / 面试题52. 两个链表的第一个公共节点 / README
- lcof / 面试题53 - I. 在排序数组中查找数字 I / README
- lcof / 面试题53 - II. 0~n-1中缺失的数字 / README
- lcof / 面试题54. 二叉搜索树的第k大节点 / README
- lcof / 面试题55 - I. 二叉树的深度 / README
- lcof / 面试题55 - II. 平衡二叉树 / README
- lcof / 面试题56 - I. 数组中数字出现的次数 / README
- lcof / 面试题56 - II. 数组中数字出现的次数 II / README
- lcof / 面试题57 - II. 和为s的连续正数序列 / README
- lcof / 面试题57. 和为s的两个数字 / README
- lcof / 面试题58 - I. 翻转单词顺序 / README
- lcof / 面试题58 - II. 左旋转字符串 / README
- lcof / 面试题59 - I. 滑动窗口的最大值 / README
- lcof / 面试题59 - II. 队列的最大值 / README
- lcof / 面试题60. n个骰子的点数 / README
- lcof / 面试题61. 扑克牌中的顺子 / README
- lcof / 面试题62. 圆圈中最后剩下的数字 / README
- lcof / 面试题63. 股票的最大利润 / README
- lcof / 面试题64. 求1+2+…+n / README
- lcof / 面试题65. 不用加减乘除做加法 / README
- lcof / 面试题66. 构建乘积数组 / README
- lcof / 面试题67. 把字符串转换成整数 / README
- lcof / 面试题68 - I. 二叉搜索树的最近公共祖先 / README
- lcof / 面试题68 - II. 二叉树的最近公共祖先 / README
- lcof2 / README
- lcof2 / summary
- lcof2 / 剑指 Offer II 001. 整数除法 / README
- lcof2 / 剑指 Offer II 002. 二进制加法 / README
- lcof2 / 剑指 Offer II 003. 前 n 个数字二进制中 1 的个数 / README
- lcof2 / 剑指 Offer II 004. 只出现一次的数字 / README
- lcof2 / 剑指 Offer II 005. 单词长度的最大乘积 / README
- lcof2 / 剑指 Offer II 006. 排序数组中两个数字之和 / README
- lcof2 / 剑指 Offer II 007. 数组中和为 0 的三个数 / README
- lcof2 / 剑指 Offer II 008. 和大于等于 target 的最短子数组 / README
- lcof2 / 剑指 Offer II 009. 乘积小于 K 的子数组 / README
- lcof2 / 剑指 Offer II 010. 和为 k 的子数组 / README
- lcof2 / 剑指 Offer II 011. 0 和 1 个数相同的子数组 / README
- lcof2 / 剑指 Offer II 012. 左右两边子数组的和相等 / README
- lcof2 / 剑指 Offer II 013. 二维子矩阵的和 / README
- lcof2 / 剑指 Offer II 014. 字符串中的变位词 / README
- lcof2 / 剑指 Offer II 015. 字符串中的所有变位词 / README
- lcof2 / 剑指 Offer II 016. 不含重复字符的最长子字符串 / README
- lcof2 / 剑指 Offer II 017. 含有所有字符的最短字符串 / README
- lcof2 / 剑指 Offer II 018. 有效的回文 / README
- lcof2 / 剑指 Offer II 019. 最多删除一个字符得到回文 / README
- lcof2 / 剑指 Offer II 020. 回文子字符串的个数 / README
- lcof2 / 剑指 Offer II 021. 删除链表的倒数第 n 个结点 / README
- lcof2 / 剑指 Offer II 022. 链表中环的入口节点 / README
- lcof2 / 剑指 Offer II 023. 两个链表的第一个重合节点 / README
- lcof2 / 剑指 Offer II 024. 反转链表 / README
- lcof2 / 剑指 Offer II 025. 链表中的两数相加 / README
- lcof2 / 剑指 Offer II 026. 重排链表 / README
- lcof2 / 剑指 Offer II 027. 回文链表 / README
- lcof2 / 剑指 Offer II 028. 展平多级双向链表 / README
- lcof2 / 剑指 Offer II 029. 排序的循环链表 / README
- lcof2 / 剑指 Offer II 030. 插入、删除和随机访问都是 O(1) 的容器 / README
- lcof2 / 剑指 Offer II 031. 最近最少使用缓存 / README
- lcof2 / 剑指 Offer II 032. 有效的变位词 / README
- lcof2 / 剑指 Offer II 033. 变位词组 / README
- lcof2 / 剑指 Offer II 034. 外星语言是否排序 / README
- lcof2 / 剑指 Offer II 035. 最小时间差 / README
- lcof2 / 剑指 Offer II 036. 后缀表达式 / README
- lcof2 / 剑指 Offer II 037. 小行星碰撞 / README
- lcof2 / 剑指 Offer II 038. 每日温度 / README
- lcof2 / 剑指 Offer II 039. 直方图最大矩形面积 / README
- lcof2 / 剑指 Offer II 040. 矩阵中最大的矩形 / README
- lcof2 / 剑指 Offer II 041. 滑动窗口的平均值 / README
- lcof2 / 剑指 Offer II 042. 最近请求次数 / README
- lcof2 / 剑指 Offer II 043. 往完全二叉树添加节点 / README
- lcof2 / 剑指 Offer II 044. 二叉树每层的最大值 / README
- lcof2 / 剑指 Offer II 045. 二叉树最底层最左边的值 / README
- lcof2 / 剑指 Offer II 046. 二叉树的右侧视图 / README
- lcof2 / 剑指 Offer II 047. 二叉树剪枝 / README
- lcof2 / 剑指 Offer II 048. 序列化与反序列化二叉树 / README
- lcof2 / 剑指 Offer II 049. 从根节点到叶节点的路径数字之和 / README
- lcof2 / 剑指 Offer II 050. 向下的路径节点之和 / README
- lcof2 / 剑指 Offer II 051. 节点之和最大的路径 / README
- lcof2 / 剑指 Offer II 052. 展平二叉搜索树 / README
- lcof2 / 剑指 Offer II 053. 二叉搜索树中的中序后继 / README
- lcof2 / 剑指 Offer II 054. 所有大于等于节点的值之和 / README
- lcof2 / 剑指 Offer II 055. 二叉搜索树迭代器 / README
- lcof2 / 剑指 Offer II 056. 二叉搜索树中两个节点之和 / README
- lcof2 / 剑指 Offer II 057. 值和下标之差都在给定的范围内 / README
- lcof2 / 剑指 Offer II 058. 日程表 / README
- lcof2 / 剑指 Offer II 059. 数据流的第 K 大数值 / README
- lcof2 / 剑指 Offer II 060. 出现频率最高的 k 个数字 / README
- lcof2 / 剑指 Offer II 061. 和最小的 k 个数对 / README
- lcof2 / 剑指 Offer II 062. 实现前缀树 / README
- lcof2 / 剑指 Offer II 063. 替换单词 / README
- lcof2 / 剑指 Offer II 064. 神奇的字典 / README
- lcof2 / 剑指 Offer II 065. 最短的单词编码 / README
- lcof2 / 剑指 Offer II 066. 单词之和 / README
- lcof2 / 剑指 Offer II 067. 最大的异或 / README
- lcof2 / 剑指 Offer II 068. 查找插入位置 / README
- lcof2 / 剑指 Offer II 069. 山峰数组的顶部 / README
- lcof2 / 剑指 Offer II 070. 排序数组中只出现一次的数字 / README
- lcof2 / 剑指 Offer II 071. 按权重生成随机数 / README
- lcof2 / 剑指 Offer II 072. 求平方根 / README
- lcof2 / 剑指 Offer II 073. 狒狒吃香蕉 / README
- lcof2 / 剑指 Offer II 074. 合并区间 / README
- lcof2 / 剑指 Offer II 075. 数组相对排序 / README
- lcof2 / 剑指 Offer II 076. 数组中的第 k 大的数字 / README
- lcof2 / 剑指 Offer II 077. 链表排序 / README
- lcof2 / 剑指 Offer II 078. 合并排序链表 / README
- lcof2 / 剑指 Offer II 079. 所有子集 / README
- lcof2 / 剑指 Offer II 080. 含有 k 个元素的组合 / README
- lcof2 / 剑指 Offer II 081. 允许重复选择元素的组合 / README
- lcof2 / 剑指 Offer II 082. 含有重复元素集合的组合 / README
- lcof2 / 剑指 Offer II 083. 没有重复元素集合的全排列 / README
- lcof2 / 剑指 Offer II 084. 含有重复元素集合的全排列 / README
- lcof2 / 剑指 Offer II 085. 生成匹配的括号 / README
- lcof2 / 剑指 Offer II 086. 分割回文子字符串 / README
- lcof2 / 剑指 Offer II 087. 复原 IP / README
- lcof2 / 剑指 Offer II 088. 爬楼梯的最少成本 / README
- lcof2 / 剑指 Offer II 089. 房屋偷盗 / README
- lcof2 / 剑指 Offer II 090. 环形房屋偷盗 / README
- lcof2 / 剑指 Offer II 091. 粉刷房子 / README
- lcof2 / 剑指 Offer II 092. 翻转字符 / README
- lcof2 / 剑指 Offer II 093. 最长斐波那契数列 / README
- lcof2 / 剑指 Offer II 094. 最少回文分割 / README
- lcof2 / 剑指 Offer II 095. 最长公共子序列 / README
- lcof2 / 剑指 Offer II 096. 字符串交织 / README
- lcof2 / 剑指 Offer II 097. 子序列的数目 / README
- lcof2 / 剑指 Offer II 098. 路径的数目 / README
- lcof2 / 剑指 Offer II 099. 最小路径之和 / README
- lcof2 / 剑指 Offer II 100. 三角形中最小路径之和 / README
- lcof2 / 剑指 Offer II 101. 分割等和子串 / README
- lcof2 / 剑指 Offer II 102. 加减的目标值 / README
- lcof2 / 剑指 Offer II 103. 最少的硬币数目 / README
- lcof2 / 剑指 Offer II 104. 排列的数目 / README
- lcof2 / 剑指 Offer II 105. 岛屿的最大面积 / README
- lcof2 / 剑指 Offer II 106. 二分图 / README
- lcof2 / 剑指 Offer II 107. 矩阵中的距离 / README
- lcof2 / 剑指 Offer II 108. 单词演变 / README
- lcof2 / 剑指 Offer II 109. 开密码锁 / README
- lcof2 / 剑指 Offer II 110. 所有路径 / README
- lcof2 / 剑指 Offer II 111. 计算除法 / README
- lcof2 / 剑指 Offer II 112. 最长递增路径 / README
- lcof2 / 剑指 Offer II 113. 课程顺序 / README
- lcof2 / 剑指 Offer II 114. 外星文字典 / README
- lcof2 / 剑指 Offer II 115. 重建序列 / README
- lcof2 / 剑指 Offer II 116. 朋友圈 / README
- lcof2 / 剑指 Offer II 117. 相似的字符串 / README
- lcof2 / 剑指 Offer II 118. 多余的边 / README
- lcof2 / 剑指 Offer II 119. 最长连续序列 / README
- lcp / problem_readme_template
- lcp / README
- lcp / summary
- lcp / summary_en
- lcp / LCP 01. 猜数字 / README
- lcp / LCP 02. 分式化简 / README
- lcp / LCP 03. 机器人大冒险 / README
- lcp / LCP 04. 覆盖 / README
- lcp / LCP 05. 发 LeetCoin / README
- lcp / LCP 06. 拿硬币 / README
- lcp / LCP 07. 传递信息 / README
- lcp / LCP 08. 剧情触发时间 / README
- lcp / LCP 09. 最小跳跃次数 / README
- lcp / LCP 10. 二叉树任务调度 / README
- lcp / LCP 11. 期望个数统计 / README
- lcp / LCP 12. 小张刷题计划 / README
- lcp / LCP 13. 寻宝 / README
- lcp / LCP 14. 切分数组 / README
- lcp / LCP 15. 游乐园的迷宫 / README
- lcp / LCP 16. 游乐园的游览计划 / README
- lcp / LCP 17. 速算机器人 / README
- lcp / LCP 18. 早餐组合 / README
- lcp / LCP 19. 秋叶收藏集 / README
- lcp / LCP 20. 快速公交 / README
- lcp / LCP 21. 追逐游戏 / README
- lcp / LCP 22. 黑白方格画 / README
- lcp / LCP 23. 魔术排列 / README
- lcp / LCP 24. 数字游戏 / README
- lcp / LCP 25. 古董键盘 / README
- lcp / LCP 26. 导航装置 / README
- lcp / LCP 27. 黑盒光线反射 / README
- lcp / LCP 28. 采购方案 / README
- lcp / LCP 29. 乐团站位 / README
- lcp / LCP 30. 魔塔游戏 / README
- lcp / LCP 31. 变换的迷宫 / README
- lcp / LCP 32. 批量处理任务 / README
- lcp / LCP 33. 蓄水 / README
- lcp / LCP 34. 二叉树染色 / README
- lcp / LCP 35. 电动车游城市 / README
- lcp / LCP 36. 最多牌组数 / README
- lcp / LCP 37. 最小矩形面积 / README
- lcp / LCP 38. 守卫城堡 / README
- lcp / LCP 39. 无人机方阵 / README
- lcp / LCP 40. 心算挑战 / README
- lcp / LCP 41. 黑白翻转棋 / README
- lcp / LCP 42. 玩具套圈 / README
- lcp / LCP 43. 十字路口的交通 / README
- lcp / LCP 44. 开幕式焰火 / README
- lcp / LCP 45. 自行车炫技赛场 / README
- lcp / LCP 46. 志愿者调配 / README
- lcp / LCP 47. 入场安检 / README
- lcp / LCP 48. 无限棋局 / README
- lcp / LCP 49. 环形闯关游戏 / README
- lcp / LCP 50. 宝石补给 / README
- lcp / LCP 51. 烹饪料理 / README
- lcp / LCP 52. 二叉搜索树染色 / README
- lcp / LCP 53. 守护太空城 / README
- lcp / LCP 54. 夺回据点 / README
- lcp / LCP 55. 采集果实 / README
- lcp / LCP 56. 信物传送 / README
- lcp / LCP 57. 打地鼠 / README
- lcp / LCP 58. 积木拼接 / README
- lcp / LCP 59. 搭桥过河 / README
- lcp / LCP 60. 力扣泡泡龙 / README
- lcp / LCP 61. 气温变化趋势 / README
- lcp / LCP 62. 交通枢纽 / README
- lcp / LCP 63. 弹珠游戏 / README
- lcp / LCP 64. 二叉树灯饰 / README
- lcp / LCP 65. 舒适的湿度 / README
- lcp / LCP 66. 最小展台数量 / README
- lcp / LCP 67. 装饰树 / README
- lcp / LCP 68. 美观的花束 / README
- lcp / LCP 69. Hello LeetCode! / README
- lcp / LCP 70. 沙地治理 / README
- lcp / LCP 71. 集水器 / README
- lcp / LCP 72. 补给马车 / README
- lcp / LCP 73. 探险营地 / README
- lcp / LCP 74. 最强祝福力场 / README
- lcp / LCP 75. 传送卷轴 / README
- lcp / LCP 76. 魔法棋盘 / README
- lcp / LCP 77. 符文储备 / README
- lcp / LCP 78. 城墙防线 / README
- lcp / LCP 79. 提取咒文 / README
- lcp / LCP 80. 生物进化录 / README
- lcp / LCP 81. 与非的谜题 / README
- lcp / LCP 82. 万灵之树 / README
- lcs / README
- lcs / summary
- lcs / summary_en
- lcs / LCS 01. 下载插件 / README
- lcs / LCS 02. 完成一半题目 / README
- lcs / LCS 03. 主题空间 / README
- solution / CONTEST_README
- solution / database-summary
- solution / database-summary_en
- solution / DATABASE_README
- solution / javascript-summary
- solution / javascript-summary_en
- solution / JAVASCRIPT_README
- solution / README
- solution / template
- solution / 0000-0099 / 0001.Two Sum / README
- solution / 0000-0099 / 0002.Add Two Numbers / README
- solution / 0000-0099 / 0003.Longest Substring Without Repeating Characters / README
- solution / 0000-0099 / 0004.Median of Two Sorted Arrays / README
- solution / 0000-0099 / 0005.Longest Palindromic Substring / README
- solution / 0000-0099 / 0006.Zigzag Conversion / README
- solution / 0000-0099 / 0007.Reverse Integer / README
- solution / 0000-0099 / 0008.String to Integer (atoi) / README
- solution / 0000-0099 / 0009.Palindrome Number / README
- solution / 0000-0099 / 0010.Regular Expression Matching / README
- solution / 0000-0099 / 0011.Container With Most Water / README
- solution / 0000-0099 / 0012.Integer to Roman / README
- solution / 0000-0099 / 0013.Roman to Integer / README
- solution / 0000-0099 / 0014.Longest Common Prefix / README
- solution / 0000-0099 / 0015.3Sum / README
- solution / 0000-0099 / 0016.3Sum Closest / README
- solution / 0000-0099 / 0017.Letter Combinations of a Phone Number / README
- solution / 0000-0099 / 0018.4Sum / README
- solution / 0000-0099 / 0019.Remove Nth Node From End of List / README
- solution / 0000-0099 / 0020.Valid Parentheses / README
- solution / 0000-0099 / 0021.Merge Two Sorted Lists / README
- solution / 0000-0099 / 0022.Generate Parentheses / README
- solution / 0000-0099 / 0023.Merge k Sorted Lists / README
- solution / 0000-0099 / 0024.Swap Nodes in Pairs / README
- solution / 0000-0099 / 0025.Reverse Nodes in k-Group / README
- solution / 0000-0099 / 0026.Remove Duplicates from Sorted Array / README
- solution / 0000-0099 / 0027.Remove Element / README
- solution / 0000-0099 / 0028.Find the Index of the First Occurrence in a String / README
- solution / 0000-0099 / 0029.Divide Two Integers / README
- solution / 0000-0099 / 0030.Substring with Concatenation of All Words / README
- solution / 0000-0099 / 0031.Next Permutation / README
- solution / 0000-0099 / 0032.Longest Valid Parentheses / README
- solution / 0000-0099 / 0033.Search in Rotated Sorted Array / README
- solution / 0000-0099 / 0034.Find First and Last Position of Element in Sorted Array / README
- solution / 0000-0099 / 0035.Search Insert Position / README
- solution / 0000-0099 / 0036.Valid Sudoku / README
- solution / 0000-0099 / 0037.Sudoku Solver / README
- solution / 0000-0099 / 0038.Count and Say / README
- solution / 0000-0099 / 0039.Combination Sum / README
- solution / 0000-0099 / 0040.Combination Sum II / README
- solution / 0000-0099 / 0041.First Missing Positive / README
- solution / 0000-0099 / 0042.Trapping Rain Water / README
- solution / 0000-0099 / 0043.Multiply Strings / README
- solution / 0000-0099 / 0044.Wildcard Matching / README
- solution / 0000-0099 / 0045.Jump Game II / README
- solution / 0000-0099 / 0046.Permutations / README
- solution / 0000-0099 / 0047.Permutations II / README
- solution / 0000-0099 / 0048.Rotate Image / README
- solution / 0000-0099 / 0049.Group Anagrams / README
- solution / 0000-0099 / 0050.Pow(x, n) / README
- solution / 0000-0099 / 0051.N-Queens / README
- solution / 0000-0099 / 0052.N-Queens II / README
- solution / 0000-0099 / 0053.Maximum Subarray / README
- solution / 0000-0099 / 0054.Spiral Matrix / README
- solution / 0000-0099 / 0055.Jump Game / README
- solution / 0000-0099 / 0056.Merge Intervals / README
- solution / 0000-0099 / 0057.Insert Interval / README
- solution / 0000-0099 / 0058.Length of Last Word / README
- solution / 0000-0099 / 0059.Spiral Matrix II / README
- solution / 0000-0099 / 0060.Permutation Sequence / README
- solution / 0000-0099 / 0061.Rotate List / README
- solution / 0000-0099 / 0062.Unique Paths / README
- solution / 0000-0099 / 0063.Unique Paths II / README
- solution / 0000-0099 / 0064.Minimum Path Sum / README
- solution / 0000-0099 / 0065.Valid Number / README
- solution / 0000-0099 / 0066.Plus One / README
- solution / 0000-0099 / 0067.Add Binary / README
- solution / 0000-0099 / 0068.Text Justification / README
- solution / 0000-0099 / 0069.Sqrt(x) / README
- solution / 0000-0099 / 0070.Climbing Stairs / README
- solution / 0000-0099 / 0071.Simplify Path / README
- solution / 0000-0099 / 0072.Edit Distance / README
- solution / 0000-0099 / 0073.Set Matrix Zeroes / README
- solution / 0000-0099 / 0074.Search a 2D Matrix / README
- solution / 0000-0099 / 0075.Sort Colors / README
- solution / 0000-0099 / 0076.Minimum Window Substring / README
- solution / 0000-0099 / 0077.Combinations / README
- solution / 0000-0099 / 0078.Subsets / README
- solution / 0000-0099 / 0079.Word Search / README
- solution / 0000-0099 / 0080.Remove Duplicates from Sorted Array II / README
- solution / 0000-0099 / 0081.Search in Rotated Sorted Array II / README
- solution / 0000-0099 / 0082.Remove Duplicates from Sorted List II / README
- solution / 0000-0099 / 0083.Remove Duplicates from Sorted List / README
- solution / 0000-0099 / 0084.Largest Rectangle in Histogram / README
- solution / 0000-0099 / 0085.Maximal Rectangle / README
- solution / 0000-0099 / 0086.Partition List / README
- solution / 0000-0099 / 0087.Scramble String / README
- solution / 0000-0099 / 0088.Merge Sorted Array / README
- solution / 0000-0099 / 0089.Gray Code / README
- solution / 0000-0099 / 0090.Subsets II / README
- solution / 0000-0099 / 0091.Decode Ways / README
- solution / 0000-0099 / 0092.Reverse Linked List II / README
- solution / 0000-0099 / 0093.Restore IP Addresses / README
- solution / 0000-0099 / 0094.Binary Tree Inorder Traversal / README
- solution / 0000-0099 / 0095.Unique Binary Search Trees II / README
- solution / 0000-0099 / 0096.Unique Binary Search Trees / README
- solution / 0000-0099 / 0097.Interleaving String / README
- solution / 0000-0099 / 0098.Validate Binary Search Tree / README
- solution / 0000-0099 / 0099.Recover Binary Search Tree / README
- solution / 0100-0199 / 0100.Same Tree / README
- solution / 0100-0199 / 0101.Symmetric Tree / README
- solution / 0100-0199 / 0102.Binary Tree Level Order Traversal / README
- solution / 0100-0199 / 0103.Binary Tree Zigzag Level Order Traversal / README
- solution / 0100-0199 / 0104.Maximum Depth of Binary Tree / README
- solution / 0100-0199 / 0105.Construct Binary Tree from Preorder and Inorder Traversal / README
- solution / 0100-0199 / 0106.Construct Binary Tree from Inorder and Postorder Traversal / README
- solution / 0100-0199 / 0107.Binary Tree Level Order Traversal II / README
- solution / 0100-0199 / 0108.Convert Sorted Array to Binary Search Tree / README
- solution / 0100-0199 / 0109.Convert Sorted List to Binary Search Tree / README
- solution / 0100-0199 / 0110.Balanced Binary Tree / README
- solution / 0100-0199 / 0111.Minimum Depth of Binary Tree / README
- solution / 0100-0199 / 0112.Path Sum / README
- solution / 0100-0199 / 0113.Path Sum II / README
- solution / 0100-0199 / 0114.Flatten Binary Tree to Linked List / README
- solution / 0100-0199 / 0115.Distinct Subsequences / README
- solution / 0100-0199 / 0116.Populating Next Right Pointers in Each Node / README
- solution / 0100-0199 / 0117.Populating Next Right Pointers in Each Node II / README
- solution / 0100-0199 / 0118.Pascal's Triangle / README
- solution / 0100-0199 / 0119.Pascal's Triangle II / README
- solution / 0100-0199 / 0120.Triangle / README
- solution / 0100-0199 / 0121.Best Time to Buy and Sell Stock / README
- solution / 0100-0199 / 0122.Best Time to Buy and Sell Stock II / README
- solution / 0100-0199 / 0123.Best Time to Buy and Sell Stock III / README
- solution / 0100-0199 / 0124.Binary Tree Maximum Path Sum / README
- solution / 0100-0199 / 0125.Valid Palindrome / README
- solution / 0100-0199 / 0126.Word Ladder II / README
- solution / 0100-0199 / 0127.Word Ladder / README
- solution / 0100-0199 / 0128.Longest Consecutive Sequence / README
- solution / 0100-0199 / 0129.Sum Root to Leaf Numbers / README
- solution / 0100-0199 / 0130.Surrounded Regions / README
- solution / 0100-0199 / 0131.Palindrome Partitioning / README
- solution / 0100-0199 / 0132.Palindrome Partitioning II / README
- solution / 0100-0199 / 0133.Clone Graph / README
- solution / 0100-0199 / 0134.Gas Station / README
- solution / 0100-0199 / 0135.Candy / README
- solution / 0100-0199 / 0136.Single Number / README
- solution / 0100-0199 / 0137.Single Number II / README
- solution / 0100-0199 / 0138.Copy List with Random Pointer / README
- solution / 0100-0199 / 0139.Word Break / README
- solution / 0100-0199 / 0140.Word Break II / README
- solution / 0100-0199 / 0141.Linked List Cycle / README
- solution / 0100-0199 / 0142.Linked List Cycle II / README
- solution / 0100-0199 / 0143.Reorder List / README
- solution / 0100-0199 / 0144.Binary Tree Preorder Traversal / README
- solution / 0100-0199 / 0145.Binary Tree Postorder Traversal / README
- solution / 0100-0199 / 0146.LRU Cache / README
- solution / 0100-0199 / 0147.Insertion Sort List / README
- solution / 0100-0199 / 0148.Sort List / README
- solution / 0100-0199 / 0149.Max Points on a Line / README
- solution / 0100-0199 / 0150.Evaluate Reverse Polish Notation / README
- solution / 0100-0199 / 0151.Reverse Words in a String / README
- solution / 0100-0199 / 0152.Maximum Product Subarray / README
- solution / 0100-0199 / 0153.Find Minimum in Rotated Sorted Array / README
- solution / 0100-0199 / 0154.Find Minimum in Rotated Sorted Array II / README
- solution / 0100-0199 / 0155.Min Stack / README
- solution / 0100-0199 / 0156.Binary Tree Upside Down / README
- solution / 0100-0199 / 0157.Read N Characters Given Read4 / README
- solution / 0100-0199 / 0158.Read N Characters Given read4 II - Call Multiple Times / README
- solution / 0100-0199 / 0159.Longest Substring with At Most Two Distinct Characters / README
- solution / 0100-0199 / 0160.Intersection of Two Linked Lists / README
- solution / 0100-0199 / 0161.One Edit Distance / README
- solution / 0100-0199 / 0162.Find Peak Element / README
- solution / 0100-0199 / 0163.Missing Ranges / README
- solution / 0100-0199 / 0164.Maximum Gap / README
- solution / 0100-0199 / 0165.Compare Version Numbers / README
- solution / 0100-0199 / 0166.Fraction to Recurring Decimal / README
- solution / 0100-0199 / 0167.Two Sum II - Input Array Is Sorted / README
- solution / 0100-0199 / 0168.Excel Sheet Column Title / README
- solution / 0100-0199 / 0169.Majority Element / README
- solution / 0100-0199 / 0170.Two Sum III - Data structure design / README
- solution / 0100-0199 / 0171.Excel Sheet Column Number / README
- solution / 0100-0199 / 0172.Factorial Trailing Zeroes / README
- solution / 0100-0199 / 0173.Binary Search Tree Iterator / README
- solution / 0100-0199 / 0174.Dungeon Game / README
- solution / 0100-0199 / 0175.Combine Two Tables / README
- solution / 0100-0199 / 0176.Second Highest Salary / README
- solution / 0100-0199 / 0177.Nth Highest Salary / README
- solution / 0100-0199 / 0178.Rank Scores / README
- solution / 0100-0199 / 0179.Largest Number / README
- solution / 0100-0199 / 0180.Consecutive Numbers / README
- solution / 0100-0199 / 0181.Employees Earning More Than Their Managers / README
- solution / 0100-0199 / 0182.Duplicate Emails / README
- solution / 0100-0199 / 0183.Customers Who Never Order / README
- solution / 0100-0199 / 0184.Department Highest Salary / README
- solution / 0100-0199 / 0185.Department Top Three Salaries / README
- solution / 0100-0199 / 0186.Reverse Words in a String II / README
- solution / 0100-0199 / 0187.Repeated DNA Sequences / README
- solution / 0100-0199 / 0188.Best Time to Buy and Sell Stock IV / README
- solution / 0100-0199 / 0189.Rotate Array / README
- solution / 0100-0199 / 0190.Reverse Bits / README
- solution / 0100-0199 / 0191.Number of 1 Bits / README
- solution / 0100-0199 / 0192.Word Frequency / README
- solution / 0100-0199 / 0193.Valid Phone Numbers / README
- solution / 0100-0199 / 0194.Transpose File / README
- solution / 0100-0199 / 0195.Tenth Line / README
- solution / 0100-0199 / 0196.Delete Duplicate Emails / README
- solution / 0100-0199 / 0197.Rising Temperature / README
- solution / 0100-0199 / 0198.House Robber / README
- solution / 0100-0199 / 0199.Binary Tree Right Side View / README
- solution / 0200-0299 / 0200.Number of Islands / README
- solution / 0200-0299 / 0201.Bitwise AND of Numbers Range / README
- solution / 0200-0299 / 0202.Happy Number / README
- solution / 0200-0299 / 0203.Remove Linked List Elements / README
- solution / 0200-0299 / 0204.Count Primes / README
- solution / 0200-0299 / 0205.Isomorphic Strings / README
- solution / 0200-0299 / 0206.Reverse Linked List / README
- solution / 0200-0299 / 0207.Course Schedule / README
- solution / 0200-0299 / 0208.Implement Trie (Prefix Tree) / README
- solution / 0200-0299 / 0209.Minimum Size Subarray Sum / README
- solution / 0200-0299 / 0210.Course Schedule II / README
- solution / 0200-0299 / 0211.Design Add and Search Words Data Structure / README
- solution / 0200-0299 / 0212.Word Search II / README
- solution / 0200-0299 / 0213.House Robber II / README
- solution / 0200-0299 / 0214.Shortest Palindrome / README
- solution / 0200-0299 / 0215.Kth Largest Element in an Array / README
- solution / 0200-0299 / 0216.Combination Sum III / README
- solution / 0200-0299 / 0217.Contains Duplicate / README
- solution / 0200-0299 / 0218.The Skyline Problem / README
- solution / 0200-0299 / 0219.Contains Duplicate II / README
- solution / 0200-0299 / 0220.Contains Duplicate III / README
- solution / 0200-0299 / 0221.Maximal Square / README
- solution / 0200-0299 / 0222.Count Complete Tree Nodes / README
- solution / 0200-0299 / 0223.Rectangle Area / README
- solution / 0200-0299 / 0224.Basic Calculator / README
- solution / 0200-0299 / 0225.Implement Stack using Queues / README
- solution / 0200-0299 / 0226.Invert Binary Tree / README
- solution / 0200-0299 / 0227.Basic Calculator II / README
- solution / 0200-0299 / 0228.Summary Ranges / README
- solution / 0200-0299 / 0229.Majority Element II / README
- solution / 0200-0299 / 0230.Kth Smallest Element in a BST / README
- solution / 0200-0299 / 0231.Power of Two / README
- solution / 0200-0299 / 0232.Implement Queue using Stacks / README
- solution / 0200-0299 / 0233.Number of Digit One / README
- solution / 0200-0299 / 0234.Palindrome Linked List / README
- solution / 0200-0299 / 0235.Lowest Common Ancestor of a Binary Search Tree / README
- solution / 0200-0299 / 0236.Lowest Common Ancestor of a Binary Tree / README
- solution / 0200-0299 / 0237.Delete Node in a Linked List / README
- solution / 0200-0299 / 0238.Product of Array Except Self / README
- solution / 0200-0299 / 0239.Sliding Window Maximum / README
- solution / 0200-0299 / 0240.Search a 2D Matrix II / README
- solution / 0200-0299 / 0241.Different Ways to Add Parentheses / README
- solution / 0200-0299 / 0242.Valid Anagram / README
- solution / 0200-0299 / 0243.Shortest Word Distance / README
- solution / 0200-0299 / 0244.Shortest Word Distance II / README
- solution / 0200-0299 / 0245.Shortest Word Distance III / README
- solution / 0200-0299 / 0246.Strobogrammatic Number / README
- solution / 0200-0299 / 0247.Strobogrammatic Number II / README
- solution / 0200-0299 / 0248.Strobogrammatic Number III / README
- solution / 0200-0299 / 0249.Group Shifted Strings / README
- solution / 0200-0299 / 0250.Count Univalue Subtrees / README
- solution / 0200-0299 / 0251.Flatten 2D Vector / README
- solution / 0200-0299 / 0252.Meeting Rooms / README
- solution / 0200-0299 / 0253.Meeting Rooms II / README
- solution / 0200-0299 / 0254.Factor Combinations / README
- solution / 0200-0299 / 0255.Verify Preorder Sequence in Binary Search Tree / README
- solution / 0200-0299 / 0256.Paint House / README
- solution / 0200-0299 / 0257.Binary Tree Paths / README
- solution / 0200-0299 / 0258.Add Digits / README
- solution / 0200-0299 / 0259.3Sum Smaller / README
- solution / 0200-0299 / 0260.Single Number III / README
- solution / 0200-0299 / 0261.Graph Valid Tree / README
- solution / 0200-0299 / 0262.Trips and Users / README
- solution / 0200-0299 / 0263.Ugly Number / README
- solution / 0200-0299 / 0264.Ugly Number II / README
- solution / 0200-0299 / 0265.Paint House II / README
- solution / 0200-0299 / 0266.Palindrome Permutation / README
- solution / 0200-0299 / 0267.Palindrome Permutation II / README
- solution / 0200-0299 / 0268.Missing Number / README
- solution / 0200-0299 / 0269.Alien Dictionary / README
- solution / 0200-0299 / 0270.Closest Binary Search Tree Value / README
- solution / 0200-0299 / 0271.Encode and Decode Strings / README
- solution / 0200-0299 / 0272.Closest Binary Search Tree Value II / README
- solution / 0200-0299 / 0273.Integer to English Words / README
- solution / 0200-0299 / 0274.H-Index / README
- solution / 0200-0299 / 0275.H-Index II / README
- solution / 0200-0299 / 0276.Paint Fence / README
- solution / 0200-0299 / 0277.Find the Celebrity / README
- solution / 0200-0299 / 0278.First Bad Version / README
- solution / 0200-0299 / 0279.Perfect Squares / README
- solution / 0200-0299 / 0280.Wiggle Sort / README
- solution / 0200-0299 / 0281.Zigzag Iterator / README
- solution / 0200-0299 / 0282.Expression Add Operators / README
- solution / 0200-0299 / 0283.Move Zeroes / README
- solution / 0200-0299 / 0284.Peeking Iterator / README
- solution / 0200-0299 / 0285.Inorder Successor in BST / README
- solution / 0200-0299 / 0286.Walls and Gates / README
- solution / 0200-0299 / 0287.Find the Duplicate Number / README
- solution / 0200-0299 / 0288.Unique Word Abbreviation / README
- solution / 0200-0299 / 0289.Game of Life / README
- solution / 0200-0299 / 0290.Word Pattern / README
- solution / 0200-0299 / 0291.Word Pattern II / README
- solution / 0200-0299 / 0292.Nim Game / README
- solution / 0200-0299 / 0293.Flip Game / README
- solution / 0200-0299 / 0294.Flip Game II / README
- solution / 0200-0299 / 0295.Find Median from Data Stream / README
- solution / 0200-0299 / 0296.Best Meeting Point / README
- solution / 0200-0299 / 0297.Serialize and Deserialize Binary Tree / README
- solution / 0200-0299 / 0298.Binary Tree Longest Consecutive Sequence / README
- solution / 0200-0299 / 0299.Bulls and Cows / README
- solution / 0300-0399 / 0300.Longest Increasing Subsequence / README
- solution / 0300-0399 / 0301.Remove Invalid Parentheses / README
- solution / 0300-0399 / 0302.Smallest Rectangle Enclosing Black Pixels / README
- solution / 0300-0399 / 0303.Range Sum Query - Immutable / README
- solution / 0300-0399 / 0304.Range Sum Query 2D - Immutable / README
- solution / 0300-0399 / 0305.Number of Islands II / README
- solution / 0300-0399 / 0306.Additive Number / README
- solution / 0300-0399 / 0307.Range Sum Query - Mutable / README
- solution / 0300-0399 / 0308.Range Sum Query 2D - Mutable / README
- solution / 0300-0399 / 0309.Best Time to Buy and Sell Stock with Cooldown / README
- solution / 0300-0399 / 0310.Minimum Height Trees / README
- solution / 0300-0399 / 0311.Sparse Matrix Multiplication / README
- solution / 0300-0399 / 0312.Burst Balloons / README
- solution / 0300-0399 / 0313.Super Ugly Number / README
- solution / 0300-0399 / 0314.Binary Tree Vertical Order Traversal / README
- solution / 0300-0399 / 0315.Count of Smaller Numbers After Self / README
- solution / 0300-0399 / 0316.Remove Duplicate Letters / README
- solution / 0300-0399 / 0317.Shortest Distance from All Buildings / README
- solution / 0300-0399 / 0318.Maximum Product of Word Lengths / README
- solution / 0300-0399 / 0319.Bulb Switcher / README
- solution / 0300-0399 / 0320.Generalized Abbreviation / README
- solution / 0300-0399 / 0321.Create Maximum Number / README
- solution / 0300-0399 / 0322.Coin Change / README
- solution / 0300-0399 / 0323.Number of Connected Components in an Undirected Graph / README
- solution / 0300-0399 / 0324.Wiggle Sort II / README
- solution / 0300-0399 / 0325.Maximum Size Subarray Sum Equals k / README
- solution / 0300-0399 / 0326.Power of Three / README
- solution / 0300-0399 / 0327.Count of Range Sum / README
- solution / 0300-0399 / 0328.Odd Even Linked List / README
- solution / 0300-0399 / 0329.Longest Increasing Path in a Matrix / README
- solution / 0300-0399 / 0330.Patching Array / README
- solution / 0300-0399 / 0331.Verify Preorder Serialization of a Binary Tree / README
- solution / 0300-0399 / 0332.Reconstruct Itinerary / README
- solution / 0300-0399 / 0333.Largest BST Subtree / README
- solution / 0300-0399 / 0334.Increasing Triplet Subsequence / README
- solution / 0300-0399 / 0335.Self Crossing / README
- solution / 0300-0399 / 0336.Palindrome Pairs / README
- solution / 0300-0399 / 0337.House Robber III / README
- solution / 0300-0399 / 0338.Counting Bits / README
- solution / 0300-0399 / 0339.Nested List Weight Sum / README
- solution / 0300-0399 / 0340.Longest Substring with At Most K Distinct Characters / README
- solution / 0300-0399 / 0341.Flatten Nested List Iterator / README
- solution / 0300-0399 / 0342.Power of Four / README
- solution / 0300-0399 / 0343.Integer Break / README
- solution / 0300-0399 / 0344.Reverse String / README
- solution / 0300-0399 / 0345.Reverse Vowels of a String / README
- solution / 0300-0399 / 0346.Moving Average from Data Stream / README
- solution / 0300-0399 / 0347.Top K Frequent Elements / README
- solution / 0300-0399 / 0348.Design Tic-Tac-Toe / README
- solution / 0300-0399 / 0349.Intersection of Two Arrays / README
- solution / 0300-0399 / 0350.Intersection of Two Arrays II / README
- solution / 0300-0399 / 0351.Android Unlock Patterns / README
- solution / 0300-0399 / 0352.Data Stream as Disjoint Intervals / README
- solution / 0300-0399 / 0353.Design Snake Game / README
- solution / 0300-0399 / 0354.Russian Doll Envelopes / README
- solution / 0300-0399 / 0355.Design Twitter / README
- solution / 0300-0399 / 0356.Line Reflection / README
- solution / 0300-0399 / 0357.Count Numbers with Unique Digits / README
- solution / 0300-0399 / 0358.Rearrange String k Distance Apart / README
- solution / 0300-0399 / 0359.Logger Rate Limiter / README
- solution / 0300-0399 / 0360.Sort Transformed Array / README
- solution / 0300-0399 / 0361.Bomb Enemy / README
- solution / 0300-0399 / 0362.Design Hit Counter / README
- solution / 0300-0399 / 0363.Max Sum of Rectangle No Larger Than K / README
- solution / 0300-0399 / 0364.Nested List Weight Sum II / README
- solution / 0300-0399 / 0365.Water and Jug Problem / README
- solution / 0300-0399 / 0366.Find Leaves of Binary Tree / README
- solution / 0300-0399 / 0367.Valid Perfect Square / README
- solution / 0300-0399 / 0368.Largest Divisible Subset / README
- solution / 0300-0399 / 0369.Plus One Linked List / README
- solution / 0300-0399 / 0370.Range Addition / README
- solution / 0300-0399 / 0371.Sum of Two Integers / README
- solution / 0300-0399 / 0372.Super Pow / README
- solution / 0300-0399 / 0373.Find K Pairs with Smallest Sums / README
- solution / 0300-0399 / 0374.Guess Number Higher or Lower / README
- solution / 0300-0399 / 0375.Guess Number Higher or Lower II / README
- solution / 0300-0399 / 0376.Wiggle Subsequence / README
- solution / 0300-0399 / 0377.Combination Sum IV / README
- solution / 0300-0399 / 0378.Kth Smallest Element in a Sorted Matrix / README
- solution / 0300-0399 / 0379.Design Phone Directory / README
- solution / 0300-0399 / 0380.Insert Delete GetRandom O(1) / README
- solution / 0300-0399 / 0381.Insert Delete GetRandom O(1) - Duplicates allowed / README
- solution / 0300-0399 / 0382.Linked List Random Node / README
- solution / 0300-0399 / 0383.Ransom Note / README
- solution / 0300-0399 / 0384.Shuffle an Array / README
- solution / 0300-0399 / 0385.Mini Parser / README
- solution / 0300-0399 / 0386.Lexicographical Numbers / README
- solution / 0300-0399 / 0387.First Unique Character in a String / README
- solution / 0300-0399 / 0388.Longest Absolute File Path / README
- solution / 0300-0399 / 0389.Find the Difference / README
- solution / 0300-0399 / 0390.Elimination Game / README
- solution / 0300-0399 / 0391.Perfect Rectangle / README
- solution / 0300-0399 / 0392.Is Subsequence / README
- solution / 0300-0399 / 0393.UTF-8 Validation / README
- solution / 0300-0399 / 0394.Decode String / README
- solution / 0300-0399 / 0395.Longest Substring with At Least K Repeating Characters / README
- solution / 0300-0399 / 0396.Rotate Function / README
- solution / 0300-0399 / 0397.Integer Replacement / README
- solution / 0300-0399 / 0398.Random Pick Index / README
- solution / 0300-0399 / 0399.Evaluate Division / README
- solution / 0400-0499 / 0400.Nth Digit / README
- solution / 0400-0499 / 0401.Binary Watch / README
- solution / 0400-0499 / 0402.Remove K Digits / README
- solution / 0400-0499 / 0403.Frog Jump / README
- solution / 0400-0499 / 0404.Sum of Left Leaves / README
- solution / 0400-0499 / 0405.Convert a Number to Hexadecimal / README
- solution / 0400-0499 / 0406.Queue Reconstruction by Height / README
- solution / 0400-0499 / 0407.Trapping Rain Water II / README
- solution / 0400-0499 / 0408.Valid Word Abbreviation / README
- solution / 0400-0499 / 0409.Longest Palindrome / README
- solution / 0400-0499 / 0410.Split Array Largest Sum / README
- solution / 0400-0499 / 0411.Minimum Unique Word Abbreviation / README
- solution / 0400-0499 / 0412.Fizz Buzz / README
- solution / 0400-0499 / 0413.Arithmetic Slices / README
- solution / 0400-0499 / 0414.Third Maximum Number / README
- solution / 0400-0499 / 0415.Add Strings / README
- solution / 0400-0499 / 0416.Partition Equal Subset Sum / README
- solution / 0400-0499 / 0417.Pacific Atlantic Water Flow / README
- solution / 0400-0499 / 0418.Sentence Screen Fitting / README
- solution / 0400-0499 / 0419.Battleships in a Board / README
- solution / 0400-0499 / 0420.Strong Password Checker / README
- solution / 0400-0499 / 0421.Maximum XOR of Two Numbers in an Array / README
- solution / 0400-0499 / 0422.Valid Word Square / README
- solution / 0400-0499 / 0423.Reconstruct Original Digits from English / README
- solution / 0400-0499 / 0424.Longest Repeating Character Replacement / README
- solution / 0400-0499 / 0425.Word Squares / README
- solution / 0400-0499 / 0426.Convert Binary Search Tree to Sorted Doubly Linked List / README
- solution / 0400-0499 / 0427.Construct Quad Tree / README
- solution / 0400-0499 / 0428.Serialize and Deserialize N-ary Tree / README
- solution / 0400-0499 / 0429.N-ary Tree Level Order Traversal / README
- solution / 0400-0499 / 0430.Flatten a Multilevel Doubly Linked List / README
- solution / 0400-0499 / 0431.Encode N-ary Tree to Binary Tree / README
- solution / 0400-0499 / 0432.All O`one Data Structure / README
- solution / 0400-0499 / 0433.Minimum Genetic Mutation / README
- solution / 0400-0499 / 0434.Number of Segments in a String / README
- solution / 0400-0499 / 0435.Non-overlapping Intervals / README
- solution / 0400-0499 / 0436.Find Right Interval / README
- solution / 0400-0499 / 0437.Path Sum III / README
- solution / 0400-0499 / 0438.Find All Anagrams in a String / README
- solution / 0400-0499 / 0439.Ternary Expression Parser / README
- solution / 0400-0499 / 0440.K-th Smallest in Lexicographical Order / README
- solution / 0400-0499 / 0441.Arranging Coins / README
- solution / 0400-0499 / 0442.Find All Duplicates in an Array / README
- solution / 0400-0499 / 0443.String Compression / README
- solution / 0400-0499 / 0444.Sequence Reconstruction / README
- solution / 0400-0499 / 0445.Add Two Numbers II / README
- solution / 0400-0499 / 0446.Arithmetic Slices II - Subsequence / README
- solution / 0400-0499 / 0447.Number of Boomerangs / README
- solution / 0400-0499 / 0448.Find All Numbers Disappeared in an Array / README
- solution / 0400-0499 / 0449.Serialize and Deserialize BST / README
- solution / 0400-0499 / 0450.Delete Node in a BST / README
- solution / 0400-0499 / 0451.Sort Characters By Frequency / README
- solution / 0400-0499 / 0452.Minimum Number of Arrows to Burst Balloons / README
- solution / 0400-0499 / 0453.Minimum Moves to Equal Array Elements / README
- solution / 0400-0499 / 0454.4Sum II / README
- solution / 0400-0499 / 0455.Assign Cookies / README
- solution / 0400-0499 / 0456.132 Pattern / README
- solution / 0400-0499 / 0457.Circular Array Loop / README
- solution / 0400-0499 / 0458.Poor Pigs / README
- solution / 0400-0499 / 0459.Repeated Substring Pattern / README
- solution / 0400-0499 / 0460.LFU Cache / README
- solution / 0400-0499 / 0461.Hamming Distance / README
- solution / 0400-0499 / 0462.Minimum Moves to Equal Array Elements II / README
- solution / 0400-0499 / 0463.Island Perimeter / README
- solution / 0400-0499 / 0464.Can I Win / README
- solution / 0400-0499 / 0465.Optimal Account Balancing / README
- solution / 0400-0499 / 0466.Count The Repetitions / README
- solution / 0400-0499 / 0467.Unique Substrings in Wraparound String / README
- solution / 0400-0499 / 0468.Validate IP Address / README
- solution / 0400-0499 / 0469.Convex Polygon / README
- solution / 0400-0499 / 0470.Implement Rand10() Using Rand7() / README
- solution / 0400-0499 / 0471.Encode String with Shortest Length / README
- solution / 0400-0499 / 0472.Concatenated Words / README
- solution / 0400-0499 / 0473.Matchsticks to Square / README
- solution / 0400-0499 / 0474.Ones and Zeroes / README
- solution / 0400-0499 / 0475.Heaters / README
- solution / 0400-0499 / 0476.Number Complement / README
- solution / 0400-0499 / 0477.Total Hamming Distance / README
- solution / 0400-0499 / 0478.Generate Random Point in a Circle / README
- solution / 0400-0499 / 0479.Largest Palindrome Product / README
- solution / 0400-0499 / 0480.Sliding Window Median / README
- solution / 0400-0499 / 0481.Magical String / README
- solution / 0400-0499 / 0482.License Key Formatting / README
- solution / 0400-0499 / 0483.Smallest Good Base / README
- solution / 0400-0499 / 0484.Find Permutation / README
- solution / 0400-0499 / 0485.Max Consecutive Ones / README
- solution / 0400-0499 / 0486.Predict the Winner / README
- solution / 0400-0499 / 0487.Max Consecutive Ones II / README
- solution / 0400-0499 / 0488.Zuma Game / README
- solution / 0400-0499 / 0489.Robot Room Cleaner / README
- solution / 0400-0499 / 0490.The Maze / README
- solution / 0400-0499 / 0491.Non-decreasing Subsequences / README
- solution / 0400-0499 / 0492.Construct the Rectangle / README
- solution / 0400-0499 / 0493.Reverse Pairs / README
- solution / 0400-0499 / 0494.Target Sum / README
- solution / 0400-0499 / 0495.Teemo Attacking / README
- solution / 0400-0499 / 0496.Next Greater Element I / README
- solution / 0400-0499 / 0497.Random Point in Non-overlapping Rectangles / README
- solution / 0400-0499 / 0498.Diagonal Traverse / README
- solution / 0400-0499 / 0499.The Maze III / README
- solution / 0500-0599 / 0500.Keyboard Row / README
- solution / 0500-0599 / 0501.Find Mode in Binary Search Tree / README
- solution / 0500-0599 / 0502.IPO / README
- solution / 0500-0599 / 0503.Next Greater Element II / README
- solution / 0500-0599 / 0504.Base 7 / README
- solution / 0500-0599 / 0505.The Maze II / README
- solution / 0500-0599 / 0506.Relative Ranks / README
- solution / 0500-0599 / 0507.Perfect Number / README
- solution / 0500-0599 / 0508.Most Frequent Subtree Sum / README
- solution / 0500-0599 / 0509.Fibonacci Number / README
- solution / 0500-0599 / 0510.Inorder Successor in BST II / README
- solution / 0500-0599 / 0511.Game Play Analysis I / README
- solution / 0500-0599 / 0512.Game Play Analysis II / README
- solution / 0500-0599 / 0513.Find Bottom Left Tree Value / README
- solution / 0500-0599 / 0514.Freedom Trail / README
- solution / 0500-0599 / 0515.Find Largest Value in Each Tree Row / README
- solution / 0500-0599 / 0516.Longest Palindromic Subsequence / README
- solution / 0500-0599 / 0517.Super Washing Machines / README
- solution / 0500-0599 / 0518.Coin Change II / README
- solution / 0500-0599 / 0519.Random Flip Matrix / README
- solution / 0500-0599 / 0520.Detect Capital / README
- solution / 0500-0599 / 0521.Longest Uncommon Subsequence I / README
- solution / 0500-0599 / 0522.Longest Uncommon Subsequence II / README
- solution / 0500-0599 / 0523.Continuous Subarray Sum / README
- solution / 0500-0599 / 0524.Longest Word in Dictionary through Deleting / README
- solution / 0500-0599 / 0525.Contiguous Array / README
- solution / 0500-0599 / 0526.Beautiful Arrangement / README
- solution / 0500-0599 / 0527.Word Abbreviation / README
- solution / 0500-0599 / 0528.Random Pick with Weight / README
- solution / 0500-0599 / 0529.Minesweeper / README
- solution / 0500-0599 / 0530.Minimum Absolute Difference in BST / README
- solution / 0500-0599 / 0531.Lonely Pixel I / README
- solution / 0500-0599 / 0532.K-diff Pairs in an Array / README
- solution / 0500-0599 / 0533.Lonely Pixel II / README
- solution / 0500-0599 / 0534.Game Play Analysis III / README
- solution / 0500-0599 / 0535.Encode and Decode TinyURL / README
- solution / 0500-0599 / 0536.Construct Binary Tree from String / README
- solution / 0500-0599 / 0537.Complex Number Multiplication / README
- solution / 0500-0599 / 0538.Convert BST to Greater Tree / README
- solution / 0500-0599 / 0539.Minimum Time Difference / README
- solution / 0500-0599 / 0540.Single Element in a Sorted Array / README
- solution / 0500-0599 / 0541.Reverse String II / README
- solution / 0500-0599 / 0542.01 Matrix / README
- solution / 0500-0599 / 0543.Diameter of Binary Tree / README
- solution / 0500-0599 / 0544.Output Contest Matches / README
- solution / 0500-0599 / 0545.Boundary of Binary Tree / README
- solution / 0500-0599 / 0546.Remove Boxes / README
- solution / 0500-0599 / 0547.Number of Provinces / README
- solution / 0500-0599 / 0548.Split Array with Equal Sum / README
- solution / 0500-0599 / 0549.Binary Tree Longest Consecutive Sequence II / README
- solution / 0500-0599 / 0550.Game Play Analysis IV / README
- solution / 0500-0599 / 0551.Student Attendance Record I / README
- solution / 0500-0599 / 0552.Student Attendance Record II / README
- solution / 0500-0599 / 0553.Optimal Division / README
- solution / 0500-0599 / 0554.Brick Wall / README
- solution / 0500-0599 / 0555.Split Concatenated Strings / README
- solution / 0500-0599 / 0556.Next Greater Element III / README
- solution / 0500-0599 / 0557.Reverse Words in a String III / README
- solution / 0500-0599 / 0558.Logical OR of Two Binary Grids Represented as Quad-Trees / README
- solution / 0500-0599 / 0559.Maximum Depth of N-ary Tree / README
- solution / 0500-0599 / 0560.Subarray Sum Equals K / README
- solution / 0500-0599 / 0561.Array Partition / README
- solution / 0500-0599 / 0562.Longest Line of Consecutive One in Matrix / README
- solution / 0500-0599 / 0563.Binary Tree Tilt / README
- solution / 0500-0599 / 0564.Find the Closest Palindrome / README
- solution / 0500-0599 / 0565.Array Nesting / README
- solution / 0500-0599 / 0566.Reshape the Matrix / README
- solution / 0500-0599 / 0567.Permutation in String / README
- solution / 0500-0599 / 0568.Maximum Vacation Days / README
- solution / 0500-0599 / 0569.Median Employee Salary / README
- solution / 0500-0599 / 0570.Managers with at Least 5 Direct Reports / README
- solution / 0500-0599 / 0571.Find Median Given Frequency of Numbers / README
- solution / 0500-0599 / 0572.Subtree of Another Tree / README
- solution / 0500-0599 / 0573.Squirrel Simulation / README
- solution / 0500-0599 / 0574.Winning Candidate / README
- solution / 0500-0599 / 0575.Distribute Candies / README
- solution / 0500-0599 / 0576.Out of Boundary Paths / README
- solution / 0500-0599 / 0577.Employee Bonus / README
- solution / 0500-0599 / 0578.Get Highest Answer Rate Question / README
- solution / 0500-0599 / 0579.Find Cumulative Salary of an Employee / README
- solution / 0500-0599 / 0580.Count Student Number in Departments / README
- solution / 0500-0599 / 0581.Shortest Unsorted Continuous Subarray / README
- solution / 0500-0599 / 0582.Kill Process / README
- solution / 0500-0599 / 0583.Delete Operation for Two Strings / README
- solution / 0500-0599 / 0584.Find Customer Referee / README
- solution / 0500-0599 / 0585.Investments in 2016 / README
- solution / 0500-0599 / 0586.Customer Placing the Largest Number of Orders / README
- solution / 0500-0599 / 0587.Erect the Fence / README
- solution / 0500-0599 / 0588.Design In-Memory File System / README
- solution / 0500-0599 / 0589.N-ary Tree Preorder Traversal / README
- solution / 0500-0599 / 0590.N-ary Tree Postorder Traversal / README
- solution / 0500-0599 / 0591.Tag Validator / README
- solution / 0500-0599 / 0592.Fraction Addition and Subtraction / README
- solution / 0500-0599 / 0593.Valid Square / README
- solution / 0500-0599 / 0594.Longest Harmonious Subsequence / README
- solution / 0500-0599 / 0595.Big Countries / README
- solution / 0500-0599 / 0596.Classes More Than 5 Students / README
- solution / 0500-0599 / 0597.Friend Requests I Overall Acceptance Rate / README
- solution / 0500-0599 / 0598.Range Addition II / README
- solution / 0500-0599 / 0599.Minimum Index Sum of Two Lists / README
- solution / 0600-0699 / 0600.Non-negative Integers without Consecutive Ones / README
- solution / 0600-0699 / 0601.Human Traffic of Stadium / README
- solution / 0600-0699 / 0602.Friend Requests II Who Has the Most Friends / README
- solution / 0600-0699 / 0603.Consecutive Available Seats / README
- solution / 0600-0699 / 0604.Design Compressed String Iterator / README
- solution / 0600-0699 / 0605.Can Place Flowers / README
- solution / 0600-0699 / 0606.Construct String from Binary Tree / README
- solution / 0600-0699 / 0607.Sales Person / README
- solution / 0600-0699 / 0608.Tree Node / README
- solution / 0600-0699 / 0609.Find Duplicate File in System / README
- solution / 0600-0699 / 0610.Triangle Judgement / README
- solution / 0600-0699 / 0611.Valid Triangle Number / README
- solution / 0600-0699 / 0612.Shortest Distance in a Plane / README
- solution / 0600-0699 / 0613.Shortest Distance in a Line / README
- solution / 0600-0699 / 0614.Second Degree Follower / README
- solution / 0600-0699 / 0615.Average Salary Departments VS Company / README
- solution / 0600-0699 / 0616.Add Bold Tag in String / README
- solution / 0600-0699 / 0617.Merge Two Binary Trees / README
- solution / 0600-0699 / 0618.Students Report By Geography / README
- solution / 0600-0699 / 0619.Biggest Single Number / README
- solution / 0600-0699 / 0620.Not Boring Movies / README
- solution / 0600-0699 / 0621.Task Scheduler / README
- solution / 0600-0699 / 0622.Design Circular Queue / README
- solution / 0600-0699 / 0623.Add One Row to Tree / README
- solution / 0600-0699 / 0624.Maximum Distance in Arrays / README
- solution / 0600-0699 / 0625.Minimum Factorization / README
- solution / 0600-0699 / 0626.Exchange Seats / README
- solution / 0600-0699 / 0627.Swap Salary / README
- solution / 0600-0699 / 0628.Maximum Product of Three Numbers / README
- solution / 0600-0699 / 0629.K Inverse Pairs Array / README
- solution / 0600-0699 / 0630.Course Schedule III / README
- solution / 0600-0699 / 0631.Design Excel Sum Formula / README
- solution / 0600-0699 / 0632.Smallest Range Covering Elements from K Lists / README
- solution / 0600-0699 / 0633.Sum of Square Numbers / README
- solution / 0600-0699 / 0634.Find the Derangement of An Array / README
- solution / 0600-0699 / 0635.Design Log Storage System / README
- solution / 0600-0699 / 0636.Exclusive Time of Functions / README
- solution / 0600-0699 / 0637.Average of Levels in Binary Tree / README
- solution / 0600-0699 / 0638.Shopping Offers / README
- solution / 0600-0699 / 0639.Decode Ways II / README
- solution / 0600-0699 / 0640.Solve the Equation / README
- solution / 0600-0699 / 0641.Design Circular Deque / README
- solution / 0600-0699 / 0642.Design Search Autocomplete System / README
- solution / 0600-0699 / 0643.Maximum Average Subarray I / README
- solution / 0600-0699 / 0644.Maximum Average Subarray II / README
- solution / 0600-0699 / 0645.Set Mismatch / README
- solution / 0600-0699 / 0646.Maximum Length of Pair Chain / README
- solution / 0600-0699 / 0647.Palindromic Substrings / README
- solution / 0600-0699 / 0648.Replace Words / README
- solution / 0600-0699 / 0649.Dota2 Senate / README
- solution / 0600-0699 / 0650.2 Keys Keyboard / README
- solution / 0600-0699 / 0651.4 Keys Keyboard / README
- solution / 0600-0699 / 0652.Find Duplicate Subtrees / README
- solution / 0600-0699 / 0653.Two Sum IV - Input is a BST / README
- solution / 0600-0699 / 0654.Maximum Binary Tree / README
- solution / 0600-0699 / 0655.Print Binary Tree / README
- solution / 0600-0699 / 0656.Coin Path / README
- solution / 0600-0699 / 0657.Robot Return to Origin / README
- solution / 0600-0699 / 0658.Find K Closest Elements / README
- solution / 0600-0699 / 0659.Split Array into Consecutive Subsequences / README
- solution / 0600-0699 / 0660.Remove 9 / README
- solution / 0600-0699 / 0661.Image Smoother / README
- solution / 0600-0699 / 0662.Maximum Width of Binary Tree / README
- solution / 0600-0699 / 0663.Equal Tree Partition / README
- solution / 0600-0699 / 0664.Strange Printer / README
- solution / 0600-0699 / 0665.Non-decreasing Array / README
- solution / 0600-0699 / 0666.Path Sum IV / README
- solution / 0600-0699 / 0667.Beautiful Arrangement II / README
- solution / 0600-0699 / 0668.Kth Smallest Number in Multiplication Table / README
- solution / 0600-0699 / 0669.Trim a Binary Search Tree / README
- solution / 0600-0699 / 0670.Maximum Swap / README
- solution / 0600-0699 / 0671.Second Minimum Node In a Binary Tree / README
- solution / 0600-0699 / 0672.Bulb Switcher II / README
- solution / 0600-0699 / 0673.Number of Longest Increasing Subsequence / README
- solution / 0600-0699 / 0674.Longest Continuous Increasing Subsequence / README
- solution / 0600-0699 / 0675.Cut Off Trees for Golf Event / README
- solution / 0600-0699 / 0676.Implement Magic Dictionary / README
- solution / 0600-0699 / 0677.Map Sum Pairs / README
- solution / 0600-0699 / 0678.Valid Parenthesis String / README
- solution / 0600-0699 / 0679.24 Game / README
- solution / 0600-0699 / 0680.Valid Palindrome II / README
- solution / 0600-0699 / 0681.Next Closest Time / README
- solution / 0600-0699 / 0682.Baseball Game / README
- solution / 0600-0699 / 0683.K Empty Slots / README
- solution / 0600-0699 / 0684.Redundant Connection / README
- solution / 0600-0699 / 0685.Redundant Connection II / README
- solution / 0600-0699 / 0686.Repeated String Match / README
- solution / 0600-0699 / 0687.Longest Univalue Path / README
- solution / 0600-0699 / 0688.Knight Probability in Chessboard / README
- solution / 0600-0699 / 0689.Maximum Sum of 3 Non-Overlapping Subarrays / README
- solution / 0600-0699 / 0690.Employee Importance / README
- solution / 0600-0699 / 0691.Stickers to Spell Word / README
- solution / 0600-0699 / 0692.Top K Frequent Words / README
- solution / 0600-0699 / 0693.Binary Number with Alternating Bits / README
- solution / 0600-0699 / 0694.Number of Distinct Islands / README
- solution / 0600-0699 / 0695.Max Area of Island / README
- solution / 0600-0699 / 0696.Count Binary Substrings / README
- solution / 0600-0699 / 0697.Degree of an Array / README
- solution / 0600-0699 / 0698.Partition to K Equal Sum Subsets / README
- solution / 0600-0699 / 0699.Falling Squares / README
- solution / 0700-0799 / 0700.Search in a Binary Search Tree / README
- solution / 0700-0799 / 0701.Insert into a Binary Search Tree / README
- solution / 0700-0799 / 0702.Search in a Sorted Array of Unknown Size / README
- solution / 0700-0799 / 0703.Kth Largest Element in a Stream / README
- solution / 0700-0799 / 0704.Binary Search / README
- solution / 0700-0799 / 0705.Design HashSet / README
- solution / 0700-0799 / 0706.Design HashMap / README
- solution / 0700-0799 / 0707.Design Linked List / README
- solution / 0700-0799 / 0708.Insert into a Sorted Circular Linked List / README
- solution / 0700-0799 / 0709.To Lower Case / README
- solution / 0700-0799 / 0710.Random Pick with Blacklist / README
- solution / 0700-0799 / 0711.Number of Distinct Islands II / README
- solution / 0700-0799 / 0712.Minimum ASCII Delete Sum for Two Strings / README
- solution / 0700-0799 / 0713.Subarray Product Less Than K / README
- solution / 0700-0799 / 0714.Best Time to Buy and Sell Stock with Transaction Fee / README
- solution / 0700-0799 / 0715.Range Module / README
- solution / 0700-0799 / 0716.Max Stack / README
- solution / 0700-0799 / 0717.1-bit and 2-bit Characters / README
- solution / 0700-0799 / 0718.Maximum Length of Repeated Subarray / README
- solution / 0700-0799 / 0719.Find K-th Smallest Pair Distance / README
- solution / 0700-0799 / 0720.Longest Word in Dictionary / README
- solution / 0700-0799 / 0721.Accounts Merge / README
- solution / 0700-0799 / 0722.Remove Comments / README
- solution / 0700-0799 / 0722.Remove Comments / README
- solution / 0700-0799 / 0723.Candy Crush / README
- solution / 0700-0799 / 0724.Find Pivot Index / README
- solution / 0700-0799 / 0725.Split Linked List in Parts / README
- solution / 0700-0799 / 0726.Number of Atoms / README
- solution / 0700-0799 / 0727.Minimum Window Subsequence / README
- solution / 0700-0799 / 0728.Self Dividing Numbers / README
- solution / 0700-0799 / 0729.My Calendar I / README
- solution / 0700-0799 / 0730.Count Different Palindromic Subsequences / README
- solution / 0700-0799 / 0731.My Calendar II / README
- solution / 0700-0799 / 0732.My Calendar III / README
- solution / 0700-0799 / 0733.Flood Fill / README
- solution / 0700-0799 / 0734.Sentence Similarity / README
- solution / 0700-0799 / 0735.Asteroid Collision / README
- solution / 0700-0799 / 0736.Parse Lisp Expression / README
- solution / 0700-0799 / 0737.Sentence Similarity II / README
- solution / 0700-0799 / 0738.Monotone Increasing Digits / README
- solution / 0700-0799 / 0739.Daily Temperatures / README
- solution / 0700-0799 / 0740.Delete and Earn / README
- solution / 0700-0799 / 0741.Cherry Pickup / README
- solution / 0700-0799 / 0742.Closest Leaf in a Binary Tree / README
- solution / 0700-0799 / 0743.Network Delay Time / README
- solution / 0700-0799 / 0744.Find Smallest Letter Greater Than Target / README
- solution / 0700-0799 / 0745.Prefix and Suffix Search / README
- solution / 0700-0799 / 0746.Min Cost Climbing Stairs / README
- solution / 0700-0799 / 0747.Largest Number At Least Twice of Others / README
- solution / 0700-0799 / 0748.Shortest Completing Word / README
- solution / 0700-0799 / 0749.Contain Virus / README
- solution / 0700-0799 / 0750.Number Of Corner Rectangles / README
- solution / 0700-0799 / 0751.IP to CIDR / README
- solution / 0700-0799 / 0752.Open the Lock / README
- solution / 0700-0799 / 0753.Cracking the Safe / README
- solution / 0700-0799 / 0754.Reach a Number / README
- solution / 0700-0799 / 0755.Pour Water / README
- solution / 0700-0799 / 0756.Pyramid Transition Matrix / README
- solution / 0700-0799 / 0757.Set Intersection Size At Least Two / README
- solution / 0700-0799 / 0758.Bold Words in String / README
- solution / 0700-0799 / 0759.Employee Free Time / README
- solution / 0700-0799 / 0760.Find Anagram Mappings / README
- solution / 0700-0799 / 0761.Special Binary String / README
- solution / 0700-0799 / 0762.Prime Number of Set Bits in Binary Representation / README
- solution / 0700-0799 / 0763.Partition Labels / README
- solution / 0700-0799 / 0764.Largest Plus Sign / README
- solution / 0700-0799 / 0765.Couples Holding Hands / README
- solution / 0700-0799 / 0766.Toeplitz Matrix / README
- solution / 0700-0799 / 0767.Reorganize String / README
- solution / 0700-0799 / 0768.Max Chunks To Make Sorted II / README
- solution / 0700-0799 / 0769.Max Chunks To Make Sorted / README
- solution / 0700-0799 / 0770.Basic Calculator IV / README
- solution / 0700-0799 / 0771.Jewels and Stones / README
- solution / 0700-0799 / 0772.Basic Calculator III / README
- solution / 0700-0799 / 0773.Sliding Puzzle / README
- solution / 0700-0799 / 0774.Minimize Max Distance to Gas Station / README
- solution / 0700-0799 / 0775.Global and Local Inversions / README
- solution / 0700-0799 / 0776.Split BST / README
- solution / 0700-0799 / 0777.Swap Adjacent in LR String / README
- solution / 0700-0799 / 0778.Swim in Rising Water / README
- solution / 0700-0799 / 0779.K-th Symbol in Grammar / README
- solution / 0700-0799 / 0780.Reaching Points / README
- solution / 0700-0799 / 0781.Rabbits in Forest / README
- solution / 0700-0799 / 0782.Transform to Chessboard / README
- solution / 0700-0799 / 0783.Minimum Distance Between BST Nodes / README
- solution / 0700-0799 / 0784.Letter Case Permutation / README
- solution / 0700-0799 / 0785.Is Graph Bipartite / README
- solution / 0700-0799 / 0786.K-th Smallest Prime Fraction / README
- solution / 0700-0799 / 0787.Cheapest Flights Within K Stops / README
- solution / 0700-0799 / 0788.Rotated Digits / README
- solution / 0700-0799 / 0789.Escape The Ghosts / README
- solution / 0700-0799 / 0790.Domino and Tromino Tiling / README
- solution / 0700-0799 / 0791.Custom Sort String / README
- solution / 0700-0799 / 0792.Number of Matching Subsequences / README
- solution / 0700-0799 / 0793.Preimage Size of Factorial Zeroes Function / README
- solution / 0700-0799 / 0794.Valid Tic-Tac-Toe State / README
- solution / 0700-0799 / 0795.Number of Subarrays with Bounded Maximum / README
- solution / 0700-0799 / 0796.Rotate String / README
- solution / 0700-0799 / 0797.All Paths From Source to Target / README
- solution / 0700-0799 / 0798.Smallest Rotation with Highest Score / README
- solution / 0700-0799 / 0799.Champagne Tower / README
- solution / 0800-0899 / 0800.Similar RGB Color / README
- solution / 0800-0899 / 0801.Minimum Swaps To Make Sequences Increasing / README
- solution / 0800-0899 / 0802.Find Eventual Safe States / README
- solution / 0800-0899 / 0803.Bricks Falling When Hit / README
- solution / 0800-0899 / 0804.Unique Morse Code Words / README
- solution / 0800-0899 / 0805.Split Array With Same Average / README
- solution / 0800-0899 / 0806.Number of Lines To Write String / README
- solution / 0800-0899 / 0807.Max Increase to Keep City Skyline / README
- solution / 0800-0899 / 0808.Soup Servings / README
- solution / 0800-0899 / 0809.Expressive Words / README
- solution / 0800-0899 / 0810.Chalkboard XOR Game / README
- solution / 0800-0899 / 0811.Subdomain Visit Count / README
- solution / 0800-0899 / 0812.Largest Triangle Area / README
- solution / 0800-0899 / 0813.Largest Sum of Averages / README
- solution / 0800-0899 / 0814.Binary Tree Pruning / README
- solution / 0800-0899 / 0815.Bus Routes / README
- solution / 0800-0899 / 0816.Ambiguous Coordinates / README
- solution / 0800-0899 / 0817.Linked List Components / README
- solution / 0800-0899 / 0818.Race Car / README
- solution / 0800-0899 / 0819.Most Common Word / README
- solution / 0800-0899 / 0820.Short Encoding of Words / README
- solution / 0800-0899 / 0821.Shortest Distance to a Character / README
- solution / 0800-0899 / 0822.Card Flipping Game / README
- solution / 0800-0899 / 0823.Binary Trees With Factors / README
- solution / 0800-0899 / 0824.Goat Latin / README
- solution / 0800-0899 / 0825.Friends Of Appropriate Ages / README
- solution / 0800-0899 / 0826.Most Profit Assigning Work / README
- solution / 0800-0899 / 0827.Making A Large Island / README
- solution / 0800-0899 / 0828.Count Unique Characters of All Substrings of a Given String / README
- solution / 0800-0899 / 0829.Consecutive Numbers Sum / README
- solution / 0800-0899 / 0830.Positions of Large Groups / README
- solution / 0800-0899 / 0831.Masking Personal Information / README
- solution / 0800-0899 / 0832.Flipping an Image / README
- solution / 0800-0899 / 0833.Find And Replace in String / README
- solution / 0800-0899 / 0834.Sum of Distances in Tree / README
- solution / 0800-0899 / 0835.Image Overlap / README
- solution / 0800-0899 / 0836.Rectangle Overlap / README
- solution / 0800-0899 / 0837.New 21 Game / README
- solution / 0800-0899 / 0838.Push Dominoes / README
- solution / 0800-0899 / 0839.Similar String Groups / README
- solution / 0800-0899 / 0840.Magic Squares In Grid / README
- solution / 0800-0899 / 0841.Keys and Rooms / README
- solution / 0800-0899 / 0842.Split Array into Fibonacci Sequence / README
- solution / 0800-0899 / 0843.Guess the Word / README
- solution / 0800-0899 / 0844.Backspace String Compare / README
- solution / 0800-0899 / 0845.Longest Mountain in Array / README
- solution / 0800-0899 / 0846.Hand of Straights / README
- solution / 0800-0899 / 0847.Shortest Path Visiting All Nodes / README
- solution / 0800-0899 / 0848.Shifting Letters / README
- solution / 0800-0899 / 0849.Maximize Distance to Closest Person / README
- solution / 0800-0899 / 0850.Rectangle Area II / README
- solution / 0800-0899 / 0851.Loud and Rich / README
- solution / 0800-0899 / 0852.Peak Index in a Mountain Array / README
- solution / 0800-0899 / 0853.Car Fleet / README
- solution / 0800-0899 / 0854.K-Similar Strings / README
- solution / 0800-0899 / 0855.Exam Room / README
- solution / 0800-0899 / 0856.Score of Parentheses / README
- solution / 0800-0899 / 0857.Minimum Cost to Hire K Workers / README
- solution / 0800-0899 / 0858.Mirror Reflection / README
- solution / 0800-0899 / 0859.Buddy Strings / README
- solution / 0800-0899 / 0860.Lemonade Change / README
- solution / 0800-0899 / 0861.Score After Flipping Matrix / README
- solution / 0800-0899 / 0862.Shortest Subarray with Sum at Least K / README
- solution / 0800-0899 / 0863.All Nodes Distance K in Binary Tree / README
- solution / 0800-0899 / 0864.Shortest Path to Get All Keys / README
- solution / 0800-0899 / 0865.Smallest Subtree with all the Deepest Nodes / README
- solution / 0800-0899 / 0866.Prime Palindrome / README
- solution / 0800-0899 / 0867.Transpose Matrix / README
- solution / 0800-0899 / 0868.Binary Gap / README
- solution / 0800-0899 / 0869.Reordered Power of 2 / README
- solution / 0800-0899 / 0870.Advantage Shuffle / README
- solution / 0800-0899 / 0871.Minimum Number of Refueling Stops / README
- solution / 0800-0899 / 0872.Leaf-Similar Trees / README
- solution / 0800-0899 / 0873.Length of Longest Fibonacci Subsequence / README
- solution / 0800-0899 / 0874.Walking Robot Simulation / README
- solution / 0800-0899 / 0875.Koko Eating Bananas / README
- solution / 0800-0899 / 0876.Middle of the Linked List / README
- solution / 0800-0899 / 0877.Stone Game / README
- solution / 0800-0899 / 0878.Nth Magical Number / README
- solution / 0800-0899 / 0879.Profitable Schemes / README
- solution / 0800-0899 / 0880.Decoded String at Index / README
- solution / 0800-0899 / 0881.Boats to Save People / README
- solution / 0800-0899 / 0882.Reachable Nodes In Subdivided Graph / README
- solution / 0800-0899 / 0883.Projection Area of 3D Shapes / README
- solution / 0800-0899 / 0884.Uncommon Words from Two Sentences / README
- solution / 0800-0899 / 0885.Spiral Matrix III / README
- solution / 0800-0899 / 0886.Possible Bipartition / README
- solution / 0800-0899 / 0887.Super Egg Drop / README
- solution / 0800-0899 / 0888.Fair Candy Swap / README
- solution / 0800-0899 / 0889.Construct Binary Tree from Preorder and Postorder Traversal / README
- solution / 0800-0899 / 0890.Find and Replace Pattern / README
- solution / 0800-0899 / 0891.Sum of Subsequence Widths / README
- solution / 0800-0899 / 0892.Surface Area of 3D Shapes / README
- solution / 0800-0899 / 0893.Groups of Special-Equivalent Strings / README
- solution / 0800-0899 / 0894.All Possible Full Binary Trees / README
- solution / 0800-0899 / 0895.Maximum Frequency Stack / README
- solution / 0800-0899 / 0896.Monotonic Array / README
- solution / 0800-0899 / 0897.Increasing Order Search Tree / README
- solution / 0800-0899 / 0898.Bitwise ORs of Subarrays / README
- solution / 0800-0899 / 0899.Orderly Queue / README
- solution / 0900-0999 / 0900.RLE Iterator / README
- solution / 0900-0999 / 0901.Online Stock Span / README
- solution / 0900-0999 / 0902.Numbers At Most N Given Digit Set / README
- solution / 0900-0999 / 0903.Valid Permutations for DI Sequence / README
- solution / 0900-0999 / 0904.Fruit Into Baskets / README
- solution / 0900-0999 / 0905.Sort Array By Parity / README
- solution / 0900-0999 / 0906.Super Palindromes / README
- solution / 0900-0999 / 0907.Sum of Subarray Minimums / README
- solution / 0900-0999 / 0908.Smallest Range I / README
- solution / 0900-0999 / 0909.Snakes and Ladders / README
- solution / 0900-0999 / 0910.Smallest Range II / README
- solution / 0900-0999 / 0911.Online Election / README
- solution / 0900-0999 / 0912.Sort an Array / README
- solution / 0900-0999 / 0913.Cat and Mouse / README
- solution / 0900-0999 / 0914.X of a Kind in a Deck of Cards / README
- solution / 0900-0999 / 0915.Partition Array into Disjoint Intervals / README
- solution / 0900-0999 / 0916.Word Subsets / README
- solution / 0900-0999 / 0917.Reverse Only Letters / README
- solution / 0900-0999 / 0918.Maximum Sum Circular Subarray / README
- solution / 0900-0999 / 0919.Complete Binary Tree Inserter / README
- solution / 0900-0999 / 0920.Number of Music Playlists / README
- solution / 0900-0999 / 0921.Minimum Add to Make Parentheses Valid / README
- solution / 0900-0999 / 0922.Sort Array By Parity II / README
- solution / 0900-0999 / 0923.3Sum With Multiplicity / README
- solution / 0900-0999 / 0924.Minimize Malware Spread / README
- solution / 0900-0999 / 0925.Long Pressed Name / README
- solution / 0900-0999 / 0926.Flip String to Monotone Increasing / README
- solution / 0900-0999 / 0927.Three Equal Parts / README
- solution / 0900-0999 / 0928.Minimize Malware Spread II / README
- solution / 0900-0999 / 0929.Unique Email Addresses / README
- solution / 0900-0999 / 0930.Binary Subarrays With Sum / README
- solution / 0900-0999 / 0931.Minimum Falling Path Sum / README
- solution / 0900-0999 / 0932.Beautiful Array / README
- solution / 0900-0999 / 0933.Number of Recent Calls / README
- solution / 0900-0999 / 0934.Shortest Bridge / README
- solution / 0900-0999 / 0935.Knight Dialer / README
- solution / 0900-0999 / 0936.Stamping The Sequence / README
- solution / 0900-0999 / 0937.Reorder Data in Log Files / README
- solution / 0900-0999 / 0938.Range Sum of BST / README
- solution / 0900-0999 / 0939.Minimum Area Rectangle / README
- solution / 0900-0999 / 0940.Distinct Subsequences II / README
- solution / 0900-0999 / 0941.Valid Mountain Array / README
- solution / 0900-0999 / 0942.DI String Match / README
- solution / 0900-0999 / 0943.Find the Shortest Superstring / README
- solution / 0900-0999 / 0944.Delete Columns to Make Sorted / README
- solution / 0900-0999 / 0945.Minimum Increment to Make Array Unique / README
- solution / 0900-0999 / 0946.Validate Stack Sequences / README
- solution / 0900-0999 / 0947.Most Stones Removed with Same Row or Column / README
- solution / 0900-0999 / 0948.Bag of Tokens / README
- solution / 0900-0999 / 0949.Largest Time for Given Digits / README
- solution / 0900-0999 / 0950.Reveal Cards In Increasing Order / README
- solution / 0900-0999 / 0951.Flip Equivalent Binary Trees / README
- solution / 0900-0999 / 0952.Largest Component Size by Common Factor / README
- solution / 0900-0999 / 0953.Verifying an Alien Dictionary / README
- solution / 0900-0999 / 0954.Array of Doubled Pairs / README
- solution / 0900-0999 / 0955.Delete Columns to Make Sorted II / README
- solution / 0900-0999 / 0956.Tallest Billboard / README
- solution / 0900-0999 / 0957.Prison Cells After N Days / README
- solution / 0900-0999 / 0958.Check Completeness of a Binary Tree / README
- solution / 0900-0999 / 0959.Regions Cut By Slashes / README
- solution / 0900-0999 / 0960.Delete Columns to Make Sorted III / README
- solution / 0900-0999 / 0961.N-Repeated Element in Size 2N Array / README
- solution / 0900-0999 / 0962.Maximum Width Ramp / README
- solution / 0900-0999 / 0963.Minimum Area Rectangle II / README
- solution / 0900-0999 / 0964.Least Operators to Express Number / README
- solution / 0900-0999 / 0965.Univalued Binary Tree / README
- solution / 0900-0999 / 0966.Vowel Spellchecker / README
- solution / 0900-0999 / 0967.Numbers With Same Consecutive Differences / README
- solution / 0900-0999 / 0968.Binary Tree Cameras / README
- solution / 0900-0999 / 0969.Pancake Sorting / README
- solution / 0900-0999 / 0970.Powerful Integers / README
- solution / 0900-0999 / 0971.Flip Binary Tree To Match Preorder Traversal / README
- solution / 0900-0999 / 0972.Equal Rational Numbers / README
- solution / 0900-0999 / 0973.K Closest Points to Origin / README
- solution / 0900-0999 / 0974.Subarray Sums Divisible by K / README
- solution / 0900-0999 / 0975.Odd Even Jump / README
- solution / 0900-0999 / 0976.Largest Perimeter Triangle / README
- solution / 0900-0999 / 0977.Squares of a Sorted Array / README
- solution / 0900-0999 / 0978.Longest Turbulent Subarray / README
- solution / 0900-0999 / 0979.Distribute Coins in Binary Tree / README
- solution / 0900-0999 / 0980.Unique Paths III / README
- solution / 0900-0999 / 0981.Time Based Key-Value Store / README
- solution / 0900-0999 / 0982.Triples with Bitwise AND Equal To Zero / README
- solution / 0900-0999 / 0983.Minimum Cost For Tickets / README
- solution / 0900-0999 / 0984.String Without AAA or BBB / README
- solution / 0900-0999 / 0985.Sum of Even Numbers After Queries / README
- solution / 0900-0999 / 0986.Interval List Intersections / README
- solution / 0900-0999 / 0987.Vertical Order Traversal of a Binary Tree / README
- solution / 0900-0999 / 0988.Smallest String Starting From Leaf / README
- solution / 0900-0999 / 0989.Add to Array-Form of Integer / README
- solution / 0900-0999 / 0990.Satisfiability of Equality Equations / README
- solution / 0900-0999 / 0991.Broken Calculator / README
- solution / 0900-0999 / 0992.Subarrays with K Different Integers / README
- solution / 0900-0999 / 0993.Cousins in Binary Tree / README
- solution / 0900-0999 / 0994.Rotting Oranges / README
- solution / 0900-0999 / 0995.Minimum Number of K Consecutive Bit Flips / README
- solution / 0900-0999 / 0996.Number of Squareful Arrays / README
- solution / 0900-0999 / 0997.Find the Town Judge / README
- solution / 0900-0999 / 0998.Maximum Binary Tree II / README
- solution / 0900-0999 / 0999.Available Captures for Rook / README
- solution / 1000-1099 / 1000.Minimum Cost to Merge Stones / README
- solution / 1000-1099 / 1001.Grid Illumination / README
- solution / 1000-1099 / 1002.Find Common Characters / README
- solution / 1000-1099 / 1003.Check If Word Is Valid After Substitutions / README
- solution / 1000-1099 / 1004.Max Consecutive Ones III / README
- solution / 1000-1099 / 1005.Maximize Sum Of Array After K Negations / README
- solution / 1000-1099 / 1006.Clumsy Factorial / README
- solution / 1000-1099 / 1007.Minimum Domino Rotations For Equal Row / README
- solution / 1000-1099 / 1008.Construct Binary Search Tree from Preorder Traversal / README
- solution / 1000-1099 / 1009.Complement of Base 10 Integer / README
- solution / 1000-1099 / 1010.Pairs of Songs With Total Durations Divisible by 60 / README
- solution / 1000-1099 / 1011.Capacity To Ship Packages Within D Days / README
- solution / 1000-1099 / 1012.Numbers With Repeated Digits / README
- solution / 1000-1099 / 1013.Partition Array Into Three Parts With Equal Sum / README
- solution / 1000-1099 / 1014.Best Sightseeing Pair / README
- solution / 1000-1099 / 1015.Smallest Integer Divisible by K / README
- solution / 1000-1099 / 1016.Binary String With Substrings Representing 1 To N / README
- solution / 1000-1099 / 1017.Convert to Base -2 / README
- solution / 1000-1099 / 1018.Binary Prefix Divisible By 5 / README
- solution / 1000-1099 / 1019.Next Greater Node In Linked List / README
- solution / 1000-1099 / 1020.Number of Enclaves / README
- solution / 1000-1099 / 1021.Remove Outermost Parentheses / README
- solution / 1000-1099 / 1022.Sum of Root To Leaf Binary Numbers / README
- solution / 1000-1099 / 1023.Camelcase Matching / README
- solution / 1000-1099 / 1024.Video Stitching / README
- solution / 1000-1099 / 1025.Divisor Game / README
- solution / 1000-1099 / 1026.Maximum Difference Between Node and Ancestor / README
- solution / 1000-1099 / 1027.Longest Arithmetic Subsequence / README
- solution / 1000-1099 / 1028.Recover a Tree From Preorder Traversal / README
- solution / 1000-1099 / 1029.Two City Scheduling / README
- solution / 1000-1099 / 1030.Matrix Cells in Distance Order / README
- solution / 1000-1099 / 1031.Maximum Sum of Two Non-Overlapping Subarrays / README
- solution / 1000-1099 / 1032.Stream of Characters / README
- solution / 1000-1099 / 1033.Moving Stones Until Consecutive / README
- solution / 1000-1099 / 1034.Coloring A Border / README
- solution / 1000-1099 / 1035.Uncrossed Lines / README
- solution / 1000-1099 / 1036.Escape a Large Maze / README
- solution / 1000-1099 / 1037.Valid Boomerang / README
- solution / 1000-1099 / 1038.Binary Search Tree to Greater Sum Tree / README
- solution / 1000-1099 / 1039.Minimum Score Triangulation of Polygon / README
- solution / 1000-1099 / 1040.Moving Stones Until Consecutive II / README
- solution / 1000-1099 / 1041.Robot Bounded In Circle / README
- solution / 1000-1099 / 1042.Flower Planting With No Adjacent / README
- solution / 1000-1099 / 1043.Partition Array for Maximum Sum / README
- solution / 1000-1099 / 1044.Longest Duplicate Substring / README
- solution / 1000-1099 / 1045.Customers Who Bought All Products / README
- solution / 1000-1099 / 1046.Last Stone Weight / README
- solution / 1000-1099 / 1047.Remove All Adjacent Duplicates In String / README
- solution / 1000-1099 / 1048.Longest String Chain / README
- solution / 1000-1099 / 1049.Last Stone Weight II / README
- solution / 1000-1099 / 1050.Actors and Directors Who Cooperated At Least Three Times / README
- solution / 1000-1099 / 1051.Height Checker / README
- solution / 1000-1099 / 1052.Grumpy Bookstore Owner / README
- solution / 1000-1099 / 1053.Previous Permutation With One Swap / README
- solution / 1000-1099 / 1054.Distant Barcodes / README
- solution / 1000-1099 / 1055.Shortest Way to Form String / README
- solution / 1000-1099 / 1056.Confusing Number / README
- solution / 1000-1099 / 1057.Campus Bikes / README
- solution / 1000-1099 / 1058.Minimize Rounding Error to Meet Target / README
- solution / 1000-1099 / 1059.All Paths from Source Lead to Destination / README
- solution / 1000-1099 / 1060.Missing Element in Sorted Array / README
- solution / 1000-1099 / 1061.Lexicographically Smallest Equivalent String / README
- solution / 1000-1099 / 1062.Longest Repeating Substring / README
- solution / 1000-1099 / 1063.Number of Valid Subarrays / README
- solution / 1000-1099 / 1064.Fixed Point / README
- solution / 1000-1099 / 1065.Index Pairs of a String / README
- solution / 1000-1099 / 1066.Campus Bikes II / README
- solution / 1000-1099 / 1067.Digit Count in Range / README
- solution / 1000-1099 / 1068.Product Sales Analysis I / README
- solution / 1000-1099 / 1069.Product Sales Analysis II / README
- solution / 1000-1099 / 1070.Product Sales Analysis III / README
- solution / 1000-1099 / 1071.Greatest Common Divisor of Strings / README
- solution / 1000-1099 / 1072.Flip Columns For Maximum Number of Equal Rows / README
- solution / 1000-1099 / 1073.Adding Two Negabinary Numbers / README
- solution / 1000-1099 / 1074.Number of Submatrices That Sum to Target / README
- solution / 1000-1099 / 1075.Project Employees I / README
- solution / 1000-1099 / 1076.Project Employees II / README
- solution / 1000-1099 / 1077.Project Employees III / README
- solution / 1000-1099 / 1078.Occurrences After Bigram / README
- solution / 1000-1099 / 1079.Letter Tile Possibilities / README
- solution / 1000-1099 / 1080.Insufficient Nodes in Root to Leaf Paths / README
- solution / 1000-1099 / 1081.Smallest Subsequence of Distinct Characters / README
- solution / 1000-1099 / 1082.Sales Analysis I / README
- solution / 1000-1099 / 1083.Sales Analysis II / README
- solution / 1000-1099 / 1084.Sales Analysis III / README
- solution / 1000-1099 / 1085.Sum of Digits in the Minimum Number / README
- solution / 1000-1099 / 1086.High Five / README
- solution / 1000-1099 / 1087.Brace Expansion / README
- solution / 1000-1099 / 1088.Confusing Number II / README
- solution / 1000-1099 / 1089.Duplicate Zeros / README
- solution / 1000-1099 / 1090.Largest Values From Labels / README
- solution / 1000-1099 / 1091.Shortest Path in Binary Matrix / README
- solution / 1000-1099 / 1092.Shortest Common Supersequence / README
- solution / 1000-1099 / 1093.Statistics from a Large Sample / README
- solution / 1000-1099 / 1094.Car Pooling / README
- solution / 1000-1099 / 1095.Find in Mountain Array / README
- solution / 1000-1099 / 1096.Brace Expansion II / README
- solution / 1000-1099 / 1097.Game Play Analysis V / README
- solution / 1000-1099 / 1098.Unpopular Books / README
- solution / 1000-1099 / 1099.Two Sum Less Than K / README
- solution / 1100-1199 / 1100.Find K-Length Substrings With No Repeated Characters / README
- solution / 1100-1199 / 1101.The Earliest Moment When Everyone Become Friends / README
- solution / 1100-1199 / 1102.Path With Maximum Minimum Value / README
- solution / 1100-1199 / 1103.Distribute Candies to People / README
- solution / 1100-1199 / 1104.Path In Zigzag Labelled Binary Tree / README
- solution / 1100-1199 / 1105.Filling Bookcase Shelves / README
- solution / 1100-1199 / 1106.Parsing A Boolean Expression / README
- solution / 1100-1199 / 1107.New Users Daily Count / README
- solution / 1100-1199 / 1108.Defanging an IP Address / README
- solution / 1100-1199 / 1109.Corporate Flight Bookings / README
- solution / 1100-1199 / 1110.Delete Nodes And Return Forest / README
- solution / 1100-1199 / 1111.Maximum Nesting Depth of Two Valid Parentheses Strings / README
- solution / 1100-1199 / 1112.Highest Grade For Each Student / README
- solution / 1100-1199 / 1113.Reported Posts / README
- solution / 1100-1199 / 1114.Print in Order / README
- solution / 1100-1199 / 1115.Print FooBar Alternately / README
- solution / 1100-1199 / 1116.Print Zero Even Odd / README
- solution / 1100-1199 / 1117.Building H2O / README
- solution / 1100-1199 / 1118.Number of Days in a Month / README
- solution / 1100-1199 / 1119.Remove Vowels from a String / README
- solution / 1100-1199 / 1120.Maximum Average Subtree / README
- solution / 1100-1199 / 1121.Divide Array Into Increasing Sequences / README
- solution / 1100-1199 / 1122.Relative Sort Array / README
- solution / 1100-1199 / 1123.Lowest Common Ancestor of Deepest Leaves / README
- solution / 1100-1199 / 1124.Longest Well-Performing Interval / README
- solution / 1100-1199 / 1125.Smallest Sufficient Team / README
- solution / 1100-1199 / 1126.Active Businesses / README
- solution / 1100-1199 / 1127.User Purchase Platform / README
- solution / 1100-1199 / 1128.Number of Equivalent Domino Pairs / README
- solution / 1100-1199 / 1129.Shortest Path with Alternating Colors / README
- solution / 1100-1199 / 1130.Minimum Cost Tree From Leaf Values / README
- solution / 1100-1199 / 1131.Maximum of Absolute Value Expression / README
- solution / 1100-1199 / 1132.Reported Posts II / README
- solution / 1100-1199 / 1133.Largest Unique Number / README
- solution / 1100-1199 / 1134.Armstrong Number / README
- solution / 1100-1199 / 1135.Connecting Cities With Minimum Cost / README
- solution / 1100-1199 / 1136.Parallel Courses / README
- solution / 1100-1199 / 1137.N-th Tribonacci Number / README
- solution / 1100-1199 / 1138.Alphabet Board Path / README
- solution / 1100-1199 / 1139.Largest 1-Bordered Square / README
- solution / 1100-1199 / 1140.Stone Game II / README
- solution / 1100-1199 / 1141.User Activity for the Past 30 Days I / README
- solution / 1100-1199 / 1142.User Activity for the Past 30 Days II / README
- solution / 1100-1199 / 1143.Longest Common Subsequence / README
- solution / 1100-1199 / 1144.Decrease Elements To Make Array Zigzag / README
- solution / 1100-1199 / 1145.Binary Tree Coloring Game / README
- solution / 1100-1199 / 1146.Snapshot Array / README
- solution / 1100-1199 / 1147.Longest Chunked Palindrome Decomposition / README
- solution / 1100-1199 / 1148.Article Views I / README
- solution / 1100-1199 / 1149.Article Views II / README
- solution / 1100-1199 / 1150.Check If a Number Is Majority Element in a Sorted Array / README
- solution / 1100-1199 / 1151.Minimum Swaps to Group All 1's Together / README
- solution / 1100-1199 / 1152.Analyze User Website Visit Pattern / README
- solution / 1100-1199 / 1153.String Transforms Into Another String / README
- solution / 1100-1199 / 1154.Day of the Year / README
- solution / 1100-1199 / 1155.Number of Dice Rolls With Target Sum / README
- solution / 1100-1199 / 1156.Swap For Longest Repeated Character Substring / README
- solution / 1100-1199 / 1157.Online Majority Element In Subarray / README
- solution / 1100-1199 / 1158.Market Analysis I / README
- solution / 1100-1199 / 1159.Market Analysis II / README
- solution / 1100-1199 / 1160.Find Words That Can Be Formed by Characters / README
- solution / 1100-1199 / 1161.Maximum Level Sum of a Binary Tree / README
- solution / 1100-1199 / 1162.As Far from Land as Possible / README
- solution / 1100-1199 / 1163.Last Substring in Lexicographical Order / README
- solution / 1100-1199 / 1164.Product Price at a Given Date / README
- solution / 1100-1199 / 1165.Single-Row Keyboard / README
- solution / 1100-1199 / 1166.Design File System / README
- solution / 1100-1199 / 1167.Minimum Cost to Connect Sticks / README
- solution / 1100-1199 / 1168.Optimize Water Distribution in a Village / README
- solution / 1100-1199 / 1169.Invalid Transactions / README
- solution / 1100-1199 / 1170.Compare Strings by Frequency of the Smallest Character / README
- solution / 1100-1199 / 1171.Remove Zero Sum Consecutive Nodes from Linked List / README
- solution / 1100-1199 / 1172.Dinner Plate Stacks / README
- solution / 1100-1199 / 1173.Immediate Food Delivery I / README
- solution / 1100-1199 / 1174.Immediate Food Delivery II / README
- solution / 1100-1199 / 1175.Prime Arrangements / README
- solution / 1100-1199 / 1176.Diet Plan Performance / README
- solution / 1100-1199 / 1177.Can Make Palindrome from Substring / README
- solution / 1100-1199 / 1178.Number of Valid Words for Each Puzzle / README
- solution / 1100-1199 / 1179.Reformat Department Table / README
- solution / 1100-1199 / 1180.Count Substrings with Only One Distinct Letter / README
- solution / 1100-1199 / 1181.Before and After Puzzle / README
- solution / 1100-1199 / 1182.Shortest Distance to Target Color / README
- solution / 1100-1199 / 1183.Maximum Number of Ones / README
- solution / 1100-1199 / 1184.Distance Between Bus Stops / README
- solution / 1100-1199 / 1185.Day of the Week / README
- solution / 1100-1199 / 1186.Maximum Subarray Sum with One Deletion / README
- solution / 1100-1199 / 1187.Make Array Strictly Increasing / README
- solution / 1100-1199 / 1188.Design Bounded Blocking Queue / README
- solution / 1100-1199 / 1189.Maximum Number of Balloons / README
- solution / 1100-1199 / 1190.Reverse Substrings Between Each Pair of Parentheses / README
- solution / 1100-1199 / 1191.K-Concatenation Maximum Sum / README
- solution / 1100-1199 / 1192.Critical Connections in a Network / README
- solution / 1100-1199 / 1193.Monthly Transactions I / README
- solution / 1100-1199 / 1194.Tournament Winners / README
- solution / 1100-1199 / 1195.Fizz Buzz Multithreaded / README
- solution / 1100-1199 / 1196.How Many Apples Can You Put into the Basket / README
- solution / 1100-1199 / 1197.Minimum Knight Moves / README
- solution / 1100-1199 / 1198.Find Smallest Common Element in All Rows / README
- solution / 1100-1199 / 1199.Minimum Time to Build Blocks / README
- solution / 1200-1299 / 1200.Minimum Absolute Difference / README
- solution / 1200-1299 / 1201.Ugly Number III / README
- solution / 1200-1299 / 1202.Smallest String With Swaps / README
- solution / 1200-1299 / 1203.Sort Items by Groups Respecting Dependencies / README
- solution / 1200-1299 / 1204.Last Person to Fit in the Bus / README
- solution / 1200-1299 / 1205.Monthly Transactions II / README
- solution / 1200-1299 / 1206.Design Skiplist / README
- solution / 1200-1299 / 1207.Unique Number of Occurrences / README
- solution / 1200-1299 / 1208.Get Equal Substrings Within Budget / README
- solution / 1200-1299 / 1209.Remove All Adjacent Duplicates in String II / README
- solution / 1200-1299 / 1210.Minimum Moves to Reach Target with Rotations / README
- solution / 1200-1299 / 1211.Queries Quality and Percentage / README
- solution / 1200-1299 / 1212.Team Scores in Football Tournament / README
- solution / 1200-1299 / 1213.Intersection of Three Sorted Arrays / README
- solution / 1200-1299 / 1214.Two Sum BSTs / README
- solution / 1200-1299 / 1215.Stepping Numbers / README
- solution / 1200-1299 / 1216.Valid Palindrome III / README
- solution / 1200-1299 / 1217.Minimum Cost to Move Chips to The Same Position / README
- solution / 1200-1299 / 1218.Longest Arithmetic Subsequence of Given Difference / README
- solution / 1200-1299 / 1219.Path with Maximum Gold / README
- solution / 1200-1299 / 1220.Count Vowels Permutation / README
- solution / 1200-1299 / 1221.Split a String in Balanced Strings / README
- solution / 1200-1299 / 1222.Queens That Can Attack the King / README
- solution / 1200-1299 / 1223.Dice Roll Simulation / README
- solution / 1200-1299 / 1224.Maximum Equal Frequency / README
- solution / 1200-1299 / 1225.Report Contiguous Dates / README
- solution / 1200-1299 / 1226.The Dining Philosophers / README
- solution / 1200-1299 / 1227.Airplane Seat Assignment Probability / README
- solution / 1200-1299 / 1228.Missing Number In Arithmetic Progression / README
- solution / 1200-1299 / 1229.Meeting Scheduler / README
- solution / 1200-1299 / 1230.Toss Strange Coins / README
- solution / 1200-1299 / 1231.Divide Chocolate / README
- solution / 1200-1299 / 1232.Check If It Is a Straight Line / README
- solution / 1200-1299 / 1233.Remove Sub-Folders from the Filesystem / README
- solution / 1200-1299 / 1234.Replace the Substring for Balanced String / README
- solution / 1200-1299 / 1235.Maximum Profit in Job Scheduling / README
- solution / 1200-1299 / 1236.Web Crawler / README
- solution / 1200-1299 / 1237.Find Positive Integer Solution for a Given Equation / README
- solution / 1200-1299 / 1238.Circular Permutation in Binary Representation / README
- solution / 1200-1299 / 1239.Maximum Length of a Concatenated String with Unique Characters / README
- solution / 1200-1299 / 1240.Tiling a Rectangle with the Fewest Squares / README
- solution / 1200-1299 / 1241.Number of Comments per Post / README
- solution / 1200-1299 / 1242.Web Crawler Multithreaded / README
- solution / 1200-1299 / 1243.Array Transformation / README
- solution / 1200-1299 / 1244.Design A Leaderboard / README
- solution / 1200-1299 / 1245.Tree Diameter / README
- solution / 1200-1299 / 1246.Palindrome Removal / README
- solution / 1200-1299 / 1247.Minimum Swaps to Make Strings Equal / README
- solution / 1200-1299 / 1248.Count Number of Nice Subarrays / README
- solution / 1200-1299 / 1249.Minimum Remove to Make Valid Parentheses / README
- solution / 1200-1299 / 1250.Check If It Is a Good Array / README
- solution / 1200-1299 / 1251.Average Selling Price / README
- solution / 1200-1299 / 1252.Cells with Odd Values in a Matrix / README
- solution / 1200-1299 / 1253.Reconstruct a 2-Row Binary Matrix / README
- solution / 1200-1299 / 1254.Number of Closed Islands / README
- solution / 1200-1299 / 1255.Maximum Score Words Formed by Letters / README
- solution / 1200-1299 / 1256.Encode Number / README
- solution / 1200-1299 / 1257.Smallest Common Region / README
- solution / 1200-1299 / 1258.Synonymous Sentences / README
- solution / 1200-1299 / 1259.Handshakes That Don't Cross / README
- solution / 1200-1299 / 1260.Shift 2D Grid / README
- solution / 1200-1299 / 1261.Find Elements in a Contaminated Binary Tree / README
- solution / 1200-1299 / 1262.Greatest Sum Divisible by Three / README
- solution / 1200-1299 / 1263.Minimum Moves to Move a Box to Their Target Location / README
- solution / 1200-1299 / 1264.Page Recommendations / README
- solution / 1200-1299 / 1265.Print Immutable Linked List in Reverse / README
- solution / 1200-1299 / 1266.Minimum Time Visiting All Points / README
- solution / 1200-1299 / 1267.Count Servers that Communicate / README
- solution / 1200-1299 / 1268.Search Suggestions System / README
- solution / 1200-1299 / 1269.Number of Ways to Stay in the Same Place After Some Steps / README
- solution / 1200-1299 / 1270.All People Report to the Given Manager / README
- solution / 1200-1299 / 1271.Hexspeak / README
- solution / 1200-1299 / 1272.Remove Interval / README
- solution / 1200-1299 / 1273.Delete Tree Nodes / README
- solution / 1200-1299 / 1274.Number of Ships in a Rectangle / README
- solution / 1200-1299 / 1275.Find Winner on a Tic Tac Toe Game / README
- solution / 1200-1299 / 1276.Number of Burgers with No Waste of Ingredients / README
- solution / 1200-1299 / 1277.Count Square Submatrices with All Ones / README
- solution / 1200-1299 / 1278.Palindrome Partitioning III / README
- solution / 1200-1299 / 1279.Traffic Light Controlled Intersection / README
- solution / 1200-1299 / 1280.Students and Examinations / README
- solution / 1200-1299 / 1281.Subtract the Product and Sum of Digits of an Integer / README
- solution / 1200-1299 / 1282.Group the People Given the Group Size They Belong To / README
- solution / 1200-1299 / 1283.Find the Smallest Divisor Given a Threshold / README
- solution / 1200-1299 / 1284.Minimum Number of Flips to Convert Binary Matrix to Zero Matrix / README
- solution / 1200-1299 / 1285.Find the Start and End Number of Continuous Ranges / README
- solution / 1200-1299 / 1286.Iterator for Combination / README
- solution / 1200-1299 / 1287.Element Appearing More Than 25% In Sorted Array / README
- solution / 1200-1299 / 1288.Remove Covered Intervals / README
- solution / 1200-1299 / 1289.Minimum Falling Path Sum II / README
- solution / 1200-1299 / 1290.Convert Binary Number in a Linked List to Integer / README
- solution / 1200-1299 / 1291.Sequential Digits / README
- solution / 1200-1299 / 1292.Maximum Side Length of a Square with Sum Less than or Equal to Threshold / README
- solution / 1200-1299 / 1293.Shortest Path in a Grid with Obstacles Elimination / README
- solution / 1200-1299 / 1294.Weather Type in Each Country / README
- solution / 1200-1299 / 1295.Find Numbers with Even Number of Digits / README
- solution / 1200-1299 / 1296.Divide Array in Sets of K Consecutive Numbers / README
- solution / 1200-1299 / 1297.Maximum Number of Occurrences of a Substring / README
- solution / 1200-1299 / 1298.Maximum Candies You Can Get from Boxes / README
- solution / 1200-1299 / 1299.Replace Elements with Greatest Element on Right Side / README
- solution / 1300-1399 / 1300.Sum of Mutated Array Closest to Target / README
- solution / 1300-1399 / 1301.Number of Paths with Max Score / README
- solution / 1300-1399 / 1302.Deepest Leaves Sum / README
- solution / 1300-1399 / 1303.Find the Team Size / README
- solution / 1300-1399 / 1304.Find N Unique Integers Sum up to Zero / README
- solution / 1300-1399 / 1305.All Elements in Two Binary Search Trees / README
- solution / 1300-1399 / 1306.Jump Game III / README
- solution / 1300-1399 / 1307.Verbal Arithmetic Puzzle / README
- solution / 1300-1399 / 1308.Running Total for Different Genders / README
- solution / 1300-1399 / 1309.Decrypt String from Alphabet to Integer Mapping / README
- solution / 1300-1399 / 1310.XOR Queries of a Subarray / README
- solution / 1300-1399 / 1311.Get Watched Videos by Your Friends / README
- solution / 1300-1399 / 1312.Minimum Insertion Steps to Make a String Palindrome / README
- solution / 1300-1399 / 1313.Decompress Run-Length Encoded List / README
- solution / 1300-1399 / 1314.Matrix Block Sum / README
- solution / 1300-1399 / 1315.Sum of Nodes with Even-Valued Grandparent / README
- solution / 1300-1399 / 1316.Distinct Echo Substrings / README
- solution / 1300-1399 / 1317.Convert Integer to the Sum of Two No-Zero Integers / README
- solution / 1300-1399 / 1318.Minimum Flips to Make a OR b Equal to c / README
- solution / 1300-1399 / 1319.Number of Operations to Make Network Connected / README
- solution / 1300-1399 / 1320.Minimum Distance to Type a Word Using Two Fingers / README
- solution / 1300-1399 / 1321.Restaurant Growth / README
- solution / 1300-1399 / 1322.Ads Performance / README
- solution / 1300-1399 / 1323.Maximum 69 Number / README
- solution / 1300-1399 / 1324.Print Words Vertically / README
- solution / 1300-1399 / 1325.Delete Leaves With a Given Value / README
- solution / 1300-1399 / 1326.Minimum Number of Taps to Open to Water a Garden / README
- solution / 1300-1399 / 1327.List the Products Ordered in a Period / README
- solution / 1300-1399 / 1328.Break a Palindrome / README
- solution / 1300-1399 / 1329.Sort the Matrix Diagonally / README
- solution / 1300-1399 / 1330.Reverse Subarray To Maximize Array Value / README
- solution / 1300-1399 / 1331.Rank Transform of an Array / README
- solution / 1300-1399 / 1332.Remove Palindromic Subsequences / README
- solution / 1300-1399 / 1333.Filter Restaurants by Vegan-Friendly, Price and Distance / README
- solution / 1300-1399 / 1334.Find the City With the Smallest Number of Neighbors at a Threshold Distance / README
- solution / 1300-1399 / 1335.Minimum Difficulty of a Job Schedule / README
- solution / 1300-1399 / 1336.Number of Transactions per Visit / README
- solution / 1300-1399 / 1337.The K Weakest Rows in a Matrix / README
- solution / 1300-1399 / 1338.Reduce Array Size to The Half / README
- solution / 1300-1399 / 1339.Maximum Product of Splitted Binary Tree / README
- solution / 1300-1399 / 1340.Jump Game V / README
- solution / 1300-1399 / 1341.Movie Rating / README
- solution / 1300-1399 / 1342.Number of Steps to Reduce a Number to Zero / README
- solution / 1300-1399 / 1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold / README
- solution / 1300-1399 / 1344.Angle Between Hands of a Clock / README
- solution / 1300-1399 / 1345.Jump Game IV / README
- solution / 1300-1399 / 1346.Check If N and Its Double Exist / README
- solution / 1300-1399 / 1347.Minimum Number of Steps to Make Two Strings Anagram / README
- solution / 1300-1399 / 1348.Tweet Counts Per Frequency / README
- solution / 1300-1399 / 1349.Maximum Students Taking Exam / README
- solution / 1300-1399 / 1350.Students With Invalid Departments / README
- solution / 1300-1399 / 1351.Count Negative Numbers in a Sorted Matrix / README
- solution / 1300-1399 / 1352.Product of the Last K Numbers / README
- solution / 1300-1399 / 1353.Maximum Number of Events That Can Be Attended / README
- solution / 1300-1399 / 1354.Construct Target Array With Multiple Sums / README
- solution / 1300-1399 / 1355.Activity Participants / README
- solution / 1300-1399 / 1356.Sort Integers by The Number of 1 Bits / README
- solution / 1300-1399 / 1357.Apply Discount Every n Orders / README
- solution / 1300-1399 / 1358.Number of Substrings Containing All Three Characters / README
- solution / 1300-1399 / 1359.Count All Valid Pickup and Delivery Options / README
- solution / 1300-1399 / 1360.Number of Days Between Two Dates / README
- solution / 1300-1399 / 1361.Validate Binary Tree Nodes / README
- solution / 1300-1399 / 1362.Closest Divisors / README
- solution / 1300-1399 / 1363.Largest Multiple of Three / README
- solution / 1300-1399 / 1364.Number of Trusted Contacts of a Customer / README
- solution / 1300-1399 / 1365.How Many Numbers Are Smaller Than the Current Number / README
- solution / 1300-1399 / 1366.Rank Teams by Votes / README
- solution / 1300-1399 / 1367.Linked List in Binary Tree / README
- solution / 1300-1399 / 1368.Minimum Cost to Make at Least One Valid Path in a Grid / README
- solution / 1300-1399 / 1369.Get the Second Most Recent Activity / README
- solution / 1300-1399 / 1370.Increasing Decreasing String / README
- solution / 1300-1399 / 1371.Find the Longest Substring Containing Vowels in Even Counts / README
- solution / 1300-1399 / 1372.Longest ZigZag Path in a Binary Tree / README
- solution / 1300-1399 / 1373.Maximum Sum BST in Binary Tree / README
- solution / 1300-1399 / 1374.Generate a String With Characters That Have Odd Counts / README
- solution / 1300-1399 / 1375.Number of Times Binary String Is Prefix-Aligned / README
- solution / 1300-1399 / 1376.Time Needed to Inform All Employees / README
- solution / 1300-1399 / 1377.Frog Position After T Seconds / README
- solution / 1300-1399 / 1378.Replace Employee ID With The Unique Identifier / README
- solution / 1300-1399 / 1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree / README
- solution / 1300-1399 / 1380.Lucky Numbers in a Matrix / README
- solution / 1300-1399 / 1381.Design a Stack With Increment Operation / README
- solution / 1300-1399 / 1382.Balance a Binary Search Tree / README
- solution / 1300-1399 / 1383.Maximum Performance of a Team / README
- solution / 1300-1399 / 1384.Total Sales Amount by Year / README
- solution / 1300-1399 / 1385.Find the Distance Value Between Two Arrays / README
- solution / 1300-1399 / 1386.Cinema Seat Allocation / README
- solution / 1300-1399 / 1387.Sort Integers by The Power Value / README
- solution / 1300-1399 / 1388.Pizza With 3n Slices / README
- solution / 1300-1399 / 1389.Create Target Array in the Given Order / README
- solution / 1300-1399 / 1390.Four Divisors / README
- solution / 1300-1399 / 1391.Check if There is a Valid Path in a Grid / README
- solution / 1300-1399 / 1392.Longest Happy Prefix / README
- solution / 1300-1399 / 1393.Capital GainLoss / README
- solution / 1300-1399 / 1394.Find Lucky Integer in an Array / README
- solution / 1300-1399 / 1395.Count Number of Teams / README
- solution / 1300-1399 / 1396.Design Underground System / README
- solution / 1300-1399 / 1397.Find All Good Strings / README
- solution / 1300-1399 / 1398.Customers Who Bought Products A and B but Not C / README
- solution / 1300-1399 / 1399.Count Largest Group / README
- solution / 1400-1499 / 1400.Construct K Palindrome Strings / README
- solution / 1400-1499 / 1401.Circle and Rectangle Overlapping / README
- solution / 1400-1499 / 1402.Reducing Dishes / README
- solution / 1400-1499 / 1403.Minimum Subsequence in Non-Increasing Order / README
- solution / 1400-1499 / 1404.Number of Steps to Reduce a Number in Binary Representation to One / README
- solution / 1400-1499 / 1405.Longest Happy String / README
- solution / 1400-1499 / 1406.Stone Game III / README
- solution / 1400-1499 / 1407.Top Travellers / README
- solution / 1400-1499 / 1408.String Matching in an Array / README
- solution / 1400-1499 / 1409.Queries on a Permutation With Key / README
- solution / 1400-1499 / 1410
- solution / 1400-1499 / 1410
- solution / 1400-1499 / 1411.Number of Ways to Paint N × 3 Grid / README
- solution / 1400-1499 / 1412.Find the Quiet Students in All Exams / README
- solution / 1400-1499 / 1413.Minimum Value to Get Positive Step by Step Sum / README
- solution / 1400-1499 / 1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K / README
- solution / 1400-1499 / 1415.The k-th Lexicographical String of All Happy Strings of Length n / README
- solution / 1400-1499 / 1416.Restore The Array / README
- solution / 1400-1499 / 1417.Reformat The String / README
- solution / 1400-1499 / 1418.Display Table of Food Orders in a Restaurant / README
- solution / 1400-1499 / 1419.Minimum Number of Frogs Croaking / README
- solution / 1400-1499 / 1420.Build Array Where You Can Find The Maximum Exactly K Comparisons / README
- solution / 1400-1499 / 1421.NPV Queries / README
- solution / 1400-1499 / 1422.Maximum Score After Splitting a String / README
- solution / 1400-1499 / 1423.Maximum Points You Can Obtain from Cards / README
- solution / 1400-1499 / 1424.Diagonal Traverse II / README
- solution / 1400-1499 / 1425.Constrained Subsequence Sum / README
- solution / 1400-1499 / 1426.Counting Elements / README
- solution / 1400-1499 / 1427.Perform String Shifts / README
- solution / 1400-1499 / 1428.Leftmost Column with at Least a One / README
- solution / 1400-1499 / 1429.First Unique Number / README
- solution / 1400-1499 / 1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree / README
- solution / 1400-1499 / 1431.Kids With the Greatest Number of Candies / README
- solution / 1400-1499 / 1432.Max Difference You Can Get From Changing an Integer / README
- solution / 1400-1499 / 1433.Check If a String Can Break Another String / README
- solution / 1400-1499 / 1434.Number of Ways to Wear Different Hats to Each Other / README
- solution / 1400-1499 / 1435.Create a Session Bar Chart / README
- solution / 1400-1499 / 1436.Destination City / README
- solution / 1400-1499 / 1437.Check If All 1's Are at Least Length K Places Away / README
- solution / 1400-1499 / 1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit / README
- solution / 1400-1499 / 1439.Find the Kth Smallest Sum of a Matrix With Sorted Rows / README
- solution / 1400-1499 / 1440.Evaluate Boolean Expression / README
- solution / 1400-1499 / 1441.Build an Array With Stack Operations / README
- solution / 1400-1499 / 1442.Count Triplets That Can Form Two Arrays of Equal XOR / README
- solution / 1400-1499 / 1443.Minimum Time to Collect All Apples in a Tree / README
- solution / 1400-1499 / 1444.Number of Ways of Cutting a Pizza / README
- solution / 1400-1499 / 1445.Apples & Oranges / README
- solution / 1400-1499 / 1446.Consecutive Characters / README
- solution / 1400-1499 / 1447.Simplified Fractions / README
- solution / 1400-1499 / 1448.Count Good Nodes in Binary Tree / README
- solution / 1400-1499 / 1449.Form Largest Integer With Digits That Add up to Target / README
- solution / 1400-1499 / 1450.Number of Students Doing Homework at a Given Time / README
- solution / 1400-1499 / 1451.Rearrange Words in a Sentence / README
- solution / 1400-1499 / 1452.People Whose List of Favorite Companies Is Not a Subset of Another List / README
- solution / 1400-1499 / 1453.Maximum Number of Darts Inside of a Circular Dartboard / README
- solution / 1400-1499 / 1454.Active Users / README
- solution / 1400-1499 / 1455.Check If a Word Occurs As a Prefix of Any Word in a Sentence / README
- solution / 1400-1499 / 1456.Maximum Number of Vowels in a Substring of Given Length / README
- solution / 1400-1499 / 1457.Pseudo-Palindromic Paths in a Binary Tree / README
- solution / 1400-1499 / 1458.Max Dot Product of Two Subsequences / README
- solution / 1400-1499 / 1459.Rectangles Area / README
- solution / 1400-1499 / 1460.Make Two Arrays Equal by Reversing Subarrays / README
- solution / 1400-1499 / 1461.Check If a String Contains All Binary Codes of Size K / README
- solution / 1400-1499 / 1462.Course Schedule IV / README
- solution / 1400-1499 / 1463.Cherry Pickup II / README
- solution / 1400-1499 / 1464.Maximum Product of Two Elements in an Array / README
- solution / 1400-1499 / 1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts / README
- solution / 1400-1499 / 1466.Reorder Routes to Make All Paths Lead to the City Zero / README
- solution / 1400-1499 / 1467.Probability of a Two Boxes Having The Same Number of Distinct Balls / README
- solution / 1400-1499 / 1468.Calculate Salaries / README
- solution / 1400-1499 / 1469.Find All The Lonely Nodes / README
- solution / 1400-1499 / 1470.Shuffle the Array / README
- solution / 1400-1499 / 1471.The k Strongest Values in an Array / README
- solution / 1400-1499 / 1472.Design Browser History / README
- solution / 1400-1499 / 1473.Paint House III / README
- solution / 1400-1499 / 1474.Delete N Nodes After M Nodes of a Linked List / README
- solution / 1400-1499 / 1475.Final Prices With a Special Discount in a Shop / README
- solution / 1400-1499 / 1476.Subrectangle Queries / README
- solution / 1400-1499 / 1477.Find Two Non-overlapping Sub-arrays Each With Target Sum / README
- solution / 1400-1499 / 1478.Allocate Mailboxes / README
- solution / 1400-1499 / 1479.Sales by Day of the Week / README
- solution / 1400-1499 / 1480.Running Sum of 1d Array / README
- solution / 1400-1499 / 1481.Least Number of Unique Integers after K Removals / README
- solution / 1400-1499 / 1482.Minimum Number of Days to Make m Bouquets / README
- solution / 1400-1499 / 1483.Kth Ancestor of a Tree Node / README
- solution / 1400-1499 / 1484.Group Sold Products By The Date / README
- solution / 1400-1499 / 1485.Clone Binary Tree With Random Pointer / README
- solution / 1400-1499 / 1486.XOR Operation in an Array / README
- solution / 1400-1499 / 1487.Making File Names Unique / README
- solution / 1400-1499 / 1488.Avoid Flood in The City / README
- solution / 1400-1499 / 1489.Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree / README
- solution / 1400-1499 / 1490.Clone N-ary Tree / README
- solution / 1400-1499 / 1491.Average Salary Excluding the Minimum and Maximum Salary / README
- solution / 1400-1499 / 1492.The kth Factor of n / README
- solution / 1400-1499 / 1493.Longest Subarray of 1's After Deleting One Element / README
- solution / 1400-1499 / 1494.Parallel Courses II / README
- solution / 1400-1499 / 1495.Friendly Movies Streamed Last Month / README
- solution / 1400-1499 / 1496.Path Crossing / README
- solution / 1400-1499 / 1497.Check If Array Pairs Are Divisible by k / README
- solution / 1400-1499 / 1498.Number of Subsequences That Satisfy the Given Sum Condition / README
- solution / 1400-1499 / 1499.Max Value of Equation / README
- solution / 1500-1599 / 1500.Design a File Sharing System / README
- solution / 1500-1599 / 1501.Countries You Can Safely Invest In / README
- solution / 1500-1599 / 1502.Can Make Arithmetic Progression From Sequence / README
- solution / 1500-1599 / 1503.Last Moment Before All Ants Fall Out of a Plank / README
- solution / 1500-1599 / 1504.Count Submatrices With All Ones / README
- solution / 1500-1599 / 1505.Minimum Possible Integer After at Most K Adjacent Swaps On Digits / README
- solution / 1500-1599 / 1506.Find Root of N-Ary Tree / README
- solution / 1500-1599 / 1507.Reformat Date / README
- solution / 1500-1599 / 1508.Range Sum of Sorted Subarray Sums / README
- solution / 1500-1599 / 1509.Minimum Difference Between Largest and Smallest Value in Three Moves / README
- solution / 1500-1599 / 1510.Stone Game IV / README
- solution / 1500-1599 / 1511.Customer Order Frequency / README
- solution / 1500-1599 / 1512.Number of Good Pairs / README
- solution / 1500-1599 / 1513.Number of Substrings With Only 1s / README
- solution / 1500-1599 / 1514.Path with Maximum Probability / README
- solution / 1500-1599 / 1515.Best Position for a Service Centre / README
- solution / 1500-1599 / 1516.Move Sub-Tree of N-Ary Tree / README
- solution / 1500-1599 / 1517.Find Users With Valid E-Mails / README
- solution / 1500-1599 / 1518.Water Bottles / README
- solution / 1500-1599 / 1519.Number of Nodes in the Sub-Tree With the Same Label / README
- solution / 1500-1599 / 1520.Maximum Number of Non-Overlapping Substrings / README
- solution / 1500-1599 / 1521.Find a Value of a Mysterious Function Closest to Target / README
- solution / 1500-1599 / 1522.Diameter of N-Ary Tree / README
- solution / 1500-1599 / 1523.Count Odd Numbers in an Interval Range / README
- solution / 1500-1599 / 1524.Number of Sub-arrays With Odd Sum / README
- solution / 1500-1599 / 1525.Number of Good Ways to Split a String / README
- solution / 1500-1599 / 1526.Minimum Number of Increments on Subarrays to Form a Target Array / README
- solution / 1500-1599 / 1527.Patients With a Condition / README
- solution / 1500-1599 / 1528.Shuffle String / README
- solution / 1500-1599 / 1529.Minimum Suffix Flips / README
- solution / 1500-1599 / 1530.Number of Good Leaf Nodes Pairs / README
- solution / 1500-1599 / 1531.String Compression II / README
- solution / 1500-1599 / 1532.The Most Recent Three Orders / README
- solution / 1500-1599 / 1533.Find the Index of the Large Integer / README
- solution / 1500-1599 / 1534.Count Good Triplets / README
- solution / 1500-1599 / 1535.Find the Winner of an Array Game / README
- solution / 1500-1599 / 1536.Minimum Swaps to Arrange a Binary Grid / README
- solution / 1500-1599 / 1537.Get the Maximum Score / README
- solution / 1500-1599 / 1538.Guess the Majority in a Hidden Array / README
- solution / 1500-1599 / 1539.Kth Missing Positive Number / README
- solution / 1500-1599 / 1540.Can Convert String in K Moves / README
- solution / 1500-1599 / 1541.Minimum Insertions to Balance a Parentheses String / README
- solution / 1500-1599 / 1542.Find Longest Awesome Substring / README
- solution / 1500-1599 / 1543.Fix Product Name Format / README
- solution / 1500-1599 / 1544.Make The String Great / README
- solution / 1500-1599 / 1545.Find Kth Bit in Nth Binary String / README
- solution / 1500-1599 / 1546.Maximum Number of Non-Overlapping Subarrays With Sum Equals Target / README
- solution / 1500-1599 / 1547.Minimum Cost to Cut a Stick / README
- solution / 1500-1599 / 1548.The Most Similar Path in a Graph / README
- solution / 1500-1599 / 1549.The Most Recent Orders for Each Product / README
- solution / 1500-1599 / 1550.Three Consecutive Odds / README
- solution / 1500-1599 / 1551.Minimum Operations to Make Array Equal / README
- solution / 1500-1599 / 1552.Magnetic Force Between Two Balls / README
- solution / 1500-1599 / 1553.Minimum Number of Days to Eat N Oranges / README
- solution / 1500-1599 / 1554.Strings Differ by One Character / README
- solution / 1500-1599 / 1555.Bank Account Summary / README
- solution / 1500-1599 / 1556.Thousand Separator / README
- solution / 1500-1599 / 1557.Minimum Number of Vertices to Reach All Nodes / README
- solution / 1500-1599 / 1558.Minimum Numbers of Function Calls to Make Target Array / README
- solution / 1500-1599 / 1559.Detect Cycles in 2D Grid / README
- solution / 1500-1599 / 1560.Most Visited Sector in a Circular Track / README
- solution / 1500-1599 / 1561.Maximum Number of Coins You Can Get / README
- solution / 1500-1599 / 1562.Find Latest Group of Size M / README
- solution / 1500-1599 / 1563.Stone Game V / README
- solution / 1500-1599 / 1564.Put Boxes Into the Warehouse I / README
- solution / 1500-1599 / 1565.Unique Orders and Customers Per Month / README
- solution / 1500-1599 / 1566.Detect Pattern of Length M Repeated K or More Times / README
- solution / 1500-1599 / 1567.Maximum Length of Subarray With Positive Product / README
- solution / 1500-1599 / 1568.Minimum Number of Days to Disconnect Island / README
- solution / 1500-1599 / 1569.Number of Ways to Reorder Array to Get Same BST / README
- solution / 1500-1599 / 1570.Dot Product of Two Sparse Vectors / README
- solution / 1500-1599 / 1571.Warehouse Manager / README
- solution / 1500-1599 / 1572.Matrix Diagonal Sum / README
- solution / 1500-1599 / 1573.Number of Ways to Split a String / README
- solution / 1500-1599 / 1574.Shortest Subarray to be Removed to Make Array Sorted / README
- solution / 1500-1599 / 1575.Count All Possible Routes / README
- solution / 1500-1599 / 1576.Replace All 's to Avoid Consecutive Repeating Characters / README
- solution / 1500-1599 / 1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers / README
- solution / 1500-1599 / 1578.Minimum Time to Make Rope Colorful / README
- solution / 1500-1599 / 1579.Remove Max Number of Edges to Keep Graph Fully Traversable / README
- solution / 1500-1599 / 1580.Put Boxes Into the Warehouse II / README
- solution / 1500-1599 / 1581.Customer Who Visited but Did Not Make Any Transactions / README
- solution / 1500-1599 / 1582.Special Positions in a Binary Matrix / README
- solution / 1500-1599 / 1583.Count Unhappy Friends / README
- solution / 1500-1599 / 1584.Min Cost to Connect All Points / README
- solution / 1500-1599 / 1585.Check If String Is Transformable With Substring Sort Operations / README
- solution / 1500-1599 / 1586.Binary Search Tree Iterator II / README
- solution / 1500-1599 / 1587.Bank Account Summary II / README
- solution / 1500-1599 / 1588.Sum of All Odd Length Subarrays / README
- solution / 1500-1599 / 1589.Maximum Sum Obtained of Any Permutation / README
- solution / 1500-1599 / 1590.Make Sum Divisible by P / README
- solution / 1500-1599 / 1591.Strange Printer II / README
- solution / 1500-1599 / 1592.Rearrange Spaces Between Words / README
- solution / 1500-1599 / 1593.Split a String Into the Max Number of Unique Substrings / README
- solution / 1500-1599 / 1594.Maximum Non Negative Product in a Matrix / README
- solution / 1500-1599 / 1595.Minimum Cost to Connect Two Groups of Points / README
- solution / 1500-1599 / 1596.The Most Frequently Ordered Products for Each Customer / README
- solution / 1500-1599 / 1597.Build Binary Expression Tree From Infix Expression / README
- solution / 1500-1599 / 1598.Crawler Log Folder / README
- solution / 1500-1599 / 1599.Maximum Profit of Operating a Centennial Wheel / README
- solution / 1600-1699 / 1600.Throne Inheritance / README
- solution / 1600-1699 / 1601.Maximum Number of Achievable Transfer Requests / README
- solution / 1600-1699 / 1602.Find Nearest Right Node in Binary Tree / README
- solution / 1600-1699 / 1603.Design Parking System / README
- solution / 1600-1699 / 1604.Alert Using Same Key-Card Three or More Times in a One Hour Period / README
- solution / 1600-1699 / 1605.Find Valid Matrix Given Row and Column Sums / README
- solution / 1600-1699 / 1606.Find Servers That Handled Most Number of Requests / README
- solution / 1600-1699 / 1607.Sellers With No Sales / README
- solution / 1600-1699 / 1608.Special Array With X Elements Greater Than or Equal X / README
- solution / 1600-1699 / 1609.Even Odd Tree / README
- solution / 1600-1699 / 1610.Maximum Number of Visible Points / README
- solution / 1600-1699 / 1611.Minimum One Bit Operations to Make Integers Zero / README
- solution / 1600-1699 / 1612.Check If Two Expression Trees are Equivalent / README
- solution / 1600-1699 / 1613.Find the Missing IDs / README
- solution / 1600-1699 / 1614.Maximum Nesting Depth of the Parentheses / README
- solution / 1600-1699 / 1615.Maximal Network Rank / README
- solution / 1600-1699 / 1616.Split Two Strings to Make Palindrome / README
- solution / 1600-1699 / 1617.Count Subtrees With Max Distance Between Cities / README
- solution / 1600-1699 / 1618.Maximum Font to Fit a Sentence in a Screen / README
- solution / 1600-1699 / 1619.Mean of Array After Removing Some Elements / README
- solution / 1600-1699 / 1620.Coordinate With Maximum Network Quality / README
- solution / 1600-1699 / 1621.Number of Sets of K Non-Overlapping Line Segments / README
- solution / 1600-1699 / 1622.Fancy Sequence / README
- solution / 1600-1699 / 1623.All Valid Triplets That Can Represent a Country / README
- solution / 1600-1699 / 1624.Largest Substring Between Two Equal Characters / README
- solution / 1600-1699 / 1625.Lexicographically Smallest String After Applying Operations / README
- solution / 1600-1699 / 1626.Best Team With No Conflicts / README
- solution / 1600-1699 / 1627.Graph Connectivity With Threshold / README
- solution / 1600-1699 / 1628.Design an Expression Tree With Evaluate Function / README
- solution / 1600-1699 / 1629.Slowest Key / README
- solution / 1600-1699 / 1630.Arithmetic Subarrays / README
- solution / 1600-1699 / 1631.Path With Minimum Effort / README
- solution / 1600-1699 / 1632.Rank Transform of a Matrix / README
- solution / 1600-1699 / 1633.Percentage of Users Attended a Contest / README
- solution / 1600-1699 / 1634.Add Two Polynomials Represented as Linked Lists / README
- solution / 1600-1699 / 1635.Hopper Company Queries I / README
- solution / 1600-1699 / 1636.Sort Array by Increasing Frequency / README
- solution / 1600-1699 / 1637.Widest Vertical Area Between Two Points Containing No Points / README
- solution / 1600-1699 / 1638.Count Substrings That Differ by One Character / README
- solution / 1600-1699 / 1639.Number of Ways to Form a Target String Given a Dictionary / README
- solution / 1600-1699 / 1640.Check Array Formation Through Concatenation / README
- solution / 1600-1699 / 1641.Count Sorted Vowel Strings / README
- solution / 1600-1699 / 1642.Furthest Building You Can Reach / README
- solution / 1600-1699 / 1643.Kth Smallest Instructions / README
- solution / 1600-1699 / 1644.Lowest Common Ancestor of a Binary Tree II / README
- solution / 1600-1699 / 1645.Hopper Company Queries II / README
- solution / 1600-1699 / 1646.Get Maximum in Generated Array / README
- solution / 1600-1699 / 1647.Minimum Deletions to Make Character Frequencies Unique / README
- solution / 1600-1699 / 1648.Sell Diminishing-Valued Colored Balls / README
- solution / 1600-1699 / 1649.Create Sorted Array through Instructions / README
- solution / 1600-1699 / 1650.Lowest Common Ancestor of a Binary Tree III / README
- solution / 1600-1699 / 1651.Hopper Company Queries III / README
- solution / 1600-1699 / 1652.Defuse the Bomb / README
- solution / 1600-1699 / 1653.Minimum Deletions to Make String Balanced / README
- solution / 1600-1699 / 1654.Minimum Jumps to Reach Home / README
- solution / 1600-1699 / 1655.Distribute Repeating Integers / README
- solution / 1600-1699 / 1656.Design an Ordered Stream / README
- solution / 1600-1699 / 1657.Determine if Two Strings Are Close / README
- solution / 1600-1699 / 1658.Minimum Operations to Reduce X to Zero / README
- solution / 1600-1699 / 1659.Maximize Grid Happiness / README
- solution / 1600-1699 / 1660.Correct a Binary Tree / README
- solution / 1600-1699 / 1661.Average Time of Process per Machine / README
- solution / 1600-1699 / 1662.Check If Two String Arrays are Equivalent / README
- solution / 1600-1699 / 1663.Smallest String With A Given Numeric Value / README
- solution / 1600-1699 / 1664.Ways to Make a Fair Array / README
- solution / 1600-1699 / 1665.Minimum Initial Energy to Finish Tasks / README
- solution / 1600-1699 / 1666.Change the Root of a Binary Tree / README
- solution / 1600-1699 / 1667.Fix Names in a Table / README
- solution / 1600-1699 / 1668.Maximum Repeating Substring / README
- solution / 1600-1699 / 1669.Merge In Between Linked Lists / README
- solution / 1600-1699 / 1670.Design Front Middle Back Queue / README
- solution / 1600-1699 / 1671.Minimum Number of Removals to Make Mountain Array / README
- solution / 1600-1699 / 1672.Richest Customer Wealth / README
- solution / 1600-1699 / 1673.Find the Most Competitive Subsequence / README
- solution / 1600-1699 / 1674.Minimum Moves to Make Array Complementary / README
- solution / 1600-1699 / 1675.Minimize Deviation in Array / README
- solution / 1600-1699 / 1676.Lowest Common Ancestor of a Binary Tree IV / README
- solution / 1600-1699 / 1677.Product's Worth Over Invoices / README
- solution / 1600-1699 / 1678.Goal Parser Interpretation / README
- solution / 1600-1699 / 1679.Max Number of K-Sum Pairs / README
- solution / 1600-1699 / 1680.Concatenation of Consecutive Binary Numbers / README
- solution / 1600-1699 / 1681.Minimum Incompatibility / README
- solution / 1600-1699 / 1682.Longest Palindromic Subsequence II / README
- solution / 1600-1699 / 1683.Invalid Tweets / README
- solution / 1600-1699 / 1684.Count the Number of Consistent Strings / README
- solution / 1600-1699 / 1685.Sum of Absolute Differences in a Sorted Array / README
- solution / 1600-1699 / 1686.Stone Game VI / README
- solution / 1600-1699 / 1687.Delivering Boxes from Storage to Ports / README
- solution / 1600-1699 / 1688.Count of Matches in Tournament / README
- solution / 1600-1699 / 1689.Partitioning Into Minimum Number Of Deci-Binary Numbers / README
- solution / 1600-1699 / 1690.Stone Game VII / README
- solution / 1600-1699 / 1691.Maximum Height by Stacking Cuboids / README
- solution / 1600-1699 / 1692.Count Ways to Distribute Candies / README
- solution / 1600-1699 / 1693.Daily Leads and Partners / README
- solution / 1600-1699 / 1694.Reformat Phone Number / README
- solution / 1600-1699 / 1695.Maximum Erasure Value / README
- solution / 1600-1699 / 1696.Jump Game VI / README
- solution / 1600-1699 / 1697.Checking Existence of Edge Length Limited Paths / README
- solution / 1600-1699 / 1698.Number of Distinct Substrings in a String / README
- solution / 1600-1699 / 1699.Number of Calls Between Two Persons / README
- solution / 1700-1799 / 1700.Number of Students Unable to Eat Lunch / README
- solution / 1700-1799 / 1701.Average Waiting Time / README
- solution / 1700-1799 / 1702.Maximum Binary String After Change / README
- solution / 1700-1799 / 1703.Minimum Adjacent Swaps for K Consecutive Ones / README
- solution / 1700-1799 / 1704.Determine if String Halves Are Alike / README
- solution / 1700-1799 / 1705.Maximum Number of Eaten Apples / README
- solution / 1700-1799 / 1706.Where Will the Ball Fall / README
- solution / 1700-1799 / 1707.Maximum XOR With an Element From Array / README
- solution / 1700-1799 / 1708.Largest Subarray Length K / README
- solution / 1700-1799 / 1709.Biggest Window Between Visits / README
- solution / 1700-1799 / 1710.Maximum Units on a Truck / README
- solution / 1700-1799 / 1711.Count Good Meals / README
- solution / 1700-1799 / 1712.Ways to Split Array Into Three Subarrays / README
- solution / 1700-1799 / 1713.Minimum Operations to Make a Subsequence / README
- solution / 1700-1799 / 1714.Sum Of Special Evenly-Spaced Elements In Array / README
- solution / 1700-1799 / 1715.Count Apples and Oranges / README
- solution / 1700-1799 / 1716.Calculate Money in Leetcode Bank / README
- solution / 1700-1799 / 1717.Maximum Score From Removing Substrings / README
- solution / 1700-1799 / 1718.Construct the Lexicographically Largest Valid Sequence / README
- solution / 1700-1799 / 1719.Number Of Ways To Reconstruct A Tree / README
- solution / 1700-1799 / 1720.Decode XORed Array / README
- solution / 1700-1799 / 1721.Swapping Nodes in a Linked List / README
- solution / 1700-1799 / 1722.Minimize Hamming Distance After Swap Operations / README
- solution / 1700-1799 / 1723.Find Minimum Time to Finish All Jobs / README
- solution / 1700-1799 / 1724.Checking Existence of Edge Length Limited Paths II / README
- solution / 1700-1799 / 1725.Number Of Rectangles That Can Form The Largest Square / README
- solution / 1700-1799 / 1726.Tuple with Same Product / README
- solution / 1700-1799 / 1727.Largest Submatrix With Rearrangements / README
- solution / 1700-1799 / 1728.Cat and Mouse II / README
- solution / 1700-1799 / 1729.Find Followers Count / README
- solution / 1700-1799 / 1730.Shortest Path to Get Food / README
- solution / 1700-1799 / 1731.The Number of Employees Which Report to Each Employee / README
- solution / 1700-1799 / 1732.Find the Highest Altitude / README
- solution / 1700-1799 / 1733.Minimum Number of People to Teach / README
- solution / 1700-1799 / 1734.Decode XORed Permutation / README
- solution / 1700-1799 / 1735.Count Ways to Make Array With Product / README
- solution / 1700-1799 / 1736.Latest Time by Replacing Hidden Digits / README
- solution / 1700-1799 / 1737.Change Minimum Characters to Satisfy One of Three Conditions / README
- solution / 1700-1799 / 1738.Find Kth Largest XOR Coordinate Value / README
- solution / 1700-1799 / 1739.Building Boxes / README
- solution / 1700-1799 / 1740.Find Distance in a Binary Tree / README
- solution / 1700-1799 / 1741.Find Total Time Spent by Each Employee / README
- solution / 1700-1799 / 1742.Maximum Number of Balls in a Box / README
- solution / 1700-1799 / 1743.Restore the Array From Adjacent Pairs / README
- solution / 1700-1799 / 1744.Can You Eat Your Favorite Candy on Your Favorite Day / README
- solution / 1700-1799 / 1745.Palindrome Partitioning IV / README
- solution / 1700-1799 / 1746.Maximum Subarray Sum After One Operation / README
- solution / 1700-1799 / 1747.Leetflex Banned Accounts / README
- solution / 1700-1799 / 1748.Sum of Unique Elements / README
- solution / 1700-1799 / 1749.Maximum Absolute Sum of Any Subarray / README
- solution / 1700-1799 / 1750.Minimum Length of String After Deleting Similar Ends / README
- solution / 1700-1799 / 1751.Maximum Number of Events That Can Be Attended II / README
- solution / 1700-1799 / 1752.Check if Array Is Sorted and Rotated / README
- solution / 1700-1799 / 1753.Maximum Score From Removing Stones / README
- solution / 1700-1799 / 1754.Largest Merge Of Two Strings / README
- solution / 1700-1799 / 1755.Closest Subsequence Sum / README
- solution / 1700-1799 / 1756.Design Most Recently Used Queue / README
- solution / 1700-1799 / 1757.Recyclable and Low Fat Products / README
- solution / 1700-1799 / 1758.Minimum Changes To Make Alternating Binary String / README
- solution / 1700-1799 / 1759.Count Number of Homogenous Substrings / README
- solution / 1700-1799 / 1760.Minimum Limit of Balls in a Bag / README
- solution / 1700-1799 / 1761.Minimum Degree of a Connected Trio in a Graph / README
- solution / 1700-1799 / 1762.Buildings With an Ocean View / README
- solution / 1700-1799 / 1763.Longest Nice Substring / README
- solution / 1700-1799 / 1764.Form Array by Concatenating Subarrays of Another Array / README
- solution / 1700-1799 / 1765.Map of Highest Peak / README
- solution / 1700-1799 / 1766.Tree of Coprimes / README
- solution / 1700-1799 / 1767.Find the Subtasks That Did Not Execute / README
- solution / 1700-1799 / 1768.Merge Strings Alternately / README
- solution / 1700-1799 / 1769.Minimum Number of Operations to Move All Balls to Each Box / README
- solution / 1700-1799 / 1770.Maximum Score from Performing Multiplication Operations / README
- solution / 1700-1799 / 1771.Maximize Palindrome Length From Subsequences / README
- solution / 1700-1799 / 1772.Sort Features by Popularity / README
- solution / 1700-1799 / 1773.Count Items Matching a Rule / README
- solution / 1700-1799 / 1774.Closest Dessert Cost / README
- solution / 1700-1799 / 1775.Equal Sum Arrays With Minimum Number of Operations / README
- solution / 1700-1799 / 1776.Car Fleet II / README
- solution / 1700-1799 / 1777.Product's Price for Each Store / README
- solution / 1700-1799 / 1778.Shortest Path in a Hidden Grid / README
- solution / 1700-1799 / 1779.Find Nearest Point That Has the Same X or Y Coordinate / README
- solution / 1700-1799 / 1780.Check if Number is a Sum of Powers of Three / README
- solution / 1700-1799 / 1781.Sum of Beauty of All Substrings / README
- solution / 1700-1799 / 1782.Count Pairs Of Nodes / README
- solution / 1700-1799 / 1783.Grand Slam Titles / README
- solution / 1700-1799 / 1784.Check if Binary String Has at Most One Segment of Ones / README
- solution / 1700-1799 / 1785.Minimum Elements to Add to Form a Given Sum / README
- solution / 1700-1799 / 1786.Number of Restricted Paths From First to Last Node / README
- solution / 1700-1799 / 1787.Make the XOR of All Segments Equal to Zero / README
- solution / 1700-1799 / 1788.Maximize the Beauty of the Garden / README
- solution / 1700-1799 / 1789.Primary Department for Each Employee / README
- solution / 1700-1799 / 1790.Check if One String Swap Can Make Strings Equal / README
- solution / 1700-1799 / 1791.Find Center of Star Graph / README
- solution / 1700-1799 / 1792.Maximum Average Pass Ratio / README
- solution / 1700-1799 / 1793.Maximum Score of a Good Subarray / README
- solution / 1700-1799 / 1794.Count Pairs of Equal Substrings With Minimum Difference / README
- solution / 1700-1799 / 1795.Rearrange Products Table / README
- solution / 1700-1799 / 1796.Second Largest Digit in a String / README
- solution / 1700-1799 / 1797.Design Authentication Manager / README
- solution / 1700-1799 / 1798.Maximum Number of Consecutive Values You Can Make / README
- solution / 1700-1799 / 1799.Maximize Score After N Operations / README
- solution / 1800-1899 / 1800.Maximum Ascending Subarray Sum / README
- solution / 1800-1899 / 1801.Number of Orders in the Backlog / README
- solution / 1800-1899 / 1802.Maximum Value at a Given Index in a Bounded Array / README
- solution / 1800-1899 / 1803.Count Pairs With XOR in a Range / README
- solution / 1800-1899 / 1804.Implement Trie II (Prefix Tree) / README
- solution / 1800-1899 / 1805.Number of Different Integers in a String / README
- solution / 1800-1899 / 1806.Minimum Number of Operations to Reinitialize a Permutation / README
- solution / 1800-1899 / 1807.Evaluate the Bracket Pairs of a String / README
- solution / 1800-1899 / 1808.Maximize Number of Nice Divisors / README
- solution / 1800-1899 / 1809.Ad-Free Sessions / README
- solution / 1800-1899 / 1810.Minimum Path Cost in a Hidden Grid / README
- solution / 1800-1899 / 1811.Find Interview Candidates / README
- solution / 1800-1899 / 1812.Determine Color of a Chessboard Square / README
- solution / 1800-1899 / 1813.Sentence Similarity III / README
- solution / 1800-1899 / 1814.Count Nice Pairs in an Array / README
- solution / 1800-1899 / 1815.Maximum Number of Groups Getting Fresh Donuts / README
- solution / 1800-1899 / 1816.Truncate Sentence / README
- solution / 1800-1899 / 1817.Finding the Users Active Minutes / README
- solution / 1800-1899 / 1818.Minimum Absolute Sum Difference / README
- solution / 1800-1899 / 1819.Number of Different Subsequences GCDs / README
- solution / 1800-1899 / 1820.Maximum Number of Accepted Invitations / README
- solution / 1800-1899 / 1821.Find Customers With Positive Revenue this Year / README
- solution / 1800-1899 / 1822.Sign of the Product of an Array / README
- solution / 1800-1899 / 1823.Find the Winner of the Circular Game / README
- solution / 1800-1899 / 1824.Minimum Sideway Jumps / README
- solution / 1800-1899 / 1825.Finding MK Average / README
- solution / 1800-1899 / 1826.Faulty Sensor / README
- solution / 1800-1899 / 1827.Minimum Operations to Make the Array Increasing / README
- solution / 1800-1899 / 1828.Queries on Number of Points Inside a Circle / README
- solution / 1800-1899 / 1829.Maximum XOR for Each Query / README
- solution / 1800-1899 / 1830.Minimum Number of Operations to Make String Sorted / README
- solution / 1800-1899 / 1831.Maximum Transaction Each Day / README
- solution / 1800-1899 / 1832.Check if the Sentence Is Pangram / README
- solution / 1800-1899 / 1833.Maximum Ice Cream Bars / README
- solution / 1800-1899 / 1834.Single-Threaded CPU / README
- solution / 1800-1899 / 1835.Find XOR Sum of All Pairs Bitwise AND / README
- solution / 1800-1899 / 1836.Remove Duplicates From an Unsorted Linked List / README
- solution / 1800-1899 / 1837.Sum of Digits in Base K / README
- solution / 1800-1899 / 1838.Frequency of the Most Frequent Element / README
- solution / 1800-1899 / 1839.Longest Substring Of All Vowels in Order / README
- solution / 1800-1899 / 1840.Maximum Building Height / README
- solution / 1800-1899 / 1841.League Statistics / README
- solution / 1800-1899 / 1842.Next Palindrome Using Same Digits / README
- solution / 1800-1899 / 1843.Suspicious Bank Accounts / README
- solution / 1800-1899 / 1844.Replace All Digits with Characters / README
- solution / 1800-1899 / 1845.Seat Reservation Manager / README
- solution / 1800-1899 / 1846.Maximum Element After Decreasing and Rearranging / README
- solution / 1800-1899 / 1847.Closest Room / README
- solution / 1800-1899 / 1848.Minimum Distance to the Target Element / README
- solution / 1800-1899 / 1849.Splitting a String Into Descending Consecutive Values / README
- solution / 1800-1899 / 1850.Minimum Adjacent Swaps to Reach the Kth Smallest Number / README
- solution / 1800-1899 / 1851.Minimum Interval to Include Each Query / README
- solution / 1800-1899 / 1852.Distinct Numbers in Each Subarray / README
- solution / 1800-1899 / 1853.Convert Date Format / README
- solution / 1800-1899 / 1854.Maximum Population Year / README
- solution / 1800-1899 / 1855.Maximum Distance Between a Pair of Values / README
- solution / 1800-1899 / 1856.Maximum Subarray Min-Product / README
- solution / 1800-1899 / 1857.Largest Color Value in a Directed Graph / README
- solution / 1800-1899 / 1858.Longest Word With All Prefixes / README
- solution / 1800-1899 / 1859.Sorting the Sentence / README
- solution / 1800-1899 / 1860.Incremental Memory Leak / README
- solution / 1800-1899 / 1861.Rotating the Box / README
- solution / 1800-1899 / 1862.Sum of Floored Pairs / README
- solution / 1800-1899 / 1863.Sum of All Subset XOR Totals / README
- solution / 1800-1899 / 1864.Minimum Number of Swaps to Make the Binary String Alternating / README
- solution / 1800-1899 / 1865.Finding Pairs With a Certain Sum / README
- solution / 1800-1899 / 1866.Number of Ways to Rearrange Sticks With K Sticks Visible / README
- solution / 1800-1899 / 1867.Orders With Maximum Quantity Above Average / README
- solution / 1800-1899 / 1868.Product of Two Run-Length Encoded Arrays / README
- solution / 1800-1899 / 1869.Longer Contiguous Segments of Ones than Zeros / README
- solution / 1800-1899 / 1870.Minimum Speed to Arrive on Time / README
- solution / 1800-1899 / 1871.Jump Game VII / README
- solution / 1800-1899 / 1872.Stone Game VIII / README
- solution / 1800-1899 / 1873.Calculate Special Bonus / README
- solution / 1800-1899 / 1874.Minimize Product Sum of Two Arrays / README
- solution / 1800-1899 / 1875.Group Employees of the Same Salary / README
- solution / 1800-1899 / 1876.Substrings of Size Three with Distinct Characters / README
- solution / 1800-1899 / 1877.Minimize Maximum Pair Sum in Array / README
- solution / 1800-1899 / 1878.Get Biggest Three Rhombus Sums in a Grid / README
- solution / 1800-1899 / 1879.Minimum XOR Sum of Two Arrays / README
- solution / 1800-1899 / 1880.Check if Word Equals Summation of Two Words / README
- solution / 1800-1899 / 1881.Maximum Value after Insertion / README
- solution / 1800-1899 / 1882.Process Tasks Using Servers / README
- solution / 1800-1899 / 1883.Minimum Skips to Arrive at Meeting On Time / README
- solution / 1800-1899 / 1884.Egg Drop With 2 Eggs and N Floors / README
- solution / 1800-1899 / 1885.Count Pairs in Two Arrays / README
- solution / 1800-1899 / 1886.Determine Whether Matrix Can Be Obtained By Rotation / README
- solution / 1800-1899 / 1887.Reduction Operations to Make the Array Elements Equal / README
- solution / 1800-1899 / 1888.Minimum Number of Flips to Make the Binary String Alternating / README
- solution / 1800-1899 / 1889.Minimum Space Wasted From Packaging / README
- solution / 1800-1899 / 1890.The Latest Login in 2020 / README
- solution / 1800-1899 / 1891.Cutting Ribbons / README
- solution / 1800-1899 / 1892.Page Recommendations II / README
- solution / 1800-1899 / 1893.Check if All the Integers in a Range Are Covered / README
- solution / 1800-1899 / 1894.Find the Student that Will Replace the Chalk / README
- solution / 1800-1899 / 1895.Largest Magic Square / README
- solution / 1800-1899 / 1896.Minimum Cost to Change the Final Value of Expression / README
- solution / 1800-1899 / 1897.Redistribute Characters to Make All Strings Equal / README
- solution / 1800-1899 / 1898.Maximum Number of Removable Characters / README
- solution / 1800-1899 / 1899.Merge Triplets to Form Target Triplet / README
- solution / 1900-1999 / 1900.The Earliest and Latest Rounds Where Players Compete / README
- solution / 1900-1999 / 1901.Find a Peak Element II / README
- solution / 1900-1999 / 1902.Depth of BST Given Insertion Order / README
- solution / 1900-1999 / 1903.Largest Odd Number in String / README
- solution / 1900-1999 / 1904.The Number of Full Rounds You Have Played / README
- solution / 1900-1999 / 1905.Count Sub Islands / README
- solution / 1900-1999 / 1906.Minimum Absolute Difference Queries / README
- solution / 1900-1999 / 1907.Count Salary Categories / README
- solution / 1900-1999 / 1908.Game of Nim / README
- solution / 1900-1999 / 1909.Remove One Element to Make the Array Strictly Increasing / README
- solution / 1900-1999 / 1910.Remove All Occurrences of a Substring / README
- solution / 1900-1999 / 1911.Maximum Alternating Subsequence Sum / README
- solution / 1900-1999 / 1912.Design Movie Rental System / README
- solution / 1900-1999 / 1913.Maximum Product Difference Between Two Pairs / README
- solution / 1900-1999 / 1914.Cyclically Rotating a Grid / README
- solution / 1900-1999 / 1915.Number of Wonderful Substrings / README
- solution / 1900-1999 / 1916.Count Ways to Build Rooms in an Ant Colony / README
- solution / 1900-1999 / 1917.Leetcodify Friends Recommendations / README
- solution / 1900-1999 / 1918.Kth Smallest Subarray Sum / README
- solution / 1900-1999 / 1919.Leetcodify Similar Friends / README
- solution / 1900-1999 / 1920.Build Array from Permutation / README
- solution / 1900-1999 / 1921.Eliminate Maximum Number of Monsters / README
- solution / 1900-1999 / 1922.Count Good Numbers / README
- solution / 1900-1999 / 1923.Longest Common Subpath / README
- solution / 1900-1999 / 1924.Erect the Fence II / README
- solution / 1900-1999 / 1925.Count Square Sum Triples / README
- solution / 1900-1999 / 1926.Nearest Exit from Entrance in Maze / README
- solution / 1900-1999 / 1927.Sum Game / README
- solution / 1900-1999 / 1928.Minimum Cost to Reach Destination in Time / README
- solution / 1900-1999 / 1929.Concatenation of Array / README
- solution / 1900-1999 / 1930.Unique Length-3 Palindromic Subsequences / README
- solution / 1900-1999 / 1931.Painting a Grid With Three Different Colors / README
- solution / 1900-1999 / 1932.Merge BSTs to Create Single BST / README
- solution / 1900-1999 / 1933.Check if String Is Decomposable Into Value-Equal Substrings / README
- solution / 1900-1999 / 1934.Confirmation Rate / README
- solution / 1900-1999 / 1935.Maximum Number of Words You Can Type / README
- solution / 1900-1999 / 1936.Add Minimum Number of Rungs / README
- solution / 1900-1999 / 1937.Maximum Number of Points with Cost / README
- solution / 1900-1999 / 1938.Maximum Genetic Difference Query / README
- solution / 1900-1999 / 1939.Users That Actively Request Confirmation Messages / README
- solution / 1900-1999 / 1940.Longest Common Subsequence Between Sorted Arrays / README
- solution / 1900-1999 / 1941.Check if All Characters Have Equal Number of Occurrences / README
- solution / 1900-1999 / 1942.The Number of the Smallest Unoccupied Chair / README
- solution / 1900-1999 / 1943.Describe the Painting / README
- solution / 1900-1999 / 1944.Number of Visible People in a Queue / README
- solution / 1900-1999 / 1945.Sum of Digits of String After Convert / README
- solution / 1900-1999 / 1946.Largest Number After Mutating Substring / README
- solution / 1900-1999 / 1947.Maximum Compatibility Score Sum / README
- solution / 1900-1999 / 1948.Delete Duplicate Folders in System / README
- solution / 1900-1999 / 1949.Strong Friendship / README
- solution / 1900-1999 / 1950.Maximum of Minimum Values in All Subarrays / README
- solution / 1900-1999 / 1951.All the Pairs With the Maximum Number of Common Followers / README
- solution / 1900-1999 / 1952.Three Divisors / README
- solution / 1900-1999 / 1953.Maximum Number of Weeks for Which You Can Work / README
- solution / 1900-1999 / 1954.Minimum Garden Perimeter to Collect Enough Apples / README
- solution / 1900-1999 / 1955.Count Number of Special Subsequences / README
- solution / 1900-1999 / 1956.Minimum Time For K Virus Variants to Spread / README
- solution / 1900-1999 / 1957.Delete Characters to Make Fancy String / README
- solution / 1900-1999 / 1958.Check if Move is Legal / README
- solution / 1900-1999 / 1959.Minimum Total Space Wasted With K Resizing Operations / README
- solution / 1900-1999 / 1960.Maximum Product of the Length of Two Palindromic Substrings / README
- solution / 1900-1999 / 1961.Check If String Is a Prefix of Array / README
- solution / 1900-1999 / 1962.Remove Stones to Minimize the Total / README
- solution / 1900-1999 / 1963.Minimum Number of Swaps to Make the String Balanced / README
- solution / 1900-1999 / 1964.Find the Longest Valid Obstacle Course at Each Position / README
- solution / 1900-1999 / 1965.Employees With Missing Information / README
- solution / 1900-1999 / 1966.Binary Searchable Numbers in an Unsorted Array / README
- solution / 1900-1999 / 1967.Number of Strings That Appear as Substrings in Word / README
- solution / 1900-1999 / 1968.Array With Elements Not Equal to Average of Neighbors / README
- solution / 1900-1999 / 1969.Minimum Non-Zero Product of the Array Elements / README
- solution / 1900-1999 / 1970.Last Day Where You Can Still Cross / README
- solution / 1900-1999 / 1971.Find if Path Exists in Graph / README
- solution / 1900-1999 / 1972.First and Last Call On the Same Day / README
- solution / 1900-1999 / 1973.Count Nodes Equal to Sum of Descendants / README
- solution / 1900-1999 / 1974.Minimum Time to Type Word Using Special Typewriter / README
- solution / 1900-1999 / 1975.Maximum Matrix Sum / README
- solution / 1900-1999 / 1976.Number of Ways to Arrive at Destination / README
- solution / 1900-1999 / 1977.Number of Ways to Separate Numbers / README
- solution / 1900-1999 / 1978.Employees Whose Manager Left the Company / README
- solution / 1900-1999 / 1979.Find Greatest Common Divisor of Array / README
- solution / 1900-1999 / 1980.Find Unique Binary String / README
- solution / 1900-1999 / 1981.Minimize the Difference Between Target and Chosen Elements / README
- solution / 1900-1999 / 1982.Find Array Given Subset Sums / README
- solution / 1900-1999 / 1983.Widest Pair of Indices With Equal Range Sum / README
- solution / 1900-1999 / 1984.Minimum Difference Between Highest and Lowest of K Scores / README
- solution / 1900-1999 / 1985.Find the Kth Largest Integer in the Array / README
- solution / 1900-1999 / 1986.Minimum Number of Work Sessions to Finish the Tasks / README
- solution / 1900-1999 / 1987.Number of Unique Good Subsequences / README
- solution / 1900-1999 / 1988.Find Cutoff Score for Each School / README
- solution / 1900-1999 / 1989.Maximum Number of People That Can Be Caught in Tag / README
- solution / 1900-1999 / 1990.Count the Number of Experiments / README
- solution / 1900-1999 / 1991.Find the Middle Index in Array / README
- solution / 1900-1999 / 1992.Find All Groups of Farmland / README
- solution / 1900-1999 / 1993.Operations on Tree / README
- solution / 1900-1999 / 1994.The Number of Good Subsets / README
- solution / 1900-1999 / 1995.Count Special Quadruplets / README
- solution / 1900-1999 / 1996.The Number of Weak Characters in the Game / README
- solution / 1900-1999 / 1997.First Day Where You Have Been in All the Rooms / README
- solution / 1900-1999 / 1998.GCD Sort of an Array / README
- solution / 1900-1999 / 1999.Smallest Greater Multiple Made of Two Digits / README
- solution / 2000-2099 / 2000.Reverse Prefix of Word / README
- solution / 2000-2099 / 2001.Number of Pairs of Interchangeable Rectangles / README
- solution / 2000-2099 / 2002.Maximum Product of the Length of Two Palindromic Subsequences / README
- solution / 2000-2099 / 2003.Smallest Missing Genetic Value in Each Subtree / README
- solution / 2000-2099 / 2004.The Number of Seniors and Juniors to Join the Company / README
- solution / 2000-2099 / 2005.Subtree Removal Game with Fibonacci Tree / README
- solution / 2000-2099 / 2006.Count Number of Pairs With Absolute Difference K / README
- solution / 2000-2099 / 2007.Find Original Array From Doubled Array / README
- solution / 2000-2099 / 2008.Maximum Earnings From Taxi / README
- solution / 2000-2099 / 2009.Minimum Number of Operations to Make Array Continuous / README
- solution / 2000-2099 / 2010.The Number of Seniors and Juniors to Join the Company II / README
- solution / 2000-2099 / 2011.Final Value of Variable After Performing Operations / README
- solution / 2000-2099 / 2012.Sum of Beauty in the Array / README
- solution / 2000-2099 / 2013.Detect Squares / README
- solution / 2000-2099 / 2014.Longest Subsequence Repeated k Times / README
- solution / 2000-2099 / 2015.Average Height of Buildings in Each Segment / README
- solution / 2000-2099 / 2016.Maximum Difference Between Increasing Elements / README
- solution / 2000-2099 / 2017.Grid Game / README
- solution / 2000-2099 / 2018.Check if Word Can Be Placed In Crossword / README
- solution / 2000-2099 / 2019.The Score of Students Solving Math Expression / README
- solution / 2000-2099 / 2020.Number of Accounts That Did Not Stream / README
- solution / 2000-2099 / 2021.Brightest Position on Street / README
- solution / 2000-2099 / 2022.Convert 1D Array Into 2D Array / README
- solution / 2000-2099 / 2023.Number of Pairs of Strings With Concatenation Equal to Target / README
- solution / 2000-2099 / 2024.Maximize the Confusion of an Exam / README
- solution / 2000-2099 / 2025.Maximum Number of Ways to Partition an Array / README
- solution / 2000-2099 / 2026.Low-Quality Problems / README
- solution / 2000-2099 / 2027.Minimum Moves to Convert String / README
- solution / 2000-2099 / 2028.Find Missing Observations / README
- solution / 2000-2099 / 2029.Stone Game IX / README
- solution / 2000-2099 / 2030.Smallest K-Length Subsequence With Occurrences of a Letter / README
- solution / 2000-2099 / 2031.Count Subarrays With More Ones Than Zeros / README
- solution / 2000-2099 / 2032.Two Out of Three / README
- solution / 2000-2099 / 2033.Minimum Operations to Make a Uni-Value Grid / README
- solution / 2000-2099 / 2034.Stock Price Fluctuation / README
- solution / 2000-2099 / 2035.Partition Array Into Two Arrays to Minimize Sum Difference / README
- solution / 2000-2099 / 2036.Maximum Alternating Subarray Sum / README
- solution / 2000-2099 / 2037.Minimum Number of Moves to Seat Everyone / README
- solution / 2000-2099 / 2038.Remove Colored Pieces if Both Neighbors are the Same Color / README
- solution / 2000-2099 / 2039.The Time When the Network Becomes Idle / README
- solution / 2000-2099 / 2040.Kth Smallest Product of Two Sorted Arrays / README
- solution / 2000-2099 / 2041.Accepted Candidates From the Interviews / README
- solution / 2000-2099 / 2042.Check if Numbers Are Ascending in a Sentence / README
- solution / 2000-2099 / 2043.Simple Bank System / README
- solution / 2000-2099 / 2044.Count Number of Maximum Bitwise-OR Subsets / README
- solution / 2000-2099 / 2045.Second Minimum Time to Reach Destination / README
- solution / 2000-2099 / 2046.Sort Linked List Already Sorted Using Absolute Values / README
- solution / 2000-2099 / 2047.Number of Valid Words in a Sentence / README
- solution / 2000-2099 / 2048.Next Greater Numerically Balanced Number / README
- solution / 2000-2099 / 2049.Count Nodes With the Highest Score / README
- solution / 2000-2099 / 2050.Parallel Courses III / README
- solution / 2000-2099 / 2051.The Category of Each Member in the Store / README
- solution / 2000-2099 / 2052.Minimum Cost to Separate Sentence Into Rows / README
- solution / 2000-2099 / 2053.Kth Distinct String in an Array / README
- solution / 2000-2099 / 2054.Two Best Non-Overlapping Events / README
- solution / 2000-2099 / 2055.Plates Between Candles / README
- solution / 2000-2099 / 2056.Number of Valid Move Combinations On Chessboard / README
- solution / 2000-2099 / 2057.Smallest Index With Equal Value / README
- solution / 2000-2099 / 2058.Find the Minimum and Maximum Number of Nodes Between Critical Points / README
- solution / 2000-2099 / 2059.Minimum Operations to Convert Number / README
- solution / 2000-2099 / 2060.Check if an Original String Exists Given Two Encoded Strings / README
- solution / 2000-2099 / 2061.Number of Spaces Cleaning Robot Cleaned / README
- solution / 2000-2099 / 2062.Count Vowel Substrings of a String / README
- solution / 2000-2099 / 2063.Vowels of All Substrings / README
- solution / 2000-2099 / 2064.Minimized Maximum of Products Distributed to Any Store / README
- solution / 2000-2099 / 2065.Maximum Path Quality of a Graph / README
- solution / 2000-2099 / 2066.Account Balance / README
- solution / 2000-2099 / 2067.Number of Equal Count Substrings / README
- solution / 2000-2099 / 2068.Check Whether Two Strings are Almost Equivalent / README
- solution / 2000-2099 / 2069.Walking Robot Simulation II / README
- solution / 2000-2099 / 2070.Most Beautiful Item for Each Query / README
- solution / 2000-2099 / 2071.Maximum Number of Tasks You Can Assign / README
- solution / 2000-2099 / 2072.The Winner University / README
- solution / 2000-2099 / 2073.Time Needed to Buy Tickets / README
- solution / 2000-2099 / 2074.Reverse Nodes in Even Length Groups / README
- solution / 2000-2099 / 2075.Decode the Slanted Ciphertext / README
- solution / 2000-2099 / 2076.Process Restricted Friend Requests / README
- solution / 2000-2099 / 2077.Paths in Maze That Lead to Same Room / README
- solution / 2000-2099 / 2078.Two Furthest Houses With Different Colors / README
- solution / 2000-2099 / 2079.Watering Plants / README
- solution / 2000-2099 / 2080.Range Frequency Queries / README
- solution / 2000-2099 / 2081.Sum of k-Mirror Numbers / README
- solution / 2000-2099 / 2082.The Number of Rich Customers / README
- solution / 2000-2099 / 2083.Substrings That Begin and End With the Same Letter / README
- solution / 2000-2099 / 2084.Drop Type 1 Orders for Customers With Type 0 Orders / README
- solution / 2000-2099 / 2085.Count Common Words With One Occurrence / README
- solution / 2000-2099 / 2086.Minimum Number of Food Buckets to Feed the Hamsters / README
- solution / 2000-2099 / 2087.Minimum Cost Homecoming of a Robot in a Grid / README
- solution / 2000-2099 / 2088.Count Fertile Pyramids in a Land / README
- solution / 2000-2099 / 2089.Find Target Indices After Sorting Array / README
- solution / 2000-2099 / 2090.K Radius Subarray Averages / README
- solution / 2000-2099 / 2091.Removing Minimum and Maximum From Array / README
- solution / 2000-2099 / 2092.Find All People With Secret / README
- solution / 2000-2099 / 2093.Minimum Cost to Reach City With Discounts / README
- solution / 2000-2099 / 2094.Finding 3-Digit Even Numbers / README
- solution / 2000-2099 / 2095.Delete the Middle Node of a Linked List / README
- solution / 2000-2099 / 2096.Step-By-Step Directions From a Binary Tree Node to Another / README
- solution / 2000-2099 / 2097.Valid Arrangement of Pairs / README
- solution / 2000-2099 / 2098.Subsequence of Size K With the Largest Even Sum / README
- solution / 2000-2099 / 2099.Find Subsequence of Length K With the Largest Sum / README
- solution / 2100-2199 / 2100.Find Good Days to Rob the Bank / README
- solution / 2100-2199 / 2101.Detonate the Maximum Bombs / README
- solution / 2100-2199 / 2102.Sequentially Ordinal Rank Tracker / README
- solution / 2100-2199 / 2103.Rings and Rods / README
- solution / 2100-2199 / 2104.Sum of Subarray Ranges / README
- solution / 2100-2199 / 2105.Watering Plants II / README
- solution / 2100-2199 / 2106.Maximum Fruits Harvested After at Most K Steps / README
- solution / 2100-2199 / 2107.Number of Unique Flavors After Sharing K Candies / README
- solution / 2100-2199 / 2108.Find First Palindromic String in the Array / README
- solution / 2100-2199 / 2109.Adding Spaces to a String / README
- solution / 2100-2199 / 2110.Number of Smooth Descent Periods of a Stock / README
- solution / 2100-2199 / 2111.Minimum Operations to Make the Array K-Increasing / README
- solution / 2100-2199 / 2112.The Airport With the Most Traffic / README
- solution / 2100-2199 / 2113.Elements in Array After Removing and Replacing Elements / README
- solution / 2100-2199 / 2114.Maximum Number of Words Found in Sentences / README
- solution / 2100-2199 / 2115.Find All Possible Recipes from Given Supplies / README
- solution / 2100-2199 / 2116.Check if a Parentheses String Can Be Valid / README
- solution / 2100-2199 / 2117.Abbreviating the Product of a Range / README
- solution / 2100-2199 / 2118.Build the Equation / README
- solution / 2100-2199 / 2119.A Number After a Double Reversal / README
- solution / 2100-2199 / 2120.Execution of All Suffix Instructions Staying in a Grid / README
- solution / 2100-2199 / 2121.Intervals Between Identical Elements / README
- solution / 2100-2199 / 2122.Recover the Original Array / README
- solution / 2100-2199 / 2123.Minimum Operations to Remove Adjacent Ones in Matrix / README
- solution / 2100-2199 / 2124.Check if All A's Appears Before All B's / README
- solution / 2100-2199 / 2125.Number of Laser Beams in a Bank / README
- solution / 2100-2199 / 2126.Destroying Asteroids / README
- solution / 2100-2199 / 2127.Maximum Employees to Be Invited to a Meeting / README
- solution / 2100-2199 / 2128.Remove All Ones With Row and Column Flips / README
- solution / 2100-2199 / 2129.Capitalize the Title / README
- solution / 2100-2199 / 2130.Maximum Twin Sum of a Linked List / README
- solution / 2100-2199 / 2131.Longest Palindrome by Concatenating Two Letter Words / README
- solution / 2100-2199 / 2132.Stamping the Grid / README
- solution / 2100-2199 / 2133.Check if Every Row and Column Contains All Numbers / README
- solution / 2100-2199 / 2134.Minimum Swaps to Group All 1's Together II / README
- solution / 2100-2199 / 2135.Count Words Obtained After Adding a Letter / README
- solution / 2100-2199 / 2136.Earliest Possible Day of Full Bloom / README
- solution / 2100-2199 / 2137.Pour Water Between Buckets to Make Water Levels Equal / README
- solution / 2100-2199 / 2138.Divide a String Into Groups of Size k / README
- solution / 2100-2199 / 2139.Minimum Moves to Reach Target Score / README
- solution / 2100-2199 / 2140.Solving Questions With Brainpower / README
- solution / 2100-2199 / 2141.Maximum Running Time of N Computers / README
- solution / 2100-2199 / 2142.The Number of Passengers in Each Bus I / README
- solution / 2100-2199 / 2143.Choose Numbers From Two Arrays in Range / README
- solution / 2100-2199 / 2144.Minimum Cost of Buying Candies With Discount / README
- solution / 2100-2199 / 2145.Count the Hidden Sequences / README
- solution / 2100-2199 / 2146.K Highest Ranked Items Within a Price Range / README
- solution / 2100-2199 / 2147.Number of Ways to Divide a Long Corridor / README
- solution / 2100-2199 / 2148.Count Elements With Strictly Smaller and Greater Elements / README
- solution / 2100-2199 / 2149.Rearrange Array Elements by Sign / README
- solution / 2100-2199 / 2150.Find All Lonely Numbers in the Array / README
- solution / 2100-2199 / 2151.Maximum Good People Based on Statements / README
- solution / 2100-2199 / 2152.Minimum Number of Lines to Cover Points / README
- solution / 2100-2199 / 2153.The Number of Passengers in Each Bus II / README
- solution / 2100-2199 / 2154.Keep Multiplying Found Values by Two / README
- solution / 2100-2199 / 2155.All Divisions With the Highest Score of a Binary Array / README
- solution / 2100-2199 / 2156.Find Substring With Given Hash Value / README
- solution / 2100-2199 / 2157.Groups of Strings / README
- solution / 2100-2199 / 2158.Amount of New Area Painted Each Day / README
- solution / 2100-2199 / 2159.Order Two Columns Independently / README
- solution / 2100-2199 / 2160.Minimum Sum of Four Digit Number After Splitting Digits / README
- solution / 2100-2199 / 2161.Partition Array According to Given Pivot / README
- solution / 2100-2199 / 2162.Minimum Cost to Set Cooking Time / README
- solution / 2100-2199 / 2163.Minimum Difference in Sums After Removal of Elements / README
- solution / 2100-2199 / 2164.Sort Even and Odd Indices Independently / README
- solution / 2100-2199 / 2165.Smallest Value of the Rearranged Number / README
- solution / 2100-2199 / 2166.Design Bitset / README
- solution / 2100-2199 / 2167.Minimum Time to Remove All Cars Containing Illegal Goods / README
- solution / 2100-2199 / 2168.Unique Substrings With Equal Digit Frequency / README
- solution / 2100-2199 / 2169.Count Operations to Obtain Zero / README
- solution / 2100-2199 / 2170.Minimum Operations to Make the Array Alternating / README
- solution / 2100-2199 / 2171.Removing Minimum Number of Magic Beans / README
- solution / 2100-2199 / 2172.Maximum AND Sum of Array / README
- solution / 2100-2199 / 2173.Longest Winning Streak / README
- solution / 2100-2199 / 2174.Remove All Ones With Row and Column Flips II / README
- solution / 2100-2199 / 2175.The Change in Global Rankings / README
- solution / 2100-2199 / 2176.Count Equal and Divisible Pairs in an Array / README
- solution / 2100-2199 / 2177.Find Three Consecutive Integers That Sum to a Given Number / README
- solution / 2100-2199 / 2178.Maximum Split of Positive Even Integers / README
- solution / 2100-2199 / 2179.Count Good Triplets in an Array / README
- solution / 2100-2199 / 2180.Count Integers With Even Digit Sum / README
- solution / 2100-2199 / 2181.Merge Nodes in Between Zeros / README
- solution / 2100-2199 / 2182.Construct String With Repeat Limit / README
- solution / 2100-2199 / 2183.Count Array Pairs Divisible by K / README
- solution / 2100-2199 / 2184.Number of Ways to Build Sturdy Brick Wall / README
- solution / 2100-2199 / 2185.Counting Words With a Given Prefix / README
- solution / 2100-2199 / 2186.Minimum Number of Steps to Make Two Strings Anagram II / README
- solution / 2100-2199 / 2187.Minimum Time to Complete Trips / README
- solution / 2100-2199 / 2188.Minimum Time to Finish the Race / README
- solution / 2100-2199 / 2189.Number of Ways to Build House of Cards / README
- solution / 2100-2199 / 2190.Most Frequent Number Following Key In an Array / README
- solution / 2100-2199 / 2191.Sort the Jumbled Numbers / README
- solution / 2100-2199 / 2192.All Ancestors of a Node in a Directed Acyclic Graph / README
- solution / 2100-2199 / 2193.Minimum Number of Moves to Make Palindrome / README
- solution / 2100-2199 / 2194.Cells in a Range on an Excel Sheet / README
- solution / 2100-2199 / 2195.Append K Integers With Minimal Sum / README
- solution / 2100-2199 / 2196.Create Binary Tree From Descriptions / README
- solution / 2100-2199 / 2197.Replace Non-Coprime Numbers in Array / README
- solution / 2100-2199 / 2198.Number of Single Divisor Triplets / README
- solution / 2100-2199 / 2199.Finding the Topic of Each Post / README
- solution / 2200-2299 / 2200.Find All K-Distant Indices in an Array / README
- solution / 2200-2299 / 2201.Count Artifacts That Can Be Extracted / README
- solution / 2200-2299 / 2202.Maximize the Topmost Element After K Moves / README
- solution / 2200-2299 / 2203.Minimum Weighted Subgraph With the Required Paths / README
- solution / 2200-2299 / 2204.Distance to a Cycle in Undirected Graph / README
- solution / 2200-2299 / 2205.The Number of Users That Are Eligible for Discount / README
- solution / 2200-2299 / 2206.Divide Array Into Equal Pairs / README
- solution / 2200-2299 / 2207.Maximize Number of Subsequences in a String / README
- solution / 2200-2299 / 2208.Minimum Operations to Halve Array Sum / README
- solution / 2200-2299 / 2209.Minimum White Tiles After Covering With Carpets / README
- solution / 2200-2299 / 2210.Count Hills and Valleys in an Array / README
- solution / 2200-2299 / 2211.Count Collisions on a Road / README
- solution / 2200-2299 / 2212.Maximum Points in an Archery Competition / README
- solution / 2200-2299 / 2213.Longest Substring of One Repeating Character / README
- solution / 2200-2299 / 2214.Minimum Health to Beat Game / README
- solution / 2200-2299 / 2215.Find the Difference of Two Arrays / README
- solution / 2200-2299 / 2216.Minimum Deletions to Make Array Beautiful / README
- solution / 2200-2299 / 2217.Find Palindrome With Fixed Length / README
- solution / 2200-2299 / 2218.Maximum Value of K Coins From Piles / README
- solution / 2200-2299 / 2219.Maximum Sum Score of Array / README
- solution / 2200-2299 / 2220.Minimum Bit Flips to Convert Number / README
- solution / 2200-2299 / 2221.Find Triangular Sum of an Array / README
- solution / 2200-2299 / 2222.Number of Ways to Select Buildings / README
- solution / 2200-2299 / 2223.Sum of Scores of Built Strings / README
- solution / 2200-2299 / 2224.Minimum Number of Operations to Convert Time / README
- solution / 2200-2299 / 2225.Find Players With Zero or One Losses / README
- solution / 2200-2299 / 2226.Maximum Candies Allocated to K Children / README
- solution / 2200-2299 / 2227.Encrypt and Decrypt Strings / README
- solution / 2200-2299 / 2228.Users With Two Purchases Within Seven Days / README
- solution / 2200-2299 / 2229.Check if an Array Is Consecutive / README
- solution / 2200-2299 / 2230.The Users That Are Eligible for Discount / README
- solution / 2200-2299 / 2231.Largest Number After Digit Swaps by Parity / README
- solution / 2200-2299 / 2232.Minimize Result by Adding Parentheses to Expression / README
- solution / 2200-2299 / 2233.Maximum Product After K Increments / README
- solution / 2200-2299 / 2234.Maximum Total Beauty of the Gardens / README
- solution / 2200-2299 / 2235.Add Two Integers / README
- solution / 2200-2299 / 2236.Root Equals Sum of Children / README
- solution / 2200-2299 / 2237.Count Positions on Street With Required Brightness / README
- solution / 2200-2299 / 2238.Number of Times a Driver Was a Passenger / README
- solution / 2200-2299 / 2239.Find Closest Number to Zero / README
- solution / 2200-2299 / 2240.Number of Ways to Buy Pens and Pencils / README
- solution / 2200-2299 / 2241.Design an ATM Machine / README
- solution / 2200-2299 / 2242.Maximum Score of a Node Sequence / README
- solution / 2200-2299 / 2243.Calculate Digit Sum of a String / README
- solution / 2200-2299 / 2244.Minimum Rounds to Complete All Tasks / README
- solution / 2200-2299 / 2245.Maximum Trailing Zeros in a Cornered Path / README
- solution / 2200-2299 / 2246.Longest Path With Different Adjacent Characters / README
- solution / 2200-2299 / 2247.Maximum Cost of Trip With K Highways / README
- solution / 2200-2299 / 2248.Intersection of Multiple Arrays / README
- solution / 2200-2299 / 2249.Count Lattice Points Inside a Circle / README
- solution / 2200-2299 / 2250.Count Number of Rectangles Containing Each Point / README
- solution / 2200-2299 / 2251.Number of Flowers in Full Bloom / README
- solution / 2200-2299 / 2252.Dynamic Pivoting of a Table / README
- solution / 2200-2299 / 2253.Dynamic Unpivoting of a Table / README
- solution / 2200-2299 / 2254.Design Video Sharing Platform / README
- solution / 2200-2299 / 2255.Count Prefixes of a Given String / README
- solution / 2200-2299 / 2256.Minimum Average Difference / README
- solution / 2200-2299 / 2257.Count Unguarded Cells in the Grid / README
- solution / 2200-2299 / 2258.Escape the Spreading Fire / README
- solution / 2200-2299 / 2259.Remove Digit From Number to Maximize Result / README
- solution / 2200-2299 / 2260.Minimum Consecutive Cards to Pick Up / README
- solution / 2200-2299 / 2261.K Divisible Elements Subarrays / README
- solution / 2200-2299 / 2262.Total Appeal of A String / README
- solution / 2200-2299 / 2263.Make Array Non-decreasing or Non-increasing / README
- solution / 2200-2299 / 2264.Largest 3-Same-Digit Number in String / README
- solution / 2200-2299 / 2265.Count Nodes Equal to Average of Subtree / README
- solution / 2200-2299 / 2266.Count Number of Texts / README
- solution / 2200-2299 / 2267.Check if There Is a Valid Parentheses String Path / README
- solution / 2200-2299 / 2268.Minimum Number of Keypresses / README
- solution / 2200-2299 / 2269.Find the K-Beauty of a Number / README
- solution / 2200-2299 / 2270.Number of Ways to Split Array / README
- solution / 2200-2299 / 2271.Maximum White Tiles Covered by a Carpet / README
- solution / 2200-2299 / 2272.Substring With Largest Variance / README
- solution / 2200-2299 / 2273.Find Resultant Array After Removing Anagrams / README
- solution / 2200-2299 / 2274.Maximum Consecutive Floors Without Special Floors / README
- solution / 2200-2299 / 2275.Largest Combination With Bitwise AND Greater Than Zero / README
- solution / 2200-2299 / 2276.Count Integers in Intervals / README
- solution / 2200-2299 / 2277.Closest Node to Path in Tree / README
- solution / 2200-2299 / 2278.Percentage of Letter in String / README
- solution / 2200-2299 / 2279.Maximum Bags With Full Capacity of Rocks / README
- solution / 2200-2299 / 2280.Minimum Lines to Represent a Line Chart / README
- solution / 2200-2299 / 2281.Sum of Total Strength of Wizards / README
- solution / 2200-2299 / 2282.Number of People That Can Be Seen in a Grid / README
- solution / 2200-2299 / 2283.Check if Number Has Equal Digit Count and Digit Value / README
- solution / 2200-2299 / 2284.Sender With Largest Word Count / README
- solution / 2200-2299 / 2285.Maximum Total Importance of Roads / README
- solution / 2200-2299 / 2286.Booking Concert Tickets in Groups / README
- solution / 2200-2299 / 2287.Rearrange Characters to Make Target String / README
- solution / 2200-2299 / 2288.Apply Discount to Prices / README
- solution / 2200-2299 / 2289.Steps to Make Array Non-decreasing / README
- solution / 2200-2299 / 2290.Minimum Obstacle Removal to Reach Corner / README
- solution / 2200-2299 / 2291.Maximum Profit From Trading Stocks / README
- solution / 2200-2299 / 2292.Products With Three or More Orders in Two Consecutive Years / README
- solution / 2200-2299 / 2293.Min Max Game / README
- solution / 2200-2299 / 2294.Partition Array Such That Maximum Difference Is K / README
- solution / 2200-2299 / 2295.Replace Elements in an Array / README
- solution / 2200-2299 / 2296.Design a Text Editor / README
- solution / 2200-2299 / 2297.Jump Game VIII / README
- solution / 2200-2299 / 2298.Tasks Count in the Weekend / README
- solution / 2200-2299 / 2299.Strong Password Checker II / README
- solution / 2300-2399 / 2300.Successful Pairs of Spells and Potions / README
- solution / 2300-2399 / 2301.Match Substring After Replacement / README
- solution / 2300-2399 / 2302.Count Subarrays With Score Less Than K / README
- solution / 2300-2399 / 2303.Calculate Amount Paid in Taxes / README
- solution / 2300-2399 / 2304.Minimum Path Cost in a Grid / README
- solution / 2300-2399 / 2305.Fair Distribution of Cookies / README
- solution / 2300-2399 / 2306.Naming a Company / README
- solution / 2300-2399 / 2307.Check for Contradictions in Equations / README
- solution / 2300-2399 / 2308.Arrange Table by Gender / README
- solution / 2300-2399 / 2309.Greatest English Letter in Upper and Lower Case / README
- solution / 2300-2399 / 2310.Sum of Numbers With Units Digit K / README
- solution / 2300-2399 / 2311.Longest Binary Subsequence Less Than or Equal to K / README
- solution / 2300-2399 / 2312.Selling Pieces of Wood / README
- solution / 2300-2399 / 2313.Minimum Flips in Binary Tree to Get Result / README
- solution / 2300-2399 / 2314.The First Day of the Maximum Recorded Degree in Each City / README
- solution / 2300-2399 / 2315.Count Asterisks / README
- solution / 2300-2399 / 2316.Count Unreachable Pairs of Nodes in an Undirected Graph / README
- solution / 2300-2399 / 2317.Maximum XOR After Operations / README
- solution / 2300-2399 / 2318.Number of Distinct Roll Sequences / README
- solution / 2300-2399 / 2319.Check if Matrix Is X-Matrix / README
- solution / 2300-2399 / 2320.Count Number of Ways to Place Houses / README
- solution / 2300-2399 / 2321.Maximum Score Of Spliced Array / README
- solution / 2300-2399 / 2322.Minimum Score After Removals on a Tree / README
- solution / 2300-2399 / 2323.Find Minimum Time to Finish All Jobs II / README
- solution / 2300-2399 / 2324.Product Sales Analysis IV / README
- solution / 2300-2399 / 2325.Decode the Message / README
- solution / 2300-2399 / 2326.Spiral Matrix IV / README
- solution / 2300-2399 / 2327.Number of People Aware of a Secret / README
- solution / 2300-2399 / 2328.Number of Increasing Paths in a Grid / README
- solution / 2300-2399 / 2329.Product Sales Analysis V / README
- solution / 2300-2399 / 2330.Valid Palindrome IV / README
- solution / 2300-2399 / 2331.Evaluate Boolean Binary Tree / README
- solution / 2300-2399 / 2332.The Latest Time to Catch a Bus / README
- solution / 2300-2399 / 2333.Minimum Sum of Squared Difference / README
- solution / 2300-2399 / 2334.Subarray With Elements Greater Than Varying Threshold / README
- solution / 2300-2399 / 2335.Minimum Amount of Time to Fill Cups / README
- solution / 2300-2399 / 2336.Smallest Number in Infinite Set / README
- solution / 2300-2399 / 2337.Move Pieces to Obtain a String / README
- solution / 2300-2399 / 2338.Count the Number of Ideal Arrays / README
- solution / 2300-2399 / 2339.All the Matches of the League / README
- solution / 2300-2399 / 2340.Minimum Adjacent Swaps to Make a Valid Array / README
- solution / 2300-2399 / 2341.Maximum Number of Pairs in Array / README
- solution / 2300-2399 / 2342.Max Sum of a Pair With Equal Sum of Digits / README
- solution / 2300-2399 / 2343.Query Kth Smallest Trimmed Number / README
- solution / 2300-2399 / 2344.Minimum Deletions to Make Array Divisible / README
- solution / 2300-2399 / 2345.Finding the Number of Visible Mountains / README
- solution / 2300-2399 / 2346.Compute the Rank as a Percentage / README
- solution / 2300-2399 / 2347.Best Poker Hand / README
- solution / 2300-2399 / 2348.Number of Zero-Filled Subarrays / README
- solution / 2300-2399 / 2349.Design a Number Container System / README
- solution / 2300-2399 / 2350.Shortest Impossible Sequence of Rolls / README
- solution / 2300-2399 / 2351.First Letter to Appear Twice / README
- solution / 2300-2399 / 2352.Equal Row and Column Pairs / README
- solution / 2300-2399 / 2353.Design a Food Rating System / README
- solution / 2300-2399 / 2354.Number of Excellent Pairs / README
- solution / 2300-2399 / 2355.Maximum Number of Books You Can Take / README
- solution / 2300-2399 / 2356.Number of Unique Subjects Taught by Each Teacher / README
- solution / 2300-2399 / 2357.Make Array Zero by Subtracting Equal Amounts / README
- solution / 2300-2399 / 2358.Maximum Number of Groups Entering a Competition / README
- solution / 2300-2399 / 2359.Find Closest Node to Given Two Nodes / README
- solution / 2300-2399 / 2360.Longest Cycle in a Graph / README
- solution / 2300-2399 / 2361.Minimum Costs Using the Train Line / README
- solution / 2300-2399 / 2362.Generate the Invoice / README
- solution / 2300-2399 / 2363.Merge Similar Items / README
- solution / 2300-2399 / 2364.Count Number of Bad Pairs / README
- solution / 2300-2399 / 2365.Task Scheduler II / README
- solution / 2300-2399 / 2366.Minimum Replacements to Sort the Array / README
- solution / 2300-2399 / 2367.Number of Arithmetic Triplets / README
- solution / 2300-2399 / 2368.Reachable Nodes With Restrictions / README
- solution / 2300-2399 / 2369.Check if There is a Valid Partition For The Array / README
- solution / 2300-2399 / 2370.Longest Ideal Subsequence / README
- solution / 2300-2399 / 2371.Minimize Maximum Value in a Grid / README
- solution / 2300-2399 / 2372.Calculate the Influence of Each Salesperson / README
- solution / 2300-2399 / 2373.Largest Local Values in a Matrix / README
- solution / 2300-2399 / 2374.Node With Highest Edge Score / README
- solution / 2300-2399 / 2375.Construct Smallest Number From DI String / README
- solution / 2300-2399 / 2376.Count Special Integers / README
- solution / 2300-2399 / 2377.Sort the Olympic Table / README
- solution / 2300-2399 / 2378.Choose Edges to Maximize Score in a Tree / README
- solution / 2300-2399 / 2379.Minimum Recolors to Get K Consecutive Black Blocks / README
- solution / 2300-2399 / 2380.Time Needed to Rearrange a Binary String / README
- solution / 2300-2399 / 2381.Shifting Letters II / README
- solution / 2300-2399 / 2382.Maximum Segment Sum After Removals / README
- solution / 2300-2399 / 2383.Minimum Hours of Training to Win a Competition / README
- solution / 2300-2399 / 2384.Largest Palindromic Number / README
- solution / 2300-2399 / 2385.Amount of Time for Binary Tree to Be Infected / README
- solution / 2300-2399 / 2386.Find the K-Sum of an Array / README
- solution / 2300-2399 / 2387.Median of a Row Wise Sorted Matrix / README
- solution / 2300-2399 / 2388.Change Null Values in a Table to the Previous Value / README
- solution / 2300-2399 / 2389.Longest Subsequence With Limited Sum / README
- solution / 2300-2399 / 2390.Removing Stars From a String / README
- solution / 2300-2399 / 2391.Minimum Amount of Time to Collect Garbage / README
- solution / 2300-2399 / 2392.Build a Matrix With Conditions / README
- solution / 2300-2399 / 2393.Count Strictly Increasing Subarrays / README
- solution / 2300-2399 / 2394.Employees With Deductions / README
- solution / 2300-2399 / 2395.Find Subarrays With Equal Sum / README
- solution / 2300-2399 / 2396.Strictly Palindromic Number / README
- solution / 2300-2399 / 2397.Maximum Rows Covered by Columns / README
- solution / 2300-2399 / 2398.Maximum Number of Robots Within Budget / README
- solution / 2300-2399 / 2399.Check Distances Between Same Letters / README
- solution / 2400-2499 / 2400.Number of Ways to Reach a Position After Exactly k Steps / README
- solution / 2400-2499 / 2401.Longest Nice Subarray / README
- solution / 2400-2499 / 2402.Meeting Rooms III / README
- solution / 2400-2499 / 2403.Minimum Time to Kill All Monsters / README
- solution / 2400-2499 / 2404.Most Frequent Even Element / README
- solution / 2400-2499 / 2405.Optimal Partition of String / README
- solution / 2400-2499 / 2406.Divide Intervals Into Minimum Number of Groups / README
- solution / 2400-2499 / 2407.Longest Increasing Subsequence II / README
- solution / 2400-2499 / 2408.Design SQL / README
- solution / 2400-2499 / 2409.Count Days Spent Together / README
- solution / 2400-2499 / 2410.Maximum Matching of Players With Trainers / README
- solution / 2400-2499 / 2411.Smallest Subarrays With Maximum Bitwise OR / README
- solution / 2400-2499 / 2412.Minimum Money Required Before Transactions / README
- solution / 2400-2499 / 2413.Smallest Even Multiple / README
- solution / 2400-2499 / 2414.Length of the Longest Alphabetical Continuous Substring / README
- solution / 2400-2499 / 2415.Reverse Odd Levels of Binary Tree / README
- solution / 2400-2499 / 2416.Sum of Prefix Scores of Strings / README
- solution / 2400-2499 / 2417.Closest Fair Integer / README
- solution / 2400-2499 / 2418.Sort the People / README
- solution / 2400-2499 / 2419.Longest Subarray With Maximum Bitwise AND / README
- solution / 2400-2499 / 2420.Find All Good Indices / README
- solution / 2400-2499 / 2421.Number of Good Paths / README
- solution / 2400-2499 / 2422.Merge Operations to Turn Array Into a Palindrome / README
- solution / 2400-2499 / 2423.Remove Letter To Equalize Frequency / README
- solution / 2400-2499 / 2424.Longest Uploaded Prefix / README
- solution / 2400-2499 / 2425.Bitwise XOR of All Pairings / README
- solution / 2400-2499 / 2426.Number of Pairs Satisfying Inequality / README
- solution / 2400-2499 / 2427.Number of Common Factors / README
- solution / 2400-2499 / 2428.Maximum Sum of an Hourglass / README
- solution / 2400-2499 / 2429.Minimize XOR / README
- solution / 2400-2499 / 2430.Maximum Deletions on a String / README
- solution / 2400-2499 / 2431.Maximize Total Tastiness of Purchased Fruits / README
- solution / 2400-2499 / 2432.The Employee That Worked on the Longest Task / README
- solution / 2400-2499 / 2433.Find The Original Array of Prefix Xor / README
- solution / 2400-2499 / 2434.Using a Robot to Print the Lexicographically Smallest String / README
- solution / 2400-2499 / 2435.Paths in Matrix Whose Sum Is Divisible by K / README
- solution / 2400-2499 / 2436.Minimum Split Into Subarrays With GCD Greater Than One / README
- solution / 2400-2499 / 2437.Number of Valid Clock Times / README
- solution / 2400-2499 / 2438.Range Product Queries of Powers / README
- solution / 2400-2499 / 2439.Minimize Maximum of Array / README
- solution / 2400-2499 / 2440.Create Components With Same Value / README
- solution / 2400-2499 / 2441.Largest Positive Integer That Exists With Its Negative / README
- solution / 2400-2499 / 2442.Count Number of Distinct Integers After Reverse Operations / README
- solution / 2400-2499 / 2443.Sum of Number and Its Reverse / README
- solution / 2400-2499 / 2444.Count Subarrays With Fixed Bounds / README
- solution / 2400-2499 / 2445.Number of Nodes With Value One / README
- solution / 2400-2499 / 2446.Determine if Two Events Have Conflict / README
- solution / 2400-2499 / 2447.Number of Subarrays With GCD Equal to K / README
- solution / 2400-2499 / 2448.Minimum Cost to Make Array Equal / README
- solution / 2400-2499 / 2449.Minimum Number of Operations to Make Arrays Similar / README
- solution / 2400-2499 / 2450.Number of Distinct Binary Strings After Applying Operations / README
- solution / 2400-2499 / 2451.Odd String Difference / README
- solution / 2400-2499 / 2452.Words Within Two Edits of Dictionary / README
- solution / 2400-2499 / 2453.Destroy Sequential Targets / README
- solution / 2400-2499 / 2454.Next Greater Element IV / README
- solution / 2400-2499 / 2455.Average Value of Even Numbers That Are Divisible by Three / README
- solution / 2400-2499 / 2456.Most Popular Video Creator / README
- solution / 2400-2499 / 2457.Minimum Addition to Make Integer Beautiful / README
- solution / 2400-2499 / 2458.Height of Binary Tree After Subtree Removal Queries / README
- solution / 2400-2499 / 2459.Sort Array by Moving Items to Empty Space / README
- solution / 2400-2499 / 2460.Apply Operations to an Array / README
- solution / 2400-2499 / 2461.Maximum Sum of Distinct Subarrays With Length K / README
- solution / 2400-2499 / 2462.Total Cost to Hire K Workers / README
- solution / 2400-2499 / 2463.Minimum Total Distance Traveled / README
- solution / 2400-2499 / 2464.Minimum Subarrays in a Valid Split / README
- solution / 2400-2499 / 2465.Number of Distinct Averages / README
- solution / 2400-2499 / 2466.Count Ways To Build Good Strings / README
- solution / 2400-2499 / 2467.Most Profitable Path in a Tree / README
- solution / 2400-2499 / 2468.Split Message Based on Limit / README
- solution / 2400-2499 / 2469.Convert the Temperature / README
- solution / 2400-2499 / 2470.Number of Subarrays With LCM Equal to K / README
- solution / 2400-2499 / 2471.Minimum Number of Operations to Sort a Binary Tree by Level / README
- solution / 2400-2499 / 2472.Maximum Number of Non-overlapping Palindrome Substrings / README
- solution / 2400-2499 / 2473.Minimum Cost to Buy Apples / README
- solution / 2400-2499 / 2474.Customers With Strictly Increasing Purchases / README
- solution / 2400-2499 / 2475.Number of Unequal Triplets in Array / README
- solution / 2400-2499 / 2476.Closest Nodes Queries in a Binary Search Tree / README
- solution / 2400-2499 / 2477.Minimum Fuel Cost to Report to the Capital / README
- solution / 2400-2499 / 2478.Number of Beautiful Partitions / README
- solution / 2400-2499 / 2479.Maximum XOR of Two Non-Overlapping Subtrees / README
- solution / 2400-2499 / 2480.Form a Chemical Bond / README
- solution / 2400-2499 / 2481.Minimum Cuts to Divide a Circle / README
- solution / 2400-2499 / 2482.Difference Between Ones and Zeros in Row and Column / README
- solution / 2400-2499 / 2483.Minimum Penalty for a Shop / README
- solution / 2400-2499 / 2484.Count Palindromic Subsequences / README
- solution / 2400-2499 / 2485.Find the Pivot Integer / README
- solution / 2400-2499 / 2486.Append Characters to String to Make Subsequence / README
- solution / 2400-2499 / 2487.Remove Nodes From Linked List / README
- solution / 2400-2499 / 2488.Count Subarrays With Median K / README
- solution / 2400-2499 / 2489.Number of Substrings With Fixed Ratio / README
- solution / 2400-2499 / 2490.Circular Sentence / README
- solution / 2400-2499 / 2491.Divide Players Into Teams of Equal Skill / README
- solution / 2400-2499 / 2492.Minimum Score of a Path Between Two Cities / README
- solution / 2400-2499 / 2493.Divide Nodes Into the Maximum Number of Groups / README
- solution / 2400-2499 / 2494.Merge Overlapping Events in the Same Hall / README
- solution / 2400-2499 / 2495.Number of Subarrays Having Even Product / README
- solution / 2400-2499 / 2496.Maximum Value of a String in an Array / README
- solution / 2400-2499 / 2497.Maximum Star Sum of a Graph / README
- solution / 2400-2499 / 2498.Frog Jump II / README
- solution / 2400-2499 / 2499.Minimum Total Cost to Make Arrays Unequal / README
- solution / 2500-2599 / 2500.Delete Greatest Value in Each Row / README
- solution / 2500-2599 / 2501.Longest Square Streak in an Array / README
- solution / 2500-2599 / 2502.Design Memory Allocator / README
- solution / 2500-2599 / 2503.Maximum Number of Points From Grid Queries / README
- solution / 2500-2599 / 2504.Concatenate the Name and the Profession / README
- solution / 2500-2599 / 2505.Bitwise OR of All Subsequence Sums / README
- solution / 2500-2599 / 2506.Count Pairs Of Similar Strings / README
- solution / 2500-2599 / 2507.Smallest Value After Replacing With Sum of Prime Factors / README
- solution / 2500-2599 / 2508.Add Edges to Make Degrees of All Nodes Even / README
- solution / 2500-2599 / 2509.Cycle Length Queries in a Tree / README
- solution / 2500-2599 / 2510.Check if There is a Path With Equal Number of 0's And 1's / README
- solution / 2500-2599 / 2511.Maximum Enemy Forts That Can Be Captured / README
- solution / 2500-2599 / 2512.Reward Top K Students / README
- solution / 2500-2599 / 2513.Minimize the Maximum of Two Arrays / README
- solution / 2500-2599 / 2514.Count Anagrams / README
- solution / 2500-2599 / 2515.Shortest Distance to Target String in a Circular Array / README
- solution / 2500-2599 / 2516.Take K of Each Character From Left and Right / README
- solution / 2500-2599 / 2517.Maximum Tastiness of Candy Basket / README
- solution / 2500-2599 / 2518.Number of Great Partitions / README
- solution / 2500-2599 / 2519.Count the Number of K-Big Indices / README
- solution / 2500-2599 / 2520.Count the Digits That Divide a Number / README
- solution / 2500-2599 / 2521.Distinct Prime Factors of Product of Array / README
- solution / 2500-2599 / 2522.Partition String Into Substrings With Values at Most K / README
- solution / 2500-2599 / 2523.Closest Prime Numbers in Range / README
- solution / 2500-2599 / 2524.Maximum Frequency Score of a Subarray / README
- solution / 2500-2599 / 2525.Categorize Box According to Criteria / README
- solution / 2500-2599 / 2526.Find Consecutive Integers from a Data Stream / README
- solution / 2500-2599 / 2527.Find Xor-Beauty of Array / README
- solution / 2500-2599 / 2528.Maximize the Minimum Powered City / README
- solution / 2500-2599 / 2529.Maximum Count of Positive Integer and Negative Integer / README
- solution / 2500-2599 / 2530.Maximal Score After Applying K Operations / README
- solution / 2500-2599 / 2531.Make Number of Distinct Characters Equal / README
- solution / 2500-2599 / 2532.Time to Cross a Bridge / README
- solution / 2500-2599 / 2533.Number of Good Binary Strings / README
- solution / 2500-2599 / 2534.Time Taken to Cross the Door / README
- solution / 2500-2599 / 2535.Difference Between Element Sum and Digit Sum of an Array / README
- solution / 2500-2599 / 2536.Increment Submatrices by One / README
- solution / 2500-2599 / 2537.Count the Number of Good Subarrays / README
- solution / 2500-2599 / 2538.Difference Between Maximum and Minimum Price Sum / README
- solution / 2500-2599 / 2539.Count the Number of Good Subsequences / README
- solution / 2500-2599 / 2540.Minimum Common Value / README
- solution / 2500-2599 / 2541.Minimum Operations to Make Array Equal II / README
- solution / 2500-2599 / 2542.Maximum Subsequence Score / README
- solution / 2500-2599 / 2543.Check if Point Is Reachable / README
- solution / 2500-2599 / 2544.Alternating Digit Sum / README
- solution / 2500-2599 / 2545.Sort the Students by Their Kth Score / README
- solution / 2500-2599 / 2546.Apply Bitwise Operations to Make Strings Equal / README
- solution / 2500-2599 / 2547.Minimum Cost to Split an Array / README
- solution / 2500-2599 / 2548.Maximum Price to Fill a Bag / README
- solution / 2500-2599 / 2549.Count Distinct Numbers on Board / README
- solution / 2500-2599 / 2550.Count Collisions of Monkeys on a Polygon / README
- solution / 2500-2599 / 2551.Put Marbles in Bags / README
- solution / 2500-2599 / 2552.Count Increasing Quadruplets / README
- solution / 2500-2599 / 2553.Separate the Digits in an Array / README
- solution / 2500-2599 / 2554.Maximum Number of Integers to Choose From a Range I / README
- solution / 2500-2599 / 2555.Maximize Win From Two Segments / README
- solution / 2500-2599 / 2556.Disconnect Path in a Binary Matrix by at Most One Flip / README
- solution / 2500-2599 / 2557.Maximum Number of Integers to Choose From a Range II / README
- solution / 2500-2599 / 2558.Take Gifts From the Richest Pile / README
- solution / 2500-2599 / 2559.Count Vowel Strings in Ranges / README
- solution / 2500-2599 / 2560.House Robber IV / README
- solution / 2500-2599 / 2561.Rearranging Fruits / README
- solution / 2500-2599 / 2562.Find the Array Concatenation Value / README
- solution / 2500-2599 / 2563.Count the Number of Fair Pairs / README
- solution / 2500-2599 / 2564.Substring XOR Queries / README
- solution / 2500-2599 / 2565.Subsequence With the Minimum Score / README
- solution / 2500-2599 / 2566.Maximum Difference by Remapping a Digit / README
- solution / 2500-2599 / 2567.Minimum Score by Changing Two Elements / README
- solution / 2500-2599 / 2568.Minimum Impossible OR / README
- solution / 2500-2599 / 2569.Handling Sum Queries After Update / README
- solution / 2500-2599 / 2570.Merge Two 2D Arrays by Summing Values / README
- solution / 2500-2599 / 2571.Minimum Operations to Reduce an Integer to 0 / README
- solution / 2500-2599 / 2572.Count the Number of Square-Free Subsets / README
- solution / 2500-2599 / 2573.Find the String with LCP / README
- solution / 2500-2599 / 2574.Left and Right Sum Differences / README
- solution / 2500-2599 / 2575.Find the Divisibility Array of a String / README
- solution / 2500-2599 / 2576.Find the Maximum Number of Marked Indices / README
- solution / 2500-2599 / 2577.Minimum Time to Visit a Cell In a Grid / README
- solution / 2500-2599 / 2578.Split With Minimum Sum / README
- solution / 2500-2599 / 2579.Count Total Number of Colored Cells / README
- solution / 2500-2599 / 2580.Count Ways to Group Overlapping Ranges / README
- solution / 2500-2599 / 2581.Count Number of Possible Root Nodes / README
- solution / 2500-2599 / 2582.Pass the Pillow / README
- solution / 2500-2599 / 2583.Kth Largest Sum in a Binary Tree / README
- solution / 2500-2599 / 2584.Split the Array to Make Coprime Products / README
- solution / 2500-2599 / 2585.Number of Ways to Earn Points / README
- solution / 2500-2599 / 2586.Count the Number of Vowel Strings in Range / README
- solution / 2500-2599 / 2587.Rearrange Array to Maximize Prefix Score / README
- solution / 2500-2599 / 2588.Count the Number of Beautiful Subarrays / README
- solution / 2500-2599 / 2589.Minimum Time to Complete All Tasks / README
- solution / 2500-2599 / 2590.Design a Todo List / README
- solution / 2500-2599 / 2591.Distribute Money to Maximum Children / README
- solution / 2500-2599 / 2592.Maximize Greatness of an Array / README
- solution / 2500-2599 / 2593.Find Score of an Array After Marking All Elements / README
- solution / 2500-2599 / 2594.Minimum Time to Repair Cars / README
- solution / 2500-2599 / 2595.Number of Even and Odd Bits / README
- solution / 2500-2599 / 2596.Check Knight Tour Configuration / README
- solution / 2500-2599 / 2597.The Number of Beautiful Subsets / README
- solution / 2500-2599 / 2598.Smallest Missing Non-negative Integer After Operations / README
- solution / 2500-2599 / 2599.Make the Prefix Sum Non-negative / README
- solution / 2600-2699 / 2600.K Items With the Maximum Sum / README
- solution / 2600-2699 / 2601.Prime Subtraction Operation / README
- solution / 2600-2699 / 2602.Minimum Operations to Make All Array Elements Equal / README
- solution / 2600-2699 / 2603.Collect Coins in a Tree / README
- solution / 2600-2699 / 2604.Minimum Time to Eat All Grains / README
- solution / 2600-2699 / 2605.Form Smallest Number From Two Digit Arrays / README
- solution / 2600-2699 / 2606.Find the Substring With Maximum Cost / README
- solution / 2600-2699 / 2607.Make K-Subarray Sums Equal / README
- solution / 2600-2699 / 2608.Shortest Cycle in a Graph / README
- solution / 2600-2699 / 2609.Find the Longest Balanced Substring of a Binary String / README
- solution / 2600-2699 / 2610.Convert an Array Into a 2D Array With Conditions / README
- solution / 2600-2699 / 2611.Mice and Cheese / README
- solution / 2600-2699 / 2612.Minimum Reverse Operations / README
- solution / 2600-2699 / 2613.Beautiful Pairs / README
- solution / 2600-2699 / 2614.Prime In Diagonal / README
- solution / 2600-2699 / 2615.Sum of Distances / README
- solution / 2600-2699 / 2616.Minimize the Maximum Difference of Pairs / README
- solution / 2600-2699 / 2617.Minimum Number of Visited Cells in a Grid / README
- solution / 2600-2699 / 2618.Check if Object Instance of Class / README
- solution / 2600-2699 / 2619.Array Prototype Last / README
- solution / 2600-2699 / 2620.Counter / README
- solution / 2600-2699 / 2621.Sleep / README
- solution / 2600-2699 / 2622.Cache With Time Limit / README
- solution / 2600-2699 / 2623.Memoize / README
- solution / 2600-2699 / 2624.Snail Traversal / README
- solution / 2600-2699 / 2625.Flatten Deeply Nested Array / README
- solution / 2600-2699 / 2626.Array Reduce Transformation / README
- solution / 2600-2699 / 2627.Debounce / README
- solution / 2600-2699 / 2628.JSON Deep Equal / README
- solution / 2600-2699 / 2629.Function Composition / README
- solution / 2600-2699 / 2630.Memoize II / README
- solution / 2600-2699 / 2631.Group By / README
- solution / 2600-2699 / 2632.Curry / README
- solution / 2600-2699 / 2633.Convert Object to JSON String / README
- solution / 2600-2699 / 2634.Filter Elements from Array / README
- solution / 2600-2699 / 2635.Apply Transform Over Each Element in Array / README
- solution / 2600-2699 / 2636.Promise Pool / README
- solution / 2600-2699 / 2637.Promise Time Limit / README
- solution / 2600-2699 / 2638.Count the Number of K-Free Subsets / README
- solution / 2600-2699 / 2639.Find the Width of Columns of a Grid / README
- solution / 2600-2699 / 2640.Find the Score of All Prefixes of an Array / README
- solution / 2600-2699 / 2641.Cousins in Binary Tree II / README
- solution / 2600-2699 / 2642.Design Graph With Shortest Path Calculator / README
- solution / 2600-2699 / 2643.Row With Maximum Ones / README
- solution / 2600-2699 / 2644.Find the Maximum Divisibility Score / README
- solution / 2600-2699 / 2645.Minimum Additions to Make Valid String / README
- solution / 2600-2699 / 2646.Minimize the Total Price of the Trips / README
- solution / 2600-2699 / 2647.Color the Triangle Red / README
- solution / 2600-2699 / 2648.Generate Fibonacci Sequence / README
- solution / 2600-2699 / 2649.Nested Array Generator / README
- solution / 2600-2699 / 2650.Design Cancellable Function / README
- solution / 2600-2699 / 2651.Calculate Delayed Arrival Time / README
- solution / 2600-2699 / 2652.Sum Multiples / README
- solution / 2600-2699 / 2653.Sliding Subarray Beauty / README
- solution / 2600-2699 / 2654.Minimum Number of Operations to Make All Array Elements Equal to 1 / README
- solution / 2600-2699 / 2655.Find Maximal Uncovered Ranges / README
- solution / 2600-2699 / 2656.Maximum Sum With Exactly K Elements / README
- solution / 2600-2699 / 2657.Find the Prefix Common Array of Two Arrays / README
- solution / 2600-2699 / 2658.Maximum Number of Fish in a Grid / README
- solution / 2600-2699 / 2659.Make Array Empty / README
- solution / 2600-2699 / 2660.Determine the Winner of a Bowling Game / README
- solution / 2600-2699 / 2661.First Completely Painted Row or Column / README
- solution / 2600-2699 / 2662.Minimum Cost of a Path With Special Roads / README
- solution / 2600-2699 / 2663.Lexicographically Smallest Beautiful String / README
- solution / 2600-2699 / 2664.The Knight’s Tour / README
- solution / 2600-2699 / 2665.Counter II / README
- solution / 2600-2699 / 2666.Allow One Function Call / README
- solution / 2600-2699 / 2667.Create Hello World Function / README
- solution / 2600-2699 / 2668.Find Latest Salaries / README
- solution / 2600-2699 / 2669.Count Artist Occurrences On Spotify Ranking List / README
- solution / 2600-2699 / 2670.Find the Distinct Difference Array / README
- solution / 2600-2699 / 2671.Frequency Tracker / README
- solution / 2600-2699 / 2672.Number of Adjacent Elements With the Same Color / README
- solution / 2600-2699 / 2673.Make Costs of Paths Equal in a Binary Tree / README
- solution / 2600-2699 / 2674.Split a Circular Linked List / README
- solution / 2600-2699 / 2675.Array of Objects to Matrix / README
- solution / 2600-2699 / 2676.Throttle / README
- solution / 2600-2699 / 2677.Chunk Array / README
- solution / 2600-2699 / 2678.Number of Senior Citizens / README
- solution / 2600-2699 / 2679.Sum in a Matrix / README
- solution / 2600-2699 / 2680.Maximum OR / README
- solution / 2600-2699 / 2681.Power of Heroes / README
- solution / 2600-2699 / 2682.Find the Losers of the Circular Game / README
- solution / 2600-2699 / 2683.Neighboring Bitwise XOR / README
- solution / 2600-2699 / 2684.Maximum Number of Moves in a Grid / README
- solution / 2600-2699 / 2685.Count the Number of Complete Components / README
- solution / 2600-2699 / 2686.Immediate Food Delivery III / README
- solution / 2600-2699 / 2687.Bikes Last Time Used / README
- solution / 2600-2699 / 2688.Find Active Users / README
- solution / 2600-2699 / 2689.Extract Kth Character From The Rope Tree / README
- solution / 2600-2699 / 2690.Infinite Method Object / README
- solution / 2600-2699 / 2691.Immutability Helper / README
- solution / 2600-2699 / 2692.Make Object Immutable / README
- solution / 2600-2699 / 2693.Call Function with Custom Context / README
- solution / 2600-2699 / 2694.Event Emitter / README
- solution / 2600-2699 / 2695.Array Wrapper / README
- solution / 2600-2699 / 2696.Minimum String Length After Removing Substrings / README
- solution / 2600-2699 / 2697.Lexicographically Smallest Palindrome / README
- solution / 2600-2699 / 2698.Find the Punishment Number of an Integer / README
- solution / 2600-2699 / 2699.Modify Graph Edge Weights / README
- solution / 2700-2799 / 2700.Differences Between Two Objects / README
- solution / 2700-2799 / 2701.Consecutive Transactions with Increasing Amounts / README
- solution / 2700-2799 / 2702.Minimum Operations to Make Numbers Non-positive / README
- solution / 2700-2799 / 2703.Return Length of Arguments Passed / README
- solution / 2700-2799 / 2704.To Be Or Not To Be / README
- solution / 2700-2799 / 2705.Compact Object / README
- solution / 2700-2799 / 2706.Buy Two Chocolates / README
- solution / 2700-2799 / 2707.Extra Characters in a String / README
- solution / 2700-2799 / 2708.Maximum Strength of a Group / README
- solution / 2700-2799 / 2709.Greatest Common Divisor Traversal / README
- solution / 2700-2799 / 2710.Remove Trailing Zeros From a String / README
- solution / 2700-2799 / 2711.Difference of Number of Distinct Values on Diagonals / README
- solution / 2700-2799 / 2712.Minimum Cost to Make All Characters Equal / README
- solution / 2700-2799 / 2713.Maximum Strictly Increasing Cells in a Matrix / README
- solution / 2700-2799 / 2714.Find Shortest Path with K Hops / README
- solution / 2700-2799 / 2715.Timeout Cancellation / README
- solution / 2700-2799 / 2716.Minimize String Length / README
- solution / 2700-2799 / 2717.Semi-Ordered Permutation / README
- solution / 2700-2799 / 2718.Sum of Matrix After Queries / README
- solution / 2700-2799 / 2719.Count of Integers / README
- solution / 2700-2799 / 2720.Popularity Percentage / README
- solution / 2700-2799 / 2721.Execute Asynchronous Functions in Parallel / README
- solution / 2700-2799 / 2722.Join Two Arrays by ID / README
- solution / 2700-2799 / 2723.Add Two Promises / README
- solution / 2700-2799 / 2724.Sort By / README
- solution / 2700-2799 / 2725.Interval Cancellation / README
- solution / 2700-2799 / 2726.Calculator with Method Chaining / README
- solution / 2700-2799 / 2727.Is Object Empty / README
- solution / 2700-2799 / 2728.Count Houses in a Circular Street / README
- solution / 2700-2799 / 2729.Check if The Number is Fascinating / README
- solution / 2700-2799 / 2730.Find the Longest Semi-Repetitive Substring / README
- solution / 2700-2799 / 2731.Movement of Robots / README
- solution / 2700-2799 / 2732.Find a Good Subset of the Matrix / README
- solution / 2700-2799 / 2733.Neither Minimum nor Maximum / README
- solution / 2700-2799 / 2734.Lexicographically Smallest String After Substring Operation / README
- solution / 2700-2799 / 2735.Collecting Chocolates / README
- solution / 2700-2799 / 2736.Maximum Sum Queries / README
- solution / 2700-2799 / 2737.Find the Closest Marked Node / README
- solution / 2700-2799 / 2738.Count Occurrences in Text / README
- solution / 2700-2799 / 2739.Total Distance Traveled / README
- solution / 2700-2799 / 2740.Find the Value of the Partition / README
- solution / 2700-2799 / 2741.Special Permutations / README
- solution / 2700-2799 / 2742.Painting the Walls / README
- solution / 2700-2799 / 2743.Count Substrings Without Repeating Character / README
- solution / 2700-2799 / 2744.Find Maximum Number of String Pairs / README
- solution / 2700-2799 / 2745.Construct the Longest New String / README
- solution / 2700-2799 / 2746.Decremental String Concatenation / README
- solution / 2700-2799 / 2747.Count Zero Request Servers / README
- solution / 2700-2799 / 2748.Number of Beautiful Pairs / README
- solution / 2700-2799 / 2749.Minimum Operations to Make the Integer Zero / README
- solution / 2700-2799 / 2750.Ways to Split Array Into Good Subarrays / README
- solution / 2700-2799 / 2751.Robot Collisions / README
- solution / 2700-2799 / 2752.Customers with Maximum Number of Transactions on Consecutive Days / README
- solution / 2700-2799 / 2753.Count Houses in a Circular Street II / README
- solution / 2700-2799 / 2754.Bind Function to Context / README
- solution / 2700-2799 / 2755.Deep Merge of Two Objects / README
- solution / 2700-2799 / 2756.Query Batching / README
- solution / 2700-2799 / 2757.Generate Circular Array Values / README
- solution / 2700-2799 / 2758.Next Day / README
- solution / 2700-2799 / 2759.Convert JSON String to Object / README
- solution / 2700-2799 / 2760.Longest Even Odd Subarray With Threshold / README
- solution / 2700-2799 / 2761.Prime Pairs With Target Sum / README
- solution / 2700-2799 / 2762.Continuous Subarrays / README
- solution / 2700-2799 / 2763.Sum of Imbalance Numbers of All Subarrays / README
- solution / 2700-2799 / 2764.Is Array a Preorder of Some Binary Tree / README
- solution / 2700-2799 / 2765.Longest Alternating Subarray / README
- solution / 2700-2799 / 2766.Relocate Marbles / README
- solution / 2700-2799 / 2767.Partition String Into Minimum Beautiful Substrings / README
- solution / 2700-2799 / 2768.Number of Black Blocks / README
- solution / 2700-2799 / 2769.Find the Maximum Achievable Number / README
- solution / 2700-2799 / 2770.Maximum Number of Jumps to Reach the Last Index / README
- solution / 2700-2799 / 2771.Longest Non-decreasing Subarray From Two Arrays / README
- solution / 2700-2799 / 2772.Apply Operations to Make All Array Elements Equal to Zero / README
- solution / 2700-2799 / 2773.Height of Special Binary Tree / README
- solution / 2700-2799 / 2774.Array Upper Bound / README
- solution / 2700-2799 / 2775.Undefined to Null / README
- solution / 2700-2799 / 2776.Convert Callback Based Function to Promise Based Function / README
- solution / 2700-2799 / 2777.Date Range Generator / README
- solution / 2700-2799 / 2778.Sum of Squares of Special Elements / README
- solution / 2700-2799 / 2779.Maximum Beauty of an Array After Applying Operation / README
- solution / 2700-2799 / 2780.Minimum Index of a Valid Split / README
- solution / 2700-2799 / 2781.Length of the Longest Valid Substring / README
- solution / 2700-2799 / 2782.Number of Unique Categories / README
- solution / 2700-2799 / 2783.Flight Occupancy and Waitlist Analysis / README
- solution / 2700-2799 / 2784.Check if Array is Good / README
- solution / 2700-2799 / 2785.Sort Vowels in a String / README
- solution / 2700-2799 / 2786.Visit Array Positions to Maximize Score / README
- solution / 2700-2799 / 2787.Ways to Express an Integer as Sum of Powers / README
- solution / 2700-2799 / 2788.Split Strings by Separator / README
- solution / 2700-2799 / 2789.Largest Element in an Array after Merge Operations / README
- solution / 2700-2799 / 2790.Maximum Number of Groups With Increasing Length / README
- solution / 2700-2799 / 2791.Count Paths That Can Form a Palindrome in a Tree / README
- solution / 2700-2799 / 2792.Count Nodes That Are Great Enough / README
- solution / 2700-2799 / 2793.Status of Flight Tickets / README
- solution / 2700-2799 / 2794.Create Object from Two Arrays / README
- solution / 2700-2799 / 2795.Parallel Execution of Promises for Individual Results Retrieval / README
- solution / 2700-2799 / 2796.Repeat String / README
- solution / 2700-2799 / 2797.Partial Function with Placeholders / README
- solution / 2700-2799 / 2798.Number of Employees Who Met the Target / README
- solution / 2700-2799 / 2799.Count Complete Subarrays in an Array / README
- solution / 2800-2899 / 2800.Shortest String That Contains Three Strings / README
- solution / 2800-2899 / 2801.Count Stepping Numbers in Range / README
- solution / 2800-2899 / 2802.Find The K-th Lucky Number / README
- solution / 2800-2899 / 2803.Factorial Generator / README
- solution / 2800-2899 / 2804.Array Prototype ForEach / README
- solution / 2800-2899 / 2805.Custom Interval / README
- solution / 2800-2899 / 2806.Account Balance After Rounded Purchase / README
- solution / 2800-2899 / 2807.Insert Greatest Common Divisors in Linked List / README
- solution / 2800-2899 / 2808.Minimum Seconds to Equalize a Circular Array / README
- solution / 2800-2899 / 2809.Minimum Time to Make Array Sum At Most x / README
- solution / 2800-2899 / 2810.Faulty Keyboard / README
- solution / 2800-2899 / 2811.Check if it is Possible to Split Array / README
- solution / 2800-2899 / 2812.Find the Safest Path in a Grid / README
- solution / 2800-2899 / 2813.Maximum Elegance of a K-Length Subsequence / README
- solution / 2800-2899 / 2814.Minimum Time Takes to Reach Destination Without Drowning / README
- solution / 2800-2899 / 2815.Max Pair Sum in an Array / README
- solution / 2800-2899 / 2816.Double a Number Represented as a Linked List / README
- solution / 2800-2899 / 2817.Minimum Absolute Difference Between Elements With Constraint / README
- solution / 2800-2899 / 2818.Apply Operations to Maximize Score / README
- solution / 2800-2899 / 2819.Minimum Relative Loss After Buying Chocolates / README
- solution / 2800-2899 / 2820.Election Results / README
- solution / 2800-2899 / 2821.Delay the Resolution of Each Promise / README
- solution / 2800-2899 / 2822.Inversion of Object / README
- solution / 2800-2899 / 2823.Deep Object Filter / README
- solution / 2800-2899 / 2824.Count Pairs Whose Sum is Less than Target / README
- solution / 2800-2899 / 2825.Make String a Subsequence Using Cyclic Increments / README
- solution / 2800-2899 / 2826.Sorting Three Groups / README
- solution / 2800-2899 / 2827.Number of Beautiful Integers in the Range / README
- solution / 2800-2899 / 2828.Check if a String Is an Acronym of Words / README
- solution / 2800-2899 / 2829.Determine the Minimum Sum of a k-avoiding Array / README
- solution / 2800-2899 / 2830.Maximize the Profit as the Salesman / README
- solution / 2800-2899 / 2831.Find the Longest Equal Subarray / README
- solution / 2800-2899 / 2832.Maximal Range That Each Element Is Maximum in It / README
- solution / 2800-2899 / 2833.Furthest Point From Origin / README
- solution / 2800-2899 / 2834.Find the Minimum Possible Sum of a Beautiful Array / README
- solution / 2800-2899 / 2835.Minimum Operations to Form Subsequence With Target Sum / README
- solution / 2800-2899 / 2836.Maximize Value of Function in a Ball Passing Game / README
- solution / 2800-2899 / 2837.Total Traveled Distance / README
- solution / 2800-2899 / 2838.Maximum Coins Heroes Can Collect / README
- solution / 2800-2899 / 2839.Check if Strings Can be Made Equal With Operations I / README
- solution / 2800-2899 / 2840.Check if Strings Can be Made Equal With Operations II / README
- solution / 2800-2899 / 2841.Maximum Sum of Almost Unique Subarray / README
- solution / 2800-2899 / 2842.Count K-Subsequences of a String With Maximum Beauty / README
- solution / 2800-2899 / 2843.Count Symmetric Integers / README
- solution / 2800-2899 / 2844.Minimum Operations to Make a Special Number / README
- solution / 2800-2899 / 2845.Count of Interesting Subarrays / README
- solution / 2800-2899 / 2846.Minimum Edge Weight Equilibrium Queries in a Tree / README
- solution / 2800-2899 / 2847.Smallest Number With Given Digit Product / README
- solution / 2800-2899 / 2848.Points That Intersect With Cars / README
- solution / 2800-2899 / 2849.Determine if a Cell Is Reachable at a Given Time / README
- solution / 2800-2899 / 2850.Minimum Moves to Spread Stones Over Grid / README
- solution / 2800-2899 / 2851.String Transformation / README
- solution / 2800-2899 / 2852.Sum of Remoteness of All Cells / README
- solution / 2800-2899 / 2853.Highest Salaries Difference / README
- solution / 2800-2899 / 2854.Rolling Average Steps / README
- solution / 2800-2899 / 2855.Minimum Right Shifts to Sort the Array / README
- solution / 2800-2899 / 2856.Minimum Array Length After Pair Removals / README
- solution / 2800-2899 / 2857.Count Pairs of Points With Distance k / README
- solution / 2800-2899 / 2858.Minimum Edge Reversals So Every Node Is Reachable / README
- solution / 2800-2899 / 2859.Sum of Values at Indices With K Set Bits / README
- solution / 2800-2899 / 2860.Happy Students / README
- solution / 2800-2899 / 2861.Maximum Number of Alloys / README
- solution / 2800-2899 / 2862.Maximum Element-Sum of a Complete Subset of Indices / README
- solution / 2800-2899 / 2863.Maximum Length of Semi-Decreasing Subarrays / README
- solution / 2800-2899 / 2864.Maximum Odd Binary Number / README
- solution / 2800-2899 / 2865.Beautiful Towers I / README
- solution / 2800-2899 / 2866.Beautiful Towers II / README
- solution / 2800-2899 / 2867.Count Valid Paths in a Tree / README
- solution / 2800-2899 / 2868.The Wording Game / README
- solution / 2800-2899 / 2869.Minimum Operations to Collect Elements / README
- solution / 2800-2899 / 2870.Minimum Number of Operations to Make Array Empty / README
- solution / 2800-2899 / 2871.Split Array Into Maximum Number of Subarrays / README
- solution / 2800-2899 / 2872.Maximum Number of K-Divisible Components / README
- solution / 2800-2899 / 2873.Maximum Value of an Ordered Triplet I / README
- solution / 2800-2899 / 2874.Maximum Value of an Ordered Triplet II / README
- solution / 2800-2899 / 2875.Minimum Size Subarray in Infinite Array / README
- solution / 2800-2899 / 2876.Count Visited Nodes in a Directed Graph / README
- solution / 2800-2899 / 2877.Create a DataFrame from List / README
- solution / 2800-2899 / 2878.Get the Size of a DataFrame / README
- solution / 2800-2899 / 2879.Display the First Three Rows / README
- solution / 2800-2899 / 2880.Select Data / README
- solution / 2800-2899 / 2881.Create a New Column / README
- solution / 2800-2899 / 2882.Drop Duplicate Rows / README
- solution / 2800-2899 / 2883.Drop Missing Data / README
- solution / 2800-2899 / 2884.Modify Columns / README
- solution / 2800-2899 / 2885.Rename Columns / README
- solution / 2800-2899 / 2886.Change Data Type / README
- solution / 2800-2899 / 2887.Fill Missing Data / README
- solution / 2800-2899 / 2888.Reshape Data Concatenate / README
- solution / 2800-2899 / 2889.Reshape Data Pivot / README
- solution / 2800-2899 / 2890.Reshape Data Melt / README
- solution / 2800-2899 / 2891.Method Chaining / README
- solution / 2800-2899 / 2892.Minimizing Array After Replacing Pairs With Their Product / README
- solution / 2800-2899 / 2893.Calculate Orders Within Each Interval / README
- solution / 2800-2899 / 2894.Divisible and Non-divisible Sums Difference / README
- solution / 2800-2899 / 2895.Minimum Processing Time / README
- solution / 2800-2899 / 2896.Apply Operations to Make Two Strings Equal / README
- solution / 2800-2899 / 2897.Apply Operations on Array to Maximize Sum of Squares / README
- solution / 2800-2899 / 2898.Maximum Linear Stock Score / README
- solution / 2800-2899 / 2899.Last Visited Integers / README
- solution / 2900-2999 / 2900.Longest Unequal Adjacent Groups Subsequence I / README
- solution / 2900-2999 / 2901.Longest Unequal Adjacent Groups Subsequence II / README
- solution / 2900-2999 / 2902.Count of Sub-Multisets With Bounded Sum / README
- solution / 2900-2999 / 2903.Find Indices With Index and Value Difference I / README
- solution / 2900-2999 / 2904.Shortest and Lexicographically Smallest Beautiful String / README
- solution / 2900-2999 / 2905.Find Indices With Index and Value Difference II / README
- solution / 2900-2999 / 2906.Construct Product Matrix / README
- solution / 2900-2999 / 2907.Maximum Profitable Triplets With Increasing Prices I / README
- solution / 2900-2999 / 2908.Minimum Sum of Mountain Triplets I / README
- solution / 2900-2999 / 2909.Minimum Sum of Mountain Triplets II / README
- solution / 2900-2999 / 2910.Minimum Number of Groups to Create a Valid Assignment / README
- solution / 2900-2999 / 2911.Minimum Changes to Make K Semi-palindromes / README
- solution / 2900-2999 / 2912.Number of Ways to Reach Destination in the Grid / README
- solution / 2900-2999 / 2913.Subarrays Distinct Element Sum of Squares I / README
- solution / 2900-2999 / 2914.Minimum Number of Changes to Make Binary String Beautiful / README
- solution / 2900-2999 / 2915.Length of the Longest Subsequence That Sums to Target / README
- solution / 2900-2999 / 2916.Subarrays Distinct Element Sum of Squares II / README
- solution / 2900-2999 / 2917.Find the K-or of an Array / README
- solution / 2900-2999 / 2918.Minimum Equal Sum of Two Arrays After Replacing Zeros / README
- solution / 2900-2999 / 2919.Minimum Increment Operations to Make Array Beautiful / README
- solution / 2900-2999 / 2920.Maximum Points After Collecting Coins From All Nodes / README
- solution / 2900-2999 / 2921.Maximum Profitable Triplets With Increasing Prices II / README
- solution / 2900-2999 / 2922.Market Analysis III / README
- solution / 2900-2999 / 2923.Find Champion I / README
- solution / 2900-2999 / 2924.Find Champion II / README
- solution / 2900-2999 / 2925.Maximum Score After Applying Operations on a Tree / README
- solution / 2900-2999 / 2926.Maximum Balanced Subsequence Sum / README
- solution / 2900-2999 / 2927.Distribute Candies Among Children III / README
- solution / 2900-2999 / 2928.Distribute Candies Among Children I / README
- solution / 2900-2999 / 2929.Distribute Candies Among Children II / README
- solution / 2900-2999 / 2930.Number of Strings Which Can Be Rearranged to Contain Substring / README
- solution / 2900-2999 / 2931.Maximum Spending After Buying Items / README
- solution / 2900-2999 / 2932.Maximum Strong Pair XOR I / README
- solution / 2900-2999 / 2933.High-Access Employees / README
- solution / 2900-2999 / 2934.Minimum Operations to Maximize Last Elements in Arrays / README
- solution / 2900-2999 / 2935.Maximum Strong Pair XOR II / README
- solution / 2900-2999 / 2936.Number of Equal Numbers Blocks / README
- solution / 2900-2999 / 2937.Make Three Strings Equal / README
- solution / 2900-2999 / 2938.Separate Black and White Balls / README
- solution / 2900-2999 / 2939.Maximum Xor Product / README
- solution / 2900-2999 / 2940.Find Building Where Alice and Bob Can Meet / README
- solution / 2900-2999 / 2941.Maximum GCD-Sum of a Subarray / README
- solution / 2900-2999 / 2942.Find Words Containing Character / README
- solution / 2900-2999 / 2943.Maximize Area of Square Hole in Grid / README
- solution / 2900-2999 / 2944.Minimum Number of Coins for Fruits / README
- solution / 2900-2999 / 2945.Find Maximum Non-decreasing Array Length / README
- solution / 2900-2999 / 2946.Matrix Similarity After Cyclic Shifts / README
- solution / 2900-2999 / 2947.Count Beautiful Substrings I / README
- solution / 2900-2999 / 2948.Make Lexicographically Smallest Array by Swapping Elements / README
- solution / 2900-2999 / 2949.Count Beautiful Substrings II / README
- solution / 2900-2999 / 2950.Number of Divisible Substrings / README
- solution / 2900-2999 / 2951.Find the Peaks / README
- solution / 2900-2999 / 2952.Minimum Number of Coins to be Added / README
- solution / 2900-2999 / 2953.Count Complete Substrings / README
- solution / 2900-2999 / 2954.Count the Number of Infection Sequences / README
- solution / 2900-2999 / 2955.Number of Same-End Substrings / README
- solution / 2900-2999 / 2956.Find Common Elements Between Two Arrays / README
- solution / 2900-2999 / 2957.Remove Adjacent Almost-Equal Characters / README
- solution / 2900-2999 / 2958.Length of Longest Subarray With at Most K Frequency / README
- solution / 2900-2999 / 2959.Number of Possible Sets of Closing Branches / README
- solution / 2900-2999 / 2960.Count Tested Devices After Test Operations / README
- solution / 2900-2999 / 2961.Double Modular Exponentiation / README
- solution / 2900-2999 / 2962.Count Subarrays Where Max Element Appears at Least K Times / README
- solution / 2900-2999 / 2963.Count the Number of Good Partitions / README
- solution / 2900-2999 / 2964.Number of Divisible Triplet Sums / README
- solution / 2900-2999 / 2965.Find Missing and Repeated Values / README
- solution / 2900-2999 / 2966.Divide Array Into Arrays With Max Difference / README
- solution / 2900-2999 / 2967.Minimum Cost to Make Array Equalindromic / README
- solution / 2900-2999 / 2968.Apply Operations to Maximize Frequency Score / README
- solution / 2900-2999 / 2969.Minimum Number of Coins for Fruits II / README
- solution / 2900-2999 / 2970.Count the Number of Incremovable Subarrays I / README
- solution / 2900-2999 / 2971.Find Polygon With the Largest Perimeter / README
- solution / 2900-2999 / 2972.Count the Number of Incremovable Subarrays II / README
- solution / 2900-2999 / 2973.Find Number of Coins to Place in Tree Nodes / README
- solution / 2900-2999 / 2974.Minimum Number Game / README
- solution / 2900-2999 / 2975.Maximum Square Area by Removing Fences From a Field / README
- solution / 2900-2999 / 2976.Minimum Cost to Convert String I / README
- solution / 2900-2999 / 2977.Minimum Cost to Convert String II / README
- solution / 2900-2999 / 2978.Symmetric Coordinates / README
- solution / 2900-2999 / 2979.Most Expensive Item That Can Not Be Bought / README
- solution / 2900-2999 / 2980.Check if Bitwise OR Has Trailing Zeros / README
- solution / 2900-2999 / 2981.Find Longest Special Substring That Occurs Thrice I / README
- solution / 2900-2999 / 2982.Find Longest Special Substring That Occurs Thrice II / README
- solution / 2900-2999 / 2983.Palindrome Rearrangement Queries / README
- solution / 2900-2999 / 2984.Find Peak Calling Hours for Each City / README
- solution / 2900-2999 / 2985.Calculate Compressed Mean / README
- solution / 2900-2999 / 2986.Find Third Transaction / README
- solution / 2900-2999 / 2987.Find Expensive Cities / README
- solution / 2900-2999 / 2988.Manager of the Largest Department / README
- solution / 2900-2999 / 2989.Class Performance / README
- solution / 2900-2999 / 2990.Loan Types / README
- solution / 2900-2999 / 2991.Top Three Wineries / README
- solution / 2900-2999 / 2992.Number of Self-Divisible Permutations / README
- solution / 2900-2999 / 2993.Friday Purchases I / README
- solution / 2900-2999 / 2994.Friday Purchases II / README
- solution / 2900-2999 / 2995.Viewers Turned Streamers / README
- solution / 2900-2999 / 2996.Smallest Missing Integer Greater Than Sequential Prefix Sum / README
- solution / 2900-2999 / 2997.Minimum Number of Operations to Make Array XOR Equal to K / README
- solution / 2900-2999 / 2998.Minimum Number of Operations to Make X and Y Equal / README
- solution / 2900-2999 / 2999.Count the Number of Powerful Integers / README
- solution / 3000-3099 / 3000.Maximum Area of Longest Diagonal Rectangle / README
- solution / 3000-3099 / 3001.Minimum Moves to Capture The Queen / README
- solution / 3000-3099 / 3002.Maximum Size of a Set After Removals / README
- solution / 3000-3099 / 3003.Maximize the Number of Partitions After Operations / README
- solution / 3000-3099 / 3004.Maximum Subtree of the Same Color / README
- solution / 3000-3099 / 3005.Count Elements With Maximum Frequency / README
- solution / 3000-3099 / 3006.Find Beautiful Indices in the Given Array I / README
- solution / 3000-3099 / 3007.Maximum Number That Sum of the Prices Is Less Than or Equal to K / README
- solution / 3000-3099 / 3008.Find Beautiful Indices in the Given Array II / README
- solution / 3000-3099 / 3009.Maximum Number of Intersections on the Chart / README
- solution / 3000-3099 / 3010.Divide an Array Into Subarrays With Minimum Cost I / README
- solution / 3000-3099 / 3011.Find if Array Can Be Sorted / README
- solution / 3000-3099 / 3012.Minimize Length of Array Using Operations / README
- solution / 3000-3099 / 3013.Divide an Array Into Subarrays With Minimum Cost II / README
- solution / 3000-3099 / 3014.Minimum Number of Pushes to Type Word I / README
- solution / 3000-3099 / 3015.Count the Number of Houses at a Certain Distance I / README
- solution / 3000-3099 / 3016.Minimum Number of Pushes to Type Word II / README
- solution / 3000-3099 / 3017.Count the Number of Houses at a Certain Distance II / README
- solution / 3000-3099 / 3018.Maximum Number of Removal Queries That Can Be Processed I / README
- solution / 3000-3099 / 3019.Number of Changing Keys / README
- solution / 3000-3099 / 3020.Find the Maximum Number of Elements in Subset / README
- solution / 3000-3099 / 3021.Alice and Bob Playing Flower Game / README
- solution / 3000-3099 / 3022.Minimize OR of Remaining Elements Using Operations / README
- solution / 3000-3099 / 3023.Find Pattern in Infinite Stream I / README
- solution / 3000-3099 / 3024.Type of Triangle / README
- solution / 3000-3099 / 3025.Find the Number of Ways to Place People I / README
- solution / 3000-3099 / 3026.Maximum Good Subarray Sum / README
- solution / 3000-3099 / 3027.Find the Number of Ways to Place People II / README
- solution / 3000-3099 / 3028.Ant on the Boundary / README
- solution / 3000-3099 / 3029.Minimum Time to Revert Word to Initial State I / README
- solution / 3000-3099 / 3030.Find the Grid of Region Average / README
- solution / 3000-3099 / 3031.Minimum Time to Revert Word to Initial State II / README
- solution / 3000-3099 / 3032.Count Numbers With Unique Digits II / README
- solution / 3000-3099 / 3033.Modify the Matrix / README
- solution / 3000-3099 / 3034.Number of Subarrays That Match a Pattern I / README
- solution / 3000-3099 / 3035.Maximum Palindromes After Operations / README
- solution / 3000-3099 / 3036.Number of Subarrays That Match a Pattern II / README
- solution / 3000-3099 / 3037.Find Pattern in Infinite Stream II / README
- solution / 3000-3099 / 3038.Maximum Number of Operations With the Same Score I / README
- solution / 3000-3099 / 3039.Apply Operations to Make String Empty / README
- solution / 3000-3099 / 3040.Maximum Number of Operations With the Same Score II / README
- solution / 3000-3099 / 3041.Maximize Consecutive Elements in an Array After Modification / README
- solution / 3000-3099 / 3042.Count Prefix and Suffix Pairs I / README
- solution / 3000-3099 / 3043.Find the Length of the Longest Common Prefix / README
- solution / 3000-3099 / 3044.Most Frequent Prime / README
- solution / 3000-3099 / 3045.Count Prefix and Suffix Pairs II / README
- solution / 3000-3099 / 3046.Split the Array / README
- solution / 3000-3099 / 3047.Find the Largest Area of Square Inside Two Rectangles / README
- solution / 3000-3099 / 3048.Earliest Second to Mark Indices I / README
- solution / 3000-3099 / 3049.Earliest Second to Mark Indices II / README
- solution / 3000-3099 / 3050.Pizza Toppings Cost Analysis / README
- solution / 3000-3099 / 3051.Find Candidates for Data Scientist Position / README
- solution / 3000-3099 / 3052.Maximize Items / README
- solution / 3000-3099 / 3053.Classifying Triangles by Lengths / README
- solution / 3000-3099 / 3054.Binary Tree Nodes / README
- solution / 3000-3099 / 3055.Top Percentile Fraud / README
- solution / 3000-3099 / 3056.Snaps Analysis / README
- solution / 3000-3099 / 3057.Employees Project Allocation / README
- solution / 3000-3099 / 3058.Friends With No Mutual Friends / README
- solution / 3000-3099 / 3059.Find All Unique Email Domains / README
- solution / 3000-3099 / 3060.User Activities within Time Bounds / README
- solution / 3000-3099 / 3061.Calculate Trapping Rain Water / README
- solution / 3000-3099 / 3062.Winner of the Linked List Game / README
- solution / 3000-3099 / 3063.Linked List Frequency / README
- solution / 3000-3099 / 3064.Guess the Number Using Bitwise Questions I / README
- solution / 3000-3099 / 3065.Minimum Operations to Exceed Threshold Value I / README
- solution / 3000-3099 / 3066.Minimum Operations to Exceed Threshold Value II / README
- solution / 3000-3099 / 3067.Count Pairs of Connectable Servers in a Weighted Tree Network / README
- solution / 3000-3099 / 3068.Find the Maximum Sum of Node Values / README
- solution / 3000-3099 / 3069.Distribute Elements Into Two Arrays I / README
- solution / 3000-3099 / 3070.Count Submatrices with Top-Left Element and Sum Less Than k / README
- solution / 3000-3099 / 3071.Minimum Operations to Write the Letter Y on a Grid / README
- solution / 3000-3099 / 3072.Distribute Elements Into Two Arrays II / README
- solution / 3000-3099 / 3073.Maximum Increasing Triplet Value / README
- solution / 3000-3099 / 3074.Apple Redistribution into Boxes / README
- solution / 3000-3099 / 3075.Maximize Happiness of Selected Children / README
- solution / 3000-3099 / 3076.Shortest Uncommon Substring in an Array / README
- solution / 3000-3099 / 3077.Maximum Strength of K Disjoint Subarrays / README
- solution / 3000-3099 / 3078.Match Alphanumerical Pattern in Matrix I / README
- solution / 3000-3099 / 3079.Find the Sum of Encrypted Integers / README
- solution / 3000-3099 / 3080.Mark Elements on Array by Performing Queries / README
- solution / 3000-3099 / 3081.Replace Question Marks in String to Minimize Its Value / README
- solution / 3000-3099 / 3082.Find the Sum of the Power of All Subsequences / README
- solution / 3000-3099 / 3083.Existence of a Substring in a String and Its Reverse / README
- solution / 3000-3099 / 3084.Count Substrings Starting and Ending with Given Character / README
- solution / 3000-3099 / 3085.Minimum Deletions to Make String K-Special / README
- solution / 3000-3099 / 3086.Minimum Moves to Pick K Ones / README
- solution / 3000-3099 / 3087.Find Trending Hashtags / README
文章来源于网络收集而来,版权归原创者所有,如有侵权请及时联系!
solution / README_EN
LeetCode
Solutions
Press Control + F(or Command + F on the Mac) to search anything you want.
# | Solution | Tags | Difficulty | Remark |
---|---|---|---|---|
0001 | Two Sum | Array ,Hash Table | Easy | |
0002 | Add Two Numbers | Recursion ,Linked List ,Math | Medium | |
0003 | Longest Substring Without Repeating Characters | Hash Table ,String ,Sliding Window | Medium | |
0004 | Median of Two Sorted Arrays | Array ,Binary Search ,Divide and Conquer | Hard | |
0005 | Longest Palindromic Substring | String ,Dynamic Programming | Medium | |
0006 | Zigzag Conversion | String | Medium | |
0007 | Reverse Integer | Math | Medium | |
0008 | String to Integer (atoi) | String | Medium | |
0009 | Palindrome Number | Math | Easy | |
0010 | Regular Expression Matching | Recursion ,String ,Dynamic Programming | Hard | |
0011 | Container With Most Water | Greedy ,Array ,Two Pointers | Medium | |
0012 | Integer to Roman | Hash Table ,Math ,String | Medium | |
0013 | Roman to Integer | Hash Table ,Math ,String | Easy | |
0014 | Longest Common Prefix | Trie ,String | Easy | |
0015 | 3Sum | Array ,Two Pointers ,Sorting | Medium | |
0016 | 3Sum Closest | Array ,Two Pointers ,Sorting | Medium | |
0017 | Letter Combinations of a Phone Number | Hash Table ,String ,Backtracking | Medium | |
0018 | 4Sum | Array ,Two Pointers ,Sorting | Medium | |
0019 | Remove Nth Node From End of List | Linked List ,Two Pointers | Medium | |
0020 | Valid Parentheses | Stack ,String | Easy | |
0021 | Merge Two Sorted Lists | Recursion ,Linked List | Easy | |
0022 | Generate Parentheses | String ,Dynamic Programming ,Backtracking | Medium | |
0023 | Merge k Sorted Lists | Linked List ,Divide and Conquer ,Heap (Priority Queue) ,Merge Sort | Hard | |
0024 | Swap Nodes in Pairs | Recursion ,Linked List | Medium | |
0025 | Reverse Nodes in k-Group | Recursion ,Linked List | Hard | |
0026 | Remove Duplicates from Sorted Array | Array ,Two Pointers | Easy | |
0027 | Remove Element | Array ,Two Pointers | Easy | |
0028 | Find the Index of the First Occurrence in a String | Two Pointers ,String ,String Matching | Easy | |
0029 | Divide Two Integers | Bit Manipulation ,Math | Medium | |
0030 | Substring with Concatenation of All Words | Hash Table ,String ,Sliding Window | Hard | |
0031 | Next Permutation | Array ,Two Pointers | Medium | |
0032 | Longest Valid Parentheses | Stack ,String ,Dynamic Programming | Hard | |
0033 | Search in Rotated Sorted Array | Array ,Binary Search | Medium | |
0034 | Find First and Last Position of Element in Sorted Array | Array ,Binary Search | Medium | |
0035 | Search Insert Position | Array ,Binary Search | Easy | |
0036 | Valid Sudoku | Array ,Hash Table ,Matrix | Medium | |
0037 | Sudoku Solver | Array ,Hash Table ,Backtracking ,Matrix | Hard | |
0038 | Count and Say | String | Medium | |
0039 | Combination Sum | Array ,Backtracking | Medium | |
0040 | Combination Sum II | Array ,Backtracking | Medium | |
0041 | First Missing Positive | Array ,Hash Table | Hard | |
0042 | Trapping Rain Water | Stack ,Array ,Two Pointers ,Dynamic Programming ,Monotonic Stack | Hard | |
0043 | Multiply Strings | Math ,String ,Simulation | Medium | |
0044 | Wildcard Matching | Greedy ,Recursion ,String ,Dynamic Programming | Hard | |
0045 | Jump Game II | Greedy ,Array ,Dynamic Programming | Medium | |
0046 | Permutations | Array ,Backtracking | Medium | |
0047 | Permutations II | Array ,Backtracking | Medium | |
0048 | Rotate Image | Array ,Math ,Matrix | Medium | |
0049 | Group Anagrams | Array ,Hash Table ,String ,Sorting | Medium | |
0050 | Pow(x, n) | Recursion ,Math | Medium | |
0051 | N-Queens | Array ,Backtracking | Hard | |
0052 | N-Queens II | Backtracking | Hard | |
0053 | Maximum Subarray | Array ,Divide and Conquer ,Dynamic Programming | Medium | |
0054 | Spiral Matrix | Array ,Matrix ,Simulation | Medium | |
0055 | Jump Game | Greedy ,Array ,Dynamic Programming | Medium | |
0056 | Merge Intervals | Array ,Sorting | Medium | |
0057 | Insert Interval | Array | Medium | |
0058 | Length of Last Word | String | Easy | |
0059 | Spiral Matrix II | Array ,Matrix ,Simulation | Medium | |
0060 | Permutation Sequence | Recursion ,Math | Hard | |
0061 | Rotate List | Linked List ,Two Pointers | Medium | |
0062 | Unique Paths | Math ,Dynamic Programming ,Combinatorics | Medium | |
0063 | Unique Paths II | Array ,Dynamic Programming ,Matrix | Medium | |
0064 | Minimum Path Sum | Array ,Dynamic Programming ,Matrix | Medium | |
0065 | Valid Number | String | Hard | |
0066 | Plus One | Array ,Math | Easy | |
0067 | Add Binary | Bit Manipulation ,Math ,String ,Simulation | Easy | |
0068 | Text Justification | Array ,String ,Simulation | Hard | |
0069 | Sqrt(x) | Math ,Binary Search | Easy | |
0070 | Climbing Stairs | Memoization ,Math ,Dynamic Programming | Easy | |
0071 | Simplify Path | Stack ,String | Medium | |
0072 | Edit Distance | String ,Dynamic Programming | Medium | |
0073 | Set Matrix Zeroes | Array ,Hash Table ,Matrix | Medium | |
0074 | Search a 2D Matrix | Array ,Binary Search ,Matrix | Medium | |
0075 | Sort Colors | Array ,Two Pointers ,Sorting | Medium | |
0076 | Minimum Window Substring | Hash Table ,String ,Sliding Window | Hard | |
0077 | Combinations | Backtracking | Medium | |
0078 | Subsets | Bit Manipulation ,Array ,Backtracking | Medium | |
0079 | Word Search | Array ,String ,Backtracking ,Matrix | Medium | |
0080 | Remove Duplicates from Sorted Array II | Array ,Two Pointers | Medium | |
0081 | Search in Rotated Sorted Array II | Array ,Binary Search | Medium | |
0082 | Remove Duplicates from Sorted List II | Linked List ,Two Pointers | Medium | |
0083 | Remove Duplicates from Sorted List | Linked List | Easy | |
0084 | Largest Rectangle in Histogram | Stack ,Array ,Monotonic Stack | Hard | |
0085 | Maximal Rectangle | Stack ,Array ,Dynamic Programming ,Matrix ,Monotonic Stack | Hard | |
0086 | Partition List | Linked List ,Two Pointers | Medium | |
0087 | Scramble String | String ,Dynamic Programming | Hard | |
0088 | Merge Sorted Array | Array ,Two Pointers ,Sorting | Easy | |
0089 | Gray Code | Bit Manipulation ,Math ,Backtracking | Medium | |
0090 | Subsets II | Bit Manipulation ,Array ,Backtracking | Medium | |
0091 | Decode Ways | String ,Dynamic Programming | Medium | |
0092 | Reverse Linked List II | Linked List | Medium | |
0093 | Restore IP Addresses | String ,Backtracking | Medium | |
0094 | Binary Tree Inorder Traversal | Stack ,Tree ,Depth-First Search ,Binary Tree | Easy | |
0095 | Unique Binary Search Trees II | Tree ,Binary Search Tree ,Dynamic Programming ,Backtracking ,Binary Tree | Medium | |
0096 | Unique Binary Search Trees | Tree ,Binary Search Tree ,Math ,Dynamic Programming ,Binary Tree | Medium | |
0097 | Interleaving String | String ,Dynamic Programming | Medium | |
0098 | Validate Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0099 | Recover Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0100 | Same Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0101 | Symmetric Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0102 | Binary Tree Level Order Traversal | Tree ,Breadth-First Search ,Binary Tree | Medium | |
0103 | Binary Tree Zigzag Level Order Traversal | Tree ,Breadth-First Search ,Binary Tree | Medium | |
0104 | Maximum Depth of Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0105 | Construct Binary Tree from Preorder and Inorder Traversal | Tree ,Array ,Hash Table ,Divide and Conquer ,Binary Tree | Medium | |
0106 | Construct Binary Tree from Inorder and Postorder Traversal | Tree ,Array ,Hash Table ,Divide and Conquer ,Binary Tree | Medium | |
0107 | Binary Tree Level Order Traversal II | Tree ,Breadth-First Search ,Binary Tree | Medium | |
0108 | Convert Sorted Array to Binary Search Tree | Tree ,Binary Search Tree ,Array ,Divide and Conquer ,Binary Tree | Easy | |
0109 | Convert Sorted List to Binary Search Tree | Tree ,Binary Search Tree ,Linked List ,Divide and Conquer ,Binary Tree | Medium | |
0110 | Balanced Binary Tree | Tree ,Depth-First Search ,Binary Tree | Easy | |
0111 | Minimum Depth of Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0112 | Path Sum | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0113 | Path Sum II | Tree ,Depth-First Search ,Backtracking ,Binary Tree | Medium | |
0114 | Flatten Binary Tree to Linked List | Stack ,Tree ,Depth-First Search ,Linked List ,Binary Tree | Medium | |
0115 | Distinct Subsequences | String ,Dynamic Programming | Hard | |
0116 | Populating Next Right Pointers in Each Node | Tree ,Depth-First Search ,Breadth-First Search ,Linked List ,Binary Tree | Medium | |
0117 | Populating Next Right Pointers in Each Node II | Tree ,Depth-First Search ,Breadth-First Search ,Linked List ,Binary Tree | Medium | |
0118 | Pascal's Triangle | Array ,Dynamic Programming | Easy | |
0119 | Pascal's Triangle II | Array ,Dynamic Programming | Easy | |
0120 | Triangle | Array ,Dynamic Programming | Medium | |
0121 | Best Time to Buy and Sell Stock | Array ,Dynamic Programming | Easy | |
0122 | Best Time to Buy and Sell Stock II | Greedy ,Array ,Dynamic Programming | Medium | |
0123 | Best Time to Buy and Sell Stock III | Array ,Dynamic Programming | Hard | |
0124 | Binary Tree Maximum Path Sum | Tree ,Depth-First Search ,Dynamic Programming ,Binary Tree | Hard | |
0125 | Valid Palindrome | Two Pointers ,String | Easy | |
0126 | Word Ladder II | Breadth-First Search ,Hash Table ,String ,Backtracking | Hard | |
0127 | Word Ladder | Breadth-First Search ,Hash Table ,String | Hard | |
0128 | Longest Consecutive Sequence | Union Find ,Array ,Hash Table | Medium | |
0129 | Sum Root to Leaf Numbers | Tree ,Depth-First Search ,Binary Tree | Medium | |
0130 | Surrounded Regions | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | |
0131 | Palindrome Partitioning | String ,Dynamic Programming ,Backtracking | Medium | |
0132 | Palindrome Partitioning II | String ,Dynamic Programming | Hard | |
0133 | Clone Graph | Depth-First Search ,Breadth-First Search ,Graph ,Hash Table | Medium | |
0134 | Gas Station | Greedy ,Array | Medium | |
0135 | Candy | Greedy ,Array | Hard | |
0136 | Single Number | Bit Manipulation ,Array | Easy | |
0137 | Single Number II | Bit Manipulation ,Array | Medium | |
0138 | Copy List with Random Pointer | Hash Table ,Linked List | Medium | |
0139 | Word Break | Trie ,Memoization ,Array ,Hash Table ,String ,Dynamic Programming | Medium | |
0140 | Word Break II | Trie ,Memoization ,Array ,Hash Table ,String ,Dynamic Programming ,Backtracking | Hard | |
0141 | Linked List Cycle | Hash Table ,Linked List ,Two Pointers | Easy | |
0142 | Linked List Cycle II | Hash Table ,Linked List ,Two Pointers | Medium | |
0143 | Reorder List | Stack ,Recursion ,Linked List ,Two Pointers | Medium | |
0144 | Binary Tree Preorder Traversal | Stack ,Tree ,Depth-First Search ,Binary Tree | Easy | |
0145 | Binary Tree Postorder Traversal | Stack ,Tree ,Depth-First Search ,Binary Tree | Easy | |
0146 | LRU Cache | Design ,Hash Table ,Linked List ,Doubly-Linked List | Medium | |
0147 | Insertion Sort List | Linked List ,Sorting | Medium | |
0148 | Sort List | Linked List ,Two Pointers ,Divide and Conquer ,Sorting ,Merge Sort | Medium | |
0149 | Max Points on a Line | Geometry ,Array ,Hash Table ,Math | Hard | |
0150 | Evaluate Reverse Polish Notation | Stack ,Array ,Math | Medium | |
0151 | Reverse Words in a String | Two Pointers ,String | Medium | |
0152 | Maximum Product Subarray | Array ,Dynamic Programming | Medium | |
0153 | Find Minimum in Rotated Sorted Array | Array ,Binary Search | Medium | |
0154 | Find Minimum in Rotated Sorted Array II | Array ,Binary Search | Hard | |
0155 | Min Stack | Stack ,Design | Medium | |
0156 | Binary Tree Upside Down | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0157 | Read N Characters Given Read4 | Array ,Interactive ,Simulation | Easy | ???? |
0158 | Read N Characters Given read4 II - Call Multiple Times | Array ,Interactive ,Simulation | Hard | ???? |
0159 | Longest Substring with At Most Two Distinct Characters | Hash Table ,String ,Sliding Window | Medium | ???? |
0160 | Intersection of Two Linked Lists | Hash Table ,Linked List ,Two Pointers | Easy | |
0161 | One Edit Distance | Two Pointers ,String | Medium | ???? |
0162 | Find Peak Element | Array ,Binary Search | Medium | |
0163 | Missing Ranges | Array | Easy | ???? |
0164 | Maximum Gap | Array ,Bucket Sort ,Radix Sort ,Sorting | Medium | |
0165 | Compare Version Numbers | Two Pointers ,String | Medium | |
0166 | Fraction to Recurring Decimal | Hash Table ,Math ,String | Medium | |
0167 | Two Sum II - Input Array Is Sorted | Array ,Two Pointers ,Binary Search | Medium | |
0168 | Excel Sheet Column Title | Math ,String | Easy | |
0169 | Majority Element | Array ,Hash Table ,Divide and Conquer ,Counting ,Sorting | Easy | |
0170 | Two Sum III - Data structure design | Design ,Array ,Hash Table ,Two Pointers ,Data Stream | Easy | ???? |
0171 | Excel Sheet Column Number | Math ,String | Easy | |
0172 | Factorial Trailing Zeroes | Math | Medium | |
0173 | Binary Search Tree Iterator | Stack ,Tree ,Design ,Binary Search Tree ,Binary Tree ,Iterator | Medium | |
0174 | Dungeon Game | Array ,Dynamic Programming ,Matrix | Hard | |
0175 | Combine Two Tables | Database | Easy | |
0176 | Second Highest Salary | Database | Medium | |
0177 | Nth Highest Salary | Database | Medium | |
0178 | Rank Scores | Database | Medium | |
0179 | Largest Number | Greedy ,Array ,String ,Sorting | Medium | |
0180 | Consecutive Numbers | Database | Medium | |
0181 | Employees Earning More Than Their Managers | Database | Easy | |
0182 | Duplicate Emails | Database | Easy | |
0183 | Customers Who Never Order | Database | Easy | |
0184 | Department Highest Salary | Database | Medium | |
0185 | Department Top Three Salaries | Database | Hard | |
0186 | Reverse Words in a String II | Two Pointers ,String | Medium | ???? |
0187 | Repeated DNA Sequences | Bit Manipulation ,Hash Table ,String ,Sliding Window ,Hash Function ,Rolling Hash | Medium | |
0188 | Best Time to Buy and Sell Stock IV | Array ,Dynamic Programming | Hard | |
0189 | Rotate Array | Array ,Math ,Two Pointers | Medium | |
0190 | Reverse Bits | Bit Manipulation ,Divide and Conquer | Easy | |
0191 | Number of 1 Bits | Bit Manipulation ,Divide and Conquer | Easy | |
0192 | Word Frequency | Shell | Medium | |
0193 | Valid Phone Numbers | Shell | Easy | |
0194 | Transpose File | Shell | Medium | |
0195 | Tenth Line | Shell | Easy | |
0196 | Delete Duplicate Emails | Database | Easy | |
0197 | Rising Temperature | Database | Easy | |
0198 | House Robber | Array ,Dynamic Programming | Medium | |
0199 | Binary Tree Right Side View | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0200 | Number of Islands | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | |
0201 | Bitwise AND of Numbers Range | Bit Manipulation | Medium | |
0202 | Happy Number | Hash Table ,Math ,Two Pointers | Easy | |
0203 | Remove Linked List Elements | Recursion ,Linked List | Easy | |
0204 | Count Primes | Array ,Math ,Enumeration ,Number Theory | Medium | |
0205 | Isomorphic Strings | Hash Table ,String | Easy | |
0206 | Reverse Linked List | Recursion ,Linked List | Easy | |
0207 | Course Schedule | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | |
0208 | Implement Trie (Prefix Tree) | Design ,Trie ,Hash Table ,String | Medium | |
0209 | Minimum Size Subarray Sum | Array ,Binary Search ,Prefix Sum ,Sliding Window | Medium | |
0210 | Course Schedule II | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | |
0211 | Design Add and Search Words Data Structure | Depth-First Search ,Design ,Trie ,String | Medium | |
0212 | Word Search II | Trie ,Array ,String ,Backtracking ,Matrix | Hard | |
0213 | House Robber II | Array ,Dynamic Programming | Medium | |
0214 | Shortest Palindrome | String ,String Matching ,Hash Function ,Rolling Hash | Hard | |
0215 | Kth Largest Element in an Array | Array ,Divide and Conquer ,Quickselect ,Sorting ,Heap (Priority Queue) | Medium | |
0216 | Combination Sum III | Array ,Backtracking | Medium | |
0217 | Contains Duplicate | Array ,Hash Table ,Sorting | Easy | |
0218 | The Skyline Problem | Binary Indexed Tree ,Segment Tree ,Array ,Divide and Conquer ,Ordered Set ,Line Sweep ,Heap (Priority Queue) | Hard | |
0219 | Contains Duplicate II | Array ,Hash Table ,Sliding Window | Easy | |
0220 | Contains Duplicate III | Array ,Bucket Sort ,Ordered Set ,Sorting ,Sliding Window | Hard | |
0221 | Maximal Square | Array ,Dynamic Programming ,Matrix | Medium | |
0222 | Count Complete Tree Nodes | Bit Manipulation ,Tree ,Binary Search ,Binary Tree | Easy | |
0223 | Rectangle Area | Geometry ,Math | Medium | |
0224 | Basic Calculator | Stack ,Recursion ,Math ,String | Hard | |
0225 | Implement Stack using Queues | Stack ,Design ,Queue | Easy | |
0226 | Invert Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0227 | Basic Calculator II | Stack ,Math ,String | Medium | |
0228 | Summary Ranges | Array | Easy | |
0229 | Majority Element II | Array ,Hash Table ,Counting ,Sorting | Medium | |
0230 | Kth Smallest Element in a BST | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0231 | Power of Two | Bit Manipulation ,Recursion ,Math | Easy | |
0232 | Implement Queue using Stacks | Stack ,Design ,Queue | Easy | |
0233 | Number of Digit One | Recursion ,Math ,Dynamic Programming | Hard | |
0234 | Palindrome Linked List | Stack ,Recursion ,Linked List ,Two Pointers | Easy | |
0235 | Lowest Common Ancestor of a Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0236 | Lowest Common Ancestor of a Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | |
0237 | Delete Node in a Linked List | Linked List | Medium | |
0238 | Product of Array Except Self | Array ,Prefix Sum | Medium | |
0239 | Sliding Window Maximum | Queue ,Array ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Hard | |
0240 | Search a 2D Matrix II | Array ,Binary Search ,Divide and Conquer ,Matrix | Medium | |
0241 | Different Ways to Add Parentheses | Recursion ,Memoization ,Math ,String ,Dynamic Programming | Medium | |
0242 | Valid Anagram | Hash Table ,String ,Sorting | Easy | |
0243 | Shortest Word Distance | Array ,String | Easy | ???? |
0244 | Shortest Word Distance II | Design ,Array ,Hash Table ,Two Pointers ,String | Medium | ???? |
0245 | Shortest Word Distance III | Array ,String | Medium | ???? |
0246 | Strobogrammatic Number | Hash Table ,Two Pointers ,String | Easy | ???? |
0247 | Strobogrammatic Number II | Recursion ,Array ,String | Medium | ???? |
0248 | Strobogrammatic Number III | Recursion ,Array ,String | Hard | ???? |
0249 | Group Shifted Strings | Array ,Hash Table ,String | Medium | ???? |
0250 | Count Univalue Subtrees | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0251 | Flatten 2D Vector | Design ,Array ,Two Pointers ,Iterator | Medium | ???? |
0252 | Meeting Rooms | Array ,Sorting | Easy | ???? |
0253 | Meeting Rooms II | Greedy ,Array ,Two Pointers ,Prefix Sum ,Sorting ,Heap (Priority Queue) | Medium | ???? |
0254 | Factor Combinations | Backtracking | Medium | ???? |
0255 | Verify Preorder Sequence in Binary Search Tree | Stack ,Tree ,Binary Search Tree ,Recursion ,Array ,Binary Tree ,Monotonic Stack | Medium | ???? |
0256 | Paint House | Array ,Dynamic Programming | Medium | ???? |
0257 | Binary Tree Paths | Tree ,Depth-First Search ,String ,Backtracking ,Binary Tree | Easy | |
0258 | Add Digits | Math ,Number Theory ,Simulation | Easy | |
0259 | 3Sum Smaller | Array ,Two Pointers ,Binary Search ,Sorting | Medium | ???? |
0260 | Single Number III | Bit Manipulation ,Array | Medium | |
0261 | Graph Valid Tree | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | ???? |
0262 | Trips and Users | Database | Hard | |
0263 | Ugly Number | Math | Easy | |
0264 | Ugly Number II | Hash Table ,Math ,Dynamic Programming ,Heap (Priority Queue) | Medium | |
0265 | Paint House II | Array ,Dynamic Programming | Hard | ???? |
0266 | Palindrome Permutation | Bit Manipulation ,Hash Table ,String | Easy | ???? |
0267 | Palindrome Permutation II | Hash Table ,String ,Backtracking | Medium | ???? |
0268 | Missing Number | Bit Manipulation ,Array ,Hash Table ,Math ,Binary Search ,Sorting | Easy | |
0269 | Alien Dictionary | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort ,Array ,String | Hard | ???? |
0270 | Closest Binary Search Tree Value | Tree ,Depth-First Search ,Binary Search Tree ,Binary Search ,Binary Tree | Easy | ???? |
0271 | Encode and Decode Strings | Design ,Array ,String | Medium | ???? |
0272 | Closest Binary Search Tree Value II | Stack ,Tree ,Depth-First Search ,Binary Search Tree ,Two Pointers ,Binary Tree ,Heap (Priority Queue) | Hard | ???? |
0273 | Integer to English Words | Recursion ,Math ,String | Hard | |
0274 | H-Index | Array ,Counting Sort ,Sorting | Medium | |
0275 | H-Index II | Array ,Binary Search | Medium | |
0276 | Paint Fence | Dynamic Programming | Medium | ???? |
0277 | Find the Celebrity | Graph ,Two Pointers ,Interactive | Medium | ???? |
0278 | First Bad Version | Binary Search ,Interactive | Easy | |
0279 | Perfect Squares | Breadth-First Search ,Math ,Dynamic Programming | Medium | |
0280 | Wiggle Sort | Greedy ,Array ,Sorting | Medium | ???? |
0281 | Zigzag Iterator | Design ,Queue ,Array ,Iterator | Medium | ???? |
0282 | Expression Add Operators | Math ,String ,Backtracking | Hard | |
0283 | Move Zeroes | Array ,Two Pointers | Easy | |
0284 | Peeking Iterator | Design ,Array ,Iterator | Medium | |
0285 | Inorder Successor in BST | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | ???? |
0286 | Walls and Gates | Breadth-First Search ,Array ,Matrix | Medium | ???? |
0287 | Find the Duplicate Number | Bit Manipulation ,Array ,Two Pointers ,Binary Search | Medium | |
0288 | Unique Word Abbreviation | Design ,Array ,Hash Table ,String | Medium | ???? |
0289 | Game of Life | Array ,Matrix ,Simulation | Medium | |
0290 | Word Pattern | Hash Table ,String | Easy | |
0291 | Word Pattern II | Hash Table ,String ,Backtracking | Medium | ???? |
0292 | Nim Game | Brainteaser ,Math ,Game Theory | Easy | |
0293 | Flip Game | String | Easy | ???? |
0294 | Flip Game II | Memoization ,Math ,Dynamic Programming ,Backtracking ,Game Theory | Medium | ???? |
0295 | Find Median from Data Stream | Design ,Two Pointers ,Data Stream ,Sorting ,Heap (Priority Queue) | Hard | |
0296 | Best Meeting Point | Array ,Math ,Matrix ,Sorting | Hard | ???? |
0297 | Serialize and Deserialize Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Design ,String ,Binary Tree | Hard | |
0298 | Binary Tree Longest Consecutive Sequence | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0299 | Bulls and Cows | Hash Table ,String ,Counting | Medium | |
0300 | Longest Increasing Subsequence | Array ,Binary Search ,Dynamic Programming | Medium | |
0301 | Remove Invalid Parentheses | Breadth-First Search ,String ,Backtracking | Hard | |
0302 | Smallest Rectangle Enclosing Black Pixels | Depth-First Search ,Breadth-First Search ,Array ,Binary Search ,Matrix | Hard | ???? |
0303 | Range Sum Query - Immutable | Design ,Array ,Prefix Sum | Easy | |
0304 | Range Sum Query 2D - Immutable | Design ,Array ,Matrix ,Prefix Sum | Medium | |
0305 | Number of Islands II | Union Find ,Array | Hard | ???? |
0306 | Additive Number | String ,Backtracking | Medium | |
0307 | Range Sum Query - Mutable | Design ,Binary Indexed Tree ,Segment Tree ,Array | Medium | |
0308 | Range Sum Query 2D - Mutable | Design ,Binary Indexed Tree ,Segment Tree ,Array ,Matrix | Hard | ???? |
0309 | Best Time to Buy and Sell Stock with Cooldown | Array ,Dynamic Programming | Medium | |
0310 | Minimum Height Trees | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | |
0311 | Sparse Matrix Multiplication | Array ,Hash Table ,Matrix | Medium | ???? |
0312 | Burst Balloons | Array ,Dynamic Programming | Hard | |
0313 | Super Ugly Number | Array ,Math ,Dynamic Programming | Medium | |
0314 | Binary Tree Vertical Order Traversal | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | ???? |
0315 | Count of Smaller Numbers After Self | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | |
0316 | Remove Duplicate Letters | Stack ,Greedy ,String ,Monotonic Stack | Medium | |
0317 | Shortest Distance from All Buildings | Breadth-First Search ,Array ,Matrix | Hard | ???? |
0318 | Maximum Product of Word Lengths | Bit Manipulation ,Array ,String | Medium | |
0319 | Bulb Switcher | Brainteaser ,Math | Medium | |
0320 | Generalized Abbreviation | Bit Manipulation ,String ,Backtracking | Medium | ???? |
0321 | Create Maximum Number | Stack ,Greedy ,Monotonic Stack | Hard | |
0322 | Coin Change | Breadth-First Search ,Array ,Dynamic Programming | Medium | |
0323 | Number of Connected Components in an Undirected Graph | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | ???? |
0324 | Wiggle Sort II | Array ,Divide and Conquer ,Quickselect ,Sorting | Medium | |
0325 | Maximum Size Subarray Sum Equals k | Array ,Hash Table ,Prefix Sum | Medium | ???? |
0326 | Power of Three | Recursion ,Math | Easy | |
0327 | Count of Range Sum | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | |
0328 | Odd Even Linked List | Linked List | Medium | |
0329 | Longest Increasing Path in a Matrix | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort ,Memoization ,Array ,Dynamic Programming ,Matrix | Hard | |
0330 | Patching Array | Greedy ,Array | Hard | |
0331 | Verify Preorder Serialization of a Binary Tree | Stack ,Tree ,String ,Binary Tree | Medium | |
0332 | Reconstruct Itinerary | Depth-First Search ,Graph ,Eulerian Circuit | Hard | |
0333 | Largest BST Subtree | Tree ,Depth-First Search ,Binary Search Tree ,Dynamic Programming ,Binary Tree | Medium | ???? |
0334 | Increasing Triplet Subsequence | Greedy ,Array | Medium | |
0335 | Self Crossing | Geometry ,Array ,Math | Hard | |
0336 | Palindrome Pairs | Trie ,Array ,Hash Table ,String | Hard | |
0337 | House Robber III | Tree ,Depth-First Search ,Dynamic Programming ,Binary Tree | Medium | |
0338 | Counting Bits | Bit Manipulation ,Dynamic Programming | Easy | |
0339 | Nested List Weight Sum | Depth-First Search ,Breadth-First Search | Medium | ???? |
0340 | Longest Substring with At Most K Distinct Characters | Hash Table ,String ,Sliding Window | Medium | ???? |
0341 | Flatten Nested List Iterator | Stack ,Tree ,Depth-First Search ,Design ,Queue ,Iterator | Medium | |
0342 | Power of Four | Bit Manipulation ,Recursion ,Math | Easy | |
0343 | Integer Break | Math ,Dynamic Programming | Medium | |
0344 | Reverse String | Two Pointers ,String | Easy | |
0345 | Reverse Vowels of a String | Two Pointers ,String | Easy | |
0346 | Moving Average from Data Stream | Design ,Queue ,Array ,Data Stream | Easy | ???? |
0347 | Top K Frequent Elements | Array ,Hash Table ,Divide and Conquer ,Bucket Sort ,Counting ,Quickselect ,Sorting ,Heap (Priority Queue) | Medium | |
0348 | Design Tic-Tac-Toe | Design ,Array ,Hash Table ,Matrix ,Simulation | Medium | ???? |
0349 | Intersection of Two Arrays | Array ,Hash Table ,Two Pointers ,Binary Search ,Sorting | Easy | |
0350 | Intersection of Two Arrays II | Array ,Hash Table ,Two Pointers ,Binary Search ,Sorting | Easy | |
0351 | Android Unlock Patterns | Dynamic Programming ,Backtracking | Medium | ???? |
0352 | Data Stream as Disjoint Intervals | Design ,Binary Search ,Ordered Set | Hard | |
0353 | Design Snake Game | Design ,Queue ,Array ,Hash Table ,Simulation | Medium | ???? |
0354 | Russian Doll Envelopes | Array ,Binary Search ,Dynamic Programming ,Sorting | Hard | |
0355 | Design Twitter | Design ,Hash Table ,Linked List ,Heap (Priority Queue) | Medium | |
0356 | Line Reflection | Array ,Hash Table ,Math | Medium | ???? |
0357 | Count Numbers with Unique Digits | Math ,Dynamic Programming ,Backtracking | Medium | |
0358 | Rearrange String k Distance Apart | Greedy ,Hash Table ,String ,Counting ,Sorting ,Heap (Priority Queue) | Hard | ???? |
0359 | Logger Rate Limiter | Design ,Hash Table ,Data Stream | Easy | ???? |
0360 | Sort Transformed Array | Array ,Math ,Two Pointers ,Sorting | Medium | ???? |
0361 | Bomb Enemy | Array ,Dynamic Programming ,Matrix | Medium | ???? |
0362 | Design Hit Counter | Design ,Queue ,Array ,Binary Search ,Data Stream | Medium | ???? |
0363 | Max Sum of Rectangle No Larger Than K | Array ,Binary Search ,Matrix ,Ordered Set ,Prefix Sum | Hard | |
0364 | Nested List Weight Sum II | Stack ,Depth-First Search ,Breadth-First Search | Medium | ???? |
0365 | Water and Jug Problem | Depth-First Search ,Breadth-First Search ,Math | Medium | |
0366 | Find Leaves of Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0367 | Valid Perfect Square | Math ,Binary Search | Easy | |
0368 | Largest Divisible Subset | Array ,Math ,Dynamic Programming ,Sorting | Medium | |
0369 | Plus One Linked List | Linked List ,Math | Medium | ???? |
0370 | Range Addition | Array ,Prefix Sum | Medium | ???? |
0371 | Sum of Two Integers | Bit Manipulation ,Math | Medium | |
0372 | Super Pow | Math ,Divide and Conquer | Medium | |
0373 | Find K Pairs with Smallest Sums | Array ,Heap (Priority Queue) | Medium | |
0374 | Guess Number Higher or Lower | Binary Search ,Interactive | Easy | |
0375 | Guess Number Higher or Lower II | Math ,Dynamic Programming ,Game Theory | Medium | |
0376 | Wiggle Subsequence | Greedy ,Array ,Dynamic Programming | Medium | |
0377 | Combination Sum IV | Array ,Dynamic Programming | Medium | |
0378 | Kth Smallest Element in a Sorted Matrix | Array ,Binary Search ,Matrix ,Sorting ,Heap (Priority Queue) | Medium | |
0379 | Design Phone Directory | Design ,Queue ,Array ,Hash Table ,Linked List | Medium | ???? |
0380 | Insert Delete GetRandom O(1) | Design ,Array ,Hash Table ,Math ,Randomized | Medium | |
0381 | Insert Delete GetRandom O(1) - Duplicates allowed | Design ,Array ,Hash Table ,Math ,Randomized | Hard | |
0382 | Linked List Random Node | Reservoir Sampling ,Linked List ,Math ,Randomized | Medium | |
0383 | Ransom Note | Hash Table ,String ,Counting | Easy | |
0384 | Shuffle an Array | Array ,Math ,Randomized | Medium | |
0385 | Mini Parser | Stack ,Depth-First Search ,String | Medium | |
0386 | Lexicographical Numbers | Depth-First Search ,Trie | Medium | |
0387 | First Unique Character in a String | Queue ,Hash Table ,String ,Counting | Easy | |
0388 | Longest Absolute File Path | Stack ,Depth-First Search ,String | Medium | |
0389 | Find the Difference | Bit Manipulation ,Hash Table ,String ,Sorting | Easy | |
0390 | Elimination Game | Recursion ,Math | Medium | |
0391 | Perfect Rectangle | Array ,Line Sweep | Hard | |
0392 | Is Subsequence | Two Pointers ,String ,Dynamic Programming | Easy | |
0393 | UTF-8 Validation | Bit Manipulation ,Array | Medium | |
0394 | Decode String | Stack ,Recursion ,String | Medium | |
0395 | Longest Substring with At Least K Repeating Characters | Hash Table ,String ,Divide and Conquer ,Sliding Window | Medium | |
0396 | Rotate Function | Array ,Math ,Dynamic Programming | Medium | |
0397 | Integer Replacement | Greedy ,Bit Manipulation ,Memoization ,Dynamic Programming | Medium | |
0398 | Random Pick Index | Reservoir Sampling ,Hash Table ,Math ,Randomized | Medium | |
0399 | Evaluate Division | Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Array ,Shortest Path | Medium | |
0400 | Nth Digit | Math ,Binary Search | Medium | |
0401 | Binary Watch | Bit Manipulation ,Backtracking | Easy | |
0402 | Remove K Digits | Stack ,Greedy ,String ,Monotonic Stack | Medium | |
0403 | Frog Jump | Array ,Dynamic Programming | Hard | |
0404 | Sum of Left Leaves | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0405 | Convert a Number to Hexadecimal | Bit Manipulation ,Math | Easy | |
0406 | Queue Reconstruction by Height | Binary Indexed Tree ,Segment Tree ,Array ,Sorting | Medium | |
0407 | Trapping Rain Water II | Breadth-First Search ,Array ,Matrix ,Heap (Priority Queue) | Hard | |
0408 | Valid Word Abbreviation | Two Pointers ,String | Easy | ???? |
0409 | Longest Palindrome | Greedy ,Hash Table ,String | Easy | |
0410 | Split Array Largest Sum | Greedy ,Array ,Binary Search ,Dynamic Programming ,Prefix Sum | Hard | |
0411 | Minimum Unique Word Abbreviation | Bit Manipulation ,String ,Backtracking | Hard | ???? |
0412 | Fizz Buzz | Math ,String ,Simulation | Easy | |
0413 | Arithmetic Slices | Array ,Dynamic Programming | Medium | |
0414 | Third Maximum Number | Array ,Sorting | Easy | |
0415 | Add Strings | Math ,String ,Simulation | Easy | |
0416 | Partition Equal Subset Sum | Array ,Dynamic Programming | Medium | |
0417 | Pacific Atlantic Water Flow | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | |
0418 | Sentence Screen Fitting | String ,Dynamic Programming ,Simulation | Medium | ???? |
0419 | Battleships in a Board | Depth-First Search ,Array ,Matrix | Medium | |
0420 | Strong Password Checker | Greedy ,String ,Heap (Priority Queue) | Hard | |
0421 | Maximum XOR of Two Numbers in an Array | Bit Manipulation ,Trie ,Array ,Hash Table | Medium | |
0422 | Valid Word Square | Array ,Matrix | Easy | ???? |
0423 | Reconstruct Original Digits from English | Hash Table ,Math ,String | Medium | |
0424 | Longest Repeating Character Replacement | Hash Table ,String ,Sliding Window | Medium | |
0425 | Word Squares | Trie ,Array ,String ,Backtracking | Hard | ???? |
0426 | Convert Binary Search Tree to Sorted Doubly Linked List | Stack ,Tree ,Depth-First Search ,Binary Search Tree ,Linked List ,Binary Tree ,Doubly-Linked List | Medium | ???? |
0427 | Construct Quad Tree | Tree ,Array ,Divide and Conquer ,Matrix | Medium | |
0428 | Serialize and Deserialize N-ary Tree | Tree ,Depth-First Search ,Breadth-First Search ,String | Hard | ???? |
0429 | N-ary Tree Level Order Traversal | Tree ,Breadth-First Search | Medium | |
0430 | Flatten a Multilevel Doubly Linked List | Depth-First Search ,Linked List ,Doubly-Linked List | Medium | |
0431 | Encode N-ary Tree to Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Design ,Binary Tree | Hard | ???? |
0432 | [All Oone Data Structure](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README_EN.md) | Design, Hash Table, Linked List, Doubly-Linked List` | Hard | ||
0433 | Minimum Genetic Mutation | Breadth-First Search ,Hash Table ,String | Medium | |
0434 | Number of Segments in a String | String | Easy | |
0435 | Non-overlapping Intervals | Greedy ,Array ,Dynamic Programming ,Sorting | Medium | |
0436 | Find Right Interval | Array ,Binary Search ,Sorting | Medium | |
0437 | Path Sum III | Tree ,Depth-First Search ,Binary Tree | Medium | |
0438 | Find All Anagrams in a String | Hash Table ,String ,Sliding Window | Medium | |
0439 | Ternary Expression Parser | Stack ,Recursion ,String | Medium | ???? |
0440 | K-th Smallest in Lexicographical Order | Trie | Hard | |
0441 | Arranging Coins | Math ,Binary Search | Easy | |
0442 | Find All Duplicates in an Array | Array ,Hash Table | Medium | |
0443 | String Compression | Two Pointers ,String | Medium | |
0444 | Sequence Reconstruction | Graph ,Topological Sort ,Array | Medium | ???? |
0445 | Add Two Numbers II | Stack ,Linked List ,Math | Medium | |
0446 | Arithmetic Slices II - Subsequence | Array ,Dynamic Programming | Hard | |
0447 | Number of Boomerangs | Array ,Hash Table ,Math | Medium | |
0448 | Find All Numbers Disappeared in an Array | Array ,Hash Table | Easy | |
0449 | Serialize and Deserialize BST | Tree ,Depth-First Search ,Breadth-First Search ,Design ,Binary Search Tree ,String ,Binary Tree | Medium | |
0450 | Delete Node in a BST | Tree ,Binary Search Tree ,Binary Tree | Medium | |
0451 | Sort Characters By Frequency | Hash Table ,String ,Bucket Sort ,Counting ,Sorting ,Heap (Priority Queue) | Medium | |
0452 | Minimum Number of Arrows to Burst Balloons | Greedy ,Array ,Sorting | Medium | |
0453 | Minimum Moves to Equal Array Elements | Array ,Math | Medium | |
0454 | 4Sum II | Array ,Hash Table | Medium | |
0455 | Assign Cookies | Greedy ,Array ,Two Pointers ,Sorting | Easy | |
0456 | 132 Pattern | Stack ,Array ,Binary Search ,Ordered Set ,Monotonic Stack | Medium | |
0457 | Circular Array Loop | Array ,Hash Table ,Two Pointers | Medium | |
0458 | Poor Pigs | Math ,Dynamic Programming ,Combinatorics | Hard | |
0459 | Repeated Substring Pattern | String ,String Matching | Easy | |
0460 | LFU Cache | Design ,Hash Table ,Linked List ,Doubly-Linked List | Hard | |
0461 | Hamming Distance | Bit Manipulation | Easy | |
0462 | Minimum Moves to Equal Array Elements II | Array ,Math ,Sorting | Medium | |
0463 | Island Perimeter | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Easy | |
0464 | Can I Win | Bit Manipulation ,Memoization ,Math ,Dynamic Programming ,Bitmask ,Game Theory | Medium | |
0465 | Optimal Account Balancing | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Hard | ???? |
0466 | Count The Repetitions | String ,Dynamic Programming | Hard | |
0467 | Unique Substrings in Wraparound String | String ,Dynamic Programming | Medium | |
0468 | Validate IP Address | String | Medium | |
0469 | Convex Polygon | Geometry ,Math | Medium | ???? |
0470 | Implement Rand10() Using Rand7() | Math ,Rejection Sampling ,Probability and Statistics ,Randomized | Medium | |
0471 | Encode String with Shortest Length | String ,Dynamic Programming | Hard | ???? |
0472 | Concatenated Words | Depth-First Search ,Trie ,Array ,String ,Dynamic Programming | Hard | |
0473 | Matchsticks to Square | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | |
0474 | Ones and Zeroes | Array ,String ,Dynamic Programming | Medium | |
0475 | Heaters | Array ,Two Pointers ,Binary Search ,Sorting | Medium | |
0476 | Number Complement | Bit Manipulation | Easy | |
0477 | Total Hamming Distance | Bit Manipulation ,Array ,Math | Medium | |
0478 | Generate Random Point in a Circle | Geometry ,Math ,Rejection Sampling ,Randomized | Medium | |
0479 | Largest Palindrome Product | Math | Hard | |
0480 | Sliding Window Median | Array ,Hash Table ,Sliding Window ,Heap (Priority Queue) | Hard | |
0481 | Magical String | Two Pointers ,String | Medium | |
0482 | License Key Formatting | String | Easy | |
0483 | Smallest Good Base | Math ,Binary Search | Hard | |
0484 | Find Permutation | Stack ,Greedy ,Array ,String | Medium | ???? |
0485 | Max Consecutive Ones | Array | Easy | |
0486 | Predict the Winner | Recursion ,Array ,Math ,Dynamic Programming ,Game Theory | Medium | |
0487 | Max Consecutive Ones II | Array ,Dynamic Programming ,Sliding Window | Medium | ???? |
0488 | Zuma Game | Stack ,Breadth-First Search ,Memoization ,String ,Dynamic Programming | Hard | |
0489 | Robot Room Cleaner | Backtracking ,Interactive | Hard | ???? |
0490 | The Maze | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | ???? |
0491 | Non-decreasing Subsequences | Bit Manipulation ,Array ,Hash Table ,Backtracking | Medium | |
0492 | Construct the Rectangle | Math | Easy | |
0493 | Reverse Pairs | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | |
0494 | Target Sum | Array ,Dynamic Programming ,Backtracking | Medium | |
0495 | Teemo Attacking | Array ,Simulation | Easy | |
0496 | Next Greater Element I | Stack ,Array ,Hash Table ,Monotonic Stack | Easy | |
0497 | Random Point in Non-overlapping Rectangles | Reservoir Sampling ,Array ,Math ,Binary Search ,Ordered Set ,Prefix Sum ,Randomized | Medium | |
0498 | Diagonal Traverse | Array ,Matrix ,Simulation | Medium | |
0499 | The Maze III | Depth-First Search ,Breadth-First Search ,Graph ,Array ,String ,Matrix ,Shortest Path ,Heap (Priority Queue) | Hard | ???? |
0500 | Keyboard Row | Array ,Hash Table ,String | Easy | |
0501 | Find Mode in Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Easy | |
0502 | IPO | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Hard | |
0503 | Next Greater Element II | Stack ,Array ,Monotonic Stack | Medium | |
0504 | Base 7 | Math | Easy | |
0505 | The Maze II | Depth-First Search ,Breadth-First Search ,Graph ,Array ,Matrix ,Shortest Path ,Heap (Priority Queue) | Medium | ???? |
0506 | Relative Ranks | Array ,Sorting ,Heap (Priority Queue) | Easy | |
0507 | Perfect Number | Math | Easy | |
0508 | Most Frequent Subtree Sum | Tree ,Depth-First Search ,Hash Table ,Binary Tree | Medium | |
0509 | Fibonacci Number | Recursion ,Memoization ,Math ,Dynamic Programming | Easy | |
0510 | Inorder Successor in BST II | Tree ,Binary Search Tree ,Binary Tree | Medium | ???? |
0511 | Game Play Analysis I | Database | Easy | |
0512 | Game Play Analysis II | Database | Easy | ???? |
0513 | Find Bottom Left Tree Value | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0514 | Freedom Trail | Depth-First Search ,Breadth-First Search ,String ,Dynamic Programming | Hard | |
0515 | Find Largest Value in Each Tree Row | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0516 | Longest Palindromic Subsequence | String ,Dynamic Programming | Medium | |
0517 | Super Washing Machines | Greedy ,Array | Hard | |
0518 | Coin Change II | Array ,Dynamic Programming | Medium | |
0519 | Random Flip Matrix | Reservoir Sampling ,Hash Table ,Math ,Randomized | Medium | |
0520 | Detect Capital | String | Easy | |
0521 | Longest Uncommon Subsequence I | String | Easy | |
0522 | Longest Uncommon Subsequence II | Array ,Hash Table ,Two Pointers ,String ,Sorting | Medium | |
0523 | Continuous Subarray Sum | Array ,Hash Table ,Math ,Prefix Sum | Medium | |
0524 | Longest Word in Dictionary through Deleting | Array ,Two Pointers ,String ,Sorting | Medium | |
0525 | Contiguous Array | Array ,Hash Table ,Prefix Sum | Medium | |
0526 | Beautiful Arrangement | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | |
0527 | Word Abbreviation | Greedy ,Trie ,Array ,String ,Sorting | Hard | ???? |
0528 | Random Pick with Weight | Array ,Math ,Binary Search ,Prefix Sum ,Randomized | Medium | |
0529 | Minesweeper | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | |
0530 | Minimum Absolute Difference in BST | Tree ,Depth-First Search ,Breadth-First Search ,Binary Search Tree ,Binary Tree | Easy | |
0531 | Lonely Pixel I | Array ,Hash Table ,Matrix | Medium | ???? |
0532 | K-diff Pairs in an Array | Array ,Hash Table ,Two Pointers ,Binary Search ,Sorting | Medium | |
0533 | Lonely Pixel II | Array ,Hash Table ,Matrix | Medium | ???? |
0534 | Game Play Analysis III | Database | Medium | ???? |
0535 | Encode and Decode TinyURL | Design ,Hash Table ,String ,Hash Function | Medium | |
0536 | Construct Binary Tree from String | Tree ,Depth-First Search ,String ,Binary Tree | Medium | ???? |
0537 | Complex Number Multiplication | Math ,String ,Simulation | Medium | |
0538 | Convert BST to Greater Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0539 | Minimum Time Difference | Array ,Math ,String ,Sorting | Medium | |
0540 | Single Element in a Sorted Array | Array ,Binary Search | Medium | |
0541 | Reverse String II | Two Pointers ,String | Easy | |
0542 | 01 Matrix | Breadth-First Search ,Array ,Dynamic Programming ,Matrix | Medium | |
0543 | Diameter of Binary Tree | Tree ,Depth-First Search ,Binary Tree | Easy | |
0544 | Output Contest Matches | Recursion ,String ,Simulation | Medium | ???? |
0545 | Boundary of Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0546 | Remove Boxes | Memoization ,Array ,Dynamic Programming | Hard | |
0547 | Number of Provinces | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | |
0548 | Split Array with Equal Sum | Array ,Prefix Sum | Hard | ???? |
0549 | Binary Tree Longest Consecutive Sequence II | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0550 | Game Play Analysis IV | Database | Medium | |
0551 | Student Attendance Record I | String | Easy | |
0552 | Student Attendance Record II | Dynamic Programming | Hard | |
0553 | Optimal Division | Array ,Math ,Dynamic Programming | Medium | |
0554 | Brick Wall | Array ,Hash Table | Medium | |
0555 | Split Concatenated Strings | Greedy ,Array ,String | Medium | ???? |
0556 | Next Greater Element III | Math ,Two Pointers ,String | Medium | |
0557 | Reverse Words in a String III | Two Pointers ,String | Easy | |
0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | Tree ,Divide and Conquer | Medium | |
0559 | Maximum Depth of N-ary Tree | Tree ,Depth-First Search ,Breadth-First Search | Easy | |
0560 | Subarray Sum Equals K | Array ,Hash Table ,Prefix Sum | Medium | |
0561 | Array Partition | Greedy ,Array ,Counting Sort ,Sorting | Easy | |
0562 | Longest Line of Consecutive One in Matrix | Array ,Dynamic Programming ,Matrix | Medium | ???? |
0563 | Binary Tree Tilt | Tree ,Depth-First Search ,Binary Tree | Easy | |
0564 | Find the Closest Palindrome | Math ,String | Hard | |
0565 | Array Nesting | Depth-First Search ,Array | Medium | |
0566 | Reshape the Matrix | Array ,Matrix ,Simulation | Easy | |
0567 | Permutation in String | Hash Table ,Two Pointers ,String ,Sliding Window | Medium | |
0568 | Maximum Vacation Days | Array ,Dynamic Programming ,Matrix | Hard | ???? |
0569 | Median Employee Salary | Database | Hard | ???? |
0570 | Managers with at Least 5 Direct Reports | Database | Medium | |
0571 | Find Median Given Frequency of Numbers | Database | Hard | ???? |
0572 | Subtree of Another Tree | Tree ,Depth-First Search ,Binary Tree ,String Matching ,Hash Function | Easy | |
0573 | Squirrel Simulation | Array ,Math | Medium | ???? |
0574 | Winning Candidate | Database | Medium | ???? |
0575 | Distribute Candies | Array ,Hash Table | Easy | |
0576 | Out of Boundary Paths | Dynamic Programming | Medium | |
0577 | Employee Bonus | Database | Easy | |
0578 | Get Highest Answer Rate Question | Database | Medium | ???? |
0579 | Find Cumulative Salary of an Employee | Database | Hard | ???? |
0580 | Count Student Number in Departments | Database | Medium | ???? |
0581 | Shortest Unsorted Continuous Subarray | Stack ,Greedy ,Array ,Two Pointers ,Sorting ,Monotonic Stack | Medium | |
0582 | Kill Process | Tree ,Depth-First Search ,Breadth-First Search ,Array ,Hash Table | Medium | ???? |
0583 | Delete Operation for Two Strings | String ,Dynamic Programming | Medium | |
0584 | Find Customer Referee | Database | Easy | |
0585 | Investments in 2016 | Database | Medium | |
0586 | Customer Placing the Largest Number of Orders | Database | Easy | |
0587 | Erect the Fence | Geometry ,Array ,Math | Hard | |
0588 | Design In-Memory File System | Design ,Trie ,Hash Table ,String | Hard | ???? |
0589 | N-ary Tree Preorder Traversal | Stack ,Tree ,Depth-First Search | Easy | |
0590 | N-ary Tree Postorder Traversal | Stack ,Tree ,Depth-First Search | Easy | |
0591 | Tag Validator | Stack ,String | Hard | |
0592 | Fraction Addition and Subtraction | Math ,String ,Simulation | Medium | |
0593 | Valid Square | Geometry ,Math | Medium | |
0594 | Longest Harmonious Subsequence | Array ,Hash Table ,Counting ,Sorting ,Sliding Window | Easy | |
0595 | Big Countries | Database | Easy | |
0596 | Classes More Than 5 Students | Database | Easy | |
0597 | Friend Requests I Overall Acceptance Rate | Database | Easy | ???? |
0598 | Range Addition II | Array ,Math | Easy | |
0599 | Minimum Index Sum of Two Lists | Array ,Hash Table ,String | Easy | |
0600 | Non-negative Integers without Consecutive Ones | Dynamic Programming | Hard | |
0601 | Human Traffic of Stadium | Database | Hard | |
0602 | Friend Requests II Who Has the Most Friends | Database | Medium | |
0603 | Consecutive Available Seats | Database | Easy | ???? |
0604 | Design Compressed String Iterator | Design ,Array ,String ,Iterator | Easy | ???? |
0605 | Can Place Flowers | Greedy ,Array | Easy | |
0606 | Construct String from Binary Tree | Tree ,Depth-First Search ,String ,Binary Tree | Medium | |
0607 | Sales Person | Database | Easy | |
0608 | Tree Node | Database | Medium | |
0609 | Find Duplicate File in System | Array ,Hash Table ,String | Medium | |
0610 | Triangle Judgement | Database | Easy | |
0611 | Valid Triangle Number | Greedy ,Array ,Two Pointers ,Binary Search ,Sorting | Medium | |
0612 | Shortest Distance in a Plane | Database | Medium | ???? |
0613 | Shortest Distance in a Line | Database | Easy | ???? |
0614 | Second Degree Follower | Database | Medium | ???? |
0615 | Average Salary Departments VS Company | Database | Hard | ???? |
0616 | Add Bold Tag in String | Trie ,Array ,Hash Table ,String ,String Matching | Medium | ???? |
0617 | Merge Two Binary Trees | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0618 | Students Report By Geography | Database | Hard | ???? |
0619 | Biggest Single Number | Database | Easy | |
0620 | Not Boring Movies | Database | Easy | |
0621 | Task Scheduler | Greedy ,Array ,Hash Table ,Counting ,Sorting ,Heap (Priority Queue) | Medium | |
0622 | Design Circular Queue | Design ,Queue ,Array ,Linked List | Medium | |
0623 | Add One Row to Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0624 | Maximum Distance in Arrays | Greedy ,Array | Medium | ???? |
0625 | Minimum Factorization | Greedy ,Math | Medium | ???? |
0626 | Exchange Seats | Database | Medium | |
0627 | Swap Salary | Database | Easy | |
0628 | Maximum Product of Three Numbers | Array ,Math ,Sorting | Easy | |
0629 | K Inverse Pairs Array | Dynamic Programming | Hard | |
0630 | Course Schedule III | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Hard | |
0631 | Design Excel Sum Formula | Graph ,Design ,Topological Sort ,Array ,Matrix | Hard | ???? |
0632 | Smallest Range Covering Elements from K Lists | Greedy ,Array ,Hash Table ,Sorting ,Sliding Window ,Heap (Priority Queue) | Hard | |
0633 | Sum of Square Numbers | Math ,Two Pointers ,Binary Search | Medium | |
0634 | Find the Derangement of An Array | Math ,Dynamic Programming | Medium | ???? |
0635 | Design Log Storage System | Design ,Hash Table ,String ,Ordered Set | Medium | ???? |
0636 | Exclusive Time of Functions | Stack ,Array | Medium | |
0637 | Average of Levels in Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
0638 | Shopping Offers | Bit Manipulation ,Memoization ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | |
0639 | Decode Ways II | String ,Dynamic Programming | Hard | |
0640 | Solve the Equation | Math ,String ,Simulation | Medium | |
0641 | Design Circular Deque | Design ,Queue ,Array ,Linked List | Medium | |
0642 | Design Search Autocomplete System | Design ,Trie ,String ,Data Stream | Hard | ???? |
0643 | Maximum Average Subarray I | Array ,Sliding Window | Easy | |
0644 | Maximum Average Subarray II | Array ,Binary Search ,Prefix Sum | Hard | ???? |
0645 | Set Mismatch | Bit Manipulation ,Array ,Hash Table ,Sorting | Easy | |
0646 | Maximum Length of Pair Chain | Greedy ,Array ,Dynamic Programming ,Sorting | Medium | |
0647 | Palindromic Substrings | String ,Dynamic Programming | Medium | |
0648 | Replace Words | Trie ,Array ,Hash Table ,String | Medium | |
0649 | Dota2 Senate | Greedy ,Queue ,String | Medium | |
0650 | 2 Keys Keyboard | Math ,Dynamic Programming | Medium | |
0651 | 4 Keys Keyboard | Math ,Dynamic Programming | Medium | ???? |
0652 | Find Duplicate Subtrees | Tree ,Depth-First Search ,Hash Table ,Binary Tree | Medium | |
0653 | Two Sum IV - Input is a BST | Tree ,Depth-First Search ,Breadth-First Search ,Binary Search Tree ,Hash Table ,Two Pointers ,Binary Tree | Easy | |
0654 | Maximum Binary Tree | Stack ,Tree ,Array ,Divide and Conquer ,Binary Tree ,Monotonic Stack | Medium | |
0655 | Print Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0656 | Coin Path | Array ,Dynamic Programming | Hard | ???? |
0657 | Robot Return to Origin | String ,Simulation | Easy | |
0658 | Find K Closest Elements | Array ,Two Pointers ,Binary Search ,Sorting ,Sliding Window ,Heap (Priority Queue) | Medium | |
0659 | Split Array into Consecutive Subsequences | Greedy ,Array ,Hash Table ,Heap (Priority Queue) | Medium | |
0660 | Remove 9 | Math | Hard | ???? |
0661 | Image Smoother | Array ,Matrix | Easy | |
0662 | Maximum Width of Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | |
0663 | Equal Tree Partition | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
0664 | Strange Printer | String ,Dynamic Programming | Hard | |
0665 | Non-decreasing Array | Array | Medium | |
0666 | Path Sum IV | Tree ,Depth-First Search ,Array ,Hash Table ,Binary Tree | Medium | ???? |
0667 | Beautiful Arrangement II | Array ,Math | Medium | |
0668 | Kth Smallest Number in Multiplication Table | Math ,Binary Search | Hard | |
0669 | Trim a Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | |
0670 | Maximum Swap | Greedy ,Math | Medium | |
0671 | Second Minimum Node In a Binary Tree | Tree ,Depth-First Search ,Binary Tree | Easy | |
0672 | Bulb Switcher II | Bit Manipulation ,Depth-First Search ,Breadth-First Search ,Math | Medium | |
0673 | Number of Longest Increasing Subsequence | Binary Indexed Tree ,Segment Tree ,Array ,Dynamic Programming | Medium | |
0674 | Longest Continuous Increasing Subsequence | Array | Easy | |
0675 | Cut Off Trees for Golf Event | Breadth-First Search ,Array ,Matrix ,Heap (Priority Queue) | Hard | |
0676 | Implement Magic Dictionary | Depth-First Search ,Design ,Trie ,Hash Table ,String | Medium | |
0677 | Map Sum Pairs | Design ,Trie ,Hash Table ,String | Medium | |
0678 | Valid Parenthesis String | Stack ,Greedy ,String ,Dynamic Programming | Medium | |
0679 | 24 Game | Array ,Math ,Backtracking | Hard | |
0680 | Valid Palindrome II | Greedy ,Two Pointers ,String | Easy | |
0681 | Next Closest Time | String ,Enumeration | Medium | ???? |
0682 | Baseball Game | Stack ,Array ,Simulation | Easy | |
0683 | K Empty Slots | Binary Indexed Tree ,Array ,Ordered Set ,Sliding Window | Hard | ???? |
0684 | Redundant Connection | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | |
0685 | Redundant Connection II | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Hard | |
0686 | Repeated String Match | String ,String Matching | Medium | |
0687 | Longest Univalue Path | Tree ,Depth-First Search ,Binary Tree | Medium | |
0688 | Knight Probability in Chessboard | Dynamic Programming | Medium | |
0689 | Maximum Sum of 3 Non-Overlapping Subarrays | Array ,Dynamic Programming | Hard | |
0690 | Employee Importance | Tree ,Depth-First Search ,Breadth-First Search ,Array ,Hash Table | Medium | |
0691 | Stickers to Spell Word | Bit Manipulation ,Array ,String ,Dynamic Programming ,Backtracking ,Bitmask | Hard | |
0692 | Top K Frequent Words | Trie ,Hash Table ,String ,Bucket Sort ,Counting ,Sorting ,Heap (Priority Queue) | Medium | |
0693 | Binary Number with Alternating Bits | Bit Manipulation | Easy | |
0694 | Number of Distinct Islands | Depth-First Search ,Breadth-First Search ,Union Find ,Hash Table ,Hash Function | Medium | ???? |
0695 | Max Area of Island | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | |
0696 | Count Binary Substrings | Two Pointers ,String | Easy | |
0697 | Degree of an Array | Array ,Hash Table | Easy | |
0698 | Partition to K Equal Sum Subsets | Bit Manipulation ,Memoization ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | |
0699 | Falling Squares | Segment Tree ,Array ,Ordered Set | Hard | |
0700 | Search in a Binary Search Tree | Tree ,Binary Search Tree ,Binary Tree | Easy | |
0701 | Insert into a Binary Search Tree | Tree ,Binary Search Tree ,Binary Tree | Medium | |
0702 | Search in a Sorted Array of Unknown Size | Array ,Binary Search ,Interactive | Medium | ???? |
0703 | Kth Largest Element in a Stream | Tree ,Design ,Binary Search Tree ,Binary Tree ,Data Stream ,Heap (Priority Queue) | Easy | |
0704 | Binary Search | Array ,Binary Search | Easy | |
0705 | Design HashSet | Design ,Array ,Hash Table ,Linked List ,Hash Function | Easy | |
0706 | Design HashMap | Design ,Array ,Hash Table ,Linked List ,Hash Function | Easy | |
0707 | Design Linked List | Design ,Linked List | Medium | |
0708 | Insert into a Sorted Circular Linked List | Linked List | Medium | ???? |
0709 | To Lower Case | String | Easy | |
0710 | Random Pick with Blacklist | Array ,Hash Table ,Math ,Binary Search ,Sorting ,Randomized | Hard | |
0711 | Number of Distinct Islands II | Depth-First Search ,Breadth-First Search ,Union Find ,Hash Table ,Hash Function | Hard | ???? |
0712 | Minimum ASCII Delete Sum for Two Strings | String ,Dynamic Programming | Medium | |
0713 | Subarray Product Less Than K | Array ,Sliding Window | Medium | |
0714 | Best Time to Buy and Sell Stock with Transaction Fee | Greedy ,Array ,Dynamic Programming | Medium | |
0715 | Range Module | Design ,Segment Tree ,Ordered Set | Hard | |
0716 | Max Stack | Stack ,Design ,Linked List ,Doubly-Linked List ,Ordered Set | Hard | ???? |
0717 | 1-bit and 2-bit Characters | Array | Easy | |
0718 | Maximum Length of Repeated Subarray | Array ,Binary Search ,Dynamic Programming ,Sliding Window ,Hash Function ,Rolling Hash | Medium | |
0719 | Find K-th Smallest Pair Distance | Array ,Two Pointers ,Binary Search ,Sorting | Hard | |
0720 | Longest Word in Dictionary | Trie ,Array ,Hash Table ,String ,Sorting | Medium | |
0721 | Accounts Merge | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Hash Table ,String ,Sorting | Medium | |
0722 | Remove Comments | Array ,String | Medium | |
0723 | Candy Crush | Array ,Two Pointers ,Matrix ,Simulation | Medium | ???? |
0724 | Find Pivot Index | Array ,Prefix Sum | Easy | |
0725 | Split Linked List in Parts | Linked List | Medium | |
0726 | Number of Atoms | Stack ,Hash Table ,String ,Sorting | Hard | |
0727 | Minimum Window Subsequence | String ,Dynamic Programming ,Sliding Window | Hard | ???? |
0728 | Self Dividing Numbers | Math | Easy | |
0729 | My Calendar I | Design ,Segment Tree ,Binary Search ,Ordered Set | Medium | |
0730 | Count Different Palindromic Subsequences | String ,Dynamic Programming | Hard | |
0731 | My Calendar II | Design ,Segment Tree ,Binary Search ,Ordered Set | Medium | |
0732 | My Calendar III | Design ,Segment Tree ,Binary Search ,Ordered Set | Hard | |
0733 | Flood Fill | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Easy | |
0734 | Sentence Similarity | Array ,Hash Table ,String | Easy | ???? |
0735 | Asteroid Collision | Stack ,Array ,Simulation | Medium | |
0736 | Parse Lisp Expression | Stack ,Recursion ,Hash Table ,String | Hard | |
0737 | Sentence Similarity II | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Hash Table ,String | Medium | ???? |
0738 | Monotone Increasing Digits | Greedy ,Math | Medium | |
0739 | Daily Temperatures | Stack ,Array ,Monotonic Stack | Medium | |
0740 | Delete and Earn | Array ,Hash Table ,Dynamic Programming | Medium | |
0741 | Cherry Pickup | Array ,Dynamic Programming ,Matrix | Hard | |
0742 | Closest Leaf in a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | ???? |
0743 | Network Delay Time | Depth-First Search ,Breadth-First Search ,Graph ,Shortest Path ,Heap (Priority Queue) | Medium | |
0744 | Find Smallest Letter Greater Than Target | Array ,Binary Search | Easy | |
0745 | Prefix and Suffix Search | Design ,Trie ,Hash Table ,String | Hard | |
0746 | Min Cost Climbing Stairs | Array ,Dynamic Programming | Easy | |
0747 | Largest Number At Least Twice of Others | Array ,Sorting | Easy | |
0748 | Shortest Completing Word | Array ,Hash Table ,String | Easy | |
0749 | Contain Virus | Depth-First Search ,Breadth-First Search ,Array ,Matrix ,Simulation | Hard | |
0750 | Number Of Corner Rectangles | Array ,Math ,Dynamic Programming ,Matrix | Medium | ???? |
0751 | IP to CIDR | Bit Manipulation ,String | Medium | ???? |
0752 | Open the Lock | Breadth-First Search ,Array ,Hash Table ,String | Medium | |
0753 | Cracking the Safe | Depth-First Search ,Graph ,Eulerian Circuit | Hard | |
0754 | Reach a Number | Math ,Binary Search | Medium | |
0755 | Pour Water | Array ,Simulation | Medium | ???? |
0756 | Pyramid Transition Matrix | Bit Manipulation ,Depth-First Search ,Breadth-First Search | Medium | |
0757 | Set Intersection Size At Least Two | Greedy ,Array ,Sorting | Hard | |
0758 | Bold Words in String | Trie ,Array ,Hash Table ,String ,String Matching | Medium | ???? |
0759 | Employee Free Time | Array ,Sorting ,Heap (Priority Queue) | Hard | ???? |
0760 | Find Anagram Mappings | Array ,Hash Table | Easy | ???? |
0761 | Special Binary String | Recursion ,String | Hard | |
0762 | Prime Number of Set Bits in Binary Representation | Bit Manipulation ,Math | Easy | |
0763 | Partition Labels | Greedy ,Hash Table ,Two Pointers ,String | Medium | |
0764 | Largest Plus Sign | Array ,Dynamic Programming | Medium | |
0765 | Couples Holding Hands | Greedy ,Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Hard | |
0766 | Toeplitz Matrix | Array ,Matrix | Easy | |
0767 | Reorganize String | Greedy ,Hash Table ,String ,Counting ,Sorting ,Heap (Priority Queue) | Medium | |
0768 | Max Chunks To Make Sorted II | Stack ,Greedy ,Array ,Sorting ,Monotonic Stack | Hard | |
0769 | Max Chunks To Make Sorted | Stack ,Greedy ,Array ,Sorting ,Monotonic Stack | Medium | |
0770 | Basic Calculator IV | Stack ,Recursion ,Hash Table ,Math ,String | Hard | |
0771 | Jewels and Stones | Hash Table ,String | Easy | |
0772 | Basic Calculator III | Stack ,Recursion ,Math ,String | Hard | ???? |
0773 | Sliding Puzzle | Breadth-First Search ,Array ,Matrix | Hard | |
0774 | Minimize Max Distance to Gas Station | Array ,Binary Search | Hard | ???? |
0775 | Global and Local Inversions | Array ,Math | Medium | |
0776 | Split BST | Tree ,Binary Search Tree ,Recursion ,Binary Tree | Medium | ???? |
0777 | Swap Adjacent in LR String | Two Pointers ,String | Medium | |
0778 | Swim in Rising Water | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Binary Search ,Matrix ,Heap (Priority Queue) | Hard | |
0779 | K-th Symbol in Grammar | Bit Manipulation ,Recursion ,Math | Medium | |
0780 | Reaching Points | Math | Hard | |
0781 | Rabbits in Forest | Greedy ,Array ,Hash Table ,Math | Medium | |
0782 | Transform to Chessboard | Bit Manipulation ,Array ,Math ,Matrix | Hard | |
0783 | Minimum Distance Between BST Nodes | Tree ,Depth-First Search ,Breadth-First Search ,Binary Search Tree ,Binary Tree | Easy | |
0784 | Letter Case Permutation | Bit Manipulation ,String ,Backtracking | Medium | |
0785 | Is Graph Bipartite | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | |
0786 | K-th Smallest Prime Fraction | Array ,Binary Search ,Sorting ,Heap (Priority Queue) | Medium | |
0787 | Cheapest Flights Within K Stops | Depth-First Search ,Breadth-First Search ,Graph ,Dynamic Programming ,Shortest Path ,Heap (Priority Queue) | Medium | |
0788 | Rotated Digits | Math ,Dynamic Programming | Medium | |
0789 | Escape The Ghosts | Array ,Math | Medium | |
0790 | Domino and Tromino Tiling | Dynamic Programming | Medium | |
0791 | Custom Sort String | Hash Table ,String ,Sorting | Medium | |
0792 | Number of Matching Subsequences | Trie ,Array ,Hash Table ,String ,Binary Search ,Dynamic Programming ,Sorting | Medium | |
0793 | Preimage Size of Factorial Zeroes Function | Math ,Binary Search | Hard | |
0794 | Valid Tic-Tac-Toe State | Array ,Matrix | Medium | |
0795 | Number of Subarrays with Bounded Maximum | Array ,Two Pointers | Medium | |
0796 | Rotate String | String ,String Matching | Easy | |
0797 | All Paths From Source to Target | Depth-First Search ,Breadth-First Search ,Graph ,Backtracking | Medium | |
0798 | Smallest Rotation with Highest Score | Array ,Prefix Sum | Hard | |
0799 | Champagne Tower | Dynamic Programming | Medium | |
0800 | Similar RGB Color | Math ,String ,Enumeration | Easy | ???? |
0801 | Minimum Swaps To Make Sequences Increasing | Array ,Dynamic Programming | Hard | |
0802 | Find Eventual Safe States | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | |
0803 | Bricks Falling When Hit | Union Find ,Array ,Matrix | Hard | |
0804 | Unique Morse Code Words | Array ,Hash Table ,String | Easy | |
0805 | Split Array With Same Average | Bit Manipulation ,Array ,Math ,Dynamic Programming ,Bitmask | Hard | |
0806 | Number of Lines To Write String | Array ,String | Easy | |
0807 | Max Increase to Keep City Skyline | Greedy ,Array ,Matrix | Medium | |
0808 | Soup Servings | Math ,Dynamic Programming ,Probability and Statistics | Medium | |
0809 | Expressive Words | Array ,Two Pointers ,String | Medium | |
0810 | Chalkboard XOR Game | Bit Manipulation ,Brainteaser ,Array ,Math ,Game Theory | Hard | |
0811 | Subdomain Visit Count | Array ,Hash Table ,String ,Counting | Medium | |
0812 | Largest Triangle Area | Geometry ,Array ,Math | Easy | |
0813 | Largest Sum of Averages | Array ,Dynamic Programming ,Prefix Sum | Medium | |
0814 | Binary Tree Pruning | Tree ,Depth-First Search ,Binary Tree | Medium | |
0815 | Bus Routes | Breadth-First Search ,Array ,Hash Table | Hard | |
0816 | Ambiguous Coordinates | String ,Backtracking ,Enumeration | Medium | |
0817 | Linked List Components | Array ,Hash Table ,Linked List | Medium | |
0818 | Race Car | Dynamic Programming | Hard | |
0819 | Most Common Word | Array ,Hash Table ,String ,Counting | Easy | |
0820 | Short Encoding of Words | Trie ,Array ,Hash Table ,String | Medium | |
0821 | Shortest Distance to a Character | Array ,Two Pointers ,String | Easy | |
0822 | Card Flipping Game | Array ,Hash Table | Medium | |
0823 | Binary Trees With Factors | Array ,Hash Table ,Dynamic Programming ,Sorting | Medium | |
0824 | Goat Latin | String | Easy | |
0825 | Friends Of Appropriate Ages | Array ,Two Pointers ,Binary Search ,Sorting | Medium | |
0826 | Most Profit Assigning Work | Greedy ,Array ,Two Pointers ,Binary Search ,Sorting | Medium | |
0827 | Making A Large Island | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Hard | |
0828 | Count Unique Characters of All Substrings of a Given String | Hash Table ,String ,Dynamic Programming | Hard | Weekly Contest 83 |
0829 | Consecutive Numbers Sum | Math ,Enumeration | Hard | Weekly Contest 83 |
0830 | Positions of Large Groups | String | Easy | Weekly Contest 83 |
0831 | Masking Personal Information | String | Medium | Weekly Contest 83 |
0832 | Flipping an Image | Bit Manipulation ,Array ,Two Pointers ,Matrix ,Simulation | Easy | Weekly Contest 84 |
0833 | Find And Replace in String | Array ,String ,Sorting | Medium | Weekly Contest 84 |
0834 | Sum of Distances in Tree | Tree ,Depth-First Search ,Graph ,Dynamic Programming | Hard | Weekly Contest 84 |
0835 | Image Overlap | Array ,Matrix | Medium | Weekly Contest 84 |
0836 | Rectangle Overlap | Geometry ,Math | Easy | Weekly Contest 85 |
0837 | New 21 Game | Math ,Dynamic Programming ,Sliding Window ,Probability and Statistics | Medium | Weekly Contest 85 |
0838 | Push Dominoes | Two Pointers ,String ,Dynamic Programming | Medium | Weekly Contest 85 |
0839 | Similar String Groups | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Hash Table ,String | Hard | Weekly Contest 85 |
0840 | Magic Squares In Grid | Array ,Math ,Matrix | Medium | Weekly Contest 86 |
0841 | Keys and Rooms | Depth-First Search ,Breadth-First Search ,Graph | Medium | Weekly Contest 86 |
0842 | Split Array into Fibonacci Sequence | String ,Backtracking | Medium | Weekly Contest 86 |
0843 | Guess the Word | Array ,Math ,String ,Game Theory ,Interactive | Hard | Weekly Contest 86 |
0844 | Backspace String Compare | Stack ,Two Pointers ,String ,Simulation | Easy | Weekly Contest 87 |
0845 | Longest Mountain in Array | Array ,Two Pointers ,Dynamic Programming ,Enumeration | Medium | Weekly Contest 87 |
0846 | Hand of Straights | Greedy ,Array ,Hash Table ,Sorting | Medium | Weekly Contest 87 |
0847 | Shortest Path Visiting All Nodes | Bit Manipulation ,Breadth-First Search ,Graph ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 87 |
0848 | Shifting Letters | Array ,String ,Prefix Sum | Medium | Weekly Contest 88 |
0849 | Maximize Distance to Closest Person | Array | Medium | Weekly Contest 88 |
0850 | Rectangle Area II | Segment Tree ,Array ,Ordered Set ,Line Sweep | Hard | Weekly Contest 88 |
0851 | Loud and Rich | Depth-First Search ,Graph ,Topological Sort ,Array | Medium | Weekly Contest 88 |
0852 | Peak Index in a Mountain Array | Array ,Binary Search | Medium | Weekly Contest 89 |
0853 | Car Fleet | Stack ,Array ,Sorting ,Monotonic Stack | Medium | Weekly Contest 89 |
0854 | K-Similar Strings | Breadth-First Search ,String | Hard | Weekly Contest 89 |
0855 | Exam Room | Design ,Ordered Set ,Heap (Priority Queue) | Medium | Weekly Contest 89 |
0856 | Score of Parentheses | Stack ,String | Medium | Weekly Contest 90 |
0857 | Minimum Cost to Hire K Workers | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 90 |
0858 | Mirror Reflection | Geometry ,Math ,Number Theory | Medium | Weekly Contest 90 |
0859 | Buddy Strings | Hash Table ,String | Easy | Weekly Contest 90 |
0860 | Lemonade Change | Greedy ,Array | Easy | Weekly Contest 91 |
0861 | Score After Flipping Matrix | Greedy ,Bit Manipulation ,Array ,Matrix | Medium | Weekly Contest 91 |
0862 | Shortest Subarray with Sum at Least K | Queue ,Array ,Binary Search ,Prefix Sum ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Hard | Weekly Contest 91 |
0863 | All Nodes Distance K in Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 91 |
0864 | Shortest Path to Get All Keys | Bit Manipulation ,Breadth-First Search ,Array ,Matrix | Hard | Weekly Contest 92 |
0865 | Smallest Subtree with all the Deepest Nodes | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | Weekly Contest 92 |
0866 | Prime Palindrome | Math | Medium | Weekly Contest 92 |
0867 | Transpose Matrix | Array ,Matrix ,Simulation | Easy | Weekly Contest 92 |
0868 | Binary Gap | Bit Manipulation | Easy | Weekly Contest 93 |
0869 | Reordered Power of 2 | Hash Table ,Math ,Counting ,Enumeration ,Sorting | Medium | Weekly Contest 93 |
0870 | Advantage Shuffle | Greedy ,Array ,Two Pointers ,Sorting | Medium | Weekly Contest 93 |
0871 | Minimum Number of Refueling Stops | Greedy ,Array ,Dynamic Programming ,Heap (Priority Queue) | Hard | Weekly Contest 93 |
0872 | Leaf-Similar Trees | Tree ,Depth-First Search ,Binary Tree | Easy | Weekly Contest 94 |
0873 | Length of Longest Fibonacci Subsequence | Array ,Hash Table ,Dynamic Programming | Medium | Weekly Contest 94 |
0874 | Walking Robot Simulation | Array ,Hash Table ,Simulation | Medium | Weekly Contest 94 |
0875 | Koko Eating Bananas | Array ,Binary Search | Medium | Weekly Contest 94 |
0876 | Middle of the Linked List | Linked List ,Two Pointers | Easy | Weekly Contest 95 |
0877 | Stone Game | Array ,Math ,Dynamic Programming ,Game Theory | Medium | Weekly Contest 95 |
0878 | Nth Magical Number | Math ,Binary Search | Hard | Weekly Contest 95 |
0879 | Profitable Schemes | Array ,Dynamic Programming | Hard | Weekly Contest 95 |
0880 | Decoded String at Index | Stack ,String | Medium | Weekly Contest 96 |
0881 | Boats to Save People | Greedy ,Array ,Two Pointers ,Sorting | Medium | Weekly Contest 96 |
0882 | Reachable Nodes In Subdivided Graph | Graph ,Shortest Path ,Heap (Priority Queue) | Hard | Weekly Contest 96 |
0883 | Projection Area of 3D Shapes | Geometry ,Array ,Math ,Matrix | Easy | Weekly Contest 96 |
0884 | Uncommon Words from Two Sentences | Hash Table ,String | Easy | Weekly Contest 97 |
0885 | Spiral Matrix III | Array ,Matrix ,Simulation | Medium | Weekly Contest 97 |
0886 | Possible Bipartition | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | Weekly Contest 97 |
0887 | Super Egg Drop | Math ,Binary Search ,Dynamic Programming | Hard | Weekly Contest 97 |
0888 | Fair Candy Swap | Array ,Hash Table ,Binary Search ,Sorting | Easy | Weekly Contest 98 |
0889 | Construct Binary Tree from Preorder and Postorder Traversal | Tree ,Array ,Hash Table ,Divide and Conquer ,Binary Tree | Medium | Weekly Contest 98 |
0890 | Find and Replace Pattern | Array ,Hash Table ,String | Medium | Weekly Contest 98 |
0891 | Sum of Subsequence Widths | Array ,Math ,Sorting | Hard | Weekly Contest 98 |
0892 | Surface Area of 3D Shapes | Geometry ,Array ,Math ,Matrix | Easy | Weekly Contest 99 |
0893 | Groups of Special-Equivalent Strings | Array ,Hash Table ,String ,Sorting | Medium | Weekly Contest 99 |
0894 | All Possible Full Binary Trees | Tree ,Recursion ,Memoization ,Dynamic Programming ,Binary Tree | Medium | Weekly Contest 99 |
0895 | Maximum Frequency Stack | Stack ,Design ,Hash Table ,Ordered Set | Hard | Weekly Contest 99 |
0896 | Monotonic Array | Array | Easy | Weekly Contest 100 |
0897 | Increasing Order Search Tree | Stack ,Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Easy | Weekly Contest 100 |
0898 | Bitwise ORs of Subarrays | Bit Manipulation ,Array ,Dynamic Programming | Medium | Weekly Contest 100 |
0899 | Orderly Queue | Math ,String ,Sorting | Hard | Weekly Contest 100 |
0900 | RLE Iterator | Design ,Array ,Counting ,Iterator | Medium | Weekly Contest 101 |
0901 | Online Stock Span | Stack ,Design ,Data Stream ,Monotonic Stack | Medium | Weekly Contest 101 |
0902 | Numbers At Most N Given Digit Set | Array ,Math ,String ,Binary Search ,Dynamic Programming | Hard | Weekly Contest 101 |
0903 | Valid Permutations for DI Sequence | String ,Dynamic Programming ,Prefix Sum | Hard | Weekly Contest 101 |
0904 | Fruit Into Baskets | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 102 |
0905 | Sort Array By Parity | Array ,Two Pointers ,Sorting | Easy | Weekly Contest 102 |
0906 | Super Palindromes | Math ,Enumeration | Hard | Weekly Contest 102 |
0907 | Sum of Subarray Minimums | Stack ,Array ,Dynamic Programming ,Monotonic Stack | Medium | Weekly Contest 102 |
0908 | Smallest Range I | Array ,Math | Easy | Weekly Contest 103 |
0909 | Snakes and Ladders | Breadth-First Search ,Array ,Matrix | Medium | Weekly Contest 103 |
0910 | Smallest Range II | Greedy ,Array ,Math ,Sorting | Medium | Weekly Contest 103 |
0911 | Online Election | Design ,Array ,Hash Table ,Binary Search | Medium | Weekly Contest 103 |
0912 | Sort an Array | Array ,Divide and Conquer ,Bucket Sort ,Counting Sort ,Radix Sort ,Sorting ,Heap (Priority Queue) ,Merge Sort | Medium | |
0913 | Cat and Mouse | Graph ,Topological Sort ,Memoization ,Math ,Dynamic Programming ,Game Theory | Hard | Weekly Contest 104 |
0914 | X of a Kind in a Deck of Cards | Array ,Hash Table ,Math ,Counting ,Number Theory | Easy | Weekly Contest 104 |
0915 | Partition Array into Disjoint Intervals | Array | Medium | Weekly Contest 104 |
0916 | Word Subsets | Array ,Hash Table ,String | Medium | Weekly Contest 104 |
0917 | Reverse Only Letters | Two Pointers ,String | Easy | Weekly Contest 105 |
0918 | Maximum Sum Circular Subarray | Queue ,Array ,Divide and Conquer ,Dynamic Programming ,Monotonic Queue | Medium | Weekly Contest 105 |
0919 | Complete Binary Tree Inserter | Tree ,Breadth-First Search ,Design ,Binary Tree | Medium | Weekly Contest 105 |
0920 | Number of Music Playlists | Math ,Dynamic Programming ,Combinatorics | Hard | Weekly Contest 105 |
0921 | Minimum Add to Make Parentheses Valid | Stack ,Greedy ,String | Medium | Weekly Contest 106 |
0922 | Sort Array By Parity II | Array ,Two Pointers ,Sorting | Easy | Weekly Contest 106 |
0923 | 3Sum With Multiplicity | Array ,Hash Table ,Two Pointers ,Counting ,Sorting | Medium | Weekly Contest 106 |
0924 | Minimize Malware Spread | Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Hash Table | Hard | Weekly Contest 106 |
0925 | Long Pressed Name | Two Pointers ,String | Easy | Weekly Contest 107 |
0926 | Flip String to Monotone Increasing | String ,Dynamic Programming | Medium | Weekly Contest 107 |
0927 | Three Equal Parts | Array ,Math | Hard | Weekly Contest 107 |
0928 | Minimize Malware Spread II | Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Hash Table | Hard | Weekly Contest 107 |
0929 | Unique Email Addresses | Array ,Hash Table ,String | Easy | Weekly Contest 108 |
0930 | Binary Subarrays With Sum | Array ,Hash Table ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 108 |
0931 | Minimum Falling Path Sum | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 108 |
0932 | Beautiful Array | Array ,Math ,Divide and Conquer | Medium | Weekly Contest 108 |
0933 | Number of Recent Calls | Design ,Queue ,Data Stream | Easy | Weekly Contest 109 |
0934 | Shortest Bridge | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | Weekly Contest 109 |
0935 | Knight Dialer | Dynamic Programming | Medium | Weekly Contest 109 |
0936 | Stamping The Sequence | Stack ,Greedy ,Queue ,String | Hard | Weekly Contest 109 |
0937 | Reorder Data in Log Files | Array ,String ,Sorting | Medium | Weekly Contest 110 |
0938 | Range Sum of BST | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Easy | Weekly Contest 110 |
0939 | Minimum Area Rectangle | Geometry ,Array ,Hash Table ,Math ,Sorting | Medium | Weekly Contest 110 |
0940 | Distinct Subsequences II | String ,Dynamic Programming | Hard | Weekly Contest 110 |
0941 | Valid Mountain Array | Array | Easy | Weekly Contest 111 |
0942 | DI String Match | Greedy ,Array ,Two Pointers ,String | Easy | Weekly Contest 111 |
0943 | Find the Shortest Superstring | Bit Manipulation ,Array ,String ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 111 |
0944 | Delete Columns to Make Sorted | Array ,String | Easy | Weekly Contest 111 |
0945 | Minimum Increment to Make Array Unique | Greedy ,Array ,Counting ,Sorting | Medium | Weekly Contest 112 |
0946 | Validate Stack Sequences | Stack ,Array ,Simulation | Medium | Weekly Contest 112 |
0947 | Most Stones Removed with Same Row or Column | Depth-First Search ,Union Find ,Graph ,Hash Table | Medium | Weekly Contest 112 |
0948 | Bag of Tokens | Greedy ,Array ,Two Pointers ,Sorting | Medium | Weekly Contest 112 |
0949 | Largest Time for Given Digits | Array ,String ,Enumeration | Medium | Weekly Contest 113 |
0950 | Reveal Cards In Increasing Order | Queue ,Array ,Sorting ,Simulation | Medium | Weekly Contest 113 |
0951 | Flip Equivalent Binary Trees | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 113 |
0952 | Largest Component Size by Common Factor | Union Find ,Array ,Hash Table ,Math ,Number Theory | Hard | Weekly Contest 113 |
0953 | Verifying an Alien Dictionary | Array ,Hash Table ,String | Easy | Weekly Contest 114 |
0954 | Array of Doubled Pairs | Greedy ,Array ,Hash Table ,Sorting | Medium | Weekly Contest 114 |
0955 | Delete Columns to Make Sorted II | Greedy ,Array ,String | Medium | Weekly Contest 114 |
0956 | Tallest Billboard | Array ,Dynamic Programming | Hard | Weekly Contest 114 |
0957 | Prison Cells After N Days | Bit Manipulation ,Array ,Hash Table ,Math | Medium | Weekly Contest 115 |
0958 | Check Completeness of a Binary Tree | Tree ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 115 |
0959 | Regions Cut By Slashes | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Hash Table ,Matrix | Medium | Weekly Contest 115 |
0960 | Delete Columns to Make Sorted III | Array ,String ,Dynamic Programming | Hard | Weekly Contest 115 |
0961 | N-Repeated Element in Size 2N Array | Array ,Hash Table | Easy | Weekly Contest 116 |
0962 | Maximum Width Ramp | Stack ,Array ,Monotonic Stack | Medium | Weekly Contest 116 |
0963 | Minimum Area Rectangle II | Geometry ,Array ,Math | Medium | Weekly Contest 116 |
0964 | Least Operators to Express Number | Memoization ,Math ,Dynamic Programming | Hard | Weekly Contest 116 |
0965 | Univalued Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | Weekly Contest 117 |
0966 | Vowel Spellchecker | Array ,Hash Table ,String | Medium | Weekly Contest 117 |
0967 | Numbers With Same Consecutive Differences | Breadth-First Search ,Backtracking | Medium | Weekly Contest 117 |
0968 | Binary Tree Cameras | Tree ,Depth-First Search ,Dynamic Programming ,Binary Tree | Hard | Weekly Contest 117 |
0969 | Pancake Sorting | Greedy ,Array ,Two Pointers ,Sorting | Medium | Weekly Contest 118 |
0970 | Powerful Integers | Hash Table ,Math ,Enumeration | Medium | Weekly Contest 118 |
0971 | Flip Binary Tree To Match Preorder Traversal | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 118 |
0972 | Equal Rational Numbers | Math ,String | Hard | Weekly Contest 118 |
0973 | K Closest Points to Origin | Geometry ,Array ,Math ,Divide and Conquer ,Quickselect ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 119 |
0974 | Subarray Sums Divisible by K | Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 119 |
0975 | Odd Even Jump | Stack ,Array ,Dynamic Programming ,Ordered Set ,Monotonic Stack | Hard | Weekly Contest 119 |
0976 | Largest Perimeter Triangle | Greedy ,Array ,Math ,Sorting | Easy | Weekly Contest 119 |
0977 | Squares of a Sorted Array | Array ,Two Pointers ,Sorting | Easy | Weekly Contest 120 |
0978 | Longest Turbulent Subarray | Array ,Dynamic Programming ,Sliding Window | Medium | Weekly Contest 120 |
0979 | Distribute Coins in Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 120 |
0980 | Unique Paths III | Bit Manipulation ,Array ,Backtracking ,Matrix | Hard | Weekly Contest 120 |
0981 | Time Based Key-Value Store | Design ,Hash Table ,String ,Binary Search | Medium | Weekly Contest 121 |
0982 | Triples with Bitwise AND Equal To Zero | Bit Manipulation ,Array ,Hash Table | Hard | Weekly Contest 121 |
0983 | Minimum Cost For Tickets | Array ,Dynamic Programming | Medium | Weekly Contest 121 |
0984 | String Without AAA or BBB | Greedy ,String | Medium | Weekly Contest 121 |
0985 | Sum of Even Numbers After Queries | Array ,Simulation | Medium | Weekly Contest 122 |
0986 | Interval List Intersections | Array ,Two Pointers | Medium | Weekly Contest 122 |
0987 | Vertical Order Traversal of a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Hard | Weekly Contest 122 |
0988 | Smallest String Starting From Leaf | Tree ,Depth-First Search ,String ,Binary Tree | Medium | Weekly Contest 122 |
0989 | Add to Array-Form of Integer | Array ,Math | Easy | Weekly Contest 123 |
0990 | Satisfiability of Equality Equations | Union Find ,Graph ,Array ,String | Medium | Weekly Contest 123 |
0991 | Broken Calculator | Greedy ,Math | Medium | Weekly Contest 123 |
0992 | Subarrays with K Different Integers | Array ,Hash Table ,Counting ,Sliding Window | Hard | Weekly Contest 123 |
0993 | Cousins in Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | Weekly Contest 124 |
0994 | Rotting Oranges | Breadth-First Search ,Array ,Matrix | Medium | Weekly Contest 124 |
0995 | Minimum Number of K Consecutive Bit Flips | Bit Manipulation ,Queue ,Array ,Prefix Sum ,Sliding Window | Hard | Weekly Contest 124 |
0996 | Number of Squareful Arrays | Bit Manipulation ,Array ,Math ,Dynamic Programming ,Backtracking ,Bitmask | Hard | Weekly Contest 124 |
0997 | Find the Town Judge | Graph ,Array ,Hash Table | Easy | Weekly Contest 125 |
0998 | Maximum Binary Tree II | Tree ,Binary Tree | Medium | Weekly Contest 125 |
0999 | Available Captures for Rook | Array ,Matrix ,Simulation | Easy | Weekly Contest 125 |
1000 | Minimum Cost to Merge Stones | Array ,Dynamic Programming ,Prefix Sum | Hard | Weekly Contest 126 |
1001 | Grid Illumination | Array ,Hash Table | Hard | Weekly Contest 125 |
1002 | Find Common Characters | Array ,Hash Table ,String | Easy | Weekly Contest 126 |
1003 | Check If Word Is Valid After Substitutions | Stack ,String | Medium | Weekly Contest 126 |
1004 | Max Consecutive Ones III | Array ,Binary Search ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 126 |
1005 | Maximize Sum Of Array After K Negations | Greedy ,Array ,Sorting | Easy | Weekly Contest 127 |
1006 | Clumsy Factorial | Stack ,Math ,Simulation | Medium | Weekly Contest 127 |
1007 | Minimum Domino Rotations For Equal Row | Greedy ,Array | Medium | Weekly Contest 127 |
1008 | Construct Binary Search Tree from Preorder Traversal | Stack ,Tree ,Binary Search Tree ,Array ,Binary Tree ,Monotonic Stack | Medium | Weekly Contest 127 |
1009 | Complement of Base 10 Integer | Bit Manipulation | Easy | Weekly Contest 128 |
1010 | Pairs of Songs With Total Durations Divisible by 60 | Array ,Hash Table ,Counting | Medium | Weekly Contest 128 |
1011 | Capacity To Ship Packages Within D Days | Array ,Binary Search | Medium | Weekly Contest 128 |
1012 | Numbers With Repeated Digits | Math ,Dynamic Programming | Hard | Weekly Contest 128 |
1013 | Partition Array Into Three Parts With Equal Sum | Greedy ,Array | Easy | Weekly Contest 129 |
1014 | Best Sightseeing Pair | Array ,Dynamic Programming | Medium | Weekly Contest 129 |
1015 | Smallest Integer Divisible by K | Hash Table ,Math | Medium | Weekly Contest 129 |
1016 | Binary String With Substrings Representing 1 To N | String | Medium | Weekly Contest 129 |
1017 | Convert to Base -2 | Math | Medium | Weekly Contest 130 |
1018 | Binary Prefix Divisible By 5 | Bit Manipulation ,Array | Easy | Weekly Contest 130 |
1019 | Next Greater Node In Linked List | Stack ,Array ,Linked List ,Monotonic Stack | Medium | Weekly Contest 130 |
1020 | Number of Enclaves | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Weekly Contest 130 |
1021 | Remove Outermost Parentheses | Stack ,String | Easy | Weekly Contest 131 |
1022 | Sum of Root To Leaf Binary Numbers | Tree ,Depth-First Search ,Binary Tree | Easy | Weekly Contest 131 |
1023 | Camelcase Matching | Trie ,Array ,Two Pointers ,String ,String Matching | Medium | Weekly Contest 131 |
1024 | Video Stitching | Greedy ,Array ,Dynamic Programming | Medium | Weekly Contest 131 |
1025 | Divisor Game | Brainteaser ,Math ,Dynamic Programming ,Game Theory | Easy | Weekly Contest 132 |
1026 | Maximum Difference Between Node and Ancestor | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 132 |
1027 | Longest Arithmetic Subsequence | Array ,Hash Table ,Binary Search ,Dynamic Programming | Medium | Weekly Contest 132 |
1028 | Recover a Tree From Preorder Traversal | Tree ,Depth-First Search ,String ,Binary Tree | Hard | Weekly Contest 132 |
1029 | Two City Scheduling | Greedy ,Array ,Sorting | Medium | Weekly Contest 133 |
1030 | Matrix Cells in Distance Order | Geometry ,Array ,Math ,Matrix ,Sorting | Easy | Weekly Contest 133 |
1031 | Maximum Sum of Two Non-Overlapping Subarrays | Array ,Dynamic Programming ,Sliding Window | Medium | Weekly Contest 133 |
1032 | Stream of Characters | Design ,Trie ,Array ,String ,Data Stream | Hard | Weekly Contest 133 |
1033 | Moving Stones Until Consecutive | Brainteaser ,Math | Medium | Weekly Contest 134 |
1034 | Coloring A Border | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | Weekly Contest 134 |
1035 | Uncrossed Lines | Array ,Dynamic Programming | Medium | Weekly Contest 134 |
1036 | Escape a Large Maze | Depth-First Search ,Breadth-First Search ,Array ,Hash Table | Hard | Weekly Contest 134 |
1037 | Valid Boomerang | Geometry ,Array ,Math | Easy | Weekly Contest 135 |
1038 | Binary Search Tree to Greater Sum Tree | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree | Medium | Weekly Contest 135 |
1039 | Minimum Score Triangulation of Polygon | Array ,Dynamic Programming | Medium | Weekly Contest 135 |
1040 | Moving Stones Until Consecutive II | Array ,Math ,Two Pointers ,Sorting | Medium | Weekly Contest 135 |
1041 | Robot Bounded In Circle | Math ,String ,Simulation | Medium | Weekly Contest 136 |
1042 | Flower Planting With No Adjacent | Depth-First Search ,Breadth-First Search ,Graph | Medium | Weekly Contest 136 |
1043 | Partition Array for Maximum Sum | Array ,Dynamic Programming | Medium | Weekly Contest 136 |
1044 | Longest Duplicate Substring | String ,Binary Search ,Suffix Array ,Sliding Window ,Hash Function ,Rolling Hash | Hard | Weekly Contest 136 |
1045 | Customers Who Bought All Products | Database | Medium | |
1046 | Last Stone Weight | Array ,Heap (Priority Queue) | Easy | Weekly Contest 137 |
1047 | Remove All Adjacent Duplicates In String | Stack ,String | Easy | Weekly Contest 137 |
1048 | Longest String Chain | Array ,Hash Table ,Two Pointers ,String ,Dynamic Programming | Medium | Weekly Contest 137 |
1049 | Last Stone Weight II | Array ,Dynamic Programming | Medium | Weekly Contest 137 |
1050 | Actors and Directors Who Cooperated At Least Three Times | Database | Easy | |
1051 | Height Checker | Array ,Counting Sort ,Sorting | Easy | Weekly Contest 138 |
1052 | Grumpy Bookstore Owner | Array ,Sliding Window | Medium | Weekly Contest 138 |
1053 | Previous Permutation With One Swap | Greedy ,Array | Medium | Weekly Contest 138 |
1054 | Distant Barcodes | Greedy ,Array ,Hash Table ,Counting ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 138 |
1055 | Shortest Way to Form String | Greedy ,Two Pointers ,String | Medium | ???? |
1056 | Confusing Number | Math | Easy | ???? |
1057 | Campus Bikes | Greedy ,Array ,Sorting | Medium | ???? |
1058 | Minimize Rounding Error to Meet Target | Greedy ,Array ,Math ,String | Medium | ???? |
1059 | All Paths from Source Lead to Destination | Depth-First Search ,Graph | Medium | ???? |
1060 | Missing Element in Sorted Array | Array ,Binary Search | Medium | ???? |
1061 | Lexicographically Smallest Equivalent String | Union Find ,String | Medium | |
1062 | Longest Repeating Substring | String ,Binary Search ,Dynamic Programming ,Suffix Array ,Hash Function ,Rolling Hash | Medium | ???? |
1063 | Number of Valid Subarrays | Stack ,Array ,Monotonic Stack | Hard | ???? |
1064 | Fixed Point | Array ,Binary Search | Easy | Biweekly Contest 1 |
1065 | Index Pairs of a String | Trie ,Array ,String ,Sorting | Easy | Biweekly Contest 1 |
1066 | Campus Bikes II | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | Biweekly Contest 1 |
1067 | Digit Count in Range | Math ,Dynamic Programming | Hard | Biweekly Contest 1 |
1068 | Product Sales Analysis I | Database | Easy | |
1069 | Product Sales Analysis II | Database | Easy | ???? |
1070 | Product Sales Analysis III | Database | Medium | |
1071 | Greatest Common Divisor of Strings | Math ,String | Easy | Weekly Contest 139 |
1072 | Flip Columns For Maximum Number of Equal Rows | Array ,Hash Table ,Matrix | Medium | Weekly Contest 139 |
1073 | Adding Two Negabinary Numbers | Array ,Math | Medium | Weekly Contest 139 |
1074 | Number of Submatrices That Sum to Target | Array ,Hash Table ,Matrix ,Prefix Sum | Hard | Weekly Contest 139 |
1075 | Project Employees I | Database | Easy | |
1076 | Project Employees II | Database | Easy | ???? |
1077 | Project Employees III | Database | Medium | ???? |
1078 | Occurrences After Bigram | String | Easy | Weekly Contest 140 |
1079 | Letter Tile Possibilities | Hash Table ,String ,Backtracking ,Counting | Medium | Weekly Contest 140 |
1080 | Insufficient Nodes in Root to Leaf Paths | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 140 |
1081 | Smallest Subsequence of Distinct Characters | Stack ,Greedy ,String ,Monotonic Stack | Medium | Weekly Contest 140 |
1082 | Sales Analysis I | Database | Easy | ???? |
1083 | Sales Analysis II | Database | Easy | ???? |
1084 | Sales Analysis III | Database | Easy | |
1085 | Sum of Digits in the Minimum Number | Array ,Math | Easy | Biweekly Contest 2 |
1086 | High Five | Array ,Hash Table ,Sorting ,Heap (Priority Queue) | Easy | Biweekly Contest 2 |
1087 | Brace Expansion | Breadth-First Search ,String ,Backtracking | Medium | Biweekly Contest 2 |
1088 | Confusing Number II | Math ,Backtracking | Hard | Biweekly Contest 2 |
1089 | Duplicate Zeros | Array ,Two Pointers | Easy | Weekly Contest 141 |
1090 | Largest Values From Labels | Greedy ,Array ,Hash Table ,Counting ,Sorting | Medium | Weekly Contest 141 |
1091 | Shortest Path in Binary Matrix | Breadth-First Search ,Array ,Matrix | Medium | Weekly Contest 141 |
1092 | Shortest Common Supersequence | String ,Dynamic Programming | Hard | Weekly Contest 141 |
1093 | Statistics from a Large Sample | Array ,Math ,Probability and Statistics | Medium | Weekly Contest 142 |
1094 | Car Pooling | Array ,Prefix Sum ,Sorting ,Simulation ,Heap (Priority Queue) | Medium | Weekly Contest 142 |
1095 | Find in Mountain Array | Array ,Binary Search ,Interactive | Hard | Weekly Contest 142 |
1096 | Brace Expansion II | Stack ,Breadth-First Search ,String ,Backtracking | Hard | Weekly Contest 142 |
1097 | Game Play Analysis V | Database | Hard | ???? |
1098 | Unpopular Books | Database | Medium | ???? |
1099 | Two Sum Less Than K | Array ,Two Pointers ,Binary Search ,Sorting | Easy | Biweekly Contest 3 |
1100 | Find K-Length Substrings With No Repeated Characters | Hash Table ,String ,Sliding Window | Medium | Biweekly Contest 3 |
1101 | The Earliest Moment When Everyone Become Friends | Union Find ,Array ,Sorting | Medium | Biweekly Contest 3 |
1102 | Path With Maximum Minimum Value | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Binary Search ,Matrix ,Heap (Priority Queue) | Medium | Biweekly Contest 3 |
1103 | Distribute Candies to People | Math ,Simulation | Easy | Weekly Contest 143 |
1104 | Path In Zigzag Labelled Binary Tree | Tree ,Math ,Binary Tree | Medium | Weekly Contest 143 |
1105 | Filling Bookcase Shelves | Array ,Dynamic Programming | Medium | Weekly Contest 143 |
1106 | Parsing A Boolean Expression | Stack ,Recursion ,String | Hard | Weekly Contest 143 |
1107 | New Users Daily Count | Database | Medium | ???? |
1108 | Defanging an IP Address | String | Easy | Weekly Contest 144 |
1109 | Corporate Flight Bookings | Array ,Prefix Sum | Medium | Weekly Contest 144 |
1110 | Delete Nodes And Return Forest | Tree ,Depth-First Search ,Array ,Hash Table ,Binary Tree | Medium | Weekly Contest 144 |
1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Stack ,String | Medium | Weekly Contest 144 |
1112 | Highest Grade For Each Student | Database | Medium | ???? |
1113 | Reported Posts | Database | Easy | ???? |
1114 | Print in Order | Concurrency | Easy | |
1115 | Print FooBar Alternately | Concurrency | Medium | |
1116 | Print Zero Even Odd | Concurrency | Medium | |
1117 | Building H2O | Concurrency | Medium | |
1118 | Number of Days in a Month | Math | Easy | Biweekly Contest 4 |
1119 | Remove Vowels from a String | String | Easy | Biweekly Contest 4 |
1120 | Maximum Average Subtree | Tree ,Depth-First Search ,Binary Tree | Medium | Biweekly Contest 4 |
1121 | Divide Array Into Increasing Sequences | Array ,Counting | Hard | Biweekly Contest 4 |
1122 | Relative Sort Array | Array ,Hash Table ,Counting Sort ,Sorting | Easy | Weekly Contest 145 |
1123 | Lowest Common Ancestor of Deepest Leaves | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | Weekly Contest 145 |
1124 | Longest Well-Performing Interval | Stack ,Array ,Hash Table ,Prefix Sum ,Monotonic Stack | Medium | Weekly Contest 145 |
1125 | Smallest Sufficient Team | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 145 |
1126 | Active Businesses | Database | Medium | ???? |
1127 | User Purchase Platform | Database | Hard | ???? |
1128 | Number of Equivalent Domino Pairs | Array ,Hash Table ,Counting | Easy | Weekly Contest 146 |
1129 | Shortest Path with Alternating Colors | Breadth-First Search ,Graph | Medium | Weekly Contest 146 |
1130 | Minimum Cost Tree From Leaf Values | Stack ,Greedy ,Array ,Dynamic Programming ,Monotonic Stack | Medium | Weekly Contest 146 |
1131 | Maximum of Absolute Value Expression | Array ,Math | Medium | Weekly Contest 146 |
1132 | Reported Posts II | Database | Medium | ???? |
1133 | Largest Unique Number | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 5 |
1134 | Armstrong Number | Math | Easy | Biweekly Contest 5 |
1135 | Connecting Cities With Minimum Cost | Union Find ,Graph ,Minimum Spanning Tree ,Heap (Priority Queue) | Medium | Biweekly Contest 5 |
1136 | Parallel Courses | Graph ,Topological Sort | Medium | Biweekly Contest 5 |
1137 | N-th Tribonacci Number | Memoization ,Math ,Dynamic Programming | Easy | Weekly Contest 147 |
1138 | Alphabet Board Path | Hash Table ,String | Medium | Weekly Contest 147 |
1139 | Largest 1-Bordered Square | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 147 |
1140 | Stone Game II | Array ,Math ,Dynamic Programming ,Game Theory ,Prefix Sum | Medium | Weekly Contest 147 |
1141 | User Activity for the Past 30 Days I | Database | Easy | |
1142 | User Activity for the Past 30 Days II | Database | Easy | ???? |
1143 | Longest Common Subsequence | String ,Dynamic Programming | Medium | |
1144 | Decrease Elements To Make Array Zigzag | Greedy ,Array | Medium | Weekly Contest 148 |
1145 | Binary Tree Coloring Game | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 148 |
1146 | Snapshot Array | Design ,Array ,Hash Table ,Binary Search | Medium | Weekly Contest 148 |
1147 | Longest Chunked Palindrome Decomposition | Greedy ,Two Pointers ,String ,Dynamic Programming ,Hash Function ,Rolling Hash | Hard | Weekly Contest 148 |
1148 | Article Views I | Database | Easy | |
1149 | Article Views II | Database | Medium | ???? |
1150 | Check If a Number Is Majority Element in a Sorted Array | Array ,Binary Search | Easy | Biweekly Contest 6 |
1151 | Minimum Swaps to Group All 1's Together | Array ,Sliding Window | Medium | Biweekly Contest 6 |
1152 | Analyze User Website Visit Pattern | Array ,Hash Table ,Sorting | Medium | Biweekly Contest 6 |
1153 | String Transforms Into Another String | Hash Table ,String | Hard | Biweekly Contest 6 |
1154 | Day of the Year | Math ,String | Easy | Weekly Contest 149 |
1155 | Number of Dice Rolls With Target Sum | Dynamic Programming | Medium | Weekly Contest 149 |
1156 | Swap For Longest Repeated Character Substring | Hash Table ,String ,Sliding Window | Medium | Weekly Contest 149 |
1157 | Online Majority Element In Subarray | Design ,Binary Indexed Tree ,Segment Tree ,Array ,Binary Search | Hard | Weekly Contest 149 |
1158 | Market Analysis I | Database | Medium | |
1159 | Market Analysis II | Database | Hard | ???? |
1160 | Find Words That Can Be Formed by Characters | Array ,Hash Table ,String | Easy | Weekly Contest 150 |
1161 | Maximum Level Sum of a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 150 |
1162 | As Far from Land as Possible | Breadth-First Search ,Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 150 |
1163 | Last Substring in Lexicographical Order | Two Pointers ,String | Hard | Weekly Contest 150 |
1164 | Product Price at a Given Date | Database | Medium | |
1165 | Single-Row Keyboard | Hash Table ,String | Easy | Biweekly Contest 7 |
1166 | Design File System | Design ,Trie ,Hash Table ,String | Medium | Biweekly Contest 7 |
1167 | Minimum Cost to Connect Sticks | Greedy ,Array ,Heap (Priority Queue) | Medium | Biweekly Contest 7 |
1168 | Optimize Water Distribution in a Village | Union Find ,Graph ,Minimum Spanning Tree ,Heap (Priority Queue) | Hard | Biweekly Contest 7 |
1169 | Invalid Transactions | Array ,Hash Table ,String ,Sorting | Medium | Weekly Contest 151 |
1170 | Compare Strings by Frequency of the Smallest Character | Array ,Hash Table ,String ,Binary Search ,Sorting | Medium | Weekly Contest 151 |
1171 | Remove Zero Sum Consecutive Nodes from Linked List | Hash Table ,Linked List | Medium | Weekly Contest 151 |
1172 | Dinner Plate Stacks | Stack ,Design ,Hash Table ,Heap (Priority Queue) | Hard | Weekly Contest 151 |
1173 | Immediate Food Delivery I | Database | Easy | ???? |
1174 | Immediate Food Delivery II | Database | Medium | |
1175 | Prime Arrangements | Math | Easy | Weekly Contest 152 |
1176 | Diet Plan Performance | Array ,Sliding Window | Easy | Weekly Contest 152 |
1177 | Can Make Palindrome from Substring | Bit Manipulation ,Array ,Hash Table ,String ,Prefix Sum | Medium | Weekly Contest 152 |
1178 | Number of Valid Words for Each Puzzle | Bit Manipulation ,Trie ,Array ,Hash Table ,String | Hard | Weekly Contest 152 |
1179 | Reformat Department Table | Database | Easy | |
1180 | Count Substrings with Only One Distinct Letter | Math ,String | Easy | Biweekly Contest 8 |
1181 | Before and After Puzzle | Array ,Hash Table ,String ,Sorting | Medium | Biweekly Contest 8 |
1182 | Shortest Distance to Target Color | Array ,Binary Search ,Dynamic Programming | Medium | Biweekly Contest 8 |
1183 | Maximum Number of Ones | Greedy ,Heap (Priority Queue) | Hard | Biweekly Contest 8 |
1184 | Distance Between Bus Stops | Array | Easy | Weekly Contest 153 |
1185 | Day of the Week | Math | Easy | Weekly Contest 153 |
1186 | Maximum Subarray Sum with One Deletion | Array ,Dynamic Programming | Medium | Weekly Contest 153 |
1187 | Make Array Strictly Increasing | Array ,Binary Search ,Dynamic Programming ,Sorting | Hard | Weekly Contest 153 |
1188 | Design Bounded Blocking Queue | Concurrency | Medium | ???? |
1189 | Maximum Number of Balloons | Hash Table ,String ,Counting | Easy | Weekly Contest 154 |
1190 | Reverse Substrings Between Each Pair of Parentheses | Stack ,String | Medium | Weekly Contest 154 |
1191 | K-Concatenation Maximum Sum | Array ,Dynamic Programming | Medium | Weekly Contest 154 |
1192 | Critical Connections in a Network | Depth-First Search ,Graph ,Biconnected Component | Hard | Weekly Contest 154 |
1193 | Monthly Transactions I | Database | Medium | |
1194 | Tournament Winners | Database | Hard | ???? |
1195 | Fizz Buzz Multithreaded | Concurrency | Medium | |
1196 | How Many Apples Can You Put into the Basket | Greedy ,Array ,Sorting | Easy | Biweekly Contest 9 |
1197 | Minimum Knight Moves | Breadth-First Search | Medium | Biweekly Contest 9 |
1198 | Find Smallest Common Element in All Rows | Array ,Hash Table ,Binary Search ,Counting ,Matrix | Medium | Biweekly Contest 9 |
1199 | Minimum Time to Build Blocks | Greedy ,Array ,Math ,Heap (Priority Queue) | Hard | Biweekly Contest 9 |
1200 | Minimum Absolute Difference | Array ,Sorting | Easy | Weekly Contest 155 |
1201 | Ugly Number III | Math ,Binary Search ,Number Theory | Medium | Weekly Contest 155 |
1202 | Smallest String With Swaps | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Hash Table ,String ,Sorting | Medium | Weekly Contest 155 |
1203 | Sort Items by Groups Respecting Dependencies | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Hard | Weekly Contest 155 |
1204 | Last Person to Fit in the Bus | Database | Medium | |
1205 | Monthly Transactions II | Database | Medium | ???? |
1206 | Design Skiplist | Design ,Linked List | Hard | |
1207 | Unique Number of Occurrences | Array ,Hash Table | Easy | Weekly Contest 156 |
1208 | Get Equal Substrings Within Budget | String ,Binary Search ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 156 |
1209 | Remove All Adjacent Duplicates in String II | Stack ,String | Medium | Weekly Contest 156 |
1210 | Minimum Moves to Reach Target with Rotations | Breadth-First Search ,Array ,Matrix | Hard | Weekly Contest 156 |
1211 | Queries Quality and Percentage | Database | Easy | |
1212 | Team Scores in Football Tournament | Database | Medium | ???? |
1213 | Intersection of Three Sorted Arrays | Array ,Hash Table ,Binary Search ,Counting | Easy | Biweekly Contest 10 |
1214 | Two Sum BSTs | Stack ,Tree ,Depth-First Search ,Binary Search Tree ,Two Pointers ,Binary Search ,Binary Tree | Medium | Biweekly Contest 10 |
1215 | Stepping Numbers | Breadth-First Search ,Backtracking | Medium | Biweekly Contest 10 |
1216 | Valid Palindrome III | String ,Dynamic Programming | Hard | Biweekly Contest 10 |
1217 | Minimum Cost to Move Chips to The Same Position | Greedy ,Array ,Math | Easy | Weekly Contest 157 |
1218 | Longest Arithmetic Subsequence of Given Difference | Array ,Hash Table ,Dynamic Programming | Medium | Weekly Contest 157 |
1219 | Path with Maximum Gold | Array ,Backtracking ,Matrix | Medium | Weekly Contest 157 |
1220 | Count Vowels Permutation | Dynamic Programming | Hard | Weekly Contest 157 |
1221 | Split a String in Balanced Strings | Greedy ,String ,Counting | Easy | Weekly Contest 158 |
1222 | Queens That Can Attack the King | Array ,Matrix ,Simulation | Medium | Weekly Contest 158 |
1223 | Dice Roll Simulation | Array ,Dynamic Programming | Hard | Weekly Contest 158 |
1224 | Maximum Equal Frequency | Array ,Hash Table | Hard | Weekly Contest 158 |
1225 | Report Contiguous Dates | Database | Hard | ???? |
1226 | The Dining Philosophers | Concurrency | Medium | |
1227 | Airplane Seat Assignment Probability | Brainteaser ,Math ,Dynamic Programming ,Probability and Statistics | Medium | |
1228 | Missing Number In Arithmetic Progression | Array ,Math | Easy | Biweekly Contest 11 |
1229 | Meeting Scheduler | Array ,Two Pointers ,Sorting | Medium | Biweekly Contest 11 |
1230 | Toss Strange Coins | Array ,Math ,Dynamic Programming ,Probability and Statistics | Medium | Biweekly Contest 11 |
1231 | Divide Chocolate | Array ,Binary Search | Hard | Biweekly Contest 11 |
1232 | Check If It Is a Straight Line | Geometry ,Array ,Math | Easy | Weekly Contest 159 |
1233 | Remove Sub-Folders from the Filesystem | Depth-First Search ,Trie ,Array ,String | Medium | Weekly Contest 159 |
1234 | Replace the Substring for Balanced String | String ,Sliding Window | Medium | Weekly Contest 159 |
1235 | Maximum Profit in Job Scheduling | Array ,Binary Search ,Dynamic Programming ,Sorting | Hard | Weekly Contest 159 |
1236 | Web Crawler | Depth-First Search ,Breadth-First Search ,String ,Interactive | Medium | ???? |
1237 | Find Positive Integer Solution for a Given Equation | Math ,Two Pointers ,Binary Search ,Interactive | Medium | Weekly Contest 160 |
1238 | Circular Permutation in Binary Representation | Bit Manipulation ,Math ,Backtracking | Medium | Weekly Contest 160 |
1239 | Maximum Length of a Concatenated String with Unique Characters | Bit Manipulation ,Array ,String ,Backtracking | Medium | Weekly Contest 160 |
1240 | Tiling a Rectangle with the Fewest Squares | Backtracking | Hard | Weekly Contest 160 |
1241 | Number of Comments per Post | Database | Easy | ???? |
1242 | Web Crawler Multithreaded | Depth-First Search ,Breadth-First Search ,Concurrency | Medium | ???? |
1243 | Array Transformation | Array ,Simulation | Easy | Biweekly Contest 12 |
1244 | Design A Leaderboard | Design ,Hash Table ,Sorting | Medium | Biweekly Contest 12 |
1245 | Tree Diameter | Tree ,Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | Biweekly Contest 12 |
1246 | Palindrome Removal | Array ,Dynamic Programming | Hard | Biweekly Contest 12 |
1247 | Minimum Swaps to Make Strings Equal | Greedy ,Math ,String | Medium | Weekly Contest 161 |
1248 | Count Number of Nice Subarrays | Array ,Hash Table ,Math ,Sliding Window | Medium | Weekly Contest 161 |
1249 | Minimum Remove to Make Valid Parentheses | Stack ,String | Medium | Weekly Contest 161 |
1250 | Check If It Is a Good Array | Array ,Math ,Number Theory | Hard | Weekly Contest 161 |
1251 | Average Selling Price | Database | Easy | |
1252 | Cells with Odd Values in a Matrix | Array ,Math ,Simulation | Easy | Weekly Contest 162 |
1253 | Reconstruct a 2-Row Binary Matrix | Greedy ,Array ,Matrix | Medium | Weekly Contest 162 |
1254 | Number of Closed Islands | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Weekly Contest 162 |
1255 | Maximum Score Words Formed by Letters | Bit Manipulation ,Array ,String ,Dynamic Programming ,Backtracking ,Bitmask | Hard | Weekly Contest 162 |
1256 | Encode Number | Bit Manipulation ,Math ,String | Medium | Biweekly Contest 13 |
1257 | Smallest Common Region | Tree ,Depth-First Search ,Breadth-First Search ,Array ,Hash Table ,String | Medium | Biweekly Contest 13 |
1258 | Synonymous Sentences | Union Find ,Array ,Hash Table ,String ,Backtracking | Medium | Biweekly Contest 13 |
1259 | Handshakes That Don't Cross | Math ,Dynamic Programming | Hard | Biweekly Contest 13 |
1260 | Shift 2D Grid | Array ,Matrix ,Simulation | Easy | Weekly Contest 163 |
1261 | Find Elements in a Contaminated Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Design ,Hash Table ,Binary Tree | Medium | Weekly Contest 163 |
1262 | Greatest Sum Divisible by Three | Greedy ,Array ,Dynamic Programming ,Sorting | Medium | Weekly Contest 163 |
1263 | Minimum Moves to Move a Box to Their Target Location | Breadth-First Search ,Array ,Matrix ,Heap (Priority Queue) | Hard | Weekly Contest 163 |
1264 | Page Recommendations | Database | Medium | ???? |
1265 | Print Immutable Linked List in Reverse | Stack ,Recursion ,Linked List ,Two Pointers | Medium | ???? |
1266 | Minimum Time Visiting All Points | Geometry ,Array ,Math | Easy | Weekly Contest 164 |
1267 | Count Servers that Communicate | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Counting ,Matrix | Medium | Weekly Contest 164 |
1268 | Search Suggestions System | Trie ,Array ,String ,Binary Search ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 164 |
1269 | Number of Ways to Stay in the Same Place After Some Steps | Dynamic Programming | Hard | Weekly Contest 164 |
1270 | All People Report to the Given Manager | Database | Medium | ???? |
1271 | Hexspeak | Math ,String | Easy | Biweekly Contest 14 |
1272 | Remove Interval | Array | Medium | Biweekly Contest 14 |
1273 | Delete Tree Nodes | Tree ,Depth-First Search ,Breadth-First Search ,Array | Medium | Biweekly Contest 14 |
1274 | Number of Ships in a Rectangle | Array ,Divide and Conquer ,Interactive | Hard | Biweekly Contest 14 |
1275 | Find Winner on a Tic Tac Toe Game | Array ,Hash Table ,Matrix ,Simulation | Easy | Weekly Contest 165 |
1276 | Number of Burgers with No Waste of Ingredients | Math | Medium | Weekly Contest 165 |
1277 | Count Square Submatrices with All Ones | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 165 |
1278 | Palindrome Partitioning III | String ,Dynamic Programming | Hard | Weekly Contest 165 |
1279 | Traffic Light Controlled Intersection | Concurrency | Easy | ???? |
1280 | Students and Examinations | Database | Easy | |
1281 | Subtract the Product and Sum of Digits of an Integer | Math | Easy | Weekly Contest 166 |
1282 | Group the People Given the Group Size They Belong To | Array ,Hash Table | Medium | Weekly Contest 166 |
1283 | Find the Smallest Divisor Given a Threshold | Array ,Binary Search | Medium | Weekly Contest 166 |
1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Bit Manipulation ,Breadth-First Search ,Array ,Hash Table ,Matrix | Hard | Weekly Contest 166 |
1285 | Find the Start and End Number of Continuous Ranges | Database | Medium | ???? |
1286 | Iterator for Combination | Design ,String ,Backtracking ,Iterator | Medium | Biweekly Contest 15 |
1287 | Element Appearing More Than 25% In Sorted Array | Array | Easy | Biweekly Contest 15 |
1288 | Remove Covered Intervals | Array ,Sorting | Medium | Biweekly Contest 15 |
1289 | Minimum Falling Path Sum II | Array ,Dynamic Programming ,Matrix | Hard | Biweekly Contest 15 |
1290 | Convert Binary Number in a Linked List to Integer | Linked List ,Math | Easy | Weekly Contest 167 |
1291 | Sequential Digits | Enumeration | Medium | Weekly Contest 167 |
1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Array ,Binary Search ,Matrix ,Prefix Sum | Medium | Weekly Contest 167 |
1293 | Shortest Path in a Grid with Obstacles Elimination | Breadth-First Search ,Array ,Matrix | Hard | Weekly Contest 167 |
1294 | Weather Type in Each Country | Database | Easy | ???? |
1295 | Find Numbers with Even Number of Digits | Array | Easy | Weekly Contest 168 |
1296 | Divide Array in Sets of K Consecutive Numbers | Greedy ,Array ,Hash Table ,Sorting | Medium | Weekly Contest 168 |
1297 | Maximum Number of Occurrences of a Substring | Hash Table ,String ,Sliding Window | Medium | Weekly Contest 168 |
1298 | Maximum Candies You Can Get from Boxes | Breadth-First Search ,Graph ,Array | Hard | Weekly Contest 168 |
1299 | Replace Elements with Greatest Element on Right Side | Array | Easy | Biweekly Contest 16 |
1300 | Sum of Mutated Array Closest to Target | Array ,Binary Search ,Sorting | Medium | Biweekly Contest 16 |
1301 | Number of Paths with Max Score | Array ,Dynamic Programming ,Matrix | Hard | Biweekly Contest 16 |
1302 | Deepest Leaves Sum | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Biweekly Contest 16 |
1303 | Find the Team Size | Database | Easy | ???? |
1304 | Find N Unique Integers Sum up to Zero | Array ,Math | Easy | Weekly Contest 169 |
1305 | All Elements in Two Binary Search Trees | Tree ,Depth-First Search ,Binary Search Tree ,Binary Tree ,Sorting | Medium | Weekly Contest 169 |
1306 | Jump Game III | Depth-First Search ,Breadth-First Search ,Array | Medium | Weekly Contest 169 |
1307 | Verbal Arithmetic Puzzle | Array ,Math ,String ,Backtracking | Hard | Weekly Contest 169 |
1308 | Running Total for Different Genders | Database | Medium | ???? |
1309 | Decrypt String from Alphabet to Integer Mapping | String | Easy | Weekly Contest 170 |
1310 | XOR Queries of a Subarray | Bit Manipulation ,Array ,Prefix Sum | Medium | Weekly Contest 170 |
1311 | Get Watched Videos by Your Friends | Breadth-First Search ,Graph ,Array ,Hash Table ,Sorting | Medium | Weekly Contest 170 |
1312 | Minimum Insertion Steps to Make a String Palindrome | String ,Dynamic Programming | Hard | Weekly Contest 170 |
1313 | Decompress Run-Length Encoded List | Array | Easy | Biweekly Contest 17 |
1314 | Matrix Block Sum | Array ,Matrix ,Prefix Sum | Medium | Biweekly Contest 17 |
1315 | Sum of Nodes with Even-Valued Grandparent | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Biweekly Contest 17 |
1316 | Distinct Echo Substrings | Trie ,String ,Hash Function ,Rolling Hash | Hard | Biweekly Contest 17 |
1317 | Convert Integer to the Sum of Two No-Zero Integers | Math | Easy | Weekly Contest 171 |
1318 | Minimum Flips to Make a OR b Equal to c | Bit Manipulation | Medium | Weekly Contest 171 |
1319 | Number of Operations to Make Network Connected | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | Weekly Contest 171 |
1320 | Minimum Distance to Type a Word Using Two Fingers | String ,Dynamic Programming | Hard | Weekly Contest 171 |
1321 | Restaurant Growth | Database | Medium | |
1322 | Ads Performance | Database | Easy | ???? |
1323 | Maximum 69 Number | Greedy ,Math | Easy | Weekly Contest 172 |
1324 | Print Words Vertically | Array ,String ,Simulation | Medium | Weekly Contest 172 |
1325 | Delete Leaves With a Given Value | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 172 |
1326 | Minimum Number of Taps to Open to Water a Garden | Greedy ,Array ,Dynamic Programming | Hard | Weekly Contest 172 |
1327 | List the Products Ordered in a Period | Database | Easy | |
1328 | Break a Palindrome | Greedy ,String | Medium | Biweekly Contest 18 |
1329 | Sort the Matrix Diagonally | Array ,Matrix ,Sorting | Medium | Biweekly Contest 18 |
1330 | Reverse Subarray To Maximize Array Value | Greedy ,Array ,Math | Hard | Biweekly Contest 18 |
1331 | Rank Transform of an Array | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 18 |
1332 | Remove Palindromic Subsequences | Two Pointers ,String | Easy | Weekly Contest 173 |
1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | Array ,Sorting | Medium | Weekly Contest 173 |
1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Graph ,Dynamic Programming ,Shortest Path | Medium | Weekly Contest 173 |
1335 | Minimum Difficulty of a Job Schedule | Array ,Dynamic Programming | Hard | Weekly Contest 173 |
1336 | Number of Transactions per Visit | Database | Hard | ???? |
1337 | The K Weakest Rows in a Matrix | Array ,Binary Search ,Matrix ,Sorting ,Heap (Priority Queue) | Easy | Weekly Contest 174 |
1338 | Reduce Array Size to The Half | Greedy ,Array ,Hash Table ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 174 |
1339 | Maximum Product of Splitted Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 174 |
1340 | Jump Game V | Array ,Dynamic Programming ,Sorting | Hard | Weekly Contest 174 |
1341 | Movie Rating | Database | Medium | |
1342 | Number of Steps to Reduce a Number to Zero | Bit Manipulation ,Math | Easy | Biweekly Contest 19 |
1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Array ,Sliding Window | Medium | Biweekly Contest 19 |
1344 | Angle Between Hands of a Clock | Math | Medium | Biweekly Contest 19 |
1345 | Jump Game IV | Breadth-First Search ,Array ,Hash Table | Hard | Biweekly Contest 19 |
1346 | Check If N and Its Double Exist | Array ,Hash Table ,Two Pointers ,Binary Search ,Sorting | Easy | Weekly Contest 175 |
1347 | Minimum Number of Steps to Make Two Strings Anagram | Hash Table ,String ,Counting | Medium | Weekly Contest 175 |
1348 | Tweet Counts Per Frequency | Design ,Hash Table ,Binary Search ,Ordered Set ,Sorting | Medium | Weekly Contest 175 |
1349 | Maximum Students Taking Exam | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask ,Matrix | Hard | Weekly Contest 175 |
1350 | Students With Invalid Departments | Database | Easy | ???? |
1351 | Count Negative Numbers in a Sorted Matrix | Array ,Binary Search ,Matrix | Easy | Weekly Contest 176 |
1352 | Product of the Last K Numbers | Design ,Queue ,Array ,Math ,Data Stream | Medium | Weekly Contest 176 |
1353 | Maximum Number of Events That Can Be Attended | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 176 |
1354 | Construct Target Array With Multiple Sums | Array ,Heap (Priority Queue) | Hard | Weekly Contest 176 |
1355 | Activity Participants | Database | Medium | ???? |
1356 | Sort Integers by The Number of 1 Bits | Bit Manipulation ,Array ,Counting ,Sorting | Easy | Biweekly Contest 20 |
1357 | Apply Discount Every n Orders | Design ,Array ,Hash Table | Medium | Biweekly Contest 20 |
1358 | Number of Substrings Containing All Three Characters | Hash Table ,String ,Sliding Window | Medium | Biweekly Contest 20 |
1359 | Count All Valid Pickup and Delivery Options | Math ,Dynamic Programming ,Combinatorics | Hard | Biweekly Contest 20 |
1360 | Number of Days Between Two Dates | Math ,String | Easy | Weekly Contest 177 |
1361 | Validate Binary Tree Nodes | Tree ,Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Binary Tree | Medium | Weekly Contest 177 |
1362 | Closest Divisors | Math | Medium | Weekly Contest 177 |
1363 | Largest Multiple of Three | Greedy ,Array ,Dynamic Programming | Hard | Weekly Contest 177 |
1364 | Number of Trusted Contacts of a Customer | Database | Medium | ???? |
1365 | How Many Numbers Are Smaller Than the Current Number | Array ,Hash Table ,Counting ,Sorting | Easy | Weekly Contest 178 |
1366 | Rank Teams by Votes | Array ,Hash Table ,String ,Counting ,Sorting | Medium | Weekly Contest 178 |
1367 | Linked List in Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Linked List ,Binary Tree | Medium | Weekly Contest 178 |
1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Breadth-First Search ,Graph ,Array ,Matrix ,Shortest Path ,Heap (Priority Queue) | Hard | Weekly Contest 178 |
1369 | Get the Second Most Recent Activity | Database | Hard | ???? |
1370 | Increasing Decreasing String | Hash Table ,String ,Counting | Easy | Biweekly Contest 21 |
1371 | Find the Longest Substring Containing Vowels in Even Counts | Bit Manipulation ,Hash Table ,String ,Prefix Sum | Medium | Biweekly Contest 21 |
1372 | Longest ZigZag Path in a Binary Tree | Tree ,Depth-First Search ,Dynamic Programming ,Binary Tree | Medium | Biweekly Contest 21 |
1373 | Maximum Sum BST in Binary Tree | Tree ,Depth-First Search ,Binary Search Tree ,Dynamic Programming ,Binary Tree | Hard | Biweekly Contest 21 |
1374 | Generate a String With Characters That Have Odd Counts | String | Easy | Weekly Contest 179 |
1375 | Number of Times Binary String Is Prefix-Aligned | Array | Medium | Weekly Contest 179 |
1376 | Time Needed to Inform All Employees | Tree ,Depth-First Search ,Breadth-First Search | Medium | Weekly Contest 179 |
1377 | Frog Position After T Seconds | Tree ,Depth-First Search ,Breadth-First Search ,Graph | Hard | Weekly Contest 179 |
1378 | Replace Employee ID With The Unique Identifier | Database | Easy | |
1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | |
1380 | Lucky Numbers in a Matrix | Array ,Matrix | Easy | Weekly Contest 180 |
1381 | Design a Stack With Increment Operation | Stack ,Design ,Array | Medium | Weekly Contest 180 |
1382 | Balance a Binary Search Tree | Greedy ,Tree ,Depth-First Search ,Binary Search Tree ,Divide and Conquer ,Binary Tree | Medium | Weekly Contest 180 |
1383 | Maximum Performance of a Team | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 180 |
1384 | Total Sales Amount by Year | Database | Hard | ???? |
1385 | Find the Distance Value Between Two Arrays | Array ,Two Pointers ,Binary Search ,Sorting | Easy | Biweekly Contest 22 |
1386 | Cinema Seat Allocation | Greedy ,Bit Manipulation ,Array ,Hash Table | Medium | Biweekly Contest 22 |
1387 | Sort Integers by The Power Value | Memoization ,Dynamic Programming ,Sorting | Medium | Biweekly Contest 22 |
1388 | Pizza With 3n Slices | Greedy ,Array ,Dynamic Programming ,Heap (Priority Queue) | Hard | Biweekly Contest 22 |
1389 | Create Target Array in the Given Order | Array ,Simulation | Easy | Weekly Contest 181 |
1390 | Four Divisors | Array ,Math | Medium | Weekly Contest 181 |
1391 | Check if There is a Valid Path in a Grid | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Weekly Contest 181 |
1392 | Longest Happy Prefix | String ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 181 |
1393 | Capital GainLoss | Database | Medium | |
1394 | Find Lucky Integer in an Array | Array ,Hash Table ,Counting | Easy | Weekly Contest 182 |
1395 | Count Number of Teams | Binary Indexed Tree ,Array ,Dynamic Programming | Medium | Weekly Contest 182 |
1396 | Design Underground System | Design ,Hash Table ,String | Medium | Weekly Contest 182 |
1397 | Find All Good Strings | String ,Dynamic Programming ,String Matching | Hard | Weekly Contest 182 |
1398 | Customers Who Bought Products A and B but Not C | Database | Medium | ???? |
1399 | Count Largest Group | Hash Table ,Math | Easy | Biweekly Contest 23 |
1400 | Construct K Palindrome Strings | Greedy ,Hash Table ,String ,Counting | Medium | Biweekly Contest 23 |
1401 | Circle and Rectangle Overlapping | Geometry ,Math | Medium | Biweekly Contest 23 |
1402 | Reducing Dishes | Greedy ,Array ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 23 |
1403 | Minimum Subsequence in Non-Increasing Order | Greedy ,Array ,Sorting | Easy | Weekly Contest 183 |
1404 | Number of Steps to Reduce a Number in Binary Representation to One | Bit Manipulation ,String | Medium | Weekly Contest 183 |
1405 | Longest Happy String | Greedy ,String ,Heap (Priority Queue) | Medium | Weekly Contest 183 |
1406 | Stone Game III | Array ,Math ,Dynamic Programming ,Game Theory | Hard | Weekly Contest 183 |
1407 | Top Travellers | Database | Easy | |
1408 | String Matching in an Array | Array ,String ,String Matching | Easy | Weekly Contest 184 |
1409 | Queries on a Permutation With Key | Binary Indexed Tree ,Array ,Simulation | Medium | Weekly Contest 184 |
1410 | HTML Entity Parser | Hash Table ,String | Medium | Weekly Contest 184 |
1411 | Number of Ways to Paint N × 3 Grid | Dynamic Programming | Hard | Weekly Contest 184 |
1412 | Find the Quiet Students in All Exams | Database | Hard | ???? |
1413 | Minimum Value to Get Positive Step by Step Sum | Array ,Prefix Sum | Easy | Biweekly Contest 24 |
1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | Greedy ,Math | Medium | Biweekly Contest 24 |
1415 | The k-th Lexicographical String of All Happy Strings of Length n | String ,Backtracking | Medium | Biweekly Contest 24 |
1416 | Restore The Array | String ,Dynamic Programming | Hard | Biweekly Contest 24 |
1417 | Reformat The String | String | Easy | Weekly Contest 185 |
1418 | Display Table of Food Orders in a Restaurant | Array ,Hash Table ,String ,Ordered Set ,Sorting | Medium | Weekly Contest 185 |
1419 | Minimum Number of Frogs Croaking | String ,Counting | Medium | Weekly Contest 185 |
1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Dynamic Programming ,Prefix Sum | Hard | Weekly Contest 185 |
1421 | NPV Queries | Database | Easy | ???? |
1422 | Maximum Score After Splitting a String | String ,Prefix Sum | Easy | Weekly Contest 186 |
1423 | Maximum Points You Can Obtain from Cards | Array ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 186 |
1424 | Diagonal Traverse II | Array ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 186 |
1425 | Constrained Subsequence Sum | Queue ,Array ,Dynamic Programming ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Hard | Weekly Contest 186 |
1426 | Counting Elements | Array ,Hash Table | Easy | ???? |
1427 | Perform String Shifts | Array ,Math ,String | Easy | ???? |
1428 | Leftmost Column with at Least a One | Array ,Binary Search ,Interactive ,Matrix | Medium | ???? |
1429 | First Unique Number | Design ,Queue ,Array ,Hash Table ,Data Stream | Medium | ???? |
1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | ???? |
1431 | Kids With the Greatest Number of Candies | Array | Easy | Biweekly Contest 25 |
1432 | Max Difference You Can Get From Changing an Integer | Greedy ,Math | Medium | Biweekly Contest 25 |
1433 | Check If a String Can Break Another String | Greedy ,String ,Sorting | Medium | Biweekly Contest 25 |
1434 | Number of Ways to Wear Different Hats to Each Other | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | Biweekly Contest 25 |
1435 | Create a Session Bar Chart | Database | Easy | ???? |
1436 | Destination City | Array ,Hash Table ,String | Easy | Weekly Contest 187 |
1437 | Check If All 1's Are at Least Length K Places Away | Array | Easy | Weekly Contest 187 |
1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Queue ,Array ,Ordered Set ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Medium | Weekly Contest 187 |
1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Array ,Binary Search ,Matrix ,Heap (Priority Queue) | Hard | Weekly Contest 187 |
1440 | Evaluate Boolean Expression | Database | Medium | ???? |
1441 | Build an Array With Stack Operations | Stack ,Array ,Simulation | Medium | Weekly Contest 188 |
1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Bit Manipulation ,Array ,Hash Table ,Math ,Prefix Sum | Medium | Weekly Contest 188 |
1443 | Minimum Time to Collect All Apples in a Tree | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table | Medium | Weekly Contest 188 |
1444 | Number of Ways of Cutting a Pizza | Memoization ,Array ,Dynamic Programming ,Matrix | Hard | Weekly Contest 188 |
1445 | Apples & Oranges | Database | Medium | ???? |
1446 | Consecutive Characters | String | Easy | Biweekly Contest 26 |
1447 | Simplified Fractions | Math ,String ,Number Theory | Medium | Biweekly Contest 26 |
1448 | Count Good Nodes in Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Biweekly Contest 26 |
1449 | Form Largest Integer With Digits That Add up to Target | Array ,Dynamic Programming | Hard | Biweekly Contest 26 |
1450 | Number of Students Doing Homework at a Given Time | Array | Easy | Weekly Contest 189 |
1451 | Rearrange Words in a Sentence | String ,Sorting | Medium | Weekly Contest 189 |
1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | Array ,Hash Table ,String | Medium | Weekly Contest 189 |
1453 | Maximum Number of Darts Inside of a Circular Dartboard | Geometry ,Array ,Math | Hard | Weekly Contest 189 |
1454 | Active Users | Database | Medium | ???? |
1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Two Pointers ,String ,String Matching | Easy | Weekly Contest 190 |
1456 | Maximum Number of Vowels in a Substring of Given Length | String ,Sliding Window | Medium | Weekly Contest 190 |
1457 | Pseudo-Palindromic Paths in a Binary Tree | Bit Manipulation ,Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 190 |
1458 | Max Dot Product of Two Subsequences | Array ,Dynamic Programming | Hard | Weekly Contest 190 |
1459 | Rectangles Area | Database | Medium | ???? |
1460 | Make Two Arrays Equal by Reversing Subarrays | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 27 |
1461 | Check If a String Contains All Binary Codes of Size K | Bit Manipulation ,Hash Table ,String ,Hash Function ,Rolling Hash | Medium | Biweekly Contest 27 |
1462 | Course Schedule IV | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | Biweekly Contest 27 |
1463 | Cherry Pickup II | Array ,Dynamic Programming ,Matrix | Hard | Biweekly Contest 27 |
1464 | Maximum Product of Two Elements in an Array | Array ,Sorting ,Heap (Priority Queue) | Easy | Weekly Contest 191 |
1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Greedy ,Array ,Sorting | Medium | Weekly Contest 191 |
1466 | Reorder Routes to Make All Paths Lead to the City Zero | Depth-First Search ,Breadth-First Search ,Graph | Medium | Weekly Contest 191 |
1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | Array ,Math ,Dynamic Programming ,Backtracking ,Combinatorics ,Probability and Statistics | Hard | Weekly Contest 191 |
1468 | Calculate Salaries | Database | Medium | ???? |
1469 | Find All The Lonely Nodes | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Easy | ???? |
1470 | Shuffle the Array | Array | Easy | Weekly Contest 192 |
1471 | The k Strongest Values in an Array | Array ,Two Pointers ,Sorting | Medium | Weekly Contest 192 |
1472 | Design Browser History | Stack ,Design ,Array ,Linked List ,Data Stream ,Doubly-Linked List | Medium | Weekly Contest 192 |
1473 | Paint House III | Array ,Dynamic Programming | Hard | Weekly Contest 192 |
1474 | Delete N Nodes After M Nodes of a Linked List | Linked List | Easy | ???? |
1475 | Final Prices With a Special Discount in a Shop | Stack ,Array ,Monotonic Stack | Easy | Biweekly Contest 28 |
1476 | Subrectangle Queries | Design ,Array ,Matrix | Medium | Biweekly Contest 28 |
1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | Array ,Hash Table ,Binary Search ,Dynamic Programming ,Sliding Window | Medium | Biweekly Contest 28 |
1478 | Allocate Mailboxes | Array ,Math ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 28 |
1479 | Sales by Day of the Week | Database | Hard | ???? |
1480 | Running Sum of 1d Array | Array ,Prefix Sum | Easy | Weekly Contest 193 |
1481 | Least Number of Unique Integers after K Removals | Greedy ,Array ,Hash Table ,Counting ,Sorting | Medium | Weekly Contest 193 |
1482 | Minimum Number of Days to Make m Bouquets | Array ,Binary Search | Medium | Weekly Contest 193 |
1483 | Kth Ancestor of a Tree Node | Tree ,Depth-First Search ,Breadth-First Search ,Design ,Binary Search ,Dynamic Programming | Hard | Weekly Contest 193 |
1484 | Group Sold Products By The Date | Database | Easy | |
1485 | Clone Binary Tree With Random Pointer | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | ???? |
1486 | XOR Operation in an Array | Bit Manipulation ,Math | Easy | Weekly Contest 194 |
1487 | Making File Names Unique | Array ,Hash Table ,String | Medium | Weekly Contest 194 |
1488 | Avoid Flood in The City | Greedy ,Array ,Hash Table ,Binary Search ,Heap (Priority Queue) | Medium | Weekly Contest 194 |
1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Union Find ,Graph ,Minimum Spanning Tree ,Sorting ,Strongly Connected Component | Hard | Weekly Contest 194 |
1490 | Clone N-ary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table | Medium | ???? |
1491 | Average Salary Excluding the Minimum and Maximum Salary | Array ,Sorting | Easy | Biweekly Contest 29 |
1492 | The kth Factor of n | Math ,Number Theory | Medium | Biweekly Contest 29 |
1493 | Longest Subarray of 1's After Deleting One Element | Array ,Dynamic Programming ,Sliding Window | Medium | Biweekly Contest 29 |
1494 | Parallel Courses II | Bit Manipulation ,Graph ,Dynamic Programming ,Bitmask | Hard | Biweekly Contest 29 |
1495 | Friendly Movies Streamed Last Month | Database | Easy | ???? |
1496 | Path Crossing | Hash Table ,String | Easy | Weekly Contest 195 |
1497 | Check If Array Pairs Are Divisible by k | Array ,Hash Table ,Counting | Medium | Weekly Contest 195 |
1498 | Number of Subsequences That Satisfy the Given Sum Condition | Array ,Two Pointers ,Binary Search ,Sorting | Medium | Weekly Contest 195 |
1499 | Max Value of Equation | Queue ,Array ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Hard | Weekly Contest 195 |
1500 | Design a File Sharing System | Design ,Hash Table ,Data Stream ,Heap (Priority Queue) | Medium | ???? |
1501 | Countries You Can Safely Invest In | Database | Medium | ???? |
1502 | Can Make Arithmetic Progression From Sequence | Array ,Sorting | Easy | Weekly Contest 196 |
1503 | Last Moment Before All Ants Fall Out of a Plank | Brainteaser ,Array ,Simulation | Medium | Weekly Contest 196 |
1504 | Count Submatrices With All Ones | Stack ,Array ,Dynamic Programming ,Matrix ,Monotonic Stack | Medium | Weekly Contest 196 |
1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Greedy ,Binary Indexed Tree ,Segment Tree ,String | Hard | Weekly Contest 196 |
1506 | Find Root of N-Ary Tree | Bit Manipulation ,Tree ,Depth-First Search ,Hash Table | Medium | ???? |
1507 | Reformat Date | String | Easy | Biweekly Contest 30 |
1508 | Range Sum of Sorted Subarray Sums | Array ,Two Pointers ,Binary Search ,Sorting | Medium | Biweekly Contest 30 |
1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Greedy ,Array ,Sorting | Medium | Biweekly Contest 30 |
1510 | Stone Game IV | Math ,Dynamic Programming ,Game Theory | Hard | Biweekly Contest 30 |
1511 | Customer Order Frequency | Database | Easy | ???? |
1512 | Number of Good Pairs | Array ,Hash Table ,Math ,Counting | Easy | Weekly Contest 197 |
1513 | Number of Substrings With Only 1s | Math ,String | Medium | Weekly Contest 197 |
1514 | Path with Maximum Probability | Graph ,Array ,Shortest Path ,Heap (Priority Queue) | Medium | Weekly Contest 197 |
1515 | Best Position for a Service Centre | Geometry ,Math ,Randomized | Hard | Weekly Contest 197 |
1516 | Move Sub-Tree of N-Ary Tree | Tree ,Depth-First Search | Hard | ???? |
1517 | Find Users With Valid E-Mails | Database | Easy | |
1518 | Water Bottles | Math ,Simulation | Easy | Weekly Contest 198 |
1519 | Number of Nodes in the Sub-Tree With the Same Label | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Counting | Medium | Weekly Contest 198 |
1520 | Maximum Number of Non-Overlapping Substrings | Greedy ,String | Hard | Weekly Contest 198 |
1521 | Find a Value of a Mysterious Function Closest to Target | Bit Manipulation ,Segment Tree ,Array ,Binary Search | Hard | Weekly Contest 198 |
1522 | Diameter of N-Ary Tree | Tree ,Depth-First Search | Medium | ???? |
1523 | Count Odd Numbers in an Interval Range | Math | Easy | Biweekly Contest 31 |
1524 | Number of Sub-arrays With Odd Sum | Array ,Math ,Dynamic Programming ,Prefix Sum | Medium | Biweekly Contest 31 |
1525 | Number of Good Ways to Split a String | Bit Manipulation ,String ,Dynamic Programming | Medium | Biweekly Contest 31 |
1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Stack ,Greedy ,Array ,Dynamic Programming ,Monotonic Stack | Hard | Biweekly Contest 31 |
1527 | Patients With a Condition | Database | Easy | |
1528 | Shuffle String | Array ,String | Easy | Weekly Contest 199 |
1529 | Minimum Suffix Flips | Greedy ,String | Medium | Weekly Contest 199 |
1530 | Number of Good Leaf Nodes Pairs | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 199 |
1531 | String Compression II | String ,Dynamic Programming | Hard | Weekly Contest 199 |
1532 | The Most Recent Three Orders | Database | Medium | ???? |
1533 | Find the Index of the Large Integer | Array ,Binary Search ,Interactive | Medium | ???? |
1534 | Count Good Triplets | Array ,Enumeration | Easy | Weekly Contest 200 |
1535 | Find the Winner of an Array Game | Array ,Simulation | Medium | Weekly Contest 200 |
1536 | Minimum Swaps to Arrange a Binary Grid | Greedy ,Array ,Matrix | Medium | Weekly Contest 200 |
1537 | Get the Maximum Score | Greedy ,Array ,Two Pointers ,Dynamic Programming | Hard | Weekly Contest 200 |
1538 | Guess the Majority in a Hidden Array | Array ,Math ,Interactive | Medium | ???? |
1539 | Kth Missing Positive Number | Array ,Binary Search | Easy | Biweekly Contest 32 |
1540 | Can Convert String in K Moves | Hash Table ,String | Medium | Biweekly Contest 32 |
1541 | Minimum Insertions to Balance a Parentheses String | Stack ,Greedy ,String | Medium | Biweekly Contest 32 |
1542 | Find Longest Awesome Substring | Bit Manipulation ,Hash Table ,String | Hard | Biweekly Contest 32 |
1543 | Fix Product Name Format | Database | Easy | ???? |
1544 | Make The String Great | Stack ,String | Easy | Weekly Contest 201 |
1545 | Find Kth Bit in Nth Binary String | Recursion ,String ,Simulation | Medium | Weekly Contest 201 |
1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | Greedy ,Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 201 |
1547 | Minimum Cost to Cut a Stick | Array ,Dynamic Programming ,Sorting | Hard | Weekly Contest 201 |
1548 | The Most Similar Path in a Graph | Graph ,Dynamic Programming | Hard | ???? |
1549 | The Most Recent Orders for Each Product | Database | Medium | ???? |
1550 | Three Consecutive Odds | Array | Easy | Weekly Contest 202 |
1551 | Minimum Operations to Make Array Equal | Math | Medium | Weekly Contest 202 |
1552 | Magnetic Force Between Two Balls | Array ,Binary Search ,Sorting | Medium | Weekly Contest 202 |
1553 | Minimum Number of Days to Eat N Oranges | Memoization ,Dynamic Programming | Hard | Weekly Contest 202 |
1554 | Strings Differ by One Character | Hash Table ,String ,Hash Function ,Rolling Hash | Medium | ???? |
1555 | Bank Account Summary | Database | Medium | ???? |
1556 | Thousand Separator | String | Easy | Biweekly Contest 33 |
1557 | Minimum Number of Vertices to Reach All Nodes | Graph | Medium | Biweekly Contest 33 |
1558 | Minimum Numbers of Function Calls to Make Target Array | Greedy ,Bit Manipulation ,Array | Medium | Biweekly Contest 33 |
1559 | Detect Cycles in 2D Grid | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Biweekly Contest 33 |
1560 | Most Visited Sector in a Circular Track | Array ,Simulation | Easy | Weekly Contest 203 |
1561 | Maximum Number of Coins You Can Get | Greedy ,Array ,Math ,Game Theory ,Sorting | Medium | Weekly Contest 203 |
1562 | Find Latest Group of Size M | Array ,Binary Search ,Simulation | Medium | Weekly Contest 203 |
1563 | Stone Game V | Array ,Math ,Dynamic Programming ,Game Theory | Hard | Weekly Contest 203 |
1564 | Put Boxes Into the Warehouse I | Greedy ,Array ,Sorting | Medium | ???? |
1565 | Unique Orders and Customers Per Month | Database | Easy | ???? |
1566 | Detect Pattern of Length M Repeated K or More Times | Array ,Enumeration | Easy | Weekly Contest 204 |
1567 | Maximum Length of Subarray With Positive Product | Greedy ,Array ,Dynamic Programming | Medium | Weekly Contest 204 |
1568 | Minimum Number of Days to Disconnect Island | Depth-First Search ,Breadth-First Search ,Array ,Matrix ,Strongly Connected Component | Hard | Weekly Contest 204 |
1569 | Number of Ways to Reorder Array to Get Same BST | Tree ,Union Find ,Binary Search Tree ,Memoization ,Array ,Math ,Divide and Conquer ,Dynamic Programming ,Binary Tree ,Combinatorics | Hard | Weekly Contest 204 |
1570 | Dot Product of Two Sparse Vectors | Design ,Array ,Hash Table ,Two Pointers | Medium | ???? |
1571 | Warehouse Manager | Database | Easy | ???? |
1572 | Matrix Diagonal Sum | Array ,Matrix | Easy | Biweekly Contest 34 |
1573 | Number of Ways to Split a String | Math ,String | Medium | Biweekly Contest 34 |
1574 | Shortest Subarray to be Removed to Make Array Sorted | Stack ,Array ,Two Pointers ,Binary Search ,Monotonic Stack | Medium | Biweekly Contest 34 |
1575 | Count All Possible Routes | Memoization ,Array ,Dynamic Programming | Hard | Biweekly Contest 34 |
1576 | Replace All 's to Avoid Consecutive Repeating Characters | String | Easy | Weekly Contest 205 |
1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | Array ,Hash Table ,Math ,Two Pointers | Medium | Weekly Contest 205 |
1578 | Minimum Time to Make Rope Colorful | Greedy ,Array ,String ,Dynamic Programming | Medium | Weekly Contest 205 |
1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Union Find ,Graph | Hard | Weekly Contest 205 |
1580 | Put Boxes Into the Warehouse II | Greedy ,Array ,Sorting | Medium | ???? |
1581 | Customer Who Visited but Did Not Make Any Transactions | Database | Easy | |
1582 | Special Positions in a Binary Matrix | Array ,Matrix | Easy | Weekly Contest 206 |
1583 | Count Unhappy Friends | Array ,Simulation | Medium | Weekly Contest 206 |
1584 | Min Cost to Connect All Points | Union Find ,Graph ,Array ,Minimum Spanning Tree | Medium | Weekly Contest 206 |
1585 | Check If String Is Transformable With Substring Sort Operations | Greedy ,String ,Sorting | Hard | Weekly Contest 206 |
1586 | Binary Search Tree Iterator II | Stack ,Tree ,Design ,Binary Search Tree ,Binary Tree ,Iterator | Medium | ???? |
1587 | Bank Account Summary II | Database | Easy | |
1588 | Sum of All Odd Length Subarrays | Array ,Math ,Prefix Sum | Easy | Biweekly Contest 35 |
1589 | Maximum Sum Obtained of Any Permutation | Greedy ,Array ,Prefix Sum ,Sorting | Medium | Biweekly Contest 35 |
1590 | Make Sum Divisible by P | Array ,Hash Table ,Prefix Sum | Medium | Biweekly Contest 35 |
1591 | Strange Printer II | Graph ,Topological Sort ,Array ,Matrix | Hard | Biweekly Contest 35 |
1592 | Rearrange Spaces Between Words | String | Easy | Weekly Contest 207 |
1593 | Split a String Into the Max Number of Unique Substrings | Hash Table ,String ,Backtracking | Medium | Weekly Contest 207 |
1594 | Maximum Non Negative Product in a Matrix | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 207 |
1595 | Minimum Cost to Connect Two Groups of Points | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask ,Matrix | Hard | Weekly Contest 207 |
1596 | The Most Frequently Ordered Products for Each Customer | Database | Medium | ???? |
1597 | Build Binary Expression Tree From Infix Expression | Stack ,Tree ,String ,Binary Tree | Hard | ???? |
1598 | Crawler Log Folder | Stack ,Array ,String | Easy | Weekly Contest 208 |
1599 | Maximum Profit of Operating a Centennial Wheel | Array ,Simulation | Medium | Weekly Contest 208 |
1600 | Throne Inheritance | Tree ,Depth-First Search ,Design ,Hash Table | Medium | Weekly Contest 208 |
1601 | Maximum Number of Achievable Transfer Requests | Bit Manipulation ,Array ,Backtracking ,Enumeration | Hard | Weekly Contest 208 |
1602 | Find Nearest Right Node in Binary Tree | Tree ,Breadth-First Search ,Binary Tree | Medium | ???? |
1603 | Design Parking System | Design ,Counting ,Simulation | Easy | Biweekly Contest 36 |
1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Array ,Hash Table ,String ,Sorting | Medium | Biweekly Contest 36 |
1605 | Find Valid Matrix Given Row and Column Sums | Greedy ,Array ,Matrix | Medium | Biweekly Contest 36 |
1606 | Find Servers That Handled Most Number of Requests | Greedy ,Array ,Ordered Set ,Heap (Priority Queue) | Hard | Biweekly Contest 36 |
1607 | Sellers With No Sales | Database | Easy | ???? |
1608 | Special Array With X Elements Greater Than or Equal X | Array ,Binary Search ,Sorting | Easy | Weekly Contest 209 |
1609 | Even Odd Tree | Tree ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 209 |
1610 | Maximum Number of Visible Points | Geometry ,Array ,Math ,Sorting ,Sliding Window | Hard | Weekly Contest 209 |
1611 | Minimum One Bit Operations to Make Integers Zero | Bit Manipulation ,Memoization ,Dynamic Programming | Hard | Weekly Contest 209 |
1612 | Check If Two Expression Trees are Equivalent | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
1613 | Find the Missing IDs | Database | Medium | ???? |
1614 | Maximum Nesting Depth of the Parentheses | Stack ,String | Easy | Weekly Contest 210 |
1615 | Maximal Network Rank | Graph | Medium | Weekly Contest 210 |
1616 | Split Two Strings to Make Palindrome | Two Pointers ,String | Medium | Weekly Contest 210 |
1617 | Count Subtrees With Max Distance Between Cities | Bit Manipulation ,Tree ,Dynamic Programming ,Bitmask ,Enumeration | Hard | Weekly Contest 210 |
1618 | Maximum Font to Fit a Sentence in a Screen | Array ,String ,Binary Search ,Interactive | Medium | ???? |
1619 | Mean of Array After Removing Some Elements | Array ,Sorting | Easy | Biweekly Contest 37 |
1620 | Coordinate With Maximum Network Quality | Array ,Enumeration | Medium | Biweekly Contest 37 |
1621 | Number of Sets of K Non-Overlapping Line Segments | Math ,Dynamic Programming ,Combinatorics | Medium | Biweekly Contest 37 |
1622 | Fancy Sequence | Design ,Segment Tree ,Math | Hard | Biweekly Contest 37 |
1623 | All Valid Triplets That Can Represent a Country | Database | Easy | ???? |
1624 | Largest Substring Between Two Equal Characters | Hash Table ,String | Easy | Weekly Contest 211 |
1625 | Lexicographically Smallest String After Applying Operations | Breadth-First Search ,String | Medium | Weekly Contest 211 |
1626 | Best Team With No Conflicts | Array ,Dynamic Programming ,Sorting | Medium | Weekly Contest 211 |
1627 | Graph Connectivity With Threshold | Union Find ,Array ,Math ,Number Theory | Hard | Weekly Contest 211 |
1628 | Design an Expression Tree With Evaluate Function | Stack ,Tree ,Design ,Math ,Binary Tree | Medium | ???? |
1629 | Slowest Key | Array ,String | Easy | Weekly Contest 212 |
1630 | Arithmetic Subarrays | Array ,Hash Table ,Sorting | Medium | Weekly Contest 212 |
1631 | Path With Minimum Effort | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Binary Search ,Matrix ,Heap (Priority Queue) | Medium | Weekly Contest 212 |
1632 | Rank Transform of a Matrix | Union Find ,Graph ,Topological Sort ,Array ,Matrix ,Sorting | Hard | Weekly Contest 212 |
1633 | Percentage of Users Attended a Contest | Database | Easy | |
1634 | Add Two Polynomials Represented as Linked Lists | Linked List ,Math ,Two Pointers | Medium | ???? |
1635 | Hopper Company Queries I | Database | Hard | ???? |
1636 | Sort Array by Increasing Frequency | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 38 |
1637 | Widest Vertical Area Between Two Points Containing No Points | Array ,Sorting | Easy | Biweekly Contest 38 |
1638 | Count Substrings That Differ by One Character | Hash Table ,String ,Dynamic Programming | Medium | Biweekly Contest 38 |
1639 | Number of Ways to Form a Target String Given a Dictionary | Array ,String ,Dynamic Programming | Hard | Biweekly Contest 38 |
1640 | Check Array Formation Through Concatenation | Array ,Hash Table | Easy | Weekly Contest 213 |
1641 | Count Sorted Vowel Strings | Math ,Dynamic Programming ,Combinatorics | Medium | Weekly Contest 213 |
1642 | Furthest Building You Can Reach | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 213 |
1643 | Kth Smallest Instructions | Array ,Math ,Dynamic Programming ,Combinatorics | Hard | Weekly Contest 213 |
1644 | Lowest Common Ancestor of a Binary Tree II | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
1645 | Hopper Company Queries II | Database | Hard | ???? |
1646 | Get Maximum in Generated Array | Array ,Simulation | Easy | Weekly Contest 214 |
1647 | Minimum Deletions to Make Character Frequencies Unique | Greedy ,Hash Table ,String ,Sorting | Medium | Weekly Contest 214 |
1648 | Sell Diminishing-Valued Colored Balls | Greedy ,Array ,Math ,Binary Search ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 214 |
1649 | Create Sorted Array through Instructions | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | Weekly Contest 214 |
1650 | Lowest Common Ancestor of a Binary Tree III | Tree ,Hash Table ,Two Pointers ,Binary Tree | Medium | ???? |
1651 | Hopper Company Queries III | Database | Hard | ???? |
1652 | Defuse the Bomb | Array ,Sliding Window | Easy | Biweekly Contest 39 |
1653 | Minimum Deletions to Make String Balanced | Stack ,String ,Dynamic Programming | Medium | Biweekly Contest 39 |
1654 | Minimum Jumps to Reach Home | Breadth-First Search ,Array ,Dynamic Programming | Medium | Biweekly Contest 39 |
1655 | Distribute Repeating Integers | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Hard | Biweekly Contest 39 |
1656 | Design an Ordered Stream | Design ,Array ,Hash Table ,Data Stream | Easy | Weekly Contest 215 |
1657 | Determine if Two Strings Are Close | Hash Table ,String ,Counting ,Sorting | Medium | Weekly Contest 215 |
1658 | Minimum Operations to Reduce X to Zero | Array ,Hash Table ,Binary Search ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 215 |
1659 | Maximize Grid Happiness | Bit Manipulation ,Memoization ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 215 |
1660 | Correct a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | ???? |
1661 | Average Time of Process per Machine | Database | Easy | |
1662 | Check If Two String Arrays are Equivalent | Array ,String | Easy | Weekly Contest 216 |
1663 | Smallest String With A Given Numeric Value | Greedy ,String | Medium | Weekly Contest 216 |
1664 | Ways to Make a Fair Array | Array ,Prefix Sum | Medium | Weekly Contest 216 |
1665 | Minimum Initial Energy to Finish Tasks | Greedy ,Array ,Sorting | Hard | Weekly Contest 216 |
1666 | Change the Root of a Binary Tree | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
1667 | Fix Names in a Table | Database | Easy | |
1668 | Maximum Repeating Substring | String ,String Matching | Easy | Biweekly Contest 40 |
1669 | Merge In Between Linked Lists | Linked List | Medium | Biweekly Contest 40 |
1670 | Design Front Middle Back Queue | Design ,Queue ,Array ,Linked List ,Data Stream | Medium | Biweekly Contest 40 |
1671 | Minimum Number of Removals to Make Mountain Array | Greedy ,Array ,Binary Search ,Dynamic Programming | Hard | Biweekly Contest 40 |
1672 | Richest Customer Wealth | Array ,Matrix | Easy | Weekly Contest 217 |
1673 | Find the Most Competitive Subsequence | Stack ,Greedy ,Array ,Monotonic Stack | Medium | Weekly Contest 217 |
1674 | Minimum Moves to Make Array Complementary | Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 217 |
1675 | Minimize Deviation in Array | Greedy ,Array ,Ordered Set ,Heap (Priority Queue) | Hard | Weekly Contest 217 |
1676 | Lowest Common Ancestor of a Binary Tree IV | Tree ,Depth-First Search ,Hash Table ,Binary Tree | Medium | ???? |
1677 | Product's Worth Over Invoices | Database | Easy | ???? |
1678 | Goal Parser Interpretation | String | Easy | Weekly Contest 218 |
1679 | Max Number of K-Sum Pairs | Array ,Hash Table ,Two Pointers ,Sorting | Medium | Weekly Contest 218 |
1680 | Concatenation of Consecutive Binary Numbers | Bit Manipulation ,Math ,Simulation | Medium | Weekly Contest 218 |
1681 | Minimum Incompatibility | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 218 |
1682 | Longest Palindromic Subsequence II | String ,Dynamic Programming | Medium | ???? |
1683 | Invalid Tweets | Database | Easy | |
1684 | Count the Number of Consistent Strings | Bit Manipulation ,Array ,Hash Table ,String | Easy | Biweekly Contest 41 |
1685 | Sum of Absolute Differences in a Sorted Array | Array ,Math ,Prefix Sum | Medium | Biweekly Contest 41 |
1686 | Stone Game VI | Greedy ,Array ,Math ,Game Theory ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 41 |
1687 | Delivering Boxes from Storage to Ports | Segment Tree ,Queue ,Array ,Dynamic Programming ,Prefix Sum ,Monotonic Queue ,Heap (Priority Queue) | Hard | Biweekly Contest 41 |
1688 | Count of Matches in Tournament | Math ,Simulation | Easy | Weekly Contest 219 |
1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Greedy ,String | Medium | Weekly Contest 219 |
1690 | Stone Game VII | Array ,Math ,Dynamic Programming ,Game Theory | Medium | Weekly Contest 219 |
1691 | Maximum Height by Stacking Cuboids | Array ,Dynamic Programming ,Sorting | Hard | Weekly Contest 219 |
1692 | Count Ways to Distribute Candies | Dynamic Programming | Hard | ???? |
1693 | Daily Leads and Partners | Database | Easy | |
1694 | Reformat Phone Number | String | Easy | Weekly Contest 220 |
1695 | Maximum Erasure Value | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 220 |
1696 | Jump Game VI | Queue ,Array ,Dynamic Programming ,Monotonic Queue ,Heap (Priority Queue) | Medium | Weekly Contest 220 |
1697 | Checking Existence of Edge Length Limited Paths | Union Find ,Graph ,Array ,Two Pointers ,Sorting | Hard | Weekly Contest 220 |
1698 | Number of Distinct Substrings in a String | Trie ,String ,Suffix Array ,Hash Function ,Rolling Hash | Medium | ???? |
1699 | Number of Calls Between Two Persons | Database | Medium | ???? |
1700 | Number of Students Unable to Eat Lunch | Stack ,Queue ,Array ,Simulation | Easy | Biweekly Contest 42 |
1701 | Average Waiting Time | Array ,Simulation | Medium | Biweekly Contest 42 |
1702 | Maximum Binary String After Change | Greedy ,String | Medium | Biweekly Contest 42 |
1703 | Minimum Adjacent Swaps for K Consecutive Ones | Greedy ,Array ,Prefix Sum ,Sliding Window | Hard | Biweekly Contest 42 |
1704 | Determine if String Halves Are Alike | String ,Counting | Easy | Weekly Contest 221 |
1705 | Maximum Number of Eaten Apples | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 221 |
1706 | Where Will the Ball Fall | Array ,Matrix ,Simulation | Medium | Weekly Contest 221 |
1707 | Maximum XOR With an Element From Array | Bit Manipulation ,Trie ,Array | Hard | Weekly Contest 221 |
1708 | Largest Subarray Length K | Greedy ,Array | Easy | ???? |
1709 | Biggest Window Between Visits | Database | Medium | ???? |
1710 | Maximum Units on a Truck | Greedy ,Array ,Sorting | Easy | Weekly Contest 222 |
1711 | Count Good Meals | Array ,Hash Table | Medium | Weekly Contest 222 |
1712 | Ways to Split Array Into Three Subarrays | Array ,Two Pointers ,Binary Search ,Prefix Sum | Medium | Weekly Contest 222 |
1713 | Minimum Operations to Make a Subsequence | Greedy ,Array ,Hash Table ,Binary Search | Hard | Weekly Contest 222 |
1714 | Sum Of Special Evenly-Spaced Elements In Array | Array ,Dynamic Programming | Hard | ???? |
1715 | Count Apples and Oranges | Database | Medium | ???? |
1716 | Calculate Money in Leetcode Bank | Math | Easy | Biweekly Contest 43 |
1717 | Maximum Score From Removing Substrings | Stack ,Greedy ,String | Medium | Biweekly Contest 43 |
1718 | Construct the Lexicographically Largest Valid Sequence | Array ,Backtracking | Medium | Biweekly Contest 43 |
1719 | Number Of Ways To Reconstruct A Tree | Tree ,Graph | Hard | Biweekly Contest 43 |
1720 | Decode XORed Array | Bit Manipulation ,Array | Easy | Weekly Contest 223 |
1721 | Swapping Nodes in a Linked List | Linked List ,Two Pointers | Medium | Weekly Contest 223 |
1722 | Minimize Hamming Distance After Swap Operations | Depth-First Search ,Union Find ,Array | Medium | Weekly Contest 223 |
1723 | Find Minimum Time to Finish All Jobs | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Hard | Weekly Contest 223 |
1724 | Checking Existence of Edge Length Limited Paths II | Union Find ,Graph ,Minimum Spanning Tree | Hard | ???? |
1725 | Number Of Rectangles That Can Form The Largest Square | Array | Easy | Weekly Contest 224 |
1726 | Tuple with Same Product | Array ,Hash Table ,Counting | Medium | Weekly Contest 224 |
1727 | Largest Submatrix With Rearrangements | Greedy ,Array ,Matrix ,Sorting | Medium | Weekly Contest 224 |
1728 | Cat and Mouse II | Graph ,Topological Sort ,Memoization ,Array ,Math ,Dynamic Programming ,Game Theory ,Matrix | Hard | Weekly Contest 224 |
1729 | Find Followers Count | Database | Easy | |
1730 | Shortest Path to Get Food | Breadth-First Search ,Array ,Matrix | Medium | ???? |
1731 | The Number of Employees Which Report to Each Employee | Database | Easy | |
1732 | Find the Highest Altitude | Array ,Prefix Sum | Easy | Biweekly Contest 44 |
1733 | Minimum Number of People to Teach | Greedy ,Array ,Hash Table | Medium | Biweekly Contest 44 |
1734 | Decode XORed Permutation | Bit Manipulation ,Array | Medium | Biweekly Contest 44 |
1735 | Count Ways to Make Array With Product | Array ,Math ,Dynamic Programming ,Combinatorics ,Number Theory | Hard | Biweekly Contest 44 |
1736 | Latest Time by Replacing Hidden Digits | Greedy ,String | Easy | Weekly Contest 225 |
1737 | Change Minimum Characters to Satisfy One of Three Conditions | Hash Table ,String ,Counting ,Prefix Sum | Medium | Weekly Contest 225 |
1738 | Find Kth Largest XOR Coordinate Value | Bit Manipulation ,Array ,Divide and Conquer ,Matrix ,Prefix Sum ,Quickselect ,Heap (Priority Queue) | Medium | Weekly Contest 225 |
1739 | Building Boxes | Greedy ,Math ,Binary Search | Hard | Weekly Contest 225 |
1740 | Find Distance in a Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | ???? |
1741 | Find Total Time Spent by Each Employee | Database | Easy | |
1742 | Maximum Number of Balls in a Box | Hash Table ,Math ,Counting | Easy | Weekly Contest 226 |
1743 | Restore the Array From Adjacent Pairs | Array ,Hash Table | Medium | Weekly Contest 226 |
1744 | Can You Eat Your Favorite Candy on Your Favorite Day | Array ,Prefix Sum | Medium | Weekly Contest 226 |
1745 | Palindrome Partitioning IV | String ,Dynamic Programming | Hard | Weekly Contest 226 |
1746 | Maximum Subarray Sum After One Operation | Array ,Dynamic Programming | Medium | ???? |
1747 | Leetflex Banned Accounts | Database | Medium | ???? |
1748 | Sum of Unique Elements | Array ,Hash Table ,Counting | Easy | Biweekly Contest 45 |
1749 | Maximum Absolute Sum of Any Subarray | Array ,Dynamic Programming | Medium | Biweekly Contest 45 |
1750 | Minimum Length of String After Deleting Similar Ends | Two Pointers ,String | Medium | Biweekly Contest 45 |
1751 | Maximum Number of Events That Can Be Attended II | Array ,Binary Search ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 45 |
1752 | Check if Array Is Sorted and Rotated | Array | Easy | Weekly Contest 227 |
1753 | Maximum Score From Removing Stones | Greedy ,Math ,Heap (Priority Queue) | Medium | Weekly Contest 227 |
1754 | Largest Merge Of Two Strings | Greedy ,Two Pointers ,String | Medium | Weekly Contest 227 |
1755 | Closest Subsequence Sum | Bit Manipulation ,Array ,Two Pointers ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 227 |
1756 | Design Most Recently Used Queue | Stack ,Design ,Binary Indexed Tree ,Array ,Hash Table ,Ordered Set | Medium | ???? |
1757 | Recyclable and Low Fat Products | Database | Easy | |
1758 | Minimum Changes To Make Alternating Binary String | String | Easy | Weekly Contest 228 |
1759 | Count Number of Homogenous Substrings | Math ,String | Medium | Weekly Contest 228 |
1760 | Minimum Limit of Balls in a Bag | Array ,Binary Search | Medium | Weekly Contest 228 |
1761 | Minimum Degree of a Connected Trio in a Graph | Graph | Hard | Weekly Contest 228 |
1762 | Buildings With an Ocean View | Stack ,Array ,Monotonic Stack | Medium | ???? |
1763 | Longest Nice Substring | Bit Manipulation ,Hash Table ,String ,Divide and Conquer ,Sliding Window | Easy | Biweekly Contest 46 |
1764 | Form Array by Concatenating Subarrays of Another Array | Greedy ,Array ,String Matching | Medium | Biweekly Contest 46 |
1765 | Map of Highest Peak | Breadth-First Search ,Array ,Matrix | Medium | Biweekly Contest 46 |
1766 | Tree of Coprimes | Tree ,Depth-First Search ,Breadth-First Search ,Math | Hard | Biweekly Contest 46 |
1767 | Find the Subtasks That Did Not Execute | Database | Hard | ???? |
1768 | Merge Strings Alternately | Two Pointers ,String | Easy | Weekly Contest 229 |
1769 | Minimum Number of Operations to Move All Balls to Each Box | Array ,String | Medium | Weekly Contest 229 |
1770 | Maximum Score from Performing Multiplication Operations | Array ,Dynamic Programming | Hard | Weekly Contest 229 |
1771 | Maximize Palindrome Length From Subsequences | String ,Dynamic Programming | Hard | Weekly Contest 229 |
1772 | Sort Features by Popularity | Array ,Hash Table ,String ,Sorting | Medium | ???? |
1773 | Count Items Matching a Rule | Array ,String | Easy | Weekly Contest 230 |
1774 | Closest Dessert Cost | Array ,Dynamic Programming ,Backtracking | Medium | Weekly Contest 230 |
1775 | Equal Sum Arrays With Minimum Number of Operations | Greedy ,Array ,Hash Table ,Counting | Medium | Weekly Contest 230 |
1776 | Car Fleet II | Stack ,Array ,Math ,Monotonic Stack ,Heap (Priority Queue) | Hard | Weekly Contest 230 |
1777 | Product's Price for Each Store | Database | Easy | ???? |
1778 | Shortest Path in a Hidden Grid | Depth-First Search ,Breadth-First Search ,Graph ,Interactive | Medium | ???? |
1779 | Find Nearest Point That Has the Same X or Y Coordinate | Array | Easy | Biweekly Contest 47 |
1780 | Check if Number is a Sum of Powers of Three | Math | Medium | Biweekly Contest 47 |
1781 | Sum of Beauty of All Substrings | Hash Table ,String ,Counting | Medium | Biweekly Contest 47 |
1782 | Count Pairs Of Nodes | Graph ,Array ,Two Pointers ,Binary Search ,Sorting | Hard | Biweekly Contest 47 |
1783 | Grand Slam Titles | Database | Medium | ???? |
1784 | Check if Binary String Has at Most One Segment of Ones | String | Easy | Weekly Contest 231 |
1785 | Minimum Elements to Add to Form a Given Sum | Greedy ,Array | Medium | Weekly Contest 231 |
1786 | Number of Restricted Paths From First to Last Node | Graph ,Topological Sort ,Dynamic Programming ,Shortest Path ,Heap (Priority Queue) | Medium | Weekly Contest 231 |
1787 | Make the XOR of All Segments Equal to Zero | Bit Manipulation ,Array ,Dynamic Programming | Hard | Weekly Contest 231 |
1788 | Maximize the Beauty of the Garden | Greedy ,Array ,Prefix Sum | Hard | ???? |
1789 | Primary Department for Each Employee | Database | Easy | |
1790 | Check if One String Swap Can Make Strings Equal | Hash Table ,String ,Counting | Easy | Weekly Contest 232 |
1791 | Find Center of Star Graph | Graph | Easy | Weekly Contest 232 |
1792 | Maximum Average Pass Ratio | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 232 |
1793 | Maximum Score of a Good Subarray | Stack ,Array ,Two Pointers ,Binary Search ,Monotonic Stack | Hard | Weekly Contest 232 |
1794 | Count Pairs of Equal Substrings With Minimum Difference | Greedy ,Hash Table ,String | Medium | ???? |
1795 | Rearrange Products Table | Database | Easy | |
1796 | Second Largest Digit in a String | Hash Table ,String | Easy | Biweekly Contest 48 |
1797 | Design Authentication Manager | Design ,Hash Table | Medium | Biweekly Contest 48 |
1798 | Maximum Number of Consecutive Values You Can Make | Greedy ,Array ,Sorting | Medium | Biweekly Contest 48 |
1799 | Maximize Score After N Operations | Bit Manipulation ,Array ,Math ,Dynamic Programming ,Backtracking ,Bitmask ,Number Theory | Hard | Biweekly Contest 48 |
1800 | Maximum Ascending Subarray Sum | Array | Easy | Weekly Contest 233 |
1801 | Number of Orders in the Backlog | Array ,Simulation ,Heap (Priority Queue) | Medium | Weekly Contest 233 |
1802 | Maximum Value at a Given Index in a Bounded Array | Greedy ,Binary Search | Medium | Weekly Contest 233 |
1803 | Count Pairs With XOR in a Range | Bit Manipulation ,Trie ,Array | Hard | Weekly Contest 233 |
1804 | Implement Trie II (Prefix Tree) | Design ,Trie ,Hash Table ,String | Medium | ???? |
1805 | Number of Different Integers in a String | Hash Table ,String | Easy | Weekly Contest 234 |
1806 | Minimum Number of Operations to Reinitialize a Permutation | Array ,Math ,Simulation | Medium | Weekly Contest 234 |
1807 | Evaluate the Bracket Pairs of a String | Array ,Hash Table ,String | Medium | Weekly Contest 234 |
1808 | Maximize Number of Nice Divisors | Recursion ,Math | Hard | Weekly Contest 234 |
1809 | Ad-Free Sessions | Database | Easy | ???? |
1810 | Minimum Path Cost in a Hidden Grid | Depth-First Search ,Breadth-First Search ,Graph ,Interactive ,Heap (Priority Queue) | Medium | ???? |
1811 | Find Interview Candidates | Database | Medium | ???? |
1812 | Determine Color of a Chessboard Square | Math ,String | Easy | Biweekly Contest 49 |
1813 | Sentence Similarity III | Array ,Two Pointers ,String | Medium | Biweekly Contest 49 |
1814 | Count Nice Pairs in an Array | Array ,Hash Table ,Math ,Counting | Medium | Biweekly Contest 49 |
1815 | Maximum Number of Groups Getting Fresh Donuts | Bit Manipulation ,Memoization ,Array ,Dynamic Programming ,Bitmask | Hard | Biweekly Contest 49 |
1816 | Truncate Sentence | Array ,String | Easy | Weekly Contest 235 |
1817 | Finding the Users Active Minutes | Array ,Hash Table | Medium | Weekly Contest 235 |
1818 | Minimum Absolute Sum Difference | Array ,Binary Search ,Ordered Set ,Sorting | Medium | Weekly Contest 235 |
1819 | Number of Different Subsequences GCDs | Array ,Math ,Counting ,Number Theory | Hard | Weekly Contest 235 |
1820 | Maximum Number of Accepted Invitations | Array ,Backtracking ,Matrix | Medium | ???? |
1821 | Find Customers With Positive Revenue this Year | Database | Easy | ???? |
1822 | Sign of the Product of an Array | Array ,Math | Easy | Weekly Contest 236 |
1823 | Find the Winner of the Circular Game | Recursion ,Queue ,Array ,Math ,Simulation | Medium | Weekly Contest 236 |
1824 | Minimum Sideway Jumps | Greedy ,Array ,Dynamic Programming | Medium | Weekly Contest 236 |
1825 | Finding MK Average | Design ,Queue ,Data Stream ,Ordered Set ,Heap (Priority Queue) | Hard | Weekly Contest 236 |
1826 | Faulty Sensor | Array ,Two Pointers | Easy | ???? |
1827 | Minimum Operations to Make the Array Increasing | Greedy ,Array | Easy | Biweekly Contest 50 |
1828 | Queries on Number of Points Inside a Circle | Geometry ,Array ,Math | Medium | Biweekly Contest 50 |
1829 | Maximum XOR for Each Query | Bit Manipulation ,Array ,Prefix Sum | Medium | Biweekly Contest 50 |
1830 | Minimum Number of Operations to Make String Sorted | Math ,String ,Combinatorics | Hard | Biweekly Contest 50 |
1831 | Maximum Transaction Each Day | Database | Medium | ???? |
1832 | Check if the Sentence Is Pangram | Hash Table ,String | Easy | Weekly Contest 237 |
1833 | Maximum Ice Cream Bars | Greedy ,Array ,Sorting | Medium | Weekly Contest 237 |
1834 | Single-Threaded CPU | Array ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 237 |
1835 | Find XOR Sum of All Pairs Bitwise AND | Bit Manipulation ,Array ,Math | Hard | Weekly Contest 237 |
1836 | Remove Duplicates From an Unsorted Linked List | Hash Table ,Linked List | Medium | ???? |
1837 | Sum of Digits in Base K | Math | Easy | Weekly Contest 238 |
1838 | Frequency of the Most Frequent Element | Greedy ,Array ,Binary Search ,Prefix Sum ,Sorting ,Sliding Window | Medium | Weekly Contest 238 |
1839 | Longest Substring Of All Vowels in Order | String ,Sliding Window | Medium | Weekly Contest 238 |
1840 | Maximum Building Height | Array ,Math | Hard | Weekly Contest 238 |
1841 | League Statistics | Database | Medium | ???? |
1842 | Next Palindrome Using Same Digits | Two Pointers ,String | Hard | ???? |
1843 | Suspicious Bank Accounts | Database | Medium | ???? |
1844 | Replace All Digits with Characters | String | Easy | Biweekly Contest 51 |
1845 | Seat Reservation Manager | Design ,Heap (Priority Queue) | Medium | Biweekly Contest 51 |
1846 | Maximum Element After Decreasing and Rearranging | Greedy ,Array ,Sorting | Medium | Biweekly Contest 51 |
1847 | Closest Room | Array ,Binary Search ,Sorting | Hard | Biweekly Contest 51 |
1848 | Minimum Distance to the Target Element | Array | Easy | Weekly Contest 239 |
1849 | Splitting a String Into Descending Consecutive Values | String ,Backtracking | Medium | Weekly Contest 239 |
1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | Greedy ,Two Pointers ,String | Medium | Weekly Contest 239 |
1851 | Minimum Interval to Include Each Query | Array ,Binary Search ,Sorting ,Line Sweep ,Heap (Priority Queue) | Hard | Weekly Contest 239 |
1852 | Distinct Numbers in Each Subarray | Array ,Hash Table ,Sliding Window | Medium | ???? |
1853 | Convert Date Format | Database | Easy | ???? |
1854 | Maximum Population Year | Array ,Counting ,Prefix Sum | Easy | Weekly Contest 240 |
1855 | Maximum Distance Between a Pair of Values | Array ,Two Pointers ,Binary Search | Medium | Weekly Contest 240 |
1856 | Maximum Subarray Min-Product | Stack ,Array ,Prefix Sum ,Monotonic Stack | Medium | Weekly Contest 240 |
1857 | Largest Color Value in a Directed Graph | Graph ,Topological Sort ,Memoization ,Hash Table ,Dynamic Programming ,Counting | Hard | Weekly Contest 240 |
1858 | Longest Word With All Prefixes | Depth-First Search ,Trie | Medium | ???? |
1859 | Sorting the Sentence | String ,Sorting | Easy | Biweekly Contest 52 |
1860 | Incremental Memory Leak | Math ,Simulation | Medium | Biweekly Contest 52 |
1861 | Rotating the Box | Array ,Two Pointers ,Matrix | Medium | Biweekly Contest 52 |
1862 | Sum of Floored Pairs | Array ,Math ,Binary Search ,Prefix Sum | Hard | Biweekly Contest 52 |
1863 | Sum of All Subset XOR Totals | Bit Manipulation ,Array ,Math ,Backtracking ,Combinatorics | Easy | Weekly Contest 241 |
1864 | Minimum Number of Swaps to Make the Binary String Alternating | Greedy ,String | Medium | Weekly Contest 241 |
1865 | Finding Pairs With a Certain Sum | Design ,Array ,Hash Table | Medium | Weekly Contest 241 |
1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | Math ,Dynamic Programming ,Combinatorics | Hard | Weekly Contest 241 |
1867 | Orders With Maximum Quantity Above Average | Database | Medium | ???? |
1868 | Product of Two Run-Length Encoded Arrays | Array ,Two Pointers | Medium | ???? |
1869 | Longer Contiguous Segments of Ones than Zeros | String | Easy | Weekly Contest 242 |
1870 | Minimum Speed to Arrive on Time | Array ,Binary Search | Medium | Weekly Contest 242 |
1871 | Jump Game VII | String ,Dynamic Programming ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 242 |
1872 | Stone Game VIII | Array ,Math ,Dynamic Programming ,Game Theory ,Prefix Sum | Hard | Weekly Contest 242 |
1873 | Calculate Special Bonus | Database | Easy | |
1874 | Minimize Product Sum of Two Arrays | Greedy ,Array ,Sorting | Medium | ???? |
1875 | Group Employees of the Same Salary | Database | Medium | ???? |
1876 | Substrings of Size Three with Distinct Characters | Hash Table ,String ,Counting ,Sliding Window | Easy | Biweekly Contest 53 |
1877 | Minimize Maximum Pair Sum in Array | Greedy ,Array ,Two Pointers ,Sorting | Medium | Biweekly Contest 53 |
1878 | Get Biggest Three Rhombus Sums in a Grid | Array ,Math ,Matrix ,Prefix Sum ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 53 |
1879 | Minimum XOR Sum of Two Arrays | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | Biweekly Contest 53 |
1880 | Check if Word Equals Summation of Two Words | String | Easy | Weekly Contest 243 |
1881 | Maximum Value after Insertion | Greedy ,String | Medium | Weekly Contest 243 |
1882 | Process Tasks Using Servers | Array ,Heap (Priority Queue) | Medium | Weekly Contest 243 |
1883 | Minimum Skips to Arrive at Meeting On Time | Array ,Dynamic Programming | Hard | Weekly Contest 243 |
1884 | Egg Drop With 2 Eggs and N Floors | Math ,Dynamic Programming | Medium | |
1885 | Count Pairs in Two Arrays | Array ,Two Pointers ,Binary Search ,Sorting | Medium | ???? |
1886 | Determine Whether Matrix Can Be Obtained By Rotation | Array ,Matrix | Easy | Weekly Contest 244 |
1887 | Reduction Operations to Make the Array Elements Equal | Array ,Sorting | Medium | Weekly Contest 244 |
1888 | Minimum Number of Flips to Make the Binary String Alternating | Greedy ,String ,Dynamic Programming ,Sliding Window | Medium | Weekly Contest 244 |
1889 | Minimum Space Wasted From Packaging | Array ,Binary Search ,Prefix Sum ,Sorting | Hard | Weekly Contest 244 |
1890 | The Latest Login in 2020 | Database | Easy | |
1891 | Cutting Ribbons | Array ,Binary Search | Medium | ???? |
1892 | Page Recommendations II | Database | Hard | ???? |
1893 | Check if All the Integers in a Range Are Covered | Array ,Hash Table ,Prefix Sum | Easy | Biweekly Contest 54 |
1894 | Find the Student that Will Replace the Chalk | Array ,Binary Search ,Prefix Sum ,Simulation | Medium | Biweekly Contest 54 |
1895 | Largest Magic Square | Array ,Matrix ,Prefix Sum | Medium | Biweekly Contest 54 |
1896 | Minimum Cost to Change the Final Value of Expression | Stack ,Math ,String ,Dynamic Programming | Hard | Biweekly Contest 54 |
1897 | Redistribute Characters to Make All Strings Equal | Hash Table ,String ,Counting | Easy | Weekly Contest 245 |
1898 | Maximum Number of Removable Characters | Array ,Two Pointers ,String ,Binary Search | Medium | Weekly Contest 245 |
1899 | Merge Triplets to Form Target Triplet | Greedy ,Array | Medium | Weekly Contest 245 |
1900 | The Earliest and Latest Rounds Where Players Compete | Memoization ,Dynamic Programming | Hard | Weekly Contest 245 |
1901 | Find a Peak Element II | Array ,Binary Search ,Matrix | Medium | |
1902 | Depth of BST Given Insertion Order | Tree ,Binary Search Tree ,Binary Tree ,Ordered Set | Medium | ???? |
1903 | Largest Odd Number in String | Greedy ,Math ,String | Easy | Weekly Contest 246 |
1904 | The Number of Full Rounds You Have Played | Math ,String | Medium | Weekly Contest 246 |
1905 | Count Sub Islands | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Weekly Contest 246 |
1906 | Minimum Absolute Difference Queries | Array ,Hash Table | Medium | Weekly Contest 246 |
1907 | Count Salary Categories | Database | Medium | |
1908 | Game of Nim | Bit Manipulation ,Brainteaser ,Array ,Math ,Dynamic Programming ,Game Theory | Medium | ???? |
1909 | Remove One Element to Make the Array Strictly Increasing | Array | Easy | Biweekly Contest 55 |
1910 | Remove All Occurrences of a Substring | String | Medium | Biweekly Contest 55 |
1911 | Maximum Alternating Subsequence Sum | Array ,Dynamic Programming | Medium | Biweekly Contest 55 |
1912 | Design Movie Rental System | Design ,Array ,Hash Table ,Ordered Set ,Heap (Priority Queue) | Hard | Biweekly Contest 55 |
1913 | Maximum Product Difference Between Two Pairs | Array ,Sorting | Easy | Weekly Contest 247 |
1914 | Cyclically Rotating a Grid | Array ,Matrix ,Simulation | Medium | Weekly Contest 247 |
1915 | Number of Wonderful Substrings | Bit Manipulation ,Hash Table ,String ,Prefix Sum | Medium | Weekly Contest 247 |
1916 | Count Ways to Build Rooms in an Ant Colony | Tree ,Graph ,Topological Sort ,Math ,Dynamic Programming ,Combinatorics | Hard | Weekly Contest 247 |
1917 | Leetcodify Friends Recommendations | Database | Hard | ???? |
1918 | Kth Smallest Subarray Sum | Array ,Binary Search ,Sliding Window | Medium | ???? |
1919 | Leetcodify Similar Friends | Database | Hard | ???? |
1920 | Build Array from Permutation | Array ,Simulation | Easy | Weekly Contest 248 |
1921 | Eliminate Maximum Number of Monsters | Greedy ,Array ,Sorting | Medium | Weekly Contest 248 |
1922 | Count Good Numbers | Recursion ,Math | Medium | Weekly Contest 248 |
1923 | Longest Common Subpath | Array ,Binary Search ,Suffix Array ,Hash Function ,Rolling Hash | Hard | Weekly Contest 248 |
1924 | Erect the Fence II | Geometry ,Array ,Math | Hard | ???? |
1925 | Count Square Sum Triples | Math ,Enumeration | Easy | Biweekly Contest 56 |
1926 | Nearest Exit from Entrance in Maze | Breadth-First Search ,Array ,Matrix | Medium | Biweekly Contest 56 |
1927 | Sum Game | Greedy ,Math ,String ,Game Theory | Medium | Biweekly Contest 56 |
1928 | Minimum Cost to Reach Destination in Time | Graph ,Dynamic Programming | Hard | Biweekly Contest 56 |
1929 | Concatenation of Array | Array ,Simulation | Easy | Weekly Contest 249 |
1930 | Unique Length-3 Palindromic Subsequences | Bit Manipulation ,Hash Table ,String ,Prefix Sum | Medium | Weekly Contest 249 |
1931 | Painting a Grid With Three Different Colors | Dynamic Programming | Hard | Weekly Contest 249 |
1932 | Merge BSTs to Create Single BST | Tree ,Depth-First Search ,Hash Table ,Binary Search ,Binary Tree | Hard | Weekly Contest 249 |
1933 | Check if String Is Decomposable Into Value-Equal Substrings | String | Easy | ???? |
1934 | Confirmation Rate | Database | Medium | |
1935 | Maximum Number of Words You Can Type | Hash Table ,String | Easy | Weekly Contest 250 |
1936 | Add Minimum Number of Rungs | Greedy ,Array | Medium | Weekly Contest 250 |
1937 | Maximum Number of Points with Cost | Array ,Dynamic Programming | Medium | Weekly Contest 250 |
1938 | Maximum Genetic Difference Query | Bit Manipulation ,Trie ,Array | Hard | Weekly Contest 250 |
1939 | Users That Actively Request Confirmation Messages | Database | Easy | ???? |
1940 | Longest Common Subsequence Between Sorted Arrays | Array ,Hash Table ,Counting | Medium | ???? |
1941 | Check if All Characters Have Equal Number of Occurrences | Hash Table ,String ,Counting | Easy | Biweekly Contest 57 |
1942 | The Number of the Smallest Unoccupied Chair | Array ,Hash Table ,Heap (Priority Queue) | Medium | Biweekly Contest 57 |
1943 | Describe the Painting | Array ,Hash Table ,Prefix Sum ,Sorting | Medium | Biweekly Contest 57 |
1944 | Number of Visible People in a Queue | Stack ,Array ,Monotonic Stack | Hard | Biweekly Contest 57 |
1945 | Sum of Digits of String After Convert | String ,Simulation | Easy | Weekly Contest 251 |
1946 | Largest Number After Mutating Substring | Greedy ,Array ,String | Medium | Weekly Contest 251 |
1947 | Maximum Compatibility Score Sum | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | Weekly Contest 251 |
1948 | Delete Duplicate Folders in System | Trie ,Array ,Hash Table ,String ,Hash Function | Hard | Weekly Contest 251 |
1949 | Strong Friendship | Database | Medium | ???? |
1950 | Maximum of Minimum Values in All Subarrays | Stack ,Array ,Monotonic Stack | Medium | ???? |
1951 | All the Pairs With the Maximum Number of Common Followers | Database | Medium | ???? |
1952 | Three Divisors | Math ,Enumeration ,Number Theory | Easy | Weekly Contest 252 |
1953 | Maximum Number of Weeks for Which You Can Work | Greedy ,Array | Medium | Weekly Contest 252 |
1954 | Minimum Garden Perimeter to Collect Enough Apples | Math ,Binary Search | Medium | Weekly Contest 252 |
1955 | Count Number of Special Subsequences | Array ,Dynamic Programming | Hard | Weekly Contest 252 |
1956 | Minimum Time For K Virus Variants to Spread | Geometry ,Array ,Math ,Binary Search ,Enumeration | Hard | ???? |
1957 | Delete Characters to Make Fancy String | String | Easy | Biweekly Contest 58 |
1958 | Check if Move is Legal | Array ,Enumeration ,Matrix | Medium | Biweekly Contest 58 |
1959 | Minimum Total Space Wasted With K Resizing Operations | Array ,Dynamic Programming | Medium | Biweekly Contest 58 |
1960 | Maximum Product of the Length of Two Palindromic Substrings | String ,Hash Function ,Rolling Hash | Hard | Biweekly Contest 58 |
1961 | Check If String Is a Prefix of Array | Array ,Two Pointers ,String | Easy | Weekly Contest 253 |
1962 | Remove Stones to Minimize the Total | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 253 |
1963 | Minimum Number of Swaps to Make the String Balanced | Stack ,Greedy ,Two Pointers ,String | Medium | Weekly Contest 253 |
1964 | Find the Longest Valid Obstacle Course at Each Position | Binary Indexed Tree ,Array ,Binary Search | Hard | Weekly Contest 253 |
1965 | Employees With Missing Information | Database | Easy | |
1966 | Binary Searchable Numbers in an Unsorted Array | Array ,Binary Search | Medium | ???? |
1967 | Number of Strings That Appear as Substrings in Word | String | Easy | Weekly Contest 254 |
1968 | Array With Elements Not Equal to Average of Neighbors | Greedy ,Array ,Sorting | Medium | Weekly Contest 254 |
1969 | Minimum Non-Zero Product of the Array Elements | Greedy ,Recursion ,Math | Medium | Weekly Contest 254 |
1970 | Last Day Where You Can Still Cross | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Binary Search ,Matrix | Hard | Weekly Contest 254 |
1971 | Find if Path Exists in Graph | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Easy | |
1972 | First and Last Call On the Same Day | Database | Hard | ???? |
1973 | Count Nodes Equal to Sum of Descendants | Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
1974 | Minimum Time to Type Word Using Special Typewriter | Greedy ,String | Easy | Biweekly Contest 59 |
1975 | Maximum Matrix Sum | Greedy ,Array ,Matrix | Medium | Biweekly Contest 59 |
1976 | Number of Ways to Arrive at Destination | Graph ,Topological Sort ,Dynamic Programming ,Shortest Path | Medium | Biweekly Contest 59 |
1977 | Number of Ways to Separate Numbers | String ,Dynamic Programming ,Suffix Array | Hard | Biweekly Contest 59 |
1978 | Employees Whose Manager Left the Company | Database | Easy | |
1979 | Find Greatest Common Divisor of Array | Array ,Math ,Number Theory | Easy | Weekly Contest 255 |
1980 | Find Unique Binary String | Array ,Hash Table ,String ,Backtracking | Medium | Weekly Contest 255 |
1981 | Minimize the Difference Between Target and Chosen Elements | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 255 |
1982 | Find Array Given Subset Sums | Array ,Divide and Conquer | Hard | Weekly Contest 255 |
1983 | Widest Pair of Indices With Equal Range Sum | Array ,Hash Table ,Prefix Sum | Medium | ???? |
1984 | Minimum Difference Between Highest and Lowest of K Scores | Array ,Sorting ,Sliding Window | Easy | Weekly Contest 256 |
1985 | Find the Kth Largest Integer in the Array | Array ,String ,Divide and Conquer ,Quickselect ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 256 |
1986 | Minimum Number of Work Sessions to Finish the Tasks | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | Weekly Contest 256 |
1987 | Number of Unique Good Subsequences | String ,Dynamic Programming | Hard | Weekly Contest 256 |
1988 | Find Cutoff Score for Each School | Database | Medium | ???? |
1989 | Maximum Number of People That Can Be Caught in Tag | Greedy ,Array | Medium | ???? |
1990 | Count the Number of Experiments | Database | Medium | ???? |
1991 | Find the Middle Index in Array | Array ,Prefix Sum | Easy | Biweekly Contest 60 |
1992 | Find All Groups of Farmland | Depth-First Search ,Breadth-First Search ,Array ,Matrix | Medium | Biweekly Contest 60 |
1993 | Operations on Tree | Tree ,Depth-First Search ,Breadth-First Search ,Design ,Array ,Hash Table | Medium | Biweekly Contest 60 |
1994 | The Number of Good Subsets | Bit Manipulation ,Array ,Math ,Dynamic Programming ,Bitmask | Hard | Biweekly Contest 60 |
1995 | Count Special Quadruplets | Array ,Enumeration | Easy | Weekly Contest 257 |
1996 | The Number of Weak Characters in the Game | Stack ,Greedy ,Array ,Sorting ,Monotonic Stack | Medium | Weekly Contest 257 |
1997 | First Day Where You Have Been in All the Rooms | Array ,Dynamic Programming | Medium | Weekly Contest 257 |
1998 | GCD Sort of an Array | Union Find ,Array ,Math ,Number Theory ,Sorting | Hard | Weekly Contest 257 |
1999 | Smallest Greater Multiple Made of Two Digits | Math ,Enumeration | Medium | ???? |
2000 | Reverse Prefix of Word | Two Pointers ,String | Easy | Weekly Contest 258 |
2001 | Number of Pairs of Interchangeable Rectangles | Array ,Hash Table ,Math ,Counting ,Number Theory | Medium | Weekly Contest 258 |
2002 | Maximum Product of the Length of Two Palindromic Subsequences | Bit Manipulation ,String ,Dynamic Programming ,Backtracking ,Bitmask | Medium | Weekly Contest 258 |
2003 | Smallest Missing Genetic Value in Each Subtree | Tree ,Depth-First Search ,Union Find ,Dynamic Programming | Hard | Weekly Contest 258 |
2004 | The Number of Seniors and Juniors to Join the Company | Database | Hard | ???? |
2005 | Subtree Removal Game with Fibonacci Tree | Tree ,Math ,Dynamic Programming ,Binary Tree ,Game Theory | Hard | ???? |
2006 | Count Number of Pairs With Absolute Difference K | Array ,Hash Table ,Counting | Easy | Biweekly Contest 61 |
2007 | Find Original Array From Doubled Array | Greedy ,Array ,Hash Table ,Sorting | Medium | Biweekly Contest 61 |
2008 | Maximum Earnings From Taxi | Array ,Hash Table ,Binary Search ,Dynamic Programming ,Sorting | Medium | Biweekly Contest 61 |
2009 | Minimum Number of Operations to Make Array Continuous | Array ,Binary Search | Hard | Biweekly Contest 61 |
2010 | The Number of Seniors and Juniors to Join the Company II | Database | Hard | ???? |
2011 | Final Value of Variable After Performing Operations | Array ,String ,Simulation | Easy | Weekly Contest 259 |
2012 | Sum of Beauty in the Array | Array | Medium | Weekly Contest 259 |
2013 | Detect Squares | Design ,Array ,Hash Table ,Counting | Medium | Weekly Contest 259 |
2014 | Longest Subsequence Repeated k Times | Greedy ,String ,Backtracking ,Counting ,Enumeration | Hard | Weekly Contest 259 |
2015 | Average Height of Buildings in Each Segment | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Medium | ???? |
2016 | Maximum Difference Between Increasing Elements | Array | Easy | Weekly Contest 260 |
2017 | Grid Game | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 260 |
2018 | Check if Word Can Be Placed In Crossword | Array ,Enumeration ,Matrix | Medium | Weekly Contest 260 |
2019 | The Score of Students Solving Math Expression | Stack ,Memoization ,Array ,Math ,String ,Dynamic Programming | Hard | Weekly Contest 260 |
2020 | Number of Accounts That Did Not Stream | Database | Medium | ???? |
2021 | Brightest Position on Street | Array ,Ordered Set ,Prefix Sum | Medium | ???? |
2022 | Convert 1D Array Into 2D Array | Array ,Matrix ,Simulation | Easy | Biweekly Contest 62 |
2023 | Number of Pairs of Strings With Concatenation Equal to Target | Array ,Hash Table ,String ,Counting | Medium | Biweekly Contest 62 |
2024 | Maximize the Confusion of an Exam | String ,Binary Search ,Prefix Sum ,Sliding Window | Medium | Biweekly Contest 62 |
2025 | Maximum Number of Ways to Partition an Array | Array ,Hash Table ,Counting ,Enumeration ,Prefix Sum | Hard | Biweekly Contest 62 |
2026 | Low-Quality Problems | Database | Easy | ???? |
2027 | Minimum Moves to Convert String | Greedy ,String | Easy | Weekly Contest 261 |
2028 | Find Missing Observations | Array ,Math ,Simulation | Medium | Weekly Contest 261 |
2029 | Stone Game IX | Greedy ,Array ,Math ,Counting ,Game Theory | Medium | Weekly Contest 261 |
2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Stack ,Greedy ,String ,Monotonic Stack | Hard | Weekly Contest 261 |
2031 | Count Subarrays With More Ones Than Zeros | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Medium | ???? |
2032 | Two Out of Three | Bit Manipulation ,Array ,Hash Table | Easy | Weekly Contest 262 |
2033 | Minimum Operations to Make a Uni-Value Grid | Array ,Math ,Matrix ,Sorting | Medium | Weekly Contest 262 |
2034 | Stock Price Fluctuation | Design ,Hash Table ,Data Stream ,Ordered Set ,Heap (Priority Queue) | Medium | Weekly Contest 262 |
2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Bit Manipulation ,Array ,Two Pointers ,Binary Search ,Dynamic Programming ,Bitmask ,Ordered Set | Hard | Weekly Contest 262 |
2036 | Maximum Alternating Subarray Sum | Array ,Dynamic Programming | Medium | ???? |
2037 | Minimum Number of Moves to Seat Everyone | Greedy ,Array ,Sorting | Easy | Biweekly Contest 63 |
2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Greedy ,Math ,String ,Game Theory | Medium | Biweekly Contest 63 |
2039 | The Time When the Network Becomes Idle | Breadth-First Search ,Graph ,Array | Medium | Biweekly Contest 63 |
2040 | Kth Smallest Product of Two Sorted Arrays | Array ,Binary Search | Hard | Biweekly Contest 63 |
2041 | Accepted Candidates From the Interviews | Database | Medium | ???? |
2042 | Check if Numbers Are Ascending in a Sentence | String | Easy | Weekly Contest 263 |
2043 | Simple Bank System | Design ,Array ,Hash Table ,Simulation | Medium | Weekly Contest 263 |
2044 | Count Number of Maximum Bitwise-OR Subsets | Bit Manipulation ,Array ,Backtracking | Medium | Weekly Contest 263 |
2045 | Second Minimum Time to Reach Destination | Breadth-First Search ,Graph ,Shortest Path | Hard | Weekly Contest 263 |
2046 | Sort Linked List Already Sorted Using Absolute Values | Linked List ,Two Pointers ,Sorting | Medium | ???? |
2047 | Number of Valid Words in a Sentence | String | Easy | Weekly Contest 264 |
2048 | Next Greater Numerically Balanced Number | Math ,Backtracking ,Enumeration | Medium | Weekly Contest 264 |
2049 | Count Nodes With the Highest Score | Tree ,Depth-First Search ,Array ,Binary Tree | Medium | Weekly Contest 264 |
2050 | Parallel Courses III | Graph ,Topological Sort ,Array ,Dynamic Programming | Hard | Weekly Contest 264 |
2051 | The Category of Each Member in the Store | Database | Medium | ???? |
2052 | Minimum Cost to Separate Sentence Into Rows | Array ,Dynamic Programming | Medium | ???? |
2053 | Kth Distinct String in an Array | Array ,Hash Table ,String ,Counting | Easy | Biweekly Contest 64 |
2054 | Two Best Non-Overlapping Events | Array ,Binary Search ,Dynamic Programming ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 64 |
2055 | Plates Between Candles | Array ,String ,Binary Search ,Prefix Sum | Medium | Biweekly Contest 64 |
2056 | Number of Valid Move Combinations On Chessboard | Array ,String ,Backtracking ,Simulation | Hard | Biweekly Contest 64 |
2057 | Smallest Index With Equal Value | Array | Easy | Weekly Contest 265 |
2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Linked List | Medium | Weekly Contest 265 |
2059 | Minimum Operations to Convert Number | Breadth-First Search ,Array | Medium | Weekly Contest 265 |
2060 | Check if an Original String Exists Given Two Encoded Strings | String ,Dynamic Programming | Hard | Weekly Contest 265 |
2061 | Number of Spaces Cleaning Robot Cleaned | Array ,Matrix ,Simulation | Medium | ???? |
2062 | Count Vowel Substrings of a String | Hash Table ,String | Easy | Weekly Contest 266 |
2063 | Vowels of All Substrings | Math ,String ,Dynamic Programming ,Combinatorics | Medium | Weekly Contest 266 |
2064 | Minimized Maximum of Products Distributed to Any Store | Array ,Binary Search | Medium | Weekly Contest 266 |
2065 | Maximum Path Quality of a Graph | Graph ,Array ,Backtracking | Hard | Weekly Contest 266 |
2066 | Account Balance | Database | Medium | ???? |
2067 | Number of Equal Count Substrings | String ,Counting ,Prefix Sum | Medium | ???? |
2068 | Check Whether Two Strings are Almost Equivalent | Hash Table ,String ,Counting | Easy | Biweekly Contest 65 |
2069 | Walking Robot Simulation II | Design ,Simulation | Medium | Biweekly Contest 65 |
2070 | Most Beautiful Item for Each Query | Array ,Binary Search ,Sorting | Medium | Biweekly Contest 65 |
2071 | Maximum Number of Tasks You Can Assign | Greedy ,Queue ,Array ,Binary Search ,Sorting ,Monotonic Queue | Hard | Biweekly Contest 65 |
2072 | The Winner University | Database | Easy | ???? |
2073 | Time Needed to Buy Tickets | Queue ,Array ,Simulation | Easy | Weekly Contest 267 |
2074 | Reverse Nodes in Even Length Groups | Linked List | Medium | Weekly Contest 267 |
2075 | Decode the Slanted Ciphertext | String ,Simulation | Medium | Weekly Contest 267 |
2076 | Process Restricted Friend Requests | Union Find ,Graph | Hard | Weekly Contest 267 |
2077 | Paths in Maze That Lead to Same Room | Graph | Medium | ???? |
2078 | Two Furthest Houses With Different Colors | Greedy ,Array | Easy | Weekly Contest 268 |
2079 | Watering Plants | Array ,Simulation | Medium | Weekly Contest 268 |
2080 | Range Frequency Queries | Design ,Segment Tree ,Array ,Hash Table ,Binary Search | Medium | Weekly Contest 268 |
2081 | Sum of k-Mirror Numbers | Math ,Enumeration | Hard | Weekly Contest 268 |
2082 | The Number of Rich Customers | Database | Easy | ???? |
2083 | Substrings That Begin and End With the Same Letter | Hash Table ,Math ,String ,Counting ,Prefix Sum | Medium | ???? |
2084 | Drop Type 1 Orders for Customers With Type 0 Orders | Database | Medium | ???? |
2085 | Count Common Words With One Occurrence | Array ,Hash Table ,String ,Counting | Easy | Biweekly Contest 66 |
2086 | Minimum Number of Food Buckets to Feed the Hamsters | Greedy ,String ,Dynamic Programming | Medium | Biweekly Contest 66 |
2087 | Minimum Cost Homecoming of a Robot in a Grid | Greedy ,Array | Medium | Biweekly Contest 66 |
2088 | Count Fertile Pyramids in a Land | Array ,Dynamic Programming ,Matrix | Hard | Biweekly Contest 66 |
2089 | Find Target Indices After Sorting Array | Array ,Binary Search ,Sorting | Easy | Weekly Contest 269 |
2090 | K Radius Subarray Averages | Array ,Sliding Window | Medium | Weekly Contest 269 |
2091 | Removing Minimum and Maximum From Array | Greedy ,Array | Medium | Weekly Contest 269 |
2092 | Find All People With Secret | Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Sorting | Hard | Weekly Contest 269 |
2093 | Minimum Cost to Reach City With Discounts | Graph ,Shortest Path ,Heap (Priority Queue) | Medium | ???? |
2094 | Finding 3-Digit Even Numbers | Array ,Hash Table ,Enumeration ,Sorting | Easy | Weekly Contest 270 |
2095 | Delete the Middle Node of a Linked List | Linked List ,Two Pointers | Medium | Weekly Contest 270 |
2096 | Step-By-Step Directions From a Binary Tree Node to Another | Tree ,Depth-First Search ,String ,Binary Tree | Medium | Weekly Contest 270 |
2097 | Valid Arrangement of Pairs | Depth-First Search ,Graph ,Eulerian Circuit | Hard | Weekly Contest 270 |
2098 | Subsequence of Size K With the Largest Even Sum | Greedy ,Array ,Sorting | Medium | ???? |
2099 | Find Subsequence of Length K With the Largest Sum | Array ,Hash Table ,Sorting ,Heap (Priority Queue) | Easy | Biweekly Contest 67 |
2100 | Find Good Days to Rob the Bank | Array ,Dynamic Programming ,Prefix Sum | Medium | Biweekly Contest 67 |
2101 | Detonate the Maximum Bombs | Depth-First Search ,Breadth-First Search ,Graph ,Geometry ,Array ,Math | Medium | Biweekly Contest 67 |
2102 | Sequentially Ordinal Rank Tracker | Design ,Data Stream ,Ordered Set ,Heap (Priority Queue) | Hard | Biweekly Contest 67 |
2103 | Rings and Rods | Hash Table ,String | Easy | Weekly Contest 271 |
2104 | Sum of Subarray Ranges | Stack ,Array ,Monotonic Stack | Medium | Weekly Contest 271 |
2105 | Watering Plants II | Array ,Two Pointers ,Simulation | Medium | Weekly Contest 271 |
2106 | Maximum Fruits Harvested After at Most K Steps | Array ,Binary Search ,Prefix Sum ,Sliding Window | Hard | Weekly Contest 271 |
2107 | Number of Unique Flavors After Sharing K Candies | Array ,Hash Table ,Sliding Window | Medium | ???? |
2108 | Find First Palindromic String in the Array | Array ,Two Pointers ,String | Easy | Weekly Contest 272 |
2109 | Adding Spaces to a String | Array ,Two Pointers ,String ,Simulation | Medium | Weekly Contest 272 |
2110 | Number of Smooth Descent Periods of a Stock | Array ,Math ,Dynamic Programming | Medium | Weekly Contest 272 |
2111 | Minimum Operations to Make the Array K-Increasing | Array ,Binary Search | Hard | Weekly Contest 272 |
2112 | The Airport With the Most Traffic | Database | Medium | ???? |
2113 | Elements in Array After Removing and Replacing Elements | Array | Medium | ???? |
2114 | Maximum Number of Words Found in Sentences | Array ,String | Easy | Biweekly Contest 68 |
2115 | Find All Possible Recipes from Given Supplies | Graph ,Topological Sort ,Array ,Hash Table ,String | Medium | Biweekly Contest 68 |
2116 | Check if a Parentheses String Can Be Valid | Stack ,Greedy ,String | Medium | Biweekly Contest 68 |
2117 | Abbreviating the Product of a Range | Math | Hard | Biweekly Contest 68 |
2118 | Build the Equation | Database | Hard | ???? |
2119 | A Number After a Double Reversal | Math | Easy | Weekly Contest 273 |
2120 | Execution of All Suffix Instructions Staying in a Grid | String ,Simulation | Medium | Weekly Contest 273 |
2121 | Intervals Between Identical Elements | Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 273 |
2122 | Recover the Original Array | Array ,Hash Table ,Enumeration ,Sorting | Hard | Weekly Contest 273 |
2123 | Minimum Operations to Remove Adjacent Ones in Matrix | Graph ,Array ,Matrix | Hard | ???? |
2124 | Check if All A's Appears Before All B's | String | Easy | Weekly Contest 274 |
2125 | Number of Laser Beams in a Bank | Array ,Math ,String ,Matrix | Medium | Weekly Contest 274 |
2126 | Destroying Asteroids | Greedy ,Array ,Sorting | Medium | Weekly Contest 274 |
2127 | Maximum Employees to Be Invited to a Meeting | Depth-First Search ,Graph ,Topological Sort | Hard | Weekly Contest 274 |
2128 | Remove All Ones With Row and Column Flips | Bit Manipulation ,Array ,Math ,Matrix | Medium | ???? |
2129 | Capitalize the Title | String | Easy | Biweekly Contest 69 |
2130 | Maximum Twin Sum of a Linked List | Stack ,Linked List ,Two Pointers | Medium | Biweekly Contest 69 |
2131 | Longest Palindrome by Concatenating Two Letter Words | Greedy ,Array ,Hash Table ,String ,Counting | Medium | Biweekly Contest 69 |
2132 | Stamping the Grid | Greedy ,Array ,Matrix ,Prefix Sum | Hard | Biweekly Contest 69 |
2133 | Check if Every Row and Column Contains All Numbers | Array ,Hash Table ,Matrix | Easy | Weekly Contest 275 |
2134 | Minimum Swaps to Group All 1's Together II | Array ,Sliding Window | Medium | Weekly Contest 275 |
2135 | Count Words Obtained After Adding a Letter | Bit Manipulation ,Array ,Hash Table ,String ,Sorting | Medium | Weekly Contest 275 |
2136 | Earliest Possible Day of Full Bloom | Greedy ,Array ,Sorting | Hard | Weekly Contest 275 |
2137 | Pour Water Between Buckets to Make Water Levels Equal | Array ,Binary Search | Medium | ???? |
2138 | Divide a String Into Groups of Size k | String ,Simulation | Easy | Weekly Contest 276 |
2139 | Minimum Moves to Reach Target Score | Greedy ,Math | Medium | Weekly Contest 276 |
2140 | Solving Questions With Brainpower | Array ,Dynamic Programming | Medium | Weekly Contest 276 |
2141 | Maximum Running Time of N Computers | Greedy ,Array ,Binary Search ,Sorting | Hard | Weekly Contest 276 |
2142 | The Number of Passengers in Each Bus I | Database | Medium | ???? |
2143 | Choose Numbers From Two Arrays in Range | Array ,Dynamic Programming | Hard | ???? |
2144 | Minimum Cost of Buying Candies With Discount | Greedy ,Array ,Sorting | Easy | Biweekly Contest 70 |
2145 | Count the Hidden Sequences | Array ,Prefix Sum | Medium | Biweekly Contest 70 |
2146 | K Highest Ranked Items Within a Price Range | Breadth-First Search ,Array ,Matrix ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 70 |
2147 | Number of Ways to Divide a Long Corridor | Math ,String ,Dynamic Programming | Hard | Biweekly Contest 70 |
2148 | Count Elements With Strictly Smaller and Greater Elements | Array ,Sorting | Easy | Weekly Contest 277 |
2149 | Rearrange Array Elements by Sign | Array ,Two Pointers ,Simulation | Medium | Weekly Contest 277 |
2150 | Find All Lonely Numbers in the Array | Array ,Hash Table ,Counting | Medium | Weekly Contest 277 |
2151 | Maximum Good People Based on Statements | Bit Manipulation ,Array ,Backtracking ,Enumeration | Hard | Weekly Contest 277 |
2152 | Minimum Number of Lines to Cover Points | Bit Manipulation ,Geometry ,Array ,Hash Table ,Math ,Dynamic Programming ,Backtracking ,Bitmask | Medium | ???? |
2153 | The Number of Passengers in Each Bus II | Database | Hard | ???? |
2154 | Keep Multiplying Found Values by Two | Array ,Hash Table ,Sorting ,Simulation | Easy | Weekly Contest 278 |
2155 | All Divisions With the Highest Score of a Binary Array | Array | Medium | Weekly Contest 278 |
2156 | Find Substring With Given Hash Value | String ,Sliding Window ,Hash Function ,Rolling Hash | Hard | Weekly Contest 278 |
2157 | Groups of Strings | Bit Manipulation ,Union Find ,String | Hard | Weekly Contest 278 |
2158 | Amount of New Area Painted Each Day | Segment Tree ,Array ,Ordered Set | Hard | ???? |
2159 | Order Two Columns Independently | Database | Medium | ???? |
2160 | Minimum Sum of Four Digit Number After Splitting Digits | Greedy ,Math ,Sorting | Easy | Biweekly Contest 71 |
2161 | Partition Array According to Given Pivot | Array ,Two Pointers ,Simulation | Medium | Biweekly Contest 71 |
2162 | Minimum Cost to Set Cooking Time | Math ,Enumeration | Medium | Biweekly Contest 71 |
2163 | Minimum Difference in Sums After Removal of Elements | Array ,Dynamic Programming ,Heap (Priority Queue) | Hard | Biweekly Contest 71 |
2164 | Sort Even and Odd Indices Independently | Array ,Sorting | Easy | Weekly Contest 279 |
2165 | Smallest Value of the Rearranged Number | Math ,Sorting | Medium | Weekly Contest 279 |
2166 | Design Bitset | Design ,Array ,Hash Table ,String | Medium | Weekly Contest 279 |
2167 | Minimum Time to Remove All Cars Containing Illegal Goods | String ,Dynamic Programming | Hard | Weekly Contest 279 |
2168 | Unique Substrings With Equal Digit Frequency | Hash Table ,String ,Counting ,Hash Function ,Rolling Hash | Medium | ???? |
2169 | Count Operations to Obtain Zero | Math ,Simulation | Easy | Weekly Contest 280 |
2170 | Minimum Operations to Make the Array Alternating | Greedy ,Array ,Hash Table ,Counting | Medium | Weekly Contest 280 |
2171 | Removing Minimum Number of Magic Beans | Greedy ,Array ,Enumeration ,Prefix Sum ,Sorting | Medium | Weekly Contest 280 |
2172 | Maximum AND Sum of Array | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 280 |
2173 | Longest Winning Streak | Database | Hard | ???? |
2174 | Remove All Ones With Row and Column Flips II | Bit Manipulation ,Breadth-First Search ,Array ,Matrix | Medium | ???? |
2175 | The Change in Global Rankings | Database | Medium | ???? |
2176 | Count Equal and Divisible Pairs in an Array | Array | Easy | Biweekly Contest 72 |
2177 | Find Three Consecutive Integers That Sum to a Given Number | Math ,Simulation | Medium | Biweekly Contest 72 |
2178 | Maximum Split of Positive Even Integers | Greedy ,Math ,Backtracking | Medium | Biweekly Contest 72 |
2179 | Count Good Triplets in an Array | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | Biweekly Contest 72 |
2180 | Count Integers With Even Digit Sum | Math ,Simulation | Easy | Weekly Contest 281 |
2181 | Merge Nodes in Between Zeros | Linked List ,Simulation | Medium | Weekly Contest 281 |
2182 | Construct String With Repeat Limit | Greedy ,String ,Counting ,Heap (Priority Queue) | Medium | Weekly Contest 281 |
2183 | Count Array Pairs Divisible by K | Array ,Math ,Number Theory | Hard | Weekly Contest 281 |
2184 | Number of Ways to Build Sturdy Brick Wall | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Medium | ???? |
2185 | Counting Words With a Given Prefix | Array ,String ,String Matching | Easy | Weekly Contest 282 |
2186 | Minimum Number of Steps to Make Two Strings Anagram II | Hash Table ,String ,Counting | Medium | Weekly Contest 282 |
2187 | Minimum Time to Complete Trips | Array ,Binary Search | Medium | Weekly Contest 282 |
2188 | Minimum Time to Finish the Race | Array ,Dynamic Programming | Hard | Weekly Contest 282 |
2189 | Number of Ways to Build House of Cards | Math ,Dynamic Programming | Medium | ???? |
2190 | Most Frequent Number Following Key In an Array | Array ,Hash Table ,Counting | Easy | Biweekly Contest 73 |
2191 | Sort the Jumbled Numbers | Array ,Sorting | Medium | Biweekly Contest 73 |
2192 | All Ancestors of a Node in a Directed Acyclic Graph | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort | Medium | Biweekly Contest 73 |
2193 | Minimum Number of Moves to Make Palindrome | Greedy ,Binary Indexed Tree ,Two Pointers ,String | Hard | Biweekly Contest 73 |
2194 | Cells in a Range on an Excel Sheet | String | Easy | Weekly Contest 283 |
2195 | Append K Integers With Minimal Sum | Greedy ,Array ,Math ,Sorting | Medium | Weekly Contest 283 |
2196 | Create Binary Tree From Descriptions | Tree ,Depth-First Search ,Breadth-First Search ,Array ,Hash Table ,Binary Tree | Medium | Weekly Contest 283 |
2197 | Replace Non-Coprime Numbers in Array | Stack ,Array ,Math ,Number Theory | Hard | Weekly Contest 283 |
2198 | Number of Single Divisor Triplets | Math | Medium | ???? |
2199 | Finding the Topic of Each Post | Database | Hard | ???? |
2200 | Find All K-Distant Indices in an Array | Array ,Two Pointers | Easy | Weekly Contest 284 |
2201 | Count Artifacts That Can Be Extracted | Array ,Hash Table ,Simulation | Medium | Weekly Contest 284 |
2202 | Maximize the Topmost Element After K Moves | Greedy ,Array | Medium | Weekly Contest 284 |
2203 | Minimum Weighted Subgraph With the Required Paths | Graph ,Shortest Path | Hard | Weekly Contest 284 |
2204 | Distance to a Cycle in Undirected Graph | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Hard | ???? |
2205 | The Number of Users That Are Eligible for Discount | Database | Easy | ???? |
2206 | Divide Array Into Equal Pairs | Bit Manipulation ,Array ,Hash Table ,Counting | Easy | Biweekly Contest 74 |
2207 | Maximize Number of Subsequences in a String | Greedy ,String ,Prefix Sum | Medium | Biweekly Contest 74 |
2208 | Minimum Operations to Halve Array Sum | Greedy ,Array ,Heap (Priority Queue) | Medium | Biweekly Contest 74 |
2209 | Minimum White Tiles After Covering With Carpets | String ,Dynamic Programming ,Prefix Sum | Hard | Biweekly Contest 74 |
2210 | Count Hills and Valleys in an Array | Array | Easy | Weekly Contest 285 |
2211 | Count Collisions on a Road | Stack ,String ,Simulation | Medium | Weekly Contest 285 |
2212 | Maximum Points in an Archery Competition | Bit Manipulation ,Array ,Backtracking ,Enumeration | Medium | Weekly Contest 285 |
2213 | Longest Substring of One Repeating Character | Segment Tree ,Array ,String ,Ordered Set | Hard | Weekly Contest 285 |
2214 | Minimum Health to Beat Game | Greedy ,Array | Medium | ???? |
2215 | Find the Difference of Two Arrays | Array ,Hash Table | Easy | Weekly Contest 286 |
2216 | Minimum Deletions to Make Array Beautiful | Stack ,Greedy ,Array | Medium | Weekly Contest 286 |
2217 | Find Palindrome With Fixed Length | Array ,Math | Medium | Weekly Contest 286 |
2218 | Maximum Value of K Coins From Piles | Array ,Dynamic Programming ,Prefix Sum | Hard | Weekly Contest 286 |
2219 | Maximum Sum Score of Array | Array ,Prefix Sum | Medium | ???? |
2220 | Minimum Bit Flips to Convert Number | Bit Manipulation | Easy | Biweekly Contest 75 |
2221 | Find Triangular Sum of an Array | Array ,Math ,Combinatorics ,Simulation | Medium | Biweekly Contest 75 |
2222 | Number of Ways to Select Buildings | String ,Dynamic Programming ,Prefix Sum | Medium | Biweekly Contest 75 |
2223 | Sum of Scores of Built Strings | String ,Binary Search ,String Matching ,Suffix Array ,Hash Function ,Rolling Hash | Hard | Biweekly Contest 75 |
2224 | Minimum Number of Operations to Convert Time | Greedy ,String | Easy | Weekly Contest 287 |
2225 | Find Players With Zero or One Losses | Array ,Hash Table ,Counting ,Sorting | Medium | Weekly Contest 287 |
2226 | Maximum Candies Allocated to K Children | Array ,Binary Search | Medium | Weekly Contest 287 |
2227 | Encrypt and Decrypt Strings | Design ,Trie ,Array ,Hash Table ,String | Hard | Weekly Contest 287 |
2228 | Users With Two Purchases Within Seven Days | Database | Medium | ???? |
2229 | Check if an Array Is Consecutive | Array ,Hash Table ,Sorting | Easy | ???? |
2230 | The Users That Are Eligible for Discount | Database | Easy | ???? |
2231 | Largest Number After Digit Swaps by Parity | Sorting ,Heap (Priority Queue) | Easy | Weekly Contest 288 |
2232 | Minimize Result by Adding Parentheses to Expression | String ,Enumeration | Medium | Weekly Contest 288 |
2233 | Maximum Product After K Increments | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 288 |
2234 | Maximum Total Beauty of the Gardens | Greedy ,Array ,Two Pointers ,Binary Search ,Sorting | Hard | Weekly Contest 288 |
2235 | Add Two Integers | Math | Easy | |
2236 | Root Equals Sum of Children | Tree ,Binary Tree | Easy | |
2237 | Count Positions on Street With Required Brightness | Array ,Prefix Sum | Medium | ???? |
2238 | Number of Times a Driver Was a Passenger | Database | Medium | ???? |
2239 | Find Closest Number to Zero | Array | Easy | Biweekly Contest 76 |
2240 | Number of Ways to Buy Pens and Pencils | Math ,Enumeration | Medium | Biweekly Contest 76 |
2241 | Design an ATM Machine | Greedy ,Design ,Array | Medium | Biweekly Contest 76 |
2242 | Maximum Score of a Node Sequence | Graph ,Array ,Enumeration ,Sorting | Hard | Biweekly Contest 76 |
2243 | Calculate Digit Sum of a String | String ,Simulation | Easy | Weekly Contest 289 |
2244 | Minimum Rounds to Complete All Tasks | Greedy ,Array ,Hash Table ,Counting | Medium | Weekly Contest 289 |
2245 | Maximum Trailing Zeros in a Cornered Path | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 289 |
2246 | Longest Path With Different Adjacent Characters | Tree ,Depth-First Search ,Graph ,Topological Sort ,Array ,String | Hard | Weekly Contest 289 |
2247 | Maximum Cost of Trip With K Highways | Bit Manipulation ,Graph ,Dynamic Programming ,Bitmask | Hard | ???? |
2248 | Intersection of Multiple Arrays | Array ,Hash Table ,Counting ,Sorting | Easy | Weekly Contest 290 |
2249 | Count Lattice Points Inside a Circle | Geometry ,Array ,Hash Table ,Math ,Enumeration | Medium | Weekly Contest 290 |
2250 | Count Number of Rectangles Containing Each Point | Binary Indexed Tree ,Array ,Binary Search ,Sorting | Medium | Weekly Contest 290 |
2251 | Number of Flowers in Full Bloom | Array ,Hash Table ,Binary Search ,Ordered Set ,Prefix Sum ,Sorting | Hard | Weekly Contest 290 |
2252 | Dynamic Pivoting of a Table | Database | Hard | ???? |
2253 | Dynamic Unpivoting of a Table | Database | Hard | ???? |
2254 | Design Video Sharing Platform | Stack ,Design ,Hash Table ,Ordered Set | Hard | ???? |
2255 | Count Prefixes of a Given String | Array ,String | Easy | Biweekly Contest 77 |
2256 | Minimum Average Difference | Array ,Prefix Sum | Medium | Biweekly Contest 77 |
2257 | Count Unguarded Cells in the Grid | Array ,Matrix ,Simulation | Medium | Biweekly Contest 77 |
2258 | Escape the Spreading Fire | Breadth-First Search ,Array ,Binary Search ,Matrix | Hard | Biweekly Contest 77 |
2259 | Remove Digit From Number to Maximize Result | Greedy ,String ,Enumeration | Easy | Weekly Contest 291 |
2260 | Minimum Consecutive Cards to Pick Up | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 291 |
2261 | K Divisible Elements Subarrays | Trie ,Array ,Hash Table ,Enumeration ,Hash Function ,Rolling Hash | Medium | Weekly Contest 291 |
2262 | Total Appeal of A String | Hash Table ,String ,Dynamic Programming | Hard | Weekly Contest 291 |
2263 | Make Array Non-decreasing or Non-increasing | Greedy ,Dynamic Programming | Hard | ???? |
2264 | Largest 3-Same-Digit Number in String | String | Easy | Weekly Contest 292 |
2265 | Count Nodes Equal to Average of Subtree | Tree ,Depth-First Search ,Binary Tree | Medium | Weekly Contest 292 |
2266 | Count Number of Texts | Hash Table ,Math ,String ,Dynamic Programming | Medium | Weekly Contest 292 |
2267 | Check if There Is a Valid Parentheses String Path | Array ,Dynamic Programming ,Matrix | Hard | Weekly Contest 292 |
2268 | Minimum Number of Keypresses | Greedy ,Hash Table ,String ,Counting ,Sorting | Medium | ???? |
2269 | Find the K-Beauty of a Number | Math ,String ,Sliding Window | Easy | Biweekly Contest 78 |
2270 | Number of Ways to Split Array | Array ,Prefix Sum | Medium | Biweekly Contest 78 |
2271 | Maximum White Tiles Covered by a Carpet | Greedy ,Array ,Binary Search ,Prefix Sum ,Sorting | Medium | Biweekly Contest 78 |
2272 | Substring With Largest Variance | Array ,Dynamic Programming | Hard | Biweekly Contest 78 |
2273 | Find Resultant Array After Removing Anagrams | Array ,Hash Table ,String ,Sorting | Easy | Weekly Contest 293 |
2274 | Maximum Consecutive Floors Without Special Floors | Array ,Sorting | Medium | Weekly Contest 293 |
2275 | Largest Combination With Bitwise AND Greater Than Zero | Bit Manipulation ,Array ,Hash Table ,Counting | Medium | Weekly Contest 293 |
2276 | Count Integers in Intervals | Design ,Segment Tree ,Ordered Set | Hard | Weekly Contest 293 |
2277 | Closest Node to Path in Tree | Tree ,Depth-First Search ,Breadth-First Search ,Array | Hard | ???? |
2278 | Percentage of Letter in String | String | Easy | Weekly Contest 294 |
2279 | Maximum Bags With Full Capacity of Rocks | Greedy ,Array ,Sorting | Medium | Weekly Contest 294 |
2280 | Minimum Lines to Represent a Line Chart | Geometry ,Array ,Math ,Number Theory ,Sorting | Medium | Weekly Contest 294 |
2281 | Sum of Total Strength of Wizards | Stack ,Array ,Prefix Sum ,Monotonic Stack | Hard | Weekly Contest 294 |
2282 | Number of People That Can Be Seen in a Grid | Stack ,Array ,Matrix ,Monotonic Stack | Medium | ???? |
2283 | Check if Number Has Equal Digit Count and Digit Value | Hash Table ,String ,Counting | Easy | Biweekly Contest 79 |
2284 | Sender With Largest Word Count | Array ,Hash Table ,String ,Counting | Medium | Biweekly Contest 79 |
2285 | Maximum Total Importance of Roads | Greedy ,Graph ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 79 |
2286 | Booking Concert Tickets in Groups | Design ,Binary Indexed Tree ,Segment Tree ,Binary Search | Hard | Biweekly Contest 79 |
2287 | Rearrange Characters to Make Target String | Hash Table ,String ,Counting | Easy | Weekly Contest 295 |
2288 | Apply Discount to Prices | String | Medium | Weekly Contest 295 |
2289 | Steps to Make Array Non-decreasing | Stack ,Array ,Linked List ,Monotonic Stack | Medium | Weekly Contest 295 |
2290 | Minimum Obstacle Removal to Reach Corner | Breadth-First Search ,Graph ,Array ,Matrix ,Shortest Path ,Heap (Priority Queue) | Hard | Weekly Contest 295 |
2291 | Maximum Profit From Trading Stocks | Array ,Dynamic Programming | Medium | ???? |
2292 | Products With Three or More Orders in Two Consecutive Years | Database | Medium | ???? |
2293 | Min Max Game | Array ,Simulation | Easy | Weekly Contest 296 |
2294 | Partition Array Such That Maximum Difference Is K | Greedy ,Array ,Sorting | Medium | Weekly Contest 296 |
2295 | Replace Elements in an Array | Array ,Hash Table ,Simulation | Medium | Weekly Contest 296 |
2296 | Design a Text Editor | Stack ,Design ,Linked List ,String ,Doubly-Linked List ,Simulation | Hard | Weekly Contest 296 |
2297 | Jump Game VIII | Stack ,Graph ,Array ,Dynamic Programming ,Shortest Path ,Monotonic Stack | Medium | ???? |
2298 | Tasks Count in the Weekend | Database | Medium | ???? |
2299 | Strong Password Checker II | String | Easy | Biweekly Contest 80 |
2300 | Successful Pairs of Spells and Potions | Array ,Two Pointers ,Binary Search ,Sorting | Medium | Biweekly Contest 80 |
2301 | Match Substring After Replacement | Array ,Hash Table ,String ,String Matching | Hard | Biweekly Contest 80 |
2302 | Count Subarrays With Score Less Than K | Array ,Binary Search ,Prefix Sum ,Sliding Window | Hard | Biweekly Contest 80 |
2303 | Calculate Amount Paid in Taxes | Array ,Simulation | Easy | Weekly Contest 297 |
2304 | Minimum Path Cost in a Grid | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 297 |
2305 | Fair Distribution of Cookies | Bit Manipulation ,Array ,Dynamic Programming ,Backtracking ,Bitmask | Medium | Weekly Contest 297 |
2306 | Naming a Company | Bit Manipulation ,Array ,Hash Table ,String ,Enumeration | Hard | Weekly Contest 297 |
2307 | Check for Contradictions in Equations | Depth-First Search ,Union Find ,Graph ,Array | Hard | ???? |
2308 | Arrange Table by Gender | Database | Medium | ???? |
2309 | Greatest English Letter in Upper and Lower Case | Hash Table ,String ,Enumeration | Easy | Weekly Contest 298 |
2310 | Sum of Numbers With Units Digit K | Greedy ,Math ,Dynamic Programming ,Enumeration | Medium | Weekly Contest 298 |
2311 | Longest Binary Subsequence Less Than or Equal to K | Greedy ,Memoization ,String ,Dynamic Programming | Medium | Weekly Contest 298 |
2312 | Selling Pieces of Wood | Memoization ,Array ,Dynamic Programming | Hard | Weekly Contest 298 |
2313 | Minimum Flips in Binary Tree to Get Result | Tree ,Depth-First Search ,Dynamic Programming ,Binary Tree | Hard | ???? |
2314 | The First Day of the Maximum Recorded Degree in Each City | Database | Medium | ???? |
2315 | Count Asterisks | String | Easy | Biweekly Contest 81 |
2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | Biweekly Contest 81 |
2317 | Maximum XOR After Operations | Bit Manipulation ,Array ,Math | Medium | Biweekly Contest 81 |
2318 | Number of Distinct Roll Sequences | Memoization ,Dynamic Programming | Hard | Biweekly Contest 81 |
2319 | Check if Matrix Is X-Matrix | Array ,Matrix | Easy | Weekly Contest 299 |
2320 | Count Number of Ways to Place Houses | Dynamic Programming | Medium | Weekly Contest 299 |
2321 | Maximum Score Of Spliced Array | Array ,Dynamic Programming | Hard | Weekly Contest 299 |
2322 | Minimum Score After Removals on a Tree | Bit Manipulation ,Tree ,Depth-First Search ,Array | Hard | Weekly Contest 299 |
2323 | Find Minimum Time to Finish All Jobs II | Greedy ,Array ,Sorting | Medium | ???? |
2324 | Product Sales Analysis IV | Database | Medium | ???? |
2325 | Decode the Message | Hash Table ,String | Easy | Weekly Contest 300 |
2326 | Spiral Matrix IV | Array ,Linked List ,Matrix ,Simulation | Medium | Weekly Contest 300 |
2327 | Number of People Aware of a Secret | Queue ,Dynamic Programming ,Simulation | Medium | Weekly Contest 300 |
2328 | Number of Increasing Paths in a Grid | Depth-First Search ,Breadth-First Search ,Graph ,Topological Sort ,Memoization ,Array ,Dynamic Programming ,Matrix | Hard | Weekly Contest 300 |
2329 | Product Sales Analysis V | Database | Easy | ???? |
2330 | Valid Palindrome IV | Two Pointers ,String | Medium | ???? |
2331 | Evaluate Boolean Binary Tree | Tree ,Depth-First Search ,Binary Tree | Easy | Biweekly Contest 82 |
2332 | The Latest Time to Catch a Bus | Array ,Two Pointers ,Binary Search ,Sorting | Medium | Biweekly Contest 82 |
2333 | Minimum Sum of Squared Difference | Array ,Math ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 82 |
2334 | Subarray With Elements Greater Than Varying Threshold | Stack ,Union Find ,Array ,Monotonic Stack | Hard | Biweekly Contest 82 |
2335 | Minimum Amount of Time to Fill Cups | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Easy | Weekly Contest 301 |
2336 | Smallest Number in Infinite Set | Design ,Hash Table ,Heap (Priority Queue) | Medium | Weekly Contest 301 |
2337 | Move Pieces to Obtain a String | Two Pointers ,String | Medium | Weekly Contest 301 |
2338 | Count the Number of Ideal Arrays | Math ,Dynamic Programming ,Combinatorics ,Number Theory | Hard | Weekly Contest 301 |
2339 | All the Matches of the League | Database | Easy | ???? |
2340 | Minimum Adjacent Swaps to Make a Valid Array | Greedy ,Array | Medium | ???? |
2341 | Maximum Number of Pairs in Array | Array ,Hash Table ,Counting | Easy | Weekly Contest 302 |
2342 | Max Sum of a Pair With Equal Sum of Digits | Array ,Hash Table ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 302 |
2343 | Query Kth Smallest Trimmed Number | Array ,String ,Divide and Conquer ,Quickselect ,Radix Sort ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 302 |
2344 | Minimum Deletions to Make Array Divisible | Array ,Math ,Number Theory ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 302 |
2345 | Finding the Number of Visible Mountains | Stack ,Array ,Sorting ,Monotonic Stack | Medium | ???? |
2346 | Compute the Rank as a Percentage | Database | Medium | ???? |
2347 | Best Poker Hand | Array ,Hash Table ,Counting | Easy | Biweekly Contest 83 |
2348 | Number of Zero-Filled Subarrays | Array ,Math | Medium | Biweekly Contest 83 |
2349 | Design a Number Container System | Design ,Hash Table ,Ordered Set ,Heap (Priority Queue) | Medium | Biweekly Contest 83 |
2350 | Shortest Impossible Sequence of Rolls | Greedy ,Array ,Hash Table | Hard | Biweekly Contest 83 |
2351 | First Letter to Appear Twice | Bit Manipulation ,Hash Table ,String ,Counting | Easy | Weekly Contest 303 |
2352 | Equal Row and Column Pairs | Array ,Hash Table ,Matrix ,Simulation | Medium | Weekly Contest 303 |
2353 | Design a Food Rating System | Design ,Hash Table ,Ordered Set ,Heap (Priority Queue) | Medium | Weekly Contest 303 |
2354 | Number of Excellent Pairs | Bit Manipulation ,Array ,Hash Table ,Binary Search | Hard | Weekly Contest 303 |
2355 | Maximum Number of Books You Can Take | Stack ,Array ,Dynamic Programming ,Monotonic Stack | Hard | ???? |
2356 | Number of Unique Subjects Taught by Each Teacher | Database | Easy | |
2357 | Make Array Zero by Subtracting Equal Amounts | Greedy ,Array ,Hash Table ,Sorting ,Simulation ,Heap (Priority Queue) | Easy | Weekly Contest 304 |
2358 | Maximum Number of Groups Entering a Competition | Greedy ,Array ,Math ,Binary Search | Medium | Weekly Contest 304 |
2359 | Find Closest Node to Given Two Nodes | Depth-First Search ,Graph | Medium | Weekly Contest 304 |
2360 | Longest Cycle in a Graph | Depth-First Search ,Graph ,Topological Sort | Hard | Weekly Contest 304 |
2361 | Minimum Costs Using the Train Line | Array ,Dynamic Programming | Hard | ???? |
2362 | Generate the Invoice | Database | Hard | ???? |
2363 | Merge Similar Items | Array ,Hash Table ,Ordered Set ,Sorting | Easy | Biweekly Contest 84 |
2364 | Count Number of Bad Pairs | Array ,Hash Table | Medium | Biweekly Contest 84 |
2365 | Task Scheduler II | Array ,Hash Table ,Simulation | Medium | Biweekly Contest 84 |
2366 | Minimum Replacements to Sort the Array | Greedy ,Array ,Math | Hard | Biweekly Contest 84 |
2367 | Number of Arithmetic Triplets | Array ,Hash Table ,Two Pointers ,Enumeration | Easy | Weekly Contest 305 |
2368 | Reachable Nodes With Restrictions | Tree ,Depth-First Search ,Breadth-First Search ,Union Find ,Graph ,Array ,Hash Table | Medium | Weekly Contest 305 |
2369 | Check if There is a Valid Partition For The Array | Array ,Dynamic Programming | Medium | Weekly Contest 305 |
2370 | Longest Ideal Subsequence | Hash Table ,String ,Dynamic Programming | Medium | Weekly Contest 305 |
2371 | Minimize Maximum Value in a Grid | Union Find ,Graph ,Topological Sort ,Array ,Matrix ,Sorting | Hard | ???? |
2372 | Calculate the Influence of Each Salesperson | Database | Medium | ???? |
2373 | Largest Local Values in a Matrix | Array ,Matrix | Easy | Weekly Contest 306 |
2374 | Node With Highest Edge Score | Graph ,Hash Table | Medium | Weekly Contest 306 |
2375 | Construct Smallest Number From DI String | Stack ,Greedy ,String ,Backtracking | Medium | Weekly Contest 306 |
2376 | Count Special Integers | Math ,Dynamic Programming | Hard | Weekly Contest 306 |
2377 | Sort the Olympic Table | Database | Easy | ???? |
2378 | Choose Edges to Maximize Score in a Tree | Tree ,Depth-First Search ,Dynamic Programming | Medium | ???? |
2379 | Minimum Recolors to Get K Consecutive Black Blocks | String ,Sliding Window | Easy | Biweekly Contest 85 |
2380 | Time Needed to Rearrange a Binary String | String ,Dynamic Programming ,Simulation | Medium | Biweekly Contest 85 |
2381 | Shifting Letters II | Array ,String ,Prefix Sum | Medium | Biweekly Contest 85 |
2382 | Maximum Segment Sum After Removals | Union Find ,Array ,Ordered Set ,Prefix Sum | Hard | Biweekly Contest 85 |
2383 | Minimum Hours of Training to Win a Competition | Greedy ,Array | Easy | Weekly Contest 307 |
2384 | Largest Palindromic Number | Greedy ,Hash Table ,String | Medium | Weekly Contest 307 |
2385 | Amount of Time for Binary Tree to Be Infected | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 307 |
2386 | Find the K-Sum of an Array | Array ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 307 |
2387 | Median of a Row Wise Sorted Matrix | Array ,Binary Search ,Matrix | Medium | ???? |
2388 | Change Null Values in a Table to the Previous Value | Database | Medium | ???? |
2389 | Longest Subsequence With Limited Sum | Greedy ,Array ,Binary Search ,Prefix Sum ,Sorting | Easy | Weekly Contest 308 |
2390 | Removing Stars From a String | Stack ,String ,Simulation | Medium | Weekly Contest 308 |
2391 | Minimum Amount of Time to Collect Garbage | Array ,String ,Prefix Sum | Medium | Weekly Contest 308 |
2392 | Build a Matrix With Conditions | Graph ,Topological Sort ,Array ,Matrix | Hard | Weekly Contest 308 |
2393 | Count Strictly Increasing Subarrays | Array ,Math ,Dynamic Programming | Medium | ???? |
2394 | Employees With Deductions | Database | Medium | ???? |
2395 | Find Subarrays With Equal Sum | Array ,Hash Table | Easy | Biweekly Contest 86 |
2396 | Strictly Palindromic Number | Brainteaser ,Math ,Two Pointers | Medium | Biweekly Contest 86 |
2397 | Maximum Rows Covered by Columns | Bit Manipulation ,Array ,Backtracking ,Enumeration ,Matrix | Medium | Biweekly Contest 86 |
2398 | Maximum Number of Robots Within Budget | Queue ,Array ,Binary Search ,Prefix Sum ,Sliding Window ,Heap (Priority Queue) | Hard | Biweekly Contest 86 |
2399 | Check Distances Between Same Letters | Array ,Hash Table ,String | Easy | Weekly Contest 309 |
2400 | Number of Ways to Reach a Position After Exactly k Steps | Math ,Dynamic Programming ,Combinatorics | Medium | Weekly Contest 309 |
2401 | Longest Nice Subarray | Bit Manipulation ,Array ,Sliding Window | Medium | Weekly Contest 309 |
2402 | Meeting Rooms III | Array ,Hash Table ,Sorting ,Simulation ,Heap (Priority Queue) | Hard | Weekly Contest 309 |
2403 | Minimum Time to Kill All Monsters | Bit Manipulation ,Array ,Dynamic Programming ,Bitmask | Hard | ???? |
2404 | Most Frequent Even Element | Array ,Hash Table ,Counting | Easy | Weekly Contest 310 |
2405 | Optimal Partition of String | Greedy ,Hash Table ,String | Medium | Weekly Contest 310 |
2406 | Divide Intervals Into Minimum Number of Groups | Greedy ,Array ,Two Pointers ,Prefix Sum ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 310 |
2407 | Longest Increasing Subsequence II | Binary Indexed Tree ,Segment Tree ,Queue ,Array ,Divide and Conquer ,Dynamic Programming ,Monotonic Queue | Hard | Weekly Contest 310 |
2408 | Design SQL | Design ,Array ,Hash Table ,String | Medium | ???? |
2409 | Count Days Spent Together | Math ,String | Easy | Biweekly Contest 87 |
2410 | Maximum Matching of Players With Trainers | Greedy ,Array ,Two Pointers ,Sorting | Medium | Biweekly Contest 87 |
2411 | Smallest Subarrays With Maximum Bitwise OR | Bit Manipulation ,Array ,Binary Search ,Sliding Window | Medium | Biweekly Contest 87 |
2412 | Minimum Money Required Before Transactions | Greedy ,Array ,Sorting | Hard | Biweekly Contest 87 |
2413 | Smallest Even Multiple | Math ,Number Theory | Easy | Weekly Contest 311 |
2414 | Length of the Longest Alphabetical Continuous Substring | String | Medium | Weekly Contest 311 |
2415 | Reverse Odd Levels of Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 311 |
2416 | Sum of Prefix Scores of Strings | Trie ,Array ,String ,Counting | Hard | Weekly Contest 311 |
2417 | Closest Fair Integer | Math ,Enumeration | Medium | ???? |
2418 | Sort the People | Array ,Hash Table ,String ,Sorting | Easy | Weekly Contest 312 |
2419 | Longest Subarray With Maximum Bitwise AND | Bit Manipulation ,Brainteaser ,Array | Medium | Weekly Contest 312 |
2420 | Find All Good Indices | Array ,Dynamic Programming ,Prefix Sum | Medium | Weekly Contest 312 |
2421 | Number of Good Paths | Tree ,Union Find ,Graph ,Array ,Hash Table ,Sorting | Hard | Weekly Contest 312 |
2422 | Merge Operations to Turn Array Into a Palindrome | Greedy ,Array ,Two Pointers | Medium | ???? |
2423 | Remove Letter To Equalize Frequency | Hash Table ,String ,Counting | Easy | Biweekly Contest 88 |
2424 | Longest Uploaded Prefix | Union Find ,Design ,Binary Indexed Tree ,Segment Tree ,Binary Search ,Ordered Set ,Heap (Priority Queue) | Medium | Biweekly Contest 88 |
2425 | Bitwise XOR of All Pairings | Bit Manipulation ,Brainteaser ,Array | Medium | Biweekly Contest 88 |
2426 | Number of Pairs Satisfying Inequality | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | Biweekly Contest 88 |
2427 | Number of Common Factors | Math ,Enumeration ,Number Theory | Easy | Weekly Contest 313 |
2428 | Maximum Sum of an Hourglass | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 313 |
2429 | Minimize XOR | Greedy ,Bit Manipulation | Medium | Weekly Contest 313 |
2430 | Maximum Deletions on a String | String ,Dynamic Programming ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 313 |
2431 | Maximize Total Tastiness of Purchased Fruits | Array ,Dynamic Programming | Medium | ???? |
2432 | The Employee That Worked on the Longest Task | Array | Easy | Weekly Contest 314 |
2433 | Find The Original Array of Prefix Xor | Bit Manipulation ,Array | Medium | Weekly Contest 314 |
2434 | Using a Robot to Print the Lexicographically Smallest String | Stack ,Greedy ,Hash Table ,String | Medium | Weekly Contest 314 |
2435 | Paths in Matrix Whose Sum Is Divisible by K | Array ,Dynamic Programming ,Matrix | Hard | Weekly Contest 314 |
2436 | Minimum Split Into Subarrays With GCD Greater Than One | Greedy ,Array ,Math ,Dynamic Programming ,Number Theory | Medium | ???? |
2437 | Number of Valid Clock Times | String ,Enumeration | Easy | Biweekly Contest 89 |
2438 | Range Product Queries of Powers | Bit Manipulation ,Array ,Prefix Sum | Medium | Biweekly Contest 89 |
2439 | Minimize Maximum of Array | Greedy ,Array ,Binary Search ,Dynamic Programming ,Prefix Sum | Medium | Biweekly Contest 89 |
2440 | Create Components With Same Value | Tree ,Depth-First Search ,Array ,Math ,Enumeration | Hard | Biweekly Contest 89 |
2441 | Largest Positive Integer That Exists With Its Negative | Array ,Hash Table ,Two Pointers ,Sorting | Easy | Weekly Contest 315 |
2442 | Count Number of Distinct Integers After Reverse Operations | Array ,Hash Table ,Math | Medium | Weekly Contest 315 |
2443 | Sum of Number and Its Reverse | Math ,Enumeration | Medium | Weekly Contest 315 |
2444 | Count Subarrays With Fixed Bounds | Queue ,Array ,Sliding Window ,Monotonic Queue | Hard | Weekly Contest 315 |
2445 | Number of Nodes With Value One | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | ???? |
2446 | Determine if Two Events Have Conflict | Array ,String | Easy | Weekly Contest 316 |
2447 | Number of Subarrays With GCD Equal to K | Array ,Math ,Number Theory | Medium | Weekly Contest 316 |
2448 | Minimum Cost to Make Array Equal | Greedy ,Array ,Binary Search ,Prefix Sum ,Sorting | Hard | Weekly Contest 316 |
2449 | Minimum Number of Operations to Make Arrays Similar | Greedy ,Array ,Sorting | Hard | Weekly Contest 316 |
2450 | Number of Distinct Binary Strings After Applying Operations | Math ,String | Medium | ???? |
2451 | Odd String Difference | Array ,Hash Table ,String | Easy | Biweekly Contest 90 |
2452 | Words Within Two Edits of Dictionary | Array ,String | Medium | Biweekly Contest 90 |
2453 | Destroy Sequential Targets | Array ,Hash Table ,Counting | Medium | Biweekly Contest 90 |
2454 | Next Greater Element IV | Stack ,Array ,Binary Search ,Sorting ,Monotonic Stack ,Heap (Priority Queue) | Hard | Biweekly Contest 90 |
2455 | Average Value of Even Numbers That Are Divisible by Three | Array ,Math | Easy | Weekly Contest 317 |
2456 | Most Popular Video Creator | Array ,Hash Table ,String ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 317 |
2457 | Minimum Addition to Make Integer Beautiful | Greedy ,Math | Medium | Weekly Contest 317 |
2458 | Height of Binary Tree After Subtree Removal Queries | Tree ,Depth-First Search ,Breadth-First Search ,Array ,Binary Tree | Hard | Weekly Contest 317 |
2459 | Sort Array by Moving Items to Empty Space | Greedy ,Array ,Sorting | Hard | ???? |
2460 | Apply Operations to an Array | Array ,Simulation | Easy | Weekly Contest 318 |
2461 | Maximum Sum of Distinct Subarrays With Length K | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 318 |
2462 | Total Cost to Hire K Workers | Array ,Two Pointers ,Simulation ,Heap (Priority Queue) | Medium | Weekly Contest 318 |
2463 | Minimum Total Distance Traveled | Array ,Dynamic Programming ,Sorting | Hard | Weekly Contest 318 |
2464 | Minimum Subarrays in a Valid Split | Array ,Math ,Dynamic Programming ,Number Theory | Medium | ???? |
2465 | Number of Distinct Averages | Array ,Hash Table ,Two Pointers ,Sorting | Easy | Biweekly Contest 91 |
2466 | Count Ways To Build Good Strings | Dynamic Programming | Medium | Biweekly Contest 91 |
2467 | Most Profitable Path in a Tree | Tree ,Depth-First Search ,Breadth-First Search ,Graph ,Array | Medium | Biweekly Contest 91 |
2468 | Split Message Based on Limit | String ,Binary Search | Hard | Biweekly Contest 91 |
2469 | Convert the Temperature | Math | Easy | Weekly Contest 319 |
2470 | Number of Subarrays With LCM Equal to K | Array ,Math ,Number Theory | Medium | Weekly Contest 319 |
2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Tree ,Breadth-First Search ,Binary Tree | Medium | Weekly Contest 319 |
2472 | Maximum Number of Non-overlapping Palindrome Substrings | String ,Dynamic Programming | Hard | Weekly Contest 319 |
2473 | Minimum Cost to Buy Apples | Graph ,Array ,Shortest Path ,Heap (Priority Queue) | Medium | ???? |
2474 | Customers With Strictly Increasing Purchases | Database | Hard | ???? |
2475 | Number of Unequal Triplets in Array | Array ,Hash Table ,Sorting | Easy | Weekly Contest 320 |
2476 | Closest Nodes Queries in a Binary Search Tree | Tree ,Depth-First Search ,Binary Search Tree ,Array ,Binary Search ,Binary Tree | Medium | Weekly Contest 320 |
2477 | Minimum Fuel Cost to Report to the Capital | Tree ,Depth-First Search ,Breadth-First Search ,Graph | Medium | Weekly Contest 320 |
2478 | Number of Beautiful Partitions | String ,Dynamic Programming | Hard | Weekly Contest 320 |
2479 | Maximum XOR of Two Non-Overlapping Subtrees | Tree ,Depth-First Search ,Graph ,Trie | Hard | ???? |
2480 | Form a Chemical Bond | Database | Easy | ???? |
2481 | Minimum Cuts to Divide a Circle | Geometry ,Math | Easy | Biweekly Contest 92 |
2482 | Difference Between Ones and Zeros in Row and Column | Array ,Matrix ,Simulation | Medium | Biweekly Contest 92 |
2483 | Minimum Penalty for a Shop | String ,Prefix Sum | Medium | Biweekly Contest 92 |
2484 | Count Palindromic Subsequences | String ,Dynamic Programming | Hard | Biweekly Contest 92 |
2485 | Find the Pivot Integer | Math ,Prefix Sum | Easy | Weekly Contest 321 |
2486 | Append Characters to String to Make Subsequence | Greedy ,Two Pointers ,String | Medium | Weekly Contest 321 |
2487 | Remove Nodes From Linked List | Stack ,Recursion ,Linked List ,Monotonic Stack | Medium | Weekly Contest 321 |
2488 | Count Subarrays With Median K | Array ,Hash Table ,Prefix Sum | Hard | Weekly Contest 321 |
2489 | Number of Substrings With Fixed Ratio | Hash Table ,Math ,String ,Prefix Sum | Medium | ???? |
2490 | Circular Sentence | String | Easy | Weekly Contest 322 |
2491 | Divide Players Into Teams of Equal Skill | Array ,Hash Table ,Two Pointers ,Sorting | Medium | Weekly Contest 322 |
2492 | Minimum Score of a Path Between Two Cities | Depth-First Search ,Breadth-First Search ,Union Find ,Graph | Medium | Weekly Contest 322 |
2493 | Divide Nodes Into the Maximum Number of Groups | Breadth-First Search ,Union Find ,Graph | Hard | Weekly Contest 322 |
2494 | Merge Overlapping Events in the Same Hall | Database | Hard | ???? |
2495 | Number of Subarrays Having Even Product | Array ,Math ,Dynamic Programming | Medium | ???? |
2496 | Maximum Value of a String in an Array | Array ,String | Easy | Biweekly Contest 93 |
2497 | Maximum Star Sum of a Graph | Greedy ,Graph ,Array ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 93 |
2498 | Frog Jump II | Greedy ,Array ,Binary Search | Medium | Biweekly Contest 93 |
2499 | Minimum Total Cost to Make Arrays Unequal | Greedy ,Array ,Hash Table ,Counting | Hard | Biweekly Contest 93 |
2500 | Delete Greatest Value in Each Row | Array ,Matrix ,Sorting ,Simulation ,Heap (Priority Queue) | Easy | Weekly Contest 323 |
2501 | Longest Square Streak in an Array | Array ,Hash Table ,Binary Search ,Dynamic Programming ,Sorting | Medium | Weekly Contest 323 |
2502 | Design Memory Allocator | Design ,Array ,Hash Table ,Simulation | Medium | Weekly Contest 323 |
2503 | Maximum Number of Points From Grid Queries | Breadth-First Search ,Union Find ,Array ,Two Pointers ,Matrix ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 323 |
2504 | Concatenate the Name and the Profession | Database | Easy | ???? |
2505 | Bitwise OR of All Subsequence Sums | Bit Manipulation ,Brainteaser ,Array ,Math | Medium | ???? |
2506 | Count Pairs Of Similar Strings | Array ,Hash Table ,String | Easy | Weekly Contest 324 |
2507 | Smallest Value After Replacing With Sum of Prime Factors | Math ,Number Theory | Medium | Weekly Contest 324 |
2508 | Add Edges to Make Degrees of All Nodes Even | Graph ,Hash Table | Hard | Weekly Contest 324 |
2509 | Cycle Length Queries in a Tree | Tree ,Binary Tree | Hard | Weekly Contest 324 |
2510 | Check if There is a Path With Equal Number of 0's And 1's | Array ,Dynamic Programming ,Matrix | Medium | ???? |
2511 | Maximum Enemy Forts That Can Be Captured | Array ,Two Pointers | Easy | Biweekly Contest 94 |
2512 | Reward Top K Students | Array ,Hash Table ,String ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 94 |
2513 | Minimize the Maximum of Two Arrays | Math ,Binary Search ,Number Theory | Medium | Biweekly Contest 94 |
2514 | Count Anagrams | Hash Table ,Math ,String ,Combinatorics ,Counting | Hard | Biweekly Contest 94 |
2515 | Shortest Distance to Target String in a Circular Array | Array ,String | Easy | Weekly Contest 325 |
2516 | Take K of Each Character From Left and Right | Hash Table ,String ,Sliding Window | Medium | Weekly Contest 325 |
2517 | Maximum Tastiness of Candy Basket | Array ,Binary Search ,Sorting | Medium | Weekly Contest 325 |
2518 | Number of Great Partitions | Array ,Dynamic Programming | Hard | Weekly Contest 325 |
2519 | Count the Number of K-Big Indices | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Divide and Conquer ,Ordered Set ,Merge Sort | Hard | ???? |
2520 | Count the Digits That Divide a Number | Math | Easy | Weekly Contest 326 |
2521 | Distinct Prime Factors of Product of Array | Array ,Hash Table ,Math ,Number Theory | Medium | Weekly Contest 326 |
2522 | Partition String Into Substrings With Values at Most K | Greedy ,String ,Dynamic Programming | Medium | Weekly Contest 326 |
2523 | Closest Prime Numbers in Range | Math ,Number Theory | Medium | Weekly Contest 326 |
2524 | Maximum Frequency Score of a Subarray | Array ,Hash Table ,Math ,Sliding Window | Hard | ???? |
2525 | Categorize Box According to Criteria | Math | Easy | Biweekly Contest 95 |
2526 | Find Consecutive Integers from a Data Stream | Design ,Queue ,Hash Table ,Counting ,Data Stream | Medium | Biweekly Contest 95 |
2527 | Find Xor-Beauty of Array | Bit Manipulation ,Array ,Math | Medium | Biweekly Contest 95 |
2528 | Maximize the Minimum Powered City | Greedy ,Queue ,Array ,Binary Search ,Prefix Sum ,Sliding Window | Hard | Biweekly Contest 95 |
2529 | Maximum Count of Positive Integer and Negative Integer | Array ,Binary Search ,Counting | Easy | Weekly Contest 327 |
2530 | Maximal Score After Applying K Operations | Greedy ,Array ,Heap (Priority Queue) | Medium | Weekly Contest 327 |
2531 | Make Number of Distinct Characters Equal | Hash Table ,String ,Counting | Medium | Weekly Contest 327 |
2532 | Time to Cross a Bridge | Array ,Simulation ,Heap (Priority Queue) | Hard | Weekly Contest 327 |
2533 | Number of Good Binary Strings | Dynamic Programming | Medium | ???? |
2534 | Time Taken to Cross the Door | Queue ,Array ,Simulation | Hard | ???? |
2535 | Difference Between Element Sum and Digit Sum of an Array | Array ,Math | Easy | Weekly Contest 328 |
2536 | Increment Submatrices by One | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 328 |
2537 | Count the Number of Good Subarrays | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 328 |
2538 | Difference Between Maximum and Minimum Price Sum | Tree ,Depth-First Search ,Array ,Dynamic Programming | Hard | Weekly Contest 328 |
2539 | Count the Number of Good Subsequences | Hash Table ,Math ,String ,Combinatorics ,Counting | Medium | ???? |
2540 | Minimum Common Value | Array ,Hash Table ,Two Pointers ,Binary Search | Easy | Biweekly Contest 96 |
2541 | Minimum Operations to Make Array Equal II | Greedy ,Array ,Math | Medium | Biweekly Contest 96 |
2542 | Maximum Subsequence Score | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Medium | Biweekly Contest 96 |
2543 | Check if Point Is Reachable | Math ,Number Theory | Hard | Biweekly Contest 96 |
2544 | Alternating Digit Sum | Math | Easy | Weekly Contest 329 |
2545 | Sort the Students by Their Kth Score | Array ,Matrix ,Sorting | Medium | Weekly Contest 329 |
2546 | Apply Bitwise Operations to Make Strings Equal | Bit Manipulation ,String | Medium | Weekly Contest 329 |
2547 | Minimum Cost to Split an Array | Array ,Hash Table ,Dynamic Programming ,Counting | Hard | Weekly Contest 329 |
2548 | Maximum Price to Fill a Bag | Greedy ,Array ,Sorting | Medium | ???? |
2549 | Count Distinct Numbers on Board | Array ,Hash Table ,Math ,Simulation | Easy | Weekly Contest 330 |
2550 | Count Collisions of Monkeys on a Polygon | Recursion ,Math | Medium | Weekly Contest 330 |
2551 | Put Marbles in Bags | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 330 |
2552 | Count Increasing Quadruplets | Binary Indexed Tree ,Array ,Dynamic Programming ,Enumeration ,Prefix Sum | Hard | Weekly Contest 330 |
2553 | Separate the Digits in an Array | Array ,Simulation | Easy | Biweekly Contest 97 |
2554 | Maximum Number of Integers to Choose From a Range I | Greedy ,Array ,Hash Table ,Binary Search ,Sorting | Medium | Biweekly Contest 97 |
2555 | Maximize Win From Two Segments | Array ,Binary Search ,Sliding Window | Medium | Biweekly Contest 97 |
2556 | Disconnect Path in a Binary Matrix by at Most One Flip | Depth-First Search ,Breadth-First Search ,Array ,Dynamic Programming ,Matrix | Medium | Biweekly Contest 97 |
2557 | Maximum Number of Integers to Choose From a Range II | Greedy ,Array ,Binary Search ,Sorting | Medium | ???? |
2558 | Take Gifts From the Richest Pile | Array ,Simulation ,Heap (Priority Queue) | Easy | Weekly Contest 331 |
2559 | Count Vowel Strings in Ranges | Array ,String ,Prefix Sum | Medium | Weekly Contest 331 |
2560 | House Robber IV | Array ,Binary Search | Medium | Weekly Contest 331 |
2561 | Rearranging Fruits | Greedy ,Array ,Hash Table | Hard | Weekly Contest 331 |
2562 | Find the Array Concatenation Value | Array ,Two Pointers ,Simulation | Easy | Weekly Contest 332 |
2563 | Count the Number of Fair Pairs | Array ,Two Pointers ,Binary Search ,Sorting | Medium | Weekly Contest 332 |
2564 | Substring XOR Queries | Bit Manipulation ,Array ,Hash Table ,String | Medium | Weekly Contest 332 |
2565 | Subsequence With the Minimum Score | Two Pointers ,String ,Binary Search | Hard | Weekly Contest 332 |
2566 | Maximum Difference by Remapping a Digit | Greedy ,Math | Easy | Biweekly Contest 98 |
2567 | Minimum Score by Changing Two Elements | Greedy ,Array ,Sorting | Medium | Biweekly Contest 98 |
2568 | Minimum Impossible OR | Bit Manipulation ,Brainteaser ,Array | Medium | Biweekly Contest 98 |
2569 | Handling Sum Queries After Update | Segment Tree ,Array | Hard | Biweekly Contest 98 |
2570 | Merge Two 2D Arrays by Summing Values | Array ,Hash Table ,Two Pointers | Easy | Weekly Contest 333 |
2571 | Minimum Operations to Reduce an Integer to 0 | Greedy ,Bit Manipulation ,Dynamic Programming | Medium | Weekly Contest 333 |
2572 | Count the Number of Square-Free Subsets | Bit Manipulation ,Array ,Math ,Dynamic Programming ,Bitmask | Medium | Weekly Contest 333 |
2573 | Find the String with LCP | Greedy ,Union Find ,Array ,String ,Dynamic Programming ,Matrix | Hard | Weekly Contest 333 |
2574 | Left and Right Sum Differences | Array ,Prefix Sum | Easy | Weekly Contest 334 |
2575 | Find the Divisibility Array of a String | Array ,Math ,String | Medium | Weekly Contest 334 |
2576 | Find the Maximum Number of Marked Indices | Greedy ,Array ,Two Pointers ,Binary Search ,Sorting | Medium | Weekly Contest 334 |
2577 | Minimum Time to Visit a Cell In a Grid | Breadth-First Search ,Graph ,Array ,Matrix ,Shortest Path ,Heap (Priority Queue) | Hard | Weekly Contest 334 |
2578 | Split With Minimum Sum | Greedy ,Math ,Sorting | Easy | Biweekly Contest 99 |
2579 | Count Total Number of Colored Cells | Math | Medium | Biweekly Contest 99 |
2580 | Count Ways to Group Overlapping Ranges | Array ,Sorting | Medium | Biweekly Contest 99 |
2581 | Count Number of Possible Root Nodes | Tree ,Depth-First Search ,Hash Table ,Dynamic Programming | Hard | Biweekly Contest 99 |
2582 | Pass the Pillow | Math ,Simulation | Easy | Weekly Contest 335 |
2583 | Kth Largest Sum in a Binary Tree | Tree ,Breadth-First Search ,Binary Tree ,Sorting | Medium | Weekly Contest 335 |
2584 | Split the Array to Make Coprime Products | Array ,Hash Table ,Math ,Number Theory | Hard | Weekly Contest 335 |
2585 | Number of Ways to Earn Points | Array ,Dynamic Programming | Hard | Weekly Contest 335 |
2586 | Count the Number of Vowel Strings in Range | Array ,String | Easy | Weekly Contest 336 |
2587 | Rearrange Array to Maximize Prefix Score | Greedy ,Array ,Prefix Sum ,Sorting | Medium | Weekly Contest 336 |
2588 | Count the Number of Beautiful Subarrays | Bit Manipulation ,Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 336 |
2589 | Minimum Time to Complete All Tasks | Stack ,Greedy ,Array ,Binary Search ,Sorting | Hard | Weekly Contest 336 |
2590 | Design a Todo List | Design ,Array ,Hash Table ,String ,Sorting | Medium | ???? |
2591 | Distribute Money to Maximum Children | Greedy ,Math | Easy | Biweekly Contest 100 |
2592 | Maximize Greatness of an Array | Greedy ,Array ,Two Pointers ,Sorting | Medium | Biweekly Contest 100 |
2593 | Find Score of an Array After Marking All Elements | Array ,Sorting ,Simulation ,Heap (Priority Queue) | Medium | Biweekly Contest 100 |
2594 | Minimum Time to Repair Cars | Array ,Binary Search | Medium | Biweekly Contest 100 |
2595 | Number of Even and Odd Bits | Bit Manipulation | Easy | Weekly Contest 337 |
2596 | Check Knight Tour Configuration | Depth-First Search ,Breadth-First Search ,Array ,Matrix ,Simulation | Medium | Weekly Contest 337 |
2597 | The Number of Beautiful Subsets | Array ,Dynamic Programming ,Backtracking ,Sorting | Medium | Weekly Contest 337 |
2598 | Smallest Missing Non-negative Integer After Operations | Greedy ,Array ,Hash Table ,Math | Medium | Weekly Contest 337 |
2599 | Make the Prefix Sum Non-negative | Greedy ,Array ,Heap (Priority Queue) | Medium | ???? |
2600 | K Items With the Maximum Sum | Greedy ,Math | Easy | Weekly Contest 338 |
2601 | Prime Subtraction Operation | Greedy ,Array ,Math ,Binary Search ,Number Theory | Medium | Weekly Contest 338 |
2602 | Minimum Operations to Make All Array Elements Equal | Array ,Binary Search ,Prefix Sum ,Sorting | Medium | Weekly Contest 338 |
2603 | Collect Coins in a Tree | Tree ,Graph ,Topological Sort ,Array | Hard | Weekly Contest 338 |
2604 | Minimum Time to Eat All Grains | Array ,Binary Search ,Sorting | Hard | ???? |
2605 | Form Smallest Number From Two Digit Arrays | Array ,Hash Table ,Enumeration | Easy | Biweekly Contest 101 |
2606 | Find the Substring With Maximum Cost | Array ,Hash Table ,String ,Dynamic Programming | Medium | Biweekly Contest 101 |
2607 | Make K-Subarray Sums Equal | Array ,Math ,Number Theory ,Sorting | Medium | Biweekly Contest 101 |
2608 | Shortest Cycle in a Graph | Breadth-First Search ,Graph | Hard | Biweekly Contest 101 |
2609 | Find the Longest Balanced Substring of a Binary String | String | Easy | Weekly Contest 339 |
2610 | Convert an Array Into a 2D Array With Conditions | Array ,Hash Table | Medium | Weekly Contest 339 |
2611 | Mice and Cheese | Greedy ,Array ,Sorting ,Heap (Priority Queue) | Medium | Weekly Contest 339 |
2612 | Minimum Reverse Operations | Breadth-First Search ,Array ,Ordered Set | Hard | Weekly Contest 339 |
2613 | Beautiful Pairs | Geometry ,Array ,Math ,Divide and Conquer ,Ordered Set ,Sorting | Hard | ???? |
2614 | Prime In Diagonal | Array ,Math ,Matrix ,Number Theory | Easy | Weekly Contest 340 |
2615 | Sum of Distances | Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 340 |
2616 | Minimize the Maximum Difference of Pairs | Greedy ,Array ,Binary Search | Medium | Weekly Contest 340 |
2617 | Minimum Number of Visited Cells in a Grid | Stack ,Union Find ,Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Dynamic Programming | Hard | Weekly Contest 340 |
2618 | Check if Object Instance of Class | Medium | ||
2619 | Array Prototype Last | Easy | ||
2620 | Counter | Easy | ||
2621 | Sleep | Easy | ||
2622 | Cache With Time Limit | Medium | ||
2623 | Memoize | Medium | ||
2624 | Snail Traversal | Medium | ||
2625 | Flatten Deeply Nested Array | Medium | ||
2626 | Array Reduce Transformation | Easy | ||
2627 | Debounce | Medium | ||
2628 | JSON Deep Equal | Medium | ???? | |
2629 | Function Composition | Easy | ||
2630 | Memoize II | Hard | ||
2631 | Group By | Medium | ||
2632 | Curry | Medium | ???? | |
2633 | Convert Object to JSON String | Medium | ???? | |
2634 | Filter Elements from Array | Easy | ||
2635 | Apply Transform Over Each Element in Array | Easy | ||
2636 | Promise Pool | Medium | ???? | |
2637 | Promise Time Limit | Medium | ||
2638 | Count the Number of K-Free Subsets | Array ,Dynamic Programming ,Sorting | Medium | ???? |
2639 | Find the Width of Columns of a Grid | Array ,Matrix | Easy | Biweekly Contest 102 |
2640 | Find the Score of All Prefixes of an Array | Array ,Prefix Sum | Medium | Biweekly Contest 102 |
2641 | Cousins in Binary Tree II | Tree ,Depth-First Search ,Breadth-First Search ,Hash Table ,Binary Tree | Medium | Biweekly Contest 102 |
2642 | Design Graph With Shortest Path Calculator | Graph ,Design ,Shortest Path ,Heap (Priority Queue) | Hard | Biweekly Contest 102 |
2643 | Row With Maximum Ones | Array ,Matrix | Easy | Weekly Contest 341 |
2644 | Find the Maximum Divisibility Score | Array | Easy | Weekly Contest 341 |
2645 | Minimum Additions to Make Valid String | Stack ,Greedy ,String ,Dynamic Programming | Medium | Weekly Contest 341 |
2646 | Minimize the Total Price of the Trips | Tree ,Depth-First Search ,Graph ,Array ,Dynamic Programming | Hard | Weekly Contest 341 |
2647 | Color the Triangle Red | Array ,Math | Hard | ???? |
2648 | Generate Fibonacci Sequence | Easy | ||
2649 | Nested Array Generator | Medium | ||
2650 | Design Cancellable Function | Hard | ||
2651 | Calculate Delayed Arrival Time | Math | Easy | Weekly Contest 342 |
2652 | Sum Multiples | Math | Easy | Weekly Contest 342 |
2653 | Sliding Subarray Beauty | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 342 |
2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Array ,Math ,Number Theory | Medium | Weekly Contest 342 |
2655 | Find Maximal Uncovered Ranges | Array ,Sorting | Medium | ???? |
2656 | Maximum Sum With Exactly K Elements | Greedy ,Array | Easy | Biweekly Contest 103 |
2657 | Find the Prefix Common Array of Two Arrays | Bit Manipulation ,Array ,Hash Table | Medium | Biweekly Contest 103 |
2658 | Maximum Number of Fish in a Grid | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | Biweekly Contest 103 |
2659 | Make Array Empty | Greedy ,Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Ordered Set ,Sorting | Hard | Biweekly Contest 103 |
2660 | Determine the Winner of a Bowling Game | Array ,Simulation | Easy | Weekly Contest 343 |
2661 | First Completely Painted Row or Column | Array ,Hash Table ,Matrix | Medium | Weekly Contest 343 |
2662 | Minimum Cost of a Path With Special Roads | Graph ,Array ,Shortest Path ,Heap (Priority Queue) | Medium | Weekly Contest 343 |
2663 | Lexicographically Smallest Beautiful String | Greedy ,String | Hard | Weekly Contest 343 |
2664 | The Knight’s Tour | Array ,Backtracking ,Matrix | Medium | ???? |
2665 | Counter II | Easy | ||
2666 | Allow One Function Call | Easy | ||
2667 | Create Hello World Function | Easy | ||
2668 | Find Latest Salaries | Database | Easy | ???? |
2669 | Count Artist Occurrences On Spotify Ranking List | Database | Easy | ???? |
2670 | Find the Distinct Difference Array | Array ,Hash Table | Easy | Weekly Contest 344 |
2671 | Frequency Tracker | Design ,Hash Table | Medium | Weekly Contest 344 |
2672 | Number of Adjacent Elements With the Same Color | Array | Medium | Weekly Contest 344 |
2673 | Make Costs of Paths Equal in a Binary Tree | Greedy ,Tree ,Array ,Dynamic Programming ,Binary Tree | Medium | Weekly Contest 344 |
2674 | Split a Circular Linked List | Linked List ,Two Pointers | Medium | ???? |
2675 | Array of Objects to Matrix | Hard | ???? | |
2676 | Throttle | Medium | ???? | |
2677 | Chunk Array | Easy | ||
2678 | Number of Senior Citizens | Array ,String | Easy | Biweekly Contest 104 |
2679 | Sum in a Matrix | Array ,Matrix ,Sorting ,Simulation ,Heap (Priority Queue) | Medium | Biweekly Contest 104 |
2680 | Maximum OR | Greedy ,Bit Manipulation ,Array ,Prefix Sum | Medium | Biweekly Contest 104 |
2681 | Power of Heroes | Array ,Math ,Prefix Sum ,Sorting | Hard | Biweekly Contest 104 |
2682 | Find the Losers of the Circular Game | Array ,Hash Table ,Simulation | Easy | Weekly Contest 345 |
2683 | Neighboring Bitwise XOR | Bit Manipulation ,Array | Medium | Weekly Contest 345 |
2684 | Maximum Number of Moves in a Grid | Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 345 |
2685 | Count the Number of Complete Components | Depth-First Search ,Breadth-First Search ,Graph | Medium | Weekly Contest 345 |
2686 | Immediate Food Delivery III | Database | Medium | ???? |
2687 | Bikes Last Time Used | Database | Easy | ???? |
2688 | Find Active Users | Database | Medium | ???? |
2689 | Extract Kth Character From The Rope Tree | Tree ,Depth-First Search ,Binary Tree | Easy | ???? |
2690 | Infinite Method Object | Easy | ???? | |
2691 | Immutability Helper | Hard | ???? | |
2692 | Make Object Immutable | Medium | ???? | |
2693 | Call Function with Custom Context | Medium | ||
2694 | Event Emitter | Medium | ||
2695 | Array Wrapper | Easy | ||
2696 | Minimum String Length After Removing Substrings | Stack ,String ,Simulation | Easy | Weekly Contest 346 |
2697 | Lexicographically Smallest Palindrome | Greedy ,Two Pointers ,String | Easy | Weekly Contest 346 |
2698 | Find the Punishment Number of an Integer | Math ,Backtracking | Medium | Weekly Contest 346 |
2699 | Modify Graph Edge Weights | Graph ,Shortest Path ,Heap (Priority Queue) | Hard | Weekly Contest 346 |
2700 | Differences Between Two Objects | Medium | ???? | |
2701 | Consecutive Transactions with Increasing Amounts | Database | Hard | ???? |
2702 | Minimum Operations to Make Numbers Non-positive | Array ,Binary Search | Hard | ???? |
2703 | Return Length of Arguments Passed | Easy | ||
2704 | To Be Or Not To Be | Easy | ||
2705 | Compact Object | Medium | ||
2706 | Buy Two Chocolates | Array ,Sorting | Easy | Biweekly Contest 105 |
2707 | Extra Characters in a String | Trie ,Array ,Hash Table ,String ,Dynamic Programming | Medium | Biweekly Contest 105 |
2708 | Maximum Strength of a Group | Greedy ,Array ,Backtracking ,Sorting | Medium | Biweekly Contest 105 |
2709 | Greatest Common Divisor Traversal | Union Find ,Array ,Math ,Number Theory | Hard | Biweekly Contest 105 |
2710 | Remove Trailing Zeros From a String | String | Easy | Weekly Contest 347 |
2711 | Difference of Number of Distinct Values on Diagonals | Array ,Hash Table ,Matrix | Medium | Weekly Contest 347 |
2712 | Minimum Cost to Make All Characters Equal | Greedy ,String ,Dynamic Programming | Medium | Weekly Contest 347 |
2713 | Maximum Strictly Increasing Cells in a Matrix | Memoization ,Array ,Binary Search ,Dynamic Programming ,Matrix ,Sorting | Hard | Weekly Contest 347 |
2714 | Find Shortest Path with K Hops | Graph ,Shortest Path ,Heap (Priority Queue) | Hard | ???? |
2715 | Timeout Cancellation | Easy | ||
2716 | Minimize String Length | Hash Table ,String | Easy | Weekly Contest 348 |
2717 | Semi-Ordered Permutation | Array ,Simulation | Easy | Weekly Contest 348 |
2718 | Sum of Matrix After Queries | Array ,Hash Table | Medium | Weekly Contest 348 |
2719 | Count of Integers | Math ,String ,Dynamic Programming | Hard | Weekly Contest 348 |
2720 | Popularity Percentage | Database | Hard | ???? |
2721 | Execute Asynchronous Functions in Parallel | Medium | ||
2722 | Join Two Arrays by ID | Medium | ||
2723 | Add Two Promises | Easy | ||
2724 | Sort By | Easy | ||
2725 | Interval Cancellation | Easy | ||
2726 | Calculator with Method Chaining | Easy | ||
2727 | Is Object Empty | Easy | ||
2728 | Count Houses in a Circular Street | Array ,Interactive | Easy | ???? |
2729 | Check if The Number is Fascinating | Hash Table ,Math | Easy | Biweekly Contest 106 |
2730 | Find the Longest Semi-Repetitive Substring | String ,Sliding Window | Medium | Biweekly Contest 106 |
2731 | Movement of Robots | Brainteaser ,Array ,Prefix Sum ,Sorting | Medium | Biweekly Contest 106 |
2732 | Find a Good Subset of the Matrix | Greedy ,Bit Manipulation ,Array ,Matrix | Hard | Biweekly Contest 106 |
2733 | Neither Minimum nor Maximum | Array ,Sorting | Easy | Weekly Contest 349 |
2734 | Lexicographically Smallest String After Substring Operation | Greedy ,String | Medium | Weekly Contest 349 |
2735 | Collecting Chocolates | Array ,Enumeration | Medium | Weekly Contest 349 |
2736 | Maximum Sum Queries | Stack ,Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Sorting ,Monotonic Stack | Hard | Weekly Contest 349 |
2737 | Find the Closest Marked Node | Graph ,Array ,Shortest Path ,Heap (Priority Queue) | Medium | ???? |
2738 | Count Occurrences in Text | Database | Medium | ???? |
2739 | Total Distance Traveled | Math ,Simulation | Easy | Weekly Contest 350 |
2740 | Find the Value of the Partition | Array ,Sorting | Medium | Weekly Contest 350 |
2741 | Special Permutations | Bit Manipulation ,Array ,Bitmask | Medium | Weekly Contest 350 |
2742 | Painting the Walls | Array ,Dynamic Programming | Hard | Weekly Contest 350 |
2743 | Count Substrings Without Repeating Character | Hash Table ,String ,Sliding Window | Medium | ???? |
2744 | Find Maximum Number of String Pairs | Array ,Hash Table ,String ,Simulation | Easy | Biweekly Contest 107 |
2745 | Construct the Longest New String | Greedy ,Brainteaser ,Math ,Dynamic Programming | Medium | Biweekly Contest 107 |
2746 | Decremental String Concatenation | Array ,String ,Dynamic Programming | Medium | Biweekly Contest 107 |
2747 | Count Zero Request Servers | Array ,Hash Table ,Sorting ,Sliding Window | Medium | Biweekly Contest 107 |
2748 | Number of Beautiful Pairs | Array ,Math ,Number Theory | Easy | Weekly Contest 351 |
2749 | Minimum Operations to Make the Integer Zero | Bit Manipulation ,Brainteaser | Medium | Weekly Contest 351 |
2750 | Ways to Split Array Into Good Subarrays | Array ,Math | Medium | Weekly Contest 351 |
2751 | Robot Collisions | Stack ,Array ,Sorting ,Simulation | Hard | Weekly Contest 351 |
2752 | Customers with Maximum Number of Transactions on Consecutive Days | Database | Hard | ???? |
2753 | Count Houses in a Circular Street II | Hard | ???? | |
2754 | Bind Function to Context | Medium | ???? | |
2755 | Deep Merge of Two Objects | Medium | ???? | |
2756 | Query Batching | Hard | ???? | |
2757 | Generate Circular Array Values | Medium | ???? | |
2758 | Next Day | Easy | ???? | |
2759 | Convert JSON String to Object | Hard | ???? | |
2760 | Longest Even Odd Subarray With Threshold | Array ,Sliding Window | Easy | Weekly Contest 352 |
2761 | Prime Pairs With Target Sum | Array ,Math ,Enumeration ,Number Theory | Medium | Weekly Contest 352 |
2762 | Continuous Subarrays | Queue ,Array ,Ordered Set ,Sliding Window ,Monotonic Queue ,Heap (Priority Queue) | Medium | Weekly Contest 352 |
2763 | Sum of Imbalance Numbers of All Subarrays | Array ,Hash Table ,Ordered Set | Hard | Weekly Contest 352 |
2764 | Is Array a Preorder of Some Binary Tree | Stack ,Tree ,Depth-First Search ,Binary Tree | Medium | ???? |
2765 | Longest Alternating Subarray | Array ,Enumeration | Easy | Biweekly Contest 108 |
2766 | Relocate Marbles | Array ,Hash Table ,Sorting ,Simulation | Medium | Biweekly Contest 108 |
2767 | Partition String Into Minimum Beautiful Substrings | Hash Table ,String ,Dynamic Programming ,Backtracking | Medium | Biweekly Contest 108 |
2768 | Number of Black Blocks | Array ,Hash Table ,Enumeration | Medium | Biweekly Contest 108 |
2769 | Find the Maximum Achievable Number | Math | Easy | Weekly Contest 353 |
2770 | Maximum Number of Jumps to Reach the Last Index | Array ,Dynamic Programming | Medium | Weekly Contest 353 |
2771 | Longest Non-decreasing Subarray From Two Arrays | Array ,Dynamic Programming | Medium | Weekly Contest 353 |
2772 | Apply Operations to Make All Array Elements Equal to Zero | Array ,Prefix Sum | Medium | Weekly Contest 353 |
2773 | Height of Special Binary Tree | Tree ,Depth-First Search ,Breadth-First Search ,Binary Tree | Medium | ???? |
2774 | Array Upper Bound | Easy | ???? | |
2775 | Undefined to Null | Medium | ???? | |
2776 | Convert Callback Based Function to Promise Based Function | Medium | ???? | |
2777 | Date Range Generator | Medium | ???? | |
2778 | Sum of Squares of Special Elements | Array ,Enumeration | Easy | Weekly Contest 354 |
2779 | Maximum Beauty of an Array After Applying Operation | Array ,Binary Search ,Sorting ,Sliding Window | Medium | Weekly Contest 354 |
2780 | Minimum Index of a Valid Split | Array ,Hash Table ,Sorting | Medium | Weekly Contest 354 |
2781 | Length of the Longest Valid Substring | Array ,Hash Table ,String ,Sliding Window | Hard | Weekly Contest 354 |
2782 | Number of Unique Categories | Union Find ,Counting ,Interactive | Medium | ???? |
2783 | Flight Occupancy and Waitlist Analysis | Database | Medium | ???? |
2784 | Check if Array is Good | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 109 |
2785 | Sort Vowels in a String | String ,Sorting | Medium | Biweekly Contest 109 |
2786 | Visit Array Positions to Maximize Score | Array ,Dynamic Programming | Medium | Biweekly Contest 109 |
2787 | Ways to Express an Integer as Sum of Powers | Dynamic Programming | Medium | Biweekly Contest 109 |
2788 | Split Strings by Separator | Array ,String | Easy | Weekly Contest 355 |
2789 | Largest Element in an Array after Merge Operations | Greedy ,Array | Medium | Weekly Contest 355 |
2790 | Maximum Number of Groups With Increasing Length | Greedy ,Array ,Math ,Binary Search ,Sorting | Hard | Weekly Contest 355 |
2791 | Count Paths That Can Form a Palindrome in a Tree | Bit Manipulation ,Tree ,Depth-First Search ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 355 |
2792 | Count Nodes That Are Great Enough | Tree ,Depth-First Search ,Divide and Conquer ,Binary Tree | Hard | ???? |
2793 | Status of Flight Tickets | Hard | ???? | |
2794 | Create Object from Two Arrays | Easy | ???? | |
2795 | Parallel Execution of Promises for Individual Results Retrieval | Medium | ???? | |
2796 | Repeat String | Easy | ???? | |
2797 | Partial Function with Placeholders | Easy | ???? | |
2798 | Number of Employees Who Met the Target | Array | Easy | Weekly Contest 356 |
2799 | Count Complete Subarrays in an Array | Array ,Hash Table ,Sliding Window | Medium | Weekly Contest 356 |
2800 | Shortest String That Contains Three Strings | Greedy ,String ,Enumeration | Medium | Weekly Contest 356 |
2801 | Count Stepping Numbers in Range | String ,Dynamic Programming | Hard | Weekly Contest 356 |
2802 | Find The K-th Lucky Number | Bit Manipulation ,Math ,String | Medium | ???? |
2803 | Factorial Generator | Easy | ???? | |
2804 | Array Prototype ForEach | Easy | ???? | |
2805 | Custom Interval | Medium | ???? | |
2806 | Account Balance After Rounded Purchase | Math | Easy | Biweekly Contest 110 |
2807 | Insert Greatest Common Divisors in Linked List | Linked List ,Math ,Number Theory | Medium | Biweekly Contest 110 |
2808 | Minimum Seconds to Equalize a Circular Array | Array ,Hash Table | Medium | Biweekly Contest 110 |
2809 | Minimum Time to Make Array Sum At Most x | Array ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 110 |
2810 | Faulty Keyboard | String ,Simulation | Easy | Weekly Contest 357 |
2811 | Check if it is Possible to Split Array | Greedy ,Array ,Dynamic Programming | Medium | Weekly Contest 357 |
2812 | Find the Safest Path in a Grid | Breadth-First Search ,Union Find ,Array ,Binary Search ,Matrix | Medium | Weekly Contest 357 |
2813 | Maximum Elegance of a K-Length Subsequence | Greedy ,Array ,Hash Table ,Sorting ,Heap (Priority Queue) | Hard | Weekly Contest 357 |
2814 | Minimum Time Takes to Reach Destination Without Drowning | Breadth-First Search ,Array ,Matrix | Hard | ???? |
2815 | Max Pair Sum in an Array | Array ,Hash Table | Easy | Weekly Contest 358 |
2816 | Double a Number Represented as a Linked List | Stack ,Linked List ,Math | Medium | Weekly Contest 358 |
2817 | Minimum Absolute Difference Between Elements With Constraint | Array ,Binary Search ,Ordered Set | Medium | Weekly Contest 358 |
2818 | Apply Operations to Maximize Score | Stack ,Greedy ,Array ,Math ,Number Theory ,Monotonic Stack | Hard | Weekly Contest 358 |
2819 | Minimum Relative Loss After Buying Chocolates | Array ,Binary Search ,Prefix Sum ,Sorting | Hard | ???? |
2820 | Election Results | Medium | ???? | |
2821 | Delay the Resolution of Each Promise | Easy | ???? | |
2822 | Inversion of Object | Easy | ???? | |
2823 | Deep Object Filter | Medium | ???? | |
2824 | Count Pairs Whose Sum is Less than Target | Array ,Two Pointers ,Binary Search ,Sorting | Easy | Biweekly Contest 111 |
2825 | Make String a Subsequence Using Cyclic Increments | Two Pointers ,String | Medium | Biweekly Contest 111 |
2826 | Sorting Three Groups | Array ,Binary Search ,Dynamic Programming | Medium | Biweekly Contest 111 |
2827 | Number of Beautiful Integers in the Range | Math ,Dynamic Programming | Hard | Biweekly Contest 111 |
2828 | Check if a String Is an Acronym of Words | Array ,String | Easy | Weekly Contest 359 |
2829 | Determine the Minimum Sum of a k-avoiding Array | Greedy ,Math | Medium | Weekly Contest 359 |
2830 | Maximize the Profit as the Salesman | Array ,Hash Table ,Binary Search ,Dynamic Programming ,Sorting | Medium | Weekly Contest 359 |
2831 | Find the Longest Equal Subarray | Array ,Hash Table ,Binary Search ,Sliding Window | Medium | Weekly Contest 359 |
2832 | Maximal Range That Each Element Is Maximum in It | Stack ,Array ,Monotonic Stack | Medium | ???? |
2833 | Furthest Point From Origin | String ,Counting | Easy | Weekly Contest 360 |
2834 | Find the Minimum Possible Sum of a Beautiful Array | Greedy ,Math | Medium | Weekly Contest 360 |
2835 | Minimum Operations to Form Subsequence With Target Sum | Greedy ,Bit Manipulation ,Array | Hard | Weekly Contest 360 |
2836 | Maximize Value of Function in a Ball Passing Game | Bit Manipulation ,Array ,Dynamic Programming | Hard | Weekly Contest 360 |
2837 | Total Traveled Distance | Database | Easy | ???? |
2838 | Maximum Coins Heroes Can Collect | Array ,Two Pointers ,Binary Search ,Prefix Sum ,Sorting | Medium | ???? |
2839 | Check if Strings Can be Made Equal With Operations I | String | Easy | Biweekly Contest 112 |
2840 | Check if Strings Can be Made Equal With Operations II | Hash Table ,String ,Sorting | Medium | Biweekly Contest 112 |
2841 | Maximum Sum of Almost Unique Subarray | Array ,Hash Table ,Sliding Window | Medium | Biweekly Contest 112 |
2842 | Count K-Subsequences of a String With Maximum Beauty | Greedy ,Hash Table ,Math ,String ,Combinatorics | Hard | Biweekly Contest 112 |
2843 | Count Symmetric Integers | Math ,Enumeration | Easy | Weekly Contest 361 |
2844 | Minimum Operations to Make a Special Number | Greedy ,Math ,String ,Enumeration | Medium | Weekly Contest 361 |
2845 | Count of Interesting Subarrays | Array ,Hash Table ,Prefix Sum | Medium | Weekly Contest 361 |
2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Tree ,Graph ,Array ,Strongly Connected Component | Hard | Weekly Contest 361 |
2847 | Smallest Number With Given Digit Product | Greedy ,Math | Medium | ???? |
2848 | Points That Intersect With Cars | Array ,Hash Table ,Prefix Sum | Easy | Weekly Contest 362 |
2849 | Determine if a Cell Is Reachable at a Given Time | Math | Medium | Weekly Contest 362 |
2850 | Minimum Moves to Spread Stones Over Grid | Breadth-First Search ,Array ,Dynamic Programming ,Matrix | Medium | Weekly Contest 362 |
2851 | String Transformation | Math ,String ,Dynamic Programming ,String Matching | Hard | Weekly Contest 362 |
2852 | Sum of Remoteness of All Cells | Depth-First Search ,Breadth-First Search ,Union Find ,Array ,Matrix | Medium | ???? |
2853 | Highest Salaries Difference | Database | Easy | ???? |
2854 | Rolling Average Steps | Database | Medium | ???? |
2855 | Minimum Right Shifts to Sort the Array | Array | Easy | Biweekly Contest 113 |
2856 | Minimum Array Length After Pair Removals | Greedy ,Array ,Hash Table ,Two Pointers ,Binary Search ,Counting | Medium | Biweekly Contest 113 |
2857 | Count Pairs of Points With Distance k | Bit Manipulation ,Array ,Hash Table | Medium | Biweekly Contest 113 |
2858 | Minimum Edge Reversals So Every Node Is Reachable | Depth-First Search ,Breadth-First Search ,Graph ,Dynamic Programming | Hard | Biweekly Contest 113 |
2859 | Sum of Values at Indices With K Set Bits | Bit Manipulation ,Array | Easy | Weekly Contest 363 |
2860 | Happy Students | Array ,Enumeration ,Sorting | Medium | Weekly Contest 363 |
2861 | Maximum Number of Alloys | Array ,Binary Search | Medium | Weekly Contest 363 |
2862 | Maximum Element-Sum of a Complete Subset of Indices | Array ,Math ,Number Theory | Hard | Weekly Contest 363 |
2863 | Maximum Length of Semi-Decreasing Subarrays | Array ,Hash Table ,Sorting | Medium | ???? |
2864 | Maximum Odd Binary Number | Greedy ,Math ,String | Easy | Weekly Contest 364 |
2865 | Beautiful Towers I | Stack ,Array ,Monotonic Stack | Medium | Weekly Contest 364 |
2866 | Beautiful Towers II | Stack ,Array ,Monotonic Stack | Medium | Weekly Contest 364 |
2867 | Count Valid Paths in a Tree | Tree ,Depth-First Search ,Math ,Dynamic Programming ,Number Theory | Hard | Weekly Contest 364 |
2868 | The Wording Game | Array ,Math ,Two Pointers ,String ,Game Theory | Hard | ???? |
2869 | Minimum Operations to Collect Elements | Bit Manipulation ,Array ,Hash Table | Easy | Biweekly Contest 114 |
2870 | Minimum Number of Operations to Make Array Empty | Greedy ,Array ,Hash Table ,Counting | Medium | Biweekly Contest 114 |
2871 | Split Array Into Maximum Number of Subarrays | Greedy ,Bit Manipulation ,Array | Medium | Biweekly Contest 114 |
2872 | Maximum Number of K-Divisible Components | Tree ,Depth-First Search | Hard | Biweekly Contest 114 |
2873 | Maximum Value of an Ordered Triplet I | Array | Easy | Weekly Contest 365 |
2874 | Maximum Value of an Ordered Triplet II | Array | Medium | Weekly Contest 365 |
2875 | Minimum Size Subarray in Infinite Array | Array ,Hash Table ,Prefix Sum ,Sliding Window | Medium | Weekly Contest 365 |
2876 | Count Visited Nodes in a Directed Graph | Graph ,Memoization ,Dynamic Programming | Hard | Weekly Contest 365 |
2877 | Create a DataFrame from List | Easy | ||
2878 | Get the Size of a DataFrame | Easy | ||
2879 | Display the First Three Rows | Easy | ||
2880 | Select Data | Easy | ||
2881 | Create a New Column | Easy | ||
2882 | Drop Duplicate Rows | Easy | ||
2883 | Drop Missing Data | Easy | ||
2884 | Modify Columns | Easy | ||
2885 | Rename Columns | Easy | ||
2886 | Change Data Type | Easy | ||
2887 | Fill Missing Data | Easy | ||
2888 | Reshape Data Concatenate | Easy | ||
2889 | Reshape Data Pivot | Easy | ||
2890 | Reshape Data Melt | Easy | ||
2891 | Method Chaining | Easy | ||
2892 | Minimizing Array After Replacing Pairs With Their Product | Greedy ,Array ,Dynamic Programming | Medium | ???? |
2893 | Calculate Orders Within Each Interval | Database | Medium | ???? |
2894 | Divisible and Non-divisible Sums Difference | Math | Easy | Weekly Contest 366 |
2895 | Minimum Processing Time | Greedy ,Array ,Sorting | Medium | Weekly Contest 366 |
2896 | Apply Operations to Make Two Strings Equal | String ,Dynamic Programming | Medium | Weekly Contest 366 |
2897 | Apply Operations on Array to Maximize Sum of Squares | Greedy ,Bit Manipulation ,Array ,Hash Table | Hard | Weekly Contest 366 |
2898 | Maximum Linear Stock Score | Array ,Hash Table | Medium | ???? |
2899 | Last Visited Integers | Array ,Simulation | Easy | Biweekly Contest 115 |
2900 | Longest Unequal Adjacent Groups Subsequence I | Greedy ,Array ,String ,Dynamic Programming | Easy | Biweekly Contest 115 |
2901 | Longest Unequal Adjacent Groups Subsequence II | Array ,String ,Dynamic Programming | Medium | Biweekly Contest 115 |
2902 | Count of Sub-Multisets With Bounded Sum | Array ,Hash Table ,Dynamic Programming ,Sliding Window | Hard | Biweekly Contest 115 |
2903 | Find Indices With Index and Value Difference I | Array ,Two Pointers | Easy | Weekly Contest 367 |
2904 | Shortest and Lexicographically Smallest Beautiful String | String ,Sliding Window | Medium | Weekly Contest 367 |
2905 | Find Indices With Index and Value Difference II | Array ,Two Pointers | Medium | Weekly Contest 367 |
2906 | Construct Product Matrix | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 367 |
2907 | Maximum Profitable Triplets With Increasing Prices I | Binary Indexed Tree ,Segment Tree ,Array | Medium | ???? |
2908 | Minimum Sum of Mountain Triplets I | Array | Easy | Weekly Contest 368 |
2909 | Minimum Sum of Mountain Triplets II | Array | Medium | Weekly Contest 368 |
2910 | Minimum Number of Groups to Create a Valid Assignment | Greedy ,Array ,Hash Table | Medium | Weekly Contest 368 |
2911 | Minimum Changes to Make K Semi-palindromes | Two Pointers ,String ,Dynamic Programming | Hard | Weekly Contest 368 |
2912 | Number of Ways to Reach Destination in the Grid | Math ,Dynamic Programming ,Combinatorics | Hard | ???? |
2913 | Subarrays Distinct Element Sum of Squares I | Array ,Hash Table | Easy | Biweekly Contest 116 |
2914 | Minimum Number of Changes to Make Binary String Beautiful | String | Medium | Biweekly Contest 116 |
2915 | Length of the Longest Subsequence That Sums to Target | Array ,Dynamic Programming | Medium | Biweekly Contest 116 |
2916 | Subarrays Distinct Element Sum of Squares II | Binary Indexed Tree ,Segment Tree ,Array ,Dynamic Programming | Hard | Biweekly Contest 116 |
2917 | Find the K-or of an Array | Bit Manipulation ,Array | Easy | Weekly Contest 369 |
2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Greedy ,Array | Medium | Weekly Contest 369 |
2919 | Minimum Increment Operations to Make Array Beautiful | Array ,Dynamic Programming | Medium | Weekly Contest 369 |
2920 | Maximum Points After Collecting Coins From All Nodes | Bit Manipulation ,Tree ,Depth-First Search ,Array ,Dynamic Programming | Hard | Weekly Contest 369 |
2921 | Maximum Profitable Triplets With Increasing Prices II | Binary Indexed Tree ,Segment Tree ,Array | Hard | ???? |
2922 | Market Analysis III | Database | Medium | ???? |
2923 | Find Champion I | Array ,Matrix | Easy | Weekly Contest 370 |
2924 | Find Champion II | Graph | Medium | Weekly Contest 370 |
2925 | Maximum Score After Applying Operations on a Tree | Tree ,Depth-First Search ,Dynamic Programming | Medium | Weekly Contest 370 |
2926 | Maximum Balanced Subsequence Sum | Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Dynamic Programming | Hard | Weekly Contest 370 |
2927 | Distribute Candies Among Children III | Math ,Combinatorics | Hard | ???? |
2928 | Distribute Candies Among Children I | Math ,Combinatorics ,Enumeration | Easy | Biweekly Contest 117 |
2929 | Distribute Candies Among Children II | Math ,Combinatorics ,Enumeration | Medium | Biweekly Contest 117 |
2930 | Number of Strings Which Can Be Rearranged to Contain Substring | Math ,Dynamic Programming ,Combinatorics | Medium | Biweekly Contest 117 |
2931 | Maximum Spending After Buying Items | Greedy ,Array ,Matrix ,Sorting ,Heap (Priority Queue) | Hard | Biweekly Contest 117 |
2932 | Maximum Strong Pair XOR I | Bit Manipulation ,Trie ,Array ,Hash Table ,Sliding Window | Easy | Weekly Contest 371 |
2933 | High-Access Employees | Array ,Hash Table ,String ,Sorting | Medium | Weekly Contest 371 |
2934 | Minimum Operations to Maximize Last Elements in Arrays | Array ,Enumeration | Medium | Weekly Contest 371 |
2935 | Maximum Strong Pair XOR II | Bit Manipulation ,Trie ,Array ,Hash Table ,Sliding Window | Hard | Weekly Contest 371 |
2936 | Number of Equal Numbers Blocks | Array ,Binary Search ,Divide and Conquer ,Interactive | Medium | ???? |
2937 | Make Three Strings Equal | String | Easy | Weekly Contest 372 |
2938 | Separate Black and White Balls | Greedy ,Two Pointers ,String | Medium | Weekly Contest 372 |
2939 | Maximum Xor Product | Greedy ,Bit Manipulation ,Math | Medium | Weekly Contest 372 |
2940 | Find Building Where Alice and Bob Can Meet | Stack ,Binary Indexed Tree ,Segment Tree ,Array ,Binary Search ,Monotonic Stack ,Heap (Priority Queue) | Hard | Weekly Contest 372 |
2941 | Maximum GCD-Sum of a Subarray | Array ,Math ,Binary Search ,Number Theory | Hard | ???? |
2942 | Find Words Containing Character | Array ,String | Easy | Biweekly Contest 118 |
2943 | Maximize Area of Square Hole in Grid | Array ,Sorting | Medium | Biweekly Contest 118 |
2944 | Minimum Number of Coins for Fruits | Queue ,Array ,Dynamic Programming ,Monotonic Queue ,Heap (Priority Queue) | Medium | Biweekly Contest 118 |
2945 | Find Maximum Non-decreasing Array Length | Stack ,Queue ,Array ,Binary Search ,Dynamic Programming ,Monotonic Queue ,Monotonic Stack | Hard | Biweekly Contest 118 |
2946 | Matrix Similarity After Cyclic Shifts | Array ,Math ,Matrix ,Simulation | Easy | Weekly Contest 373 |
2947 | Count Beautiful Substrings I | String ,Enumeration ,Prefix Sum | Medium | Weekly Contest 373 |
2948 | Make Lexicographically Smallest Array by Swapping Elements | Union Find ,Array ,Sorting | Medium | Weekly Contest 373 |
2949 | Count Beautiful Substrings II | Hash Table ,Math ,String ,Number Theory ,Prefix Sum | Hard | Weekly Contest 373 |
2950 | Number of Divisible Substrings | Hash Table ,String ,Counting ,Prefix Sum | Medium | ???? |
2951 | Find the Peaks | Array ,Enumeration | Easy | Weekly Contest 374 |
2952 | Minimum Number of Coins to be Added | Greedy ,Array ,Sorting | Medium | Weekly Contest 374 |
2953 | Count Complete Substrings | Hash Table ,String ,Sliding Window | Hard | Weekly Contest 374 |
2954 | Count the Number of Infection Sequences | Array ,Math ,Combinatorics | Hard | Weekly Contest 374 |
2955 | Number of Same-End Substrings | Array ,Hash Table ,String ,Counting ,Prefix Sum | Medium | ???? |
2956 | Find Common Elements Between Two Arrays | Array ,Hash Table | Easy | Biweekly Contest 119 |
2957 | Remove Adjacent Almost-Equal Characters | Greedy ,String ,Dynamic Programming | Medium | Biweekly Contest 119 |
2958 | Length of Longest Subarray With at Most K Frequency | Array ,Hash Table ,Sliding Window | Medium | Biweekly Contest 119 |
2959 | Number of Possible Sets of Closing Branches | Bit Manipulation ,Graph ,Enumeration ,Shortest Path ,Heap (Priority Queue) | Hard | Biweekly Contest 119 |
2960 | Count Tested Devices After Test Operations | Array ,Simulation | Easy | Weekly Contest 375 |
2961 | Double Modular Exponentiation | Array ,Math ,Simulation | Medium | Weekly Contest 375 |
2962 | Count Subarrays Where Max Element Appears at Least K Times | Array ,Sliding Window | Medium | Weekly Contest 375 |
2963 | Count the Number of Good Partitions | Array ,Hash Table ,Math ,Combinatorics | Hard | Weekly Contest 375 |
2964 | Number of Divisible Triplet Sums | Array ,Hash Table | Medium | ???? |
2965 | Find Missing and Repeated Values | Array ,Hash Table ,Math ,Matrix | Easy | Weekly Contest 376 |
2966 | Divide Array Into Arrays With Max Difference | Greedy ,Array ,Sorting | Medium | Weekly Contest 376 |
2967 | Minimum Cost to Make Array Equalindromic | Greedy ,Array ,Math ,Sorting | Medium | Weekly Contest 376 |
2968 | Apply Operations to Maximize Frequency Score | Array ,Binary Search ,Prefix Sum ,Sorting ,Sliding Window | Hard | Weekly Contest 376 |
2969 | Minimum Number of Coins for Fruits II | Queue ,Array ,Dynamic Programming ,Monotonic Queue ,Heap (Priority Queue) | Hard | ???? |
2970 | Count the Number of Incremovable Subarrays I | Array ,Two Pointers ,Binary Search ,Enumeration | Easy | Biweekly Contest 120 |
2971 | Find Polygon With the Largest Perimeter | Greedy ,Array ,Prefix Sum ,Sorting | Medium | Biweekly Contest 120 |
2972 | Count the Number of Incremovable Subarrays II | Array ,Two Pointers ,Binary Search | Hard | Biweekly Contest 120 |
2973 | Find Number of Coins to Place in Tree Nodes | Tree ,Depth-First Search ,Dynamic Programming ,Sorting ,Heap (Priority Queue) | Hard | Biweekly Contest 120 |
2974 | Minimum Number Game | Array ,Sorting ,Simulation ,Heap (Priority Queue) | Easy | Weekly Contest 377 |
2975 | Maximum Square Area by Removing Fences From a Field | Array ,Hash Table ,Enumeration | Medium | Weekly Contest 377 |
2976 | Minimum Cost to Convert String I | Graph ,Array ,String ,Shortest Path | Medium | Weekly Contest 377 |
2977 | Minimum Cost to Convert String II | Graph ,Trie ,Array ,String ,Dynamic Programming ,Shortest Path | Hard | Weekly Contest 377 |
2978 | Symmetric Coordinates | Database | Medium | ???? |
2979 | Most Expensive Item That Can Not Be Bought | Math ,Dynamic Programming ,Number Theory | Medium | ???? |
2980 | Check if Bitwise OR Has Trailing Zeros | Bit Manipulation ,Array | Easy | Weekly Contest 378 |
2981 | Find Longest Special Substring That Occurs Thrice I | Hash Table ,String ,Binary Search ,Counting ,Sliding Window | Medium | Weekly Contest 378 |
2982 | Find Longest Special Substring That Occurs Thrice II | Hash Table ,String ,Binary Search ,Counting ,Sliding Window | Medium | Weekly Contest 378 |
2983 | Palindrome Rearrangement Queries | Hash Table ,String ,Prefix Sum | Hard | Weekly Contest 378 |
2984 | Find Peak Calling Hours for Each City | Database | Medium | ???? |
2985 | Calculate Compressed Mean | Database | Easy | ???? |
2986 | Find Third Transaction | Database | Medium | ???? |
2987 | Find Expensive Cities | Database | Easy | ???? |
2988 | Manager of the Largest Department | Database | Medium | ???? |
2989 | Class Performance | Database | Medium | ???? |
2990 | Loan Types | Database | Easy | ???? |
2991 | Top Three Wineries | Database | Hard | ???? |
2992 | Number of Self-Divisible Permutations | Bit Manipulation ,Recursion ,Array ,Dynamic Programming ,Bitmask | Medium | ???? |
2993 | Friday Purchases I | Database | Medium | ???? |
2994 | Friday Purchases II | Database | Hard | ???? |
2995 | Viewers Turned Streamers | Database | Hard | ???? |
2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | Array ,Hash Table ,Sorting | Easy | Biweekly Contest 121 |
2997 | Minimum Number of Operations to Make Array XOR Equal to K | Bit Manipulation ,Array | Medium | Biweekly Contest 121 |
2998 | Minimum Number of Operations to Make X and Y Equal | Breadth-First Search ,Memoization ,Dynamic Programming | Medium | Biweekly Contest 121 |
2999 | Count the Number of Powerful Integers | Math ,String ,Dynamic Programming | Hard | Biweekly Contest 121 |
3000 | Maximum Area of Longest Diagonal Rectangle | Array | Easy | Weekly Contest 379 |
3001 | Minimum Moves to Capture The Queen | Array ,Enumeration | Medium | Weekly Contest 379 |
3002 | Maximum Size of a Set After Removals | Greedy ,Array ,Hash Table | Medium | Weekly Contest 379 |
3003 | Maximize the Number of Partitions After Operations | Bit Manipulation ,String ,Dynamic Programming ,Bitmask | Hard | Weekly Contest 379 |
3004 | Maximum Subtree of the Same Color | Tree ,Depth-First Search ,Array ,Dynamic Programming | Medium | ???? |
3005 | Count Elements With Maximum Frequency | Array ,Hash Table ,Counting | Easy | Weekly Contest 380 |
3006 | Find Beautiful Indices in the Given Array I | Two Pointers ,String ,Binary Search ,String Matching ,Hash Function ,Rolling Hash | Medium | Weekly Contest 380 |
3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | Bit Manipulation ,Binary Search ,Dynamic Programming | Medium | Weekly Contest 380 |
3008 | Find Beautiful Indices in the Given Array II | Two Pointers ,String ,Binary Search ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 380 |
3009 | Maximum Number of Intersections on the Chart | Binary Indexed Tree ,Geometry ,Array ,Math | Hard | ???? |
3010 | Divide an Array Into Subarrays With Minimum Cost I | Array ,Enumeration ,Sorting | Easy | Biweekly Contest 122 |
3011 | Find if Array Can Be Sorted | Bit Manipulation ,Array ,Sorting | Medium | Biweekly Contest 122 |
3012 | Minimize Length of Array Using Operations | Greedy ,Array ,Math ,Number Theory | Medium | Biweekly Contest 122 |
3013 | Divide an Array Into Subarrays With Minimum Cost II | Array ,Hash Table ,Sliding Window ,Heap (Priority Queue) | Hard | Biweekly Contest 122 |
3014 | Minimum Number of Pushes to Type Word I | Greedy ,Math ,String | Easy | Weekly Contest 381 |
3015 | Count the Number of Houses at a Certain Distance I | Breadth-First Search ,Graph ,Prefix Sum | Medium | Weekly Contest 381 |
3016 | Minimum Number of Pushes to Type Word II | Greedy ,Hash Table ,String ,Counting ,Sorting | Medium | Weekly Contest 381 |
3017 | Count the Number of Houses at a Certain Distance II | Breadth-First Search ,Graph ,Prefix Sum | Hard | Weekly Contest 381 |
3018 | Maximum Number of Removal Queries That Can Be Processed I | Array ,Dynamic Programming | Hard | ???? |
3019 | Number of Changing Keys | String | Easy | Weekly Contest 382 |
3020 | Find the Maximum Number of Elements in Subset | Array ,Hash Table ,Enumeration | Medium | Weekly Contest 382 |
3021 | Alice and Bob Playing Flower Game | Math | Medium | Weekly Contest 382 |
3022 | Minimize OR of Remaining Elements Using Operations | Greedy ,Bit Manipulation ,Array | Hard | Weekly Contest 382 |
3023 | Find Pattern in Infinite Stream I | Array ,String Matching ,Sliding Window ,Hash Function ,Rolling Hash | Medium | ???? |
3024 | Type of Triangle | Array ,Math ,Sorting | Easy | Biweekly Contest 123 |
3025 | Find the Number of Ways to Place People I | Geometry ,Array ,Math ,Enumeration ,Sorting | Medium | Biweekly Contest 123 |
3026 | Maximum Good Subarray Sum | Array ,Hash Table ,Prefix Sum | Medium | Biweekly Contest 123 |
3027 | Find the Number of Ways to Place People II | Geometry ,Array ,Math ,Enumeration ,Sorting | Hard | Biweekly Contest 123 |
3028 | Ant on the Boundary | Array ,Prefix Sum ,Simulation | Easy | Weekly Contest 383 |
3029 | Minimum Time to Revert Word to Initial State I | String ,String Matching ,Hash Function ,Rolling Hash | Medium | Weekly Contest 383 |
3030 | Find the Grid of Region Average | Array ,Matrix | Medium | Weekly Contest 383 |
3031 | Minimum Time to Revert Word to Initial State II | String ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 383 |
3032 | Count Numbers With Unique Digits II | Hash Table ,Math ,Dynamic Programming | Easy | ???? |
3033 | Modify the Matrix | Array ,Matrix | Easy | Weekly Contest 384 |
3034 | Number of Subarrays That Match a Pattern I | Array ,String Matching ,Hash Function ,Rolling Hash | Medium | Weekly Contest 384 |
3035 | Maximum Palindromes After Operations | Greedy ,Array ,Hash Table ,String ,Counting ,Sorting | Medium | Weekly Contest 384 |
3036 | Number of Subarrays That Match a Pattern II | Array ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 384 |
3037 | Find Pattern in Infinite Stream II | Array ,String Matching ,Sliding Window ,Hash Function ,Rolling Hash | Hard | ???? |
3038 | Maximum Number of Operations With the Same Score I | Array ,Simulation | Easy | Biweekly Contest 124 |
3039 | Apply Operations to Make String Empty | Array ,Hash Table ,Counting ,Sorting | Medium | Biweekly Contest 124 |
3040 | Maximum Number of Operations With the Same Score II | Memoization ,Array ,Dynamic Programming | Medium | Biweekly Contest 124 |
3041 | Maximize Consecutive Elements in an Array After Modification | Array ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 124 |
3042 | Count Prefix and Suffix Pairs I | Trie ,Array ,String ,String Matching ,Hash Function ,Rolling Hash | Easy | Weekly Contest 385 |
3043 | Find the Length of the Longest Common Prefix | Trie ,Array ,Hash Table ,String | Medium | Weekly Contest 385 |
3044 | Most Frequent Prime | Array ,Hash Table ,Math ,Counting ,Enumeration ,Matrix ,Number Theory | Medium | Weekly Contest 385 |
3045 | Count Prefix and Suffix Pairs II | Trie ,Array ,String ,String Matching ,Hash Function ,Rolling Hash | Hard | Weekly Contest 385 |
3046 | Split the Array | Array ,Hash Table ,Counting | Easy | Weekly Contest 386 |
3047 | Find the Largest Area of Square Inside Two Rectangles | Geometry ,Array ,Math | Medium | Weekly Contest 386 |
3048 | Earliest Second to Mark Indices I | Array ,Binary Search | Medium | Weekly Contest 386 |
3049 | Earliest Second to Mark Indices II | Greedy ,Array ,Binary Search ,Heap (Priority Queue) | Hard | Weekly Contest 386 |
3050 | Pizza Toppings Cost Analysis | Database | Medium | ???? |
3051 | Find Candidates for Data Scientist Position | Database | Easy | ???? |
3052 | Maximize Items | Database | Hard | ???? |
3053 | Classifying Triangles by Lengths | Database | Easy | ???? |
3054 | Binary Tree Nodes | Database | Medium | ???? |
3055 | Top Percentile Fraud | Database | Medium | ???? |
3056 | Snaps Analysis | Database | Medium | ???? |
3057 | Employees Project Allocation | Database | Hard | ???? |
3058 | Friends With No Mutual Friends | Database | Medium | ???? |
3059 | Find All Unique Email Domains | Database | Easy | ???? |
3060 | User Activities within Time Bounds | Database | Hard | ???? |
3061 | Calculate Trapping Rain Water | Database | Hard | ???? |
3062 | Winner of the Linked List Game | Linked List | Easy | ???? |
3063 | Linked List Frequency | Hash Table ,Linked List ,Counting | Easy | ???? |
3064 | Guess the Number Using Bitwise Questions I | Bit Manipulation ,Interactive | Medium | ???? |
3065 | Minimum Operations to Exceed Threshold Value I | Array | Easy | Biweekly Contest 125 |
3066 | Minimum Operations to Exceed Threshold Value II | Array ,Simulation ,Heap (Priority Queue) | Medium | Biweekly Contest 125 |
3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | Tree ,Depth-First Search ,Array | Medium | Biweekly Contest 125 |
3068 | Find the Maximum Sum of Node Values | Greedy ,Bit Manipulation ,Tree ,Array ,Dynamic Programming ,Sorting | Hard | Biweekly Contest 125 |
3069 | Distribute Elements Into Two Arrays I | Array ,Simulation | Easy | Weekly Contest 387 |
3070 | Count Submatrices with Top-Left Element and Sum Less Than k | Array ,Matrix ,Prefix Sum | Medium | Weekly Contest 387 |
3071 | Minimum Operations to Write the Letter Y on a Grid | Array ,Hash Table ,Counting ,Matrix | Medium | Weekly Contest 387 |
3072 | Distribute Elements Into Two Arrays II | Binary Indexed Tree ,Segment Tree ,Array ,Simulation | Hard | Weekly Contest 387 |
3073 | Maximum Increasing Triplet Value | Array ,Ordered Set | Medium | ???? |
3074 | Apple Redistribution into Boxes | Greedy ,Array ,Sorting | Easy | Weekly Contest 388 |
3075 | Maximize Happiness of Selected Children | Greedy ,Array ,Sorting | Medium | Weekly Contest 388 |
3076 | Shortest Uncommon Substring in an Array | Trie ,Array ,Hash Table ,String | Medium | Weekly Contest 388 |
3077 | Maximum Strength of K Disjoint Subarrays | Array ,Dynamic Programming ,Prefix Sum | Hard | Weekly Contest 388 |
3078 | Match Alphanumerical Pattern in Matrix I | Medium | ???? | |
3079 | Find the Sum of Encrypted Integers | Easy | Biweekly Contest 126 | |
3080 | Mark Elements on Array by Performing Queries | Medium | Biweekly Contest 126 | |
3081 | Replace Question Marks in String to Minimize Its Value | Medium | Biweekly Contest 126 | |
3082 | Find the Sum of the Power of All Subsequences | Hard | Biweekly Contest 126 | |
3083 | Existence of a Substring in a String and Its Reverse | Easy | Weekly Contest 389 | |
3084 | Count Substrings Starting and Ending with Given Character | Medium | Weekly Contest 389 | |
3085 | Minimum Deletions to Make String K-Special | Medium | Weekly Contest 389 | |
3086 | Minimum Moves to Pick K Ones | Hard | Weekly Contest 389 | |
3087 | Find Trending Hashtags | Medium | ???? |
Copyright
The copyright of this project belongs to Doocs community. For commercial reprints, please contact @yanglbme for authorization. For non-commercial reprints, please indicate the source.
Contact Us
We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together.
![]() |
---|
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论