From a20399379d483bd81670b4ec7a9f2f94c9cfcdf6 Mon Sep 17 00:00:00 2001
From: Tirth chokshi <chokshitirth4@gmail.com>
Date: Tue, 21 May 2024 00:20:04 +0530
Subject: [PATCH 1/2] add 0500-0599 leetcode

---
 dsa-problems/leetcode-problems/0500-0599.md | 512 +++++++++++++++++++-
 1 file changed, 511 insertions(+), 1 deletion(-)

diff --git a/dsa-problems/leetcode-problems/0500-0599.md b/dsa-problems/leetcode-problems/0500-0599.md
index 73294c9cd..2e3dc53fa 100644
--- a/dsa-problems/leetcode-problems/0500-0599.md
+++ b/dsa-problems/leetcode-problems/0500-0599.md
@@ -7,4 +7,514 @@ keywords:
   - LeeCode Problems
   - LeeCode Problems 500 - 599
   - dsa problems
----
\ No newline at end of file
+---
+
+export const problems =[
+  {
+    "problemName": "500. Keyboard Row",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/keyboard-row",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "501. Find Mode in Binary Search Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/find-mode-in-binary-search-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "502. IPO",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/ipo",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "503. Next Greater Element II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/next-greater-element-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "504. Base 7",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/base-7",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "505. The Maze II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/the-maze-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "506. Relative Ranks",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/relative-ranks",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "507. Perfect Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/perfect-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "508. Most Frequent Subtree Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/most-frequent-subtree-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "509. Fibonacci Number",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/fibonacci-number",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "510. Inorder Successor in BST II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/inorder-successor-in-bst-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "513. Find Bottom Left Tree Value",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-bottom-left-tree-value",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "514. Freedom Trail",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/freedom-trail",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "515. Find Largest Value in Each Tree Row",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/find-largest-value-in-each-tree-row",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "516. Longest Palindromic Subsequence",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-palindromic-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "517. Super Washing Machines",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/super-washing-machines",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "518. Coin Change 2",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/coin-change-2",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "519. Random Flip Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/random-flip-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "520. Detect Capital",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/detect-capital",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "521. Longest Uncommon Subsequence I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-uncommon-subsequence-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "522. Longest Uncommon Subsequence II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-uncommon-subsequence-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "523. Continuous Subarray Sum",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/continuous-subarray-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "524. Longest Word in Dictionary through Deleting",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-word-in-dictionary-through-deleting",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "525. Contiguous Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/contiguous-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "526. Beautiful Arrangement",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/beautiful-arrangement",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "527. Word Abbreviation",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/word-abbreviation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "528. Random Pick with Weight",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/random-pick-with-weight",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "529. Minesweeper",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minesweeper",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "530. Minimum Absolute Difference in BST",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-absolute-difference-in-bst",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "531. Lonely Pixel I",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/lonely-pixel-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "532. K-diff Pairs in an Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/k-diff-pairs-in-an-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "533. Lonely Pixel II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/lonely-pixel-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "535. Encode and Decode TinyURL",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/encode-and-decode-tinyurl",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "536. Construct Binary Tree from String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/construct-binary-tree-from-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "537. Complex Number Multiplication",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/complex-number-multiplication",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "538. Convert BST to Greater Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/convert-bst-to-greater-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "539. Minimum Time Difference",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-time-difference",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "540. Single Element in a Sorted Array",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/single-element-in-a-sorted-array",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "541. Reverse String II",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reverse-string-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "542. 01 Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/01-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "543. Diameter of Binary Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/diameter-of-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "544. Output Contest Matches",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/output-contest-matches",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "545. Boundary of Binary Tree",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/boundary-of-binary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "546. Remove Boxes",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/remove-boxes",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "547. Friend Circles",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/friend-circles",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "548. Split Array with Equal Sum",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/split-array-with-equal-sum",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "549. Binary Tree Longest Consecutive Sequence II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "550. Game Play Analysis IV",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/game-play-analysis-iv",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "551. Student Attendance Record I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/student-attendance-record-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "552. Student Attendance Record II",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/student-attendance-record-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "553. Optimal Division",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/optimal-division",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "554. Brick Wall",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/brick-wall",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "555. Split Concatenated Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/split-concatenated-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "556. Next Greater Element III",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/next-greater-element-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "557. Reverse Words in a String III",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reverse-words-in-a-string-iii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "558. Quad Tree Intersection",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/quad-tree-intersection",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "559. Maximum Depth of N-ary Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-depth-of-n-ary-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "560. Subarray Sum Equals K",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/subarray-sum-equals-k",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "561. Array Partition I",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/array-partition-i",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "562. Longest Line of Consecutive One in Matrix",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "563. Binary Tree Tilt",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/binary-tree-tilt",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "564. Find the Closest Palindrome",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/find-the-closest-palindrome",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "565. Array Nesting",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/array-nesting",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "566. Reshape the Matrix",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/reshape-the-matrix",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "567. Permutation in String",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/permutation-in-string",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "568. Maximum Vacation Days",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/maximum-vacation-days",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "572. Subtree of Another Tree",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/subtree-of-another-tree",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "573. Squirrel Simulation",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/squirrel-simulation",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "575. Distribute Candies",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/distribute-candies",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "576. Out of Boundary Paths",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/out-of-boundary-paths",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "581. Shortest Unsorted Continuous Subarray",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/shortest-unsorted-continuous-subarray",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "582. Kill Process",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/kill-process",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "583. Delete Operation for Two Strings",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/delete-operation-for-two-strings",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "587. Erect the Fence",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/erect-the-fence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "588. Design In-Memory File System",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/design-in-memory-file-system",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "589. N-ary Tree Preorder Traversal",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/n-ary-tree-preorder-traversal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "590. N-ary Tree Postorder Traversal",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/n-ary-tree-postorder-traversal",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "591. Tag Validator",
+    "difficulty": "Hard",
+    "leetCodeLink": "https://leetcode.com/problems/tag-validator",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "592. Fraction Addition and Subtraction",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/fraction-addition-and-subtraction",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "593. Valid Square",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/valid-square",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "594. Longest Harmonious Subsequence",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/longest-harmonious-subsequence",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "598. Range Addition II",
+    "difficulty": "Medium",
+    "leetCodeLink": "https://leetcode.com/problems/range-addition-ii",
+    "solutionLink": "#"
+  },
+  {
+    "problemName": "599. Minimum Index Sum of Two Lists",
+    "difficulty": "Easy",
+    "leetCodeLink": "https://leetcode.com/problems/minimum-index-sum-of-two-lists",
+    "solutionLink": "#"
+  }
+]
+
+<Table 
+    title=""
+    data={problems}
+    isSorted={false}
+    collectionLink="https://leetcode.com/study-plan/programming-skills"
+/>
+
+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.
\ No newline at end of file

From 9b7ce72341385d805e7fbf89a6baaf6b3a9ad400 Mon Sep 17 00:00:00 2001
From: Tirth chokshi <chokshitirth4@gmail.com>
Date: Tue, 21 May 2024 00:54:23 +0530
Subject: [PATCH 2/2] typos fixed

---
 dsa-problems/leetcode-problems/0500-0599.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/dsa-problems/leetcode-problems/0500-0599.md b/dsa-problems/leetcode-problems/0500-0599.md
index 2e3dc53fa..b18072f6d 100644
--- a/dsa-problems/leetcode-problems/0500-0599.md
+++ b/dsa-problems/leetcode-problems/0500-0599.md
@@ -4,9 +4,9 @@ title: LeetCode Problems 500 - 599
 sidebar_label: 0500 - 0599
 keywords:
   - LeetCode
-  - LeeCode Problems
-  - LeeCode Problems 500 - 599
-  - dsa problems
+  - LeetCode Problems
+  - LeetCode Problems 500 - 599
+  - DSA problems
 ---
 
 export const problems =[