| id | title | sidebar_label | keywords | ||||
|---|---|---|---|---|---|---|---|
0400-0499 |
LeetCode Problems 400 - 499 |
0400 - 0499 |
|
export const problems = [ { "problemName": "400. Nth Digit", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/nth-digit", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/nth-digit" }, { "problemName": "401. Binary Watch", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/binary-watch", "solutionLink": "#" }, { "problemName": "402. Remove K Digits", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/remove-k-digits", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/remove-k-digits" }, { "problemName": "403. Frog Jump", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/frog-jump", "solutionLink": "#" }, { "problemName": "404. Sum of Left Leaves", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/sum-of-left-leaves", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/sum-of-left-leaves" }, { "problemName": "405. Convert a Number to Hexadecimal", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/convert-a-number-to-hexadecimal", "solutionLink": "#" }, { "problemName": "406. Queue Reconstruction by Height", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/queue-reconstruction-by-height", "solutionLink": "#" }, { "problemName": "407. Trapping Rain Water II", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/trapping-rain-water-ii", "solutionLink": "#" }, { "problemName": "408. Valid Word Abbreviation", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/valid-word-abbreviation", "solutionLink": "#" }, { "problemName": "409. Longest Palindrome", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/longest-palindrome", "solutionLink": "#" }, { "problemName": "410. Split Array Largest Sum", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/split-array-largest-sum", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/split-array-largest-sum" }, { "problemName": "411. Minimum Unique Word Abbreviation", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/minimum-unique-word-abbreviation", "solutionLink": "#" }, { "problemName": "412. Fizz Buzz", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/fizz-buzz", "solutionLink": "#" }, { "problemName": "413. Arithmetic Slices", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/arithmetic-slices", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/arithmetic-slices" }, { "problemName": "414. Third Maximum Number", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/third-maximum-number", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/third-maximum-number" }, { "problemName": "415. Add Strings", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/add-strings", "solutionLink": "#" }, { "problemName": "416. Partition Equal Subset Sum", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/partition-equal-subset-sum", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/" }, { "problemName": "417. Pacific Atlantic Water Flow", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/pacific-atlantic-water-flow", "solutionLink": "#" }, { "problemName": "418. Sentence Screen Fitting", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/sentence-screen-fitting", "solutionLink": "#" }, { "problemName": "419. Battleships in a Board", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/battleships-in-a-board", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/" }, { "problemName": "420. Strong Password Checker", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/strong-password-checker", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/strong-password-checker" }, { "problemName": "421. Maximum XOR of Two Numbers in an Array", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/" }, { "problemName": "422. Valid Word Square", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/valid-word-square", "solutionLink": "#" }, { "problemName": "423. Reconstruct Original Digits from English", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/reconstruct-original-digits-from-english", "solutionLink": "#" }, { "problemName": "424. Longest Repeating Character Replacement", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/longest-repeating-character-replacement", "solutionLink": "#" }, { "problemName": "425. Word Squares", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/word-squares", "solutionLink": "#" }, { "problemName": "426. Convert Binary Search Tree to Sorted Doubly Linked List", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list", "solutionLink": "#" }, { "problemName": "427. Construct Quad Tree", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/construct-quad-tree", "solutionLink": "#" }, { "problemName": "428. Serialize and Deserialize N-ary Tree", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree", "solutionLink": "#" }, { "problemName": "429. N-ary Tree Level Order Traversal", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/n-ary-tree-level-order-traversal", "solutionLink": "#" }, { "problemName": "430. Flatten a Multilevel Doubly Linked List", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/flatten-a-multilevel-doubly-linked-list" }, { "problemName": "431. Encode N-ary Tree to Binary Tree", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree", "solutionLink": "#" }, { "problemName": "432. All Oone Data Structure", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/all-oone-data-structure", "solutionLink": "#" }, { "problemName": "433. Minimum Genetic Mutation", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/minimum-genetic-mutation", "solutionLink": "#" }, { "problemName": "434. Number of Segments in a String", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/number-of-segments-in-a-string", "solutionLink": "#" }, { "problemName": "435. Non-overlapping Intervals", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/non-overlapping-intervals", "solutionLink": "#" }, { "problemName": "436. Find Right Interval", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/find-right-interval", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/find-right-interval" }, { "problemName": "437. Path Sum III", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/path-sum-iii", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/path-sum-iii" }, { "problemName": "438. Find All Anagrams in a String", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/find-all-anagrams-in-a-string", "solutionLink": "#" }, { "problemName": "439. Ternary Expression Parser", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/ternary-expression-parser", "solutionLink": "#" }, { "problemName": "440. K-th Smallest in Lexicographical Order", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order", "solutionLink": "#" }, { "problemName": "441. Arranging Coins", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/arranging-coins", "solutionLink": "#" }, { "problemName": "442. Find All Duplicates in an Array", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/find-all-duplicates-in-an-array", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/find-all-duplicates-in-an-array" }, { "problemName": "443. String Compression", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/string-compression", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/string-compression" }, { "problemName": "444. Sequence Reconstruction", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/sequence-reconstruction", "solutionLink": "#" }, { "problemName": "445. Add Two Numbers II", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/add-two-numbers-ii", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/add-two-numbers-ii" }, { "problemName": "446. Arithmetic Slices II - Subsequence", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/arithmetic-slices-ii-subsequence", "solutionLink": "#" }, { "problemName": "447. Number of Boomerangs", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/number-of-boomerangs", "solutionLink": "#" }, { "problemName": "448. Find All Numbers Disappeared in an Array", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array", "solutionLink": "#" }, { "problemName": "449. Serialize and Deserialize BST", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/serialize-and-deserialize-bst", "solutionLink": "#" }, { "problemName": "450. Delete Node in a BST", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/delete-node-in-a-bst", "solutionLink": "#" }, { "problemName": "451. Sort Characters By Frequency", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/sort-characters-by-frequency", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/sort-characters-by-frequency" }, { "problemName": "452. Minimum Number of Arrows to Burst Balloons", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons", "solutionLink": "#" }, { "problemName": "453. Minimum Moves to Equal Array Elements", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements", "solutionLink": "#" }, { "problemName": "454. 4Sum II", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/4sum-ii", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/4Sum-II" }, { "problemName": "455. Assign Cookies", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/assign-cookies", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/assign-cookies" }, { "problemName": "456. 132 Pattern", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/132-pattern", "solutionLink": "#" }, { "problemName": "457. Circular Array Loop", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/circular-array-loop", "solutionLink": "#" }, { "problemName": "458. Poor Pigs", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/poor-pigs", "solutionLink": "#" }, { "problemName": "459. Repeated Substring Pattern", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/repeated-substring-pattern", "solutionLink": "#" }, { "problemName": "460. LFU Cache", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/lfu-cache", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/lfu-cache" }, { "problemName": "461. Hamming Distance", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/hamming-distance", "solutionLink": "#" }, { "problemName": "462. Minimum Moves to Equal Array Elements II", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii", "solutionLink": "#" }, { "problemName": "463. Island Perimeter", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/island-perimeter", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/island-perimeter" }, { "problemName": "464. Can I Win", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/can-i-win", "solutionLink": "#" }, { "problemName": "465. Optimal Account Balancing", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/optimal-account-balancing", "solutionLink": "#" }, { "problemName": "466. Count The Repetitions", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/count-the-repetitions", "solutionLink": "#" }, { "problemName": "467. Unique Substrings in Wraparound String", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/unique-substrings-in-wraparound-string", "solutionLink": "#" }, { "problemName": "468. Validate IP Address", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/validate-ip-address", "solutionLink": "#" }, { "problemName": "469. Convex Polygon", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/convex-polygon", "solutionLink": "#" }, { "problemName": "470. Implement Rand10() Using Rand7()", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/implement-rand10-using-rand7", "solutionLink": "#" }, { "problemName": "471. Encode String with Shortest Length", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/encode-string-with-shortest-length", "solutionLink": "#" }, { "problemName": "472. Concatenated Words", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/concatenated-words", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/concatenated-words" }, { "problemName": "473. Matchsticks to Square", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/matchsticks-to-square", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/matchsticks-to-square" }, { "problemName": "474. Ones and Zeroes", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/ones-and-zeroes", "solutionLink": "#" }, { "problemName": "475. Heaters", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/heaters", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/heaters" }, { "problemName": "476. Number Complement", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/number-complement", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/number-complement" }, { "problemName": "477. Total Hamming Distance", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/total-hamming-distance", "solutionLink": "#" }, { "problemName": "478. Generate Random Point in a Circle", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/generate-random-point-in-a-circle", "solutionLink": "#" }, { "problemName": "479. Largest Palindrome Product", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/largest-palindrome-product", "solutionLink": "#" }, { "problemName": "480. Sliding Window Median", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/sliding-window-median", "solutionLink": "#" }, { "problemName": "481. Magical String", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/magical-string", "solutionLink": "#" }, { "problemName": "482. License Key Formatting", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/license-key-formatting", "solutionLink": "#" }, { "problemName": "483. Smallest Good Base", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/smallest-good-base", "solutionLink": "#" }, { "problemName": "484. Find Permutation", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/find-permutation", "solutionLink": "#" }, { "problemName": "485. Max Consecutive Ones", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/max-consecutive-ones", "solutionLink": "#" }, { "problemName": "486. Predict the Winner", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/predict-the-winner", "solutionLink": "#" }, { "problemName": "487. Max Consecutive Ones II", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/max-consecutive-ones-ii", "solutionLink": "#" }, { "problemName": "488. Zuma Game", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/zuma-game", "solutionLink": "#" }, { "problemName": "489. Robot Room Cleaner", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/robot-room-cleaner", "solutionLink": "#" }, { "problemName": "490. The Maze", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/the-maze", "solutionLink": "#" }, { "problemName": "491. Increasing Subsequences", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/increasing-subsequences", "solutionLink": "#" }, { "problemName": "492. Construct the Rectangle", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/construct-the-rectangle", "solutionLink": "#" }, { "problemName": "493. Reverse Pairs", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/reverse-pairs", "solutionLink": "#" }, { "problemName": "494. Target Sum", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/target-sum", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/target-sum" }, { "problemName": "495. Teemo Attacking", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/teemo-attacking", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/teemo-attacking" }, { "problemName": "496. Next Greater Element I", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/next-greater-element-i", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/next-greater-element-I" }, { "problemName": "497. Random Point in Non-overlapping Rectangles", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/random-point-in-non-overlapping-rectangles", "solutionLink": "#" }, { "problemName": "498. Diagonal Traverse", "difficulty": "Medium", "leetCodeLink": "https://leetcode.com/problems/diagonal-traverse", "solutionLink": "/dsa-solutions/lc-solutions/0400-0499/diagonal-traverse" }, { "problemName": "499. The Maze III", "difficulty": "Hard", "leetCodeLink": "https://leetcode.com/problems/the-maze-iii", "solutionLink": "#" } ];
Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem.