
Leet Code : Trapping Rain Water Solution Java | CPP | JS
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Input: height…
// tag archive
14 articles

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Input: height…

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: Input: root = [2,1,3] Output:…

Two integer arrays, nums and multipliers, of sizes n and m, respectively, are provided to you, where n >= m. The arrays are all…

The 3Sum problem is one of the most popular problems on LeetCode.It looks simple, but many developers struggle with it because of duplicate handling…

Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string is the same as…

Find the length of the longest substring without repeated characters given a string s. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The…

You are given two non-empty linked lists that each represent a non-negative integer. The digits are kept in reverse order, with each node containing…

Provide the median of the two sorted arrays given two sorted arrays of sizes m and n, respectively. The entire complexity of the run…

The Two Sum problem is one of the most popular beginner-friendly questions on LeetCode.It is frequently asked in coding interviews and helps you understand…
Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level). Example 1: Input:…

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked…

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: Example 1: Input: root =…

Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums =…
What is the difference between inner and outer join? Explain with example. Inner Join Inner join is the most common type of Join which…