3400–3499

Problems in this range: 100

• 3400. Maximum Number of Matching Indices After Right Shifts 🔒
• 3401. Find Circular Gift Exchange Chains 🔒
• 3402. Minimum Operations to Make Columns Strictly Increasing
• 3403. Find the Lexicographically Largest String From the Box I
• 3404. Count Special Subsequences
• 3405. Count the Number of Arrays with K Matching Adjacent Elements
• 3406. Find the Lexicographically Largest String From the Box II 🔒
• 3407. Substring Matching Pattern
• 3408. Design Task Manager
• 3409. Longest Subsequence With Decreasing Adjacent Difference
• 3410. Maximize Subarray Sum After Removing All Occurrences of One Element
• 3411. Maximum Subarray With Equal Products
• 3412. Find Mirror Score of a String
• 3413. Maximum Coins From K Consecutive Bags
• 3414. Maximum Score of Non-overlapping Intervals
• 3415. Find Products with Three Consecutive Digits 🔒
• 3416. Subsequences with a Unique Middle Mode II 🔒
• 3417. Zigzag Grid Traversal With Skip
• 3418. Maximum Amount of Money Robot Can Earn
• 3419. Minimize the Maximum Edge Weight of Graph
• 3420. Count Non-Decreasing Subarrays After K Operations
• 3421. Find Students Who Improved
• 3422. Minimum Operations to Make Subarray Elements Equal 🔒
• 3423. Maximum Difference Between Adjacent Elements in a Circular Array
• 3424. Minimum Cost to Make Arrays Identical
• 3425. Longest Special Path
• 3426. Manhattan Distances of All Arrangements of Pieces
• 3427. Sum of Variable Length Subarrays
• 3428. Maximum and Minimum Sums of at Most Size K Subsequences
• 3429. Paint House IV
• 3430. Maximum and Minimum Sums of at Most Size K Subarrays
• 3431. Minimum Unlocked Indices to Sort Nums 🔒
• 3432. Count Partitions with Even Sum Difference
• 3433. Count Mentions Per User
• 3434. Maximum Frequency After Subarray Operation
• 3435. Frequencies of Shortest Supersequences
• 3436. Find Valid Emails
• 3437. Permutations III 🔒
• 3438. Find Valid Pair of Adjacent Digits in String
• 3439. Reschedule Meetings for Maximum Free Time I
• 3440. Reschedule Meetings for Maximum Free Time II
• 3441. Minimum Cost Good Caption
• 3442. Maximum Difference Between Even and Odd Frequency I
• 3443. Maximum Manhattan Distance After K Changes
• 3444. Minimum Increments for Target Multiples in an Array
• 3445. Maximum Difference Between Even and Odd Frequency II
• 3446. Sort Matrix by Diagonals
• 3447. Assign Elements to Groups with Constraints
• 3448. Count Substrings Divisible By Last Digit
• 3449. Maximize the Minimum Game Score
• 3450. Maximum Students on a Single Bench 🔒
• 3451. Find Invalid IP Addresses
• 3452. Sum of Good Numbers
• 3453. Separate Squares I
• 3454. Separate Squares II
• 3455. Shortest Matching Substring
• 3456. Find Special Substring of Length K
• 3457. Eat Pizzas!
• 3458. Select K Disjoint Special Substrings
• 3459. Length of Longest V-Shaped Diagonal Segment
• 3460. Longest Common Prefix After at Most One Removal 🔒
• 3461. Check If Digits Are Equal in String After Operations I
• 3462. Maximum Sum With at Most K Elements
• 3463. Check If Digits Are Equal in String After Operations II
• 3464. Maximize the Distance Between Points on a Square
• 3465. Find Products with Valid Serial Numbers
• 3466. Maximum Coin Collection 🔒
• 3467. Transform Array by Parity
• 3468. Find the Number of Copy Arrays
• 3469. Find Minimum Cost to Remove Array Elements
• 3470. Permutations IV
• 3471. Find the Largest Almost Missing Integer
• 3472. Longest Palindromic Subsequence After at Most K Operations
• 3473. Sum of K Subarrays With Length at Least M
• 3474. Lexicographically Smallest Generated String
• 3475. DNA Pattern Recognition
• 3476. Maximize Profit from Task Assignment 🔒
• 3477. Fruits Into Baskets II
• 3478. Choose K Elements With Maximum Sum
• 3479. Fruits Into Baskets III
• 3480. Maximize Subarrays After Removing One Conflicting Pair
• 3481. Apply Substitutions 🔒
• 3482. Analyze Organization Hierarchy
• 3483. Unique 3-Digit Even Numbers
• 3484. Design Spreadsheet
• 3485. Longest Common Prefix of K Strings After Removal
• 3486. Longest Special Path II
• 3487. Maximum Unique Subarray Sum After Deletion
• 3488. Closest Equal Element Queries
• 3489. Zero Array Transformation IV
• 3490. Count Beautiful Numbers
• 3491. Phone Number Prefix 🔒
• 3492. Maximum Containers on a Ship
• 3493. Properties Graph
• 3494. Find the Minimum Amount of Time to Brew Potions
• 3495. Minimum Operations to Make Array Elements Zero
• 3496. Maximize Score After Pair Deletions 🔒
• 3497. Analyze Subscription Conversion
• 3498. Reverse Degree of a String
• 3499. Maximize Active Section with Trade I