CodeSearch

pick a problem · learn it with an AI tutor — hints, not spoilers

37,000 problems · all sources

3155. Maximum Number of Upgradable ServersMedium
LeetCodeArrayMathBinary Search
3157. Find the Level of Tree with Minimum SumMedium
LeetCodeTreeDepth-First SearchBreadth-First SearchBinary Tree
3159. Find Occurrences of an Element in an ArrayMedium
LeetCodeArrayHash Table
316. Remove Duplicate LettersMedium
LeetCodeStringStackGreedyMonotonic Stack
3160. Find the Number of Distinct Colors Among the BallsMedium
LeetCodeArrayHash TableSimulation
3163. String Compression IIIMedium
LeetCodeString
3164. Find the Number of Good Pairs IIMedium
LeetCodeArrayHash Table
3166. Calculate Parking Fees and DurationMedium
LeetCodeDatabase
3167. Better Compression of StringMedium
LeetCodeHash TableStringSortingCounting
3169. Count Days Without MeetingsMedium
LeetCodeArraySorting
3170. Lexicographically Minimum String After Removing StarsMedium
LeetCodeHash TableStringStackGreedy
3175. Find The First Player to win K Games in a RowMedium
LeetCodeArraySimulation
3176. Find the Maximum Length of a Good Subsequence IMedium
LeetCodeArrayHash TableDynamic Programming
3179. Find the N-th Value After K SecondsMedium
LeetCodeArrayMathSimulationCombinatorics
318. Maximum Product of Word LengthsMedium
LeetCodeArrayStringBit Manipulation
3180. Maximum Total Reward Using Operations IMedium
LeetCodeArrayDynamic ProgrammingBit ManipulationSorting
3182. Find Top Scoring StudentsMedium
LeetCodeDatabase
3183. The Number of Ways to Make the SumMedium
LeetCodeArrayDynamic Programming
3185. Count Pairs That Form a Complete Day IIMedium
LeetCodeArrayHash TableCounting
3186. Maximum Total Damage With Spell CastingMedium
LeetCodeArrayHash TableTwo PointersBinary Search
3189. Minimum Moves to Get a Peaceful BoardMedium
LeetCodeArrayGreedySortingCounting Sort
319. Bulb SwitcherMedium
LeetCodeMathBrainteaser
3191. Minimum Operations to Make Binary Array Elements Equal to One IMedium
LeetCodeArrayBit ManipulationQueueSliding Window
3192. Minimum Operations to Make Binary Array Elements Equal to One IIMedium
LeetCodeArrayDynamic ProgrammingGreedy
3195. Find the Minimum Area to Cover All Ones IMedium
LeetCodeArrayMatrix
3196. Maximize Total Cost of Alternating SubarraysMedium
LeetCodeArrayDynamic Programming
320. Generalized AbbreviationMedium
LeetCodeStringBacktrackingBit Manipulation
3201. Find the Maximum Length of Valid Subsequence IMedium
LeetCodeArrayDynamic Programming
3202. Find the Maximum Length of Valid Subsequence IIMedium
LeetCodeArrayDynamic Programming
3204. Bitwise User Permissions AnalysisMedium
LeetCodeDatabase
3205. Maximum Array Hopping Score IMedium
LeetCodeArrayDynamic ProgrammingStackGreedy
3207. Maximum Points After Enemy BattlesMedium
LeetCodeArrayGreedy
3208. Alternating Groups IIMedium
LeetCodeArraySliding Window
3211. Generate Binary Strings Without Adjacent ZerosMedium
LeetCodeStringBacktrackingBit Manipulation
3212. Count Submatrices With Equal Frequency of X and YMedium
LeetCodeArrayMatrixPrefix Sum
3215. Count Triplets with Even XOR Set Bits IIMedium
LeetCodeArrayBit Manipulation
3217. Delete Nodes From Linked List Present in ArrayMedium
LeetCodeArrayHash TableLinked List
3218. Minimum Cost for Cutting Cake IMedium
LeetCodeArrayTwo PointersDynamic ProgrammingGreedy
322. Coin ChangeMedium
LeetCodeArrayDynamic ProgrammingBreadth-First Search
3220. Odd and Even TransactionsMedium
LeetCodeDatabase
3221. Maximum Array Hopping Score IIMedium
LeetCodeArrayStackGreedyMonotonic Stack
3223. Minimum Length of String After OperationsMedium
LeetCodeHash TableStringCounting
3224. Minimum Array Changes to Make Differences EqualMedium
LeetCodeArrayHash TablePrefix Sum
3227. Vowels Game in a StringMedium
LeetCodeMathStringBrainteaserGame Theory
3228. Maximum Number of Operations to Move Ones to the EndMedium
LeetCodeStringGreedyCounting
323. Number of Connected Components in an Undirected GraphMedium
LeetCodeDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
3230. Customer Purchasing Behavior AnalysisMedium
LeetCodeDatabase
3233. Find the Count of Numbers Which Are Not SpecialMedium
LeetCodeArrayMathNumber Theory
3234. Count the Number of Substrings With Dominant OnesMedium
LeetCodeStringEnumeration
3237. Alt and Tab SimulationMedium
LeetCodeArrayHash TableSimulation
3239. Minimum Number of Flips to Make Binary Grid Palindromic IMedium
LeetCodeArrayTwo PointersMatrix
324. Wiggle Sort IIMedium
LeetCodeArrayDivide and ConquerGreedySorting
3240. Minimum Number of Flips to Make Binary Grid Palindromic IIMedium
LeetCodeArrayTwo PointersMatrix
3243. Shortest Distance After Road Addition Queries IMedium
LeetCodeArrayBreadth-First SearchGraph Theory
3247. Number of Subsequences with Odd SumMedium
LeetCodeArrayMathDynamic ProgrammingCombinatorics
3249. Count the Number of Good NodesMedium
LeetCodeTreeDepth-First Search
325. Maximum Size Subarray Sum Equals kMedium
LeetCodeArrayHash TablePrefix Sum
3252. Premier League Table Ranking IIMedium
LeetCodeDatabase
3253. Construct String with Minimum Cost (Easy)Medium
LeetCode
3254. Find the Power of K-Size Subarrays IMedium
LeetCodeArraySliding Window

← prevpage 133 / 617next →