Solution for 501-600


72/100

24
39
9
# Name Difficulty Tags
501 Find Mode in Binary Search Tree Easy Tree
502 IPO Hard
503 Next Greater Element II Medium
504 Base 7 Easy
506 Relative Ranks Easy
507 Perfect Number Easy
508 Most Frequent Subtree Sum Medium Hash Table | Tree
509 Fibonacci Number Easy
510 Inorder Successor in BST II Medium Tree
512 Game Play Analysis II Easy
513 Find Bottom Left Tree Value Medium Tree | Depth-first Search | Breadth-first Search
514 Freedom Trail Hard
515 Find Largest Value in Each Tree Row Medium Tree | Depth-first Search | Breadth-first Search
516 Longest Palindromic Subsequence Medium
517 Super Washing Machines Hard
518 Coin Change 2 Medium
519 Random Flip Matrix Medium
520 Detect Capital Easy
522 Longest Uncommon Subsequence II Medium
523 Continuous Subarray Sum Medium
524 Longest Word in Dictionary through Deleting Medium
525 Contiguous Array Medium
526 Beautiful Arrangement Medium
528 Random Pick with Weight Medium
529 Minesweeper Medium
530 Minimum Absolute Difference in BST Easy Tree
532 K-diff Pairs in an Array Medium
535 Encode and Decode TinyURL Medium
536 Construct Binary Tree from String Medium String | Tree
537 Complex Number Multiplication Medium
538 Convert BST to Greater Tree Medium Tree
539 Minimum Time Difference Medium
540 Single Element in a Sorted Array Medium
541 Reverse String II Easy
542 01 Matrix Medium
543 Diameter of Binary Tree Easy Tree
545 Boundary of Binary Tree Medium Tree
546 Remove Boxes Hard
547 Number of Provinces Medium
549 Binary Tree Longest Consecutive Sequence II Medium Tree
551 Student Attendance Record I Easy
552 Student Attendance Record II Hard
553 Optimal Division Medium
554 Brick Wall Medium
556 Next Greater Element III Medium
557 Reverse Words in a String III Easy
558 Logical OR of Two Binary Grids Represented as Quad-Trees Medium
559 Maximum Depth of N-ary Tree Easy Tree | Depth-first Search | Breadth-first Search
560 Subarray Sum Equals K Medium
561 Array Partition I Easy
563 Binary Tree Tilt Easy Tree
564 Find the Closest Palindrome Hard
565 Array Nesting Medium
566 Reshape the Matrix Easy
567 Permutation in String Medium
572 Subtree of Another Tree Easy Tree
575 Distribute Candies Easy
576 Out of Boundary Paths Medium
581 Shortest Unsorted Continuous Subarray Medium
582 Kill Process Medium Tree | Queue
583 Delete Operation for Two Strings Medium
587 Erect the Fence Hard
589 N-ary Tree Preorder Traversal Easy Tree
590 N-ary Tree Postorder Traversal Easy Tree
591 Tag Validator Hard
592 Fraction Addition and Subtraction Medium
593 Valid Square Medium
594 Longest Harmonious Subsequence Easy
596 Classes More Than 5 Students Easy
598 Range Addition II Easy
599 Minimum Index Sum of Two Lists Easy
600 Non-negative Integers without Consecutive Ones Hard