3500–3599
Problems in this range: 100
- 3500. Minimum Cost to Divide Array Into Subarrays
- 3501. Maximize Active Section with Trade II
- 3502. Minimum Cost to Reach Every Position
- 3503. Longest Palindrome After Substring Concatenation I
- 3504. Longest Palindrome After Substring Concatenation II
- 3505. Minimum Operations to Make Elements Within K Subarrays Equal
- 3506. Find Time Required to Eliminate Bacterial Strains 🔒
- 3507. Minimum Pair Removal to Sort Array I
- 3508. Implement Router
- 3509. Maximum Product of Subsequences With an Alternating Sum Equal to K
- 3510. Minimum Pair Removal to Sort Array II
- 3511. Make a Positive Array 🔒
- 3512. Minimum Operations to Make Array Sum Divisible by K
- 3513. Number of Unique XOR Triplets I
- 3514. Number of Unique XOR Triplets II
- 3515. Shortest Path in a Weighted Tree
- 3516. Find Closest Person
- 3517. Smallest Palindromic Rearrangement I
- 3518. Smallest Palindromic Rearrangement II
- 3519. Count Numbers with Non-Decreasing Digits
- 3520. Minimum Threshold for Inversion Pairs Count 🔒
- 3521. Find Product Recommendation Pairs
- 3522. Calculate Score After Performing Instructions
- 3523. Make Array Non-decreasing
- 3524. Find X Value of Array I
- 3525. Find X Value of Array II
- 3526. Range XOR Queries with Subarray Reversals 🔒
- 3527. Find the Most Common Response
- 3528. Unit Conversion I
- 3529. Count Cells in Overlapping Horizontal and Vertical Substrings
- 3530. Maximum Profit from Valid Topological Order in DAG
- 3531. Count Covered Buildings
- 3532. Path Existence Queries in a Graph I
- 3533. Concatenated Divisibility
- 3534. Path Existence Queries in a Graph II
- 3535. Unit Conversion II 🔒
- 3536. Maximum Product of Two Digits
- 3537. Fill a Special Grid
- 3538. Merge Operations for Minimum Travel Time
- 3539. Find Sum of Array Product of Magical Sequences
- 3540. Minimum Time to Visit All Houses 🔒
- 3541. Find Most Frequent Vowel and Consonant
- 3542. Minimum Operations to Convert All Elements to Zero
- 3543. Maximum Weighted K-Edge Path
- 3544. Subtree Inversion Sum
- 3545. Minimum Deletions for At Most K Distinct Characters
- 3546. Equal Sum Grid Partition I
- 3547. Maximum Sum of Edge Values in a Graph
- 3548. Equal Sum Grid Partition II
- 3549. Multiply Two Polynomials 🔒
- 3550. Smallest Index With Digit Sum Equal to Index
- 3551. Minimum Swaps to Sort by Digit Sum
- 3552. Grid Teleportation Traversal
- 3553. Minimum Weighted Subgraph With the Required Paths II
- 3554. Find Category Recommendation Pairs
- 3555. Smallest Subarray to Sort in Every Sliding Window 🔒
- 3556. Sum of Largest Prime Substrings
- 3557. Find Maximum Number of Non Intersecting Substrings
- 3558. Number of Ways to Assign Edge Weights I
- 3559. Number of Ways to Assign Edge Weights II
- 3560. Find Minimum Log Transportation Cost
- 3561. Resulting String After Adjacent Removals
- 3562. Maximum Profit from Trading Stocks with Discounts
- 3563. Lexicographically Smallest String After Adjacent Removals
- 3564. Seasonal Sales Analysis
- 3565. Sequential Grid Path Cover 🔒
- 3566. Partition Array into Two Equal Product Subsets
- 3567. Minimum Absolute Difference in Sliding Submatrix
- 3568. Minimum Moves to Clean the Classroom
- 3569. Maximize Count of Distinct Primes After Split
- 3570. Find Books with No Available Copies
- 3571. Find the Shortest Superstring II 🔒
- 3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
- 3573. Best Time to Buy and Sell Stock V
- 3574. Maximize Subarray GCD Score
- 3575. Maximum Good Subtree Score
- 3576. Transform Array to All Equal Elements
- 3577. Count the Number of Computer Unlocking Permutations
- 3578. Count Partitions With Max-Min Difference at Most K
- 3579. Minimum Steps to Convert String with Operations
- 3580. Find Consistently Improving Employees
- 3581. Count Odd Letters from Number 🔒
- 3582. Generate Tag for Video Caption
- 3583. Count Special Triplets
- 3584. Maximum Product of First and Last Elements of a Subsequence
- 3585. Find Weighted Median Node in Tree
- 3586. Find COVID Recovery Patients
- 3587. Minimum Adjacent Swaps to Alternate Parity
- 3588. Find Maximum Area of a Triangle
- 3589. Count Prime-Gap Balanced Subarrays
- 3590. Kth Smallest Path XOR Sum
- 3591. Check if Any Element Has Prime Frequency
- 3592. Inverse Coin Change
- 3593. Minimum Increments to Equalize Leaf Paths
- 3594. Minimum Time to Transport All Individuals
- 3595. Once Twice 🔒
- 3596. Minimum Cost Path with Alternating Directions I 🔒
- 3597. Partition String
- 3598. Longest Common Prefix Between Adjacent Strings After Removals
- 3599. Partition Array to Minimize XOR