ποΈ Keyboard-Rows
Problem Description
ποΈ IPO
Problem Description
ποΈ 0503-Next-Greater-Element-II
Given a circular integer array nums (i.e., the next element of `nums[nums.length - 1]` is `nums[0]`), return the next greater number for every element in nums..
ποΈ Relative Ranks
This document provides solutions for the Relative Ranks problem.
ποΈ Perfect Number
This document provides solutions for the Perfect Number problem.
ποΈ 0508-Most-Frequent-Subtree-Sum
Given the root of a binary tree, return the most frequent subtree sum. If there is a tie, return all the values with the highest frequency in any order.
ποΈ Fibonacci-Numbers
Problem Description
ποΈ 0513-Find-Bottom-Left-Tree-Value
Given the root of a binary tree, return the leftmost value in the last row of the tree.
ποΈ 0515 - Find Largest Value in Each Tree Row
This is a solution to the Find Largest Value in Each Tree Row problem on LeetCode.
ποΈ 0516-Longest-Palindromic-Subsequence
Given a string s, find the longest palindromic subsequence's length in s.
ποΈ 0518-Coin-Change-2
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the number of combinations that make up that amount.
ποΈ Detect Capital
Problem Description
ποΈ 0522-Longest-Uncommon-Subsequence-II
Given an array of strings strs, return the length of the longest uncommon subsequence between them. If the longest uncommon subsequence does not exist, return -1.
ποΈ 0523 continuous subarray sum
This is a solution to the Continuous Subarray Sum problem on LeetCode
ποΈ 0524-longest-word-in-dictionary-through-deleting
This is a solution to the longest word in dictionary through deleting problem on LeetCode.
ποΈ 0525-Contiguous-Array
Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1.
ποΈ 0526-Beautiful-Arrangement
solution to the leetcode problem beautiful arrrangement.
ποΈ 0527-Word-Abbreviation
solution to the leetcode problem Word Abbreviation.
ποΈ 0528-Random-Pick-with-Weight
solution to the leetcode problem Random Pick With Weight.
ποΈ Minesweeper
Problem Description
ποΈ BST Minimum Absolute Difference
Problem Description
ποΈ 0531- Lonely Pixel I
Given an m x n picture consisting of black 'B' and white 'W' pixels, return the number of black lonely pixels.
ποΈ 0537 - Complex Number Multiplication
This is a solution to the Complex Number Multiplication problem on LeetCode.
ποΈ 0538-Convert-BST-to-Greater-Tree
Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.
ποΈ 0540-Single-Element-in-a-Sorted-Array
You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once.
ποΈ Single Element in Sorted Array
Problem Description
ποΈ 0541 - Reverse String II
This is a solution to the Reverse String II problem on LeetCode.
ποΈ 0542 - 01 Matrix
This is a solution to the 542. 01 Matrix problem on LeetCode.
ποΈ 0543. Diameter of Binary tree
This is a solution to the Diameter of Binary tree problem on LeetCode.
ποΈ 0547 - Number of Provinces
This is a solution to the Number of Provincess problem on LeetCode.
ποΈ 0548 - Split Array with Equal Sum
This is a solution to the Split Array with Equal Sum problem on LeetCode.
ποΈ 0549-binary-tree-longest-consecutive-sequence-iiQ549-lc
This is a solution to binary-tree-longest-consecutive-sequence-ii problem on LeetCode.
ποΈ 0550-game-play-analysis-iv
This is a solution to game-play-analysis-iv problem on LeetCode.
ποΈ 0551-student-attendance-record-i
This is a solution to student-attendance-record-i problem on LeetCode.
ποΈ 0553 - Optimal Division
This is a solution to the Optimal Division problem on LeetCode.
ποΈ Brick-Wall
This is a solution to the. Brick-Wall problem on LeetCode
ποΈ 0555-split-concatenated-strings
This is a solution to split-concatenated-strings problem on LeetCode.
ποΈ 0557 - Reverse Words in a String III
This is a solution to the Reverse Words in a String III problem on LeetCode.
ποΈ Subarray Sum Equals K
Problem Description
ποΈ 0563 - Binary Tree Tilt
This is a solution to the Binary Tree Tilt problem on LeetCode.
ποΈ 564 Find the Closest Palindrome
This document provides a solution where we need to find the nearest palindrome to a given number n, the idea is to generate potential palindromic candidates close to n and then determine which one is closest in terms of absolute difference.
ποΈ 0565 - Array Nesting
This is a solution to the Array Nesting problem on LeetCode.
π οΈ 567. Permutation in String
This is a solution to the 567. Permutation in String problem on LeetCode.
ποΈ 0572-Subtree of Another Tree
Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise.
ποΈ 0576 - Out of Boundary Paths
This is a solution to the Out of Boundary Paths problem on LeetCode.
ποΈ 583-delete operations for 2 strings
Given two strings , return the min no of steps in which you can make one string to another.
ποΈ Erect-The-Fence
Problem Description
ποΈ 0589-N-ary Tree Preorder Traversal
Given the root of an n-ary tree, return the preorder traversal of its nodes' values.
ποΈ 0590-N-ary Tree Postorder Traversal
Given the root of an n-ary tree, return the postorder traversal of its nodes' values.
ποΈ 0591 - Tag Validator
This is a solution to the Tag Validator problem on LeetCode.
ποΈ 0592 - Fraction Addition and Subtraction
This is a solution to the Fraction Addition and Subtraction problem on LeetCode.
ποΈ 0593 - Valid Square
This is a solution to the Valid Square problem on LeetCode.
ποΈ 0599 - Minimum Index Sum of Two Lists
This is a solution to the Minimum Index Sum of Two Lists problem on LeetCode.
ποΈ 01-Matrix
Problem Description