| 1358 | Number of Substrings Containing All Three Characters | Hash TableStringSliding Window | Medium |
| 1359 | Count All Valid Pickup and Delivery Options | MathDynamic ProgrammingCombinatorics | Hard |
| 1360 | Number of Days Between Two Dates | MathString | Easy |
| 1361 | Validate Binary Tree Nodes | TreeDepth-First SearchBreadth-First Search+3 | Medium |
| 1362 | Closest Divisors | Math | Medium |
| 1363 | Largest Multiple of Three | ArrayMathDynamic Programming+2 | Hard |
| 1365 | How Many Numbers Are Smaller Than the Current Number | ArrayHash TableSorting+1 | Easy |
| 1366 | Rank Teams by Votes | ArrayHash TableString+2 | Medium |
| 1367 | Linked List in Binary Tree | Linked ListTreeDepth-First Search+1 | Medium |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | ArrayBreadth-First SearchGraph+3 | Hard |
| 1370 | Increasing Decreasing String | Hash TableStringCounting | Easy |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Hash TableStringBit Manipulation+1 | Medium |
| 1372 | Longest ZigZag Path in a Binary Tree | Dynamic ProgrammingTreeDepth-First Search+1 | Medium |
| 1373 | Maximum Sum BST in Binary Tree | Dynamic ProgrammingTreeDepth-First Search+2 | Hard |
| 1374 | Generate a String With Characters That Have Odd Counts | String | Easy |
| 1375 | Number of Times Binary String Is Prefix-Aligned | Array | Medium |
| 1376 | Time Needed to Inform All Employees | TreeDepth-First SearchBreadth-First Search | Medium |
| 1377 | Frog Position After T Seconds | TreeDepth-First SearchBreadth-First Search+1 | Hard |
| 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 | TreeDepth-First SearchBreadth-First Search+1 | Easy |
| 1380 | Lucky Numbers in a Matrix | ArrayMatrix | Easy |
| 1381 | Design a Stack With Increment Operation | ArrayStackDesign | Medium |
| 1382 | Balance a Binary Search Tree | Divide and ConquerGreedyTree+3 | Medium |
| 1383 | Maximum Performance of a Team | ArrayGreedySorting+1 | Hard |
| 1385 | Find the Distance Value Between Two Arrays | ArrayTwo PointersBinary Search+1 | Easy |
| 1386 | Cinema Seat Allocation | ArrayHash TableGreedy+1 | Medium |
| 1387 | Sort Integers by The Power Value | Dynamic ProgrammingMemoizationSorting | Medium |
| 1388 | Pizza With 3n Slices | ArrayDynamic ProgrammingGreedy+1 | Hard |
| 1389 | Create Target Array in the Given Order | ArraySimulation | Easy |
| 1390 | Four Divisors | ArrayMath | Medium |
| 1391 | Check if There is a Valid Path in a Grid | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 1392 | Longest Happy Prefix | StringRolling HashString Matching+1 | Hard |
| 1393 | Capital Gain/Loss | Database | Medium |
| 1394 | Find Lucky Integer in an Array | ArrayHash TableCounting | Easy |
| 1395 | Count Number of Teams | ArrayDynamic ProgrammingBinary Indexed Tree+1 | Medium |
| 1396 | Design Underground System | Hash TableStringDesign | Medium |
| 1397 | Find All Good Strings | StringDynamic ProgrammingString Matching | Hard |
| 1399 | Count Largest Group | Hash TableMath | Easy |
| 1400 | Construct K Palindrome Strings | Hash TableStringGreedy+1 | Medium |
| 1401 | Circle and Rectangle Overlapping | MathGeometry | Medium |
| 1402 | Reducing Dishes | ArrayDynamic ProgrammingGreedy+1 | Hard |
| 1403 | Minimum Subsequence in Non-Increasing Order | ArrayGreedySorting | Easy |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | StringBit ManipulationSimulation | Medium |
| 1405 | Longest Happy String | StringGreedyHeap (Priority Queue) | Medium |
| 1406 | Stone Game III | ArrayMathDynamic Programming+1 | Hard |
| 1407 | Top Travellers | Database | Easy |
| 1408 | String Matching in an Array | ArrayStringString Matching | Easy |
| 1409 | Queries on a Permutation With Key | ArrayBinary Indexed TreeSimulation | Medium |
| 1410 | HTML Entity Parser | Hash TableString | Medium |
| 1411 | Number of Ways to Paint N × 3 Grid | Dynamic Programming | Hard |