3600–3699

Problems in this range: 100

• 3600. Maximize Spanning Tree Stability with Upgrades
• 3601. Find Drivers with Improved Fuel Efficiency
• 3602. Hexadecimal and Hexatrigesimal Conversion
• 3603. Minimum Cost Path with Alternating Directions II
• 3604. Minimum Time to Reach Destination in Directed Graph
• 3605. Minimum Stability Factor of Array
• 3606. Coupon Code Validator
• 3607. Power Grid Maintenance
• 3608. Minimum Time for K Connected Components
• 3609. Minimum Moves to Reach Target in Grid
• 3610. Minimum Number of Primes to Sum to Target 🔒
• 3611. Find Overbooked Employees
• 3612. Process String with Special Operations I
• 3613. Minimize Maximum Component Cost
• 3614. Process String with Special Operations II
• 3615. Longest Palindromic Path in Graph
• 3616. Number of Student Replacements 🔒
• 3617. Find Students with Study Spiral Pattern
• 3618. Split Array by Prime Indices
• 3619. Count Islands With Total Value Divisible by K
• 3620. Network Recovery Pathways
• 3621. Number of Integers With Popcount-Depth Equal to K I
• 3622. Check Divisibility by Digit Sum and Product
• 3623. Count Number of Trapezoids I
• 3624. Number of Integers With Popcount-Depth Equal to K II
• 3625. Count Number of Trapezoids II
• 3626. Find Stores with Inventory Imbalance
• 3627. Maximum Median Sum of Subsequences of Size 3
• 3628. Maximum Number of Subsequences After One Inserting
• 3629. Minimum Jumps to Reach End via Prime Teleportation
• 3630. Partition Array for Maximum XOR and AND
• 3631. Sort Threats by Severity and Exploitability 🔒
• 3632. Subarrays with XOR at Least K 🔒
• 3633. Earliest Finish Time for Land and Water Rides I
• 3634. Minimum Removals to Balance Array
• 3635. Earliest Finish Time for Land and Water Rides II
• 3636. Threshold Majority Queries
• 3637. Trionic Array I
• 3638. Maximum Balanced Shipments
• 3639. Minimum Time to Activate String
• 3640. Trionic Array II
• 3641. Longest Semi-Repeating Subarray 🔒
• 3642. Find Books with Polarized Opinions
• 3643. Flip Square Submatrix Vertically
• 3644. Maximum K to Sort a Permutation
• 3645. Maximum Total from Optimal Activation Order
• 3646. Next Special Palindrome Number
• 3647. Maximum Weight in Two Bags 🔒
• 3648. Minimum Sensors to Cover Grid
• 3649. Number of Perfect Pairs
• 3650. Minimum Cost Path with Edge Reversals
• 3651. Minimum Cost Path with Teleportations
• 3652. Best Time to Buy and Sell Stock using Strategy
• 3653. XOR After Range Multiplication Queries I
• 3654. Minimum Sum After Divisible Sum Deletions
• 3655. XOR After Range Multiplication Queries II
• 3656. Determine if a Simple Graph Exists 🔒
• 3657. Find Loyal Customers
• 3658. GCD of Odd and Even Sums
• 3659. Partition Array Into K-Distinct Groups
• 3660. Jump Game IX
• 3661. Maximum Walls Destroyed by Robots
• 3662. Filter Characters by Frequency 🔒
• 3663. Find The Least Frequent Digit
• 3664. Two-Letter Card Game
• 3665. Twisted Mirror Path Count
• 3666. Minimum Operations to Equalize Binary String
• 3667. Sort Array By Absolute Value 🔒
• 3668. Restore Finishing Order
• 3669. Balanced K-Factor Decomposition
• 3670. Maximum Product of Two Integers With No Common Bits
• 3671. Sum of Beautiful Subsequences
• 3672. Sum of Weighted Modes in Subarrays 🔒
• 3673. Find Zombie Sessions
• 3674. Minimum Operations to Equalize Array
• 3675. Minimum Operations to Transform String
• 3676. Count Bowl Subarrays
• 3677. Count Binary Palindromic Numbers
• 3678. Smallest Absent Positive Greater Than Average
• 3679. Minimum Discards to Balance Inventory
• 3680. Generate Schedule
• 3681. Maximum XOR of Subsequences
• 3682. Minimum Index Sum of Common Elements 🔒
• 3683. Earliest Time to Finish One Task
• 3684. Maximize Sum of At Most K Distinct Elements
• 3685. Subsequence Sum After Capping Elements
• 3686. Number of Stable Subsequences
• 3687. Library Late Fee Calculator 🔒
• 3688. Bitwise OR of Even Numbers in an Array
• 3689. Maximum Total Subarray Value I
• 3690. Split and Merge Array Transformation
• 3691. Maximum Total Subarray Value II
• 3692. Majority Frequency Characters
• 3693. Climbing Stairs II
• 3694. Distinct Points Reachable After Substring Removal
• 3695. Maximize Alternating Sum Using Swaps
• 3696. Maximum Distance Between Unequal Words in Array I 🔒
• 3697. Compute Decimal Representation
• 3698. Split Array With Minimum Difference
• 3699. Number of ZigZag Arrays I