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 […]
Leet Code : Validate Binary Search Tree Java | CPP | Python solution
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:
Leet Code : Maximum Score from Performing Multiplication Operations Cpp | Java | Python solution
Two integer arrays, nums and multipliers, of sizes n and m, respectively, are provided to you, where n >= m.
LeetCode 15 3Sum Explained Like a Production Engineer (Java, C++, Python)
The 3Sum problem is one of the most popular problems on LeetCode.It looks simple, but many developers struggle with it
Leet Code : Longest Palindromic Substring Java | CPP | Java Script | Python Solution
Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string
Leet Code: Longest Substring Without Repeating Characters Java | JavaScript | CPP | Python Solution
Find the length of the longest substring without repeated characters given a string s. Example 1: Input: s = “abcabcbb”
Leet Code : Add Two List – Java | CPP | Javascript | Python
You are given two non-empty linked lists that each represent a non-negative integer. The digits are kept in reverse order,
Leet Code : Median of two sorted array -CPP || java || Python || Java Script
Provide the median of the two sorted arrays given two sorted arrays of sizes m and n, respectively. The entire
LeetCode Two Sum Problem – Optimal Solutions in Java, C++, JavaScript & Python
The Two Sum problem is one of the most popular beginner-friendly questions on LeetCode.It is frequently asked in coding interviews
leet code
Binary Tree Level Order Traversal
Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by
Leet Code :Linked List Cycle II Java || Python || C++ solution
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a
leet Code : Validate Binary Search Tree Java || C++ || C || pYthon
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
Leet Code :Running Sum of 1d Array Solution C++ || Python || Java
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
Job
TCS and Infosys Database , SQL questions | TCS and Infosys Technical Round Question
What is the difference between inner and outer join? Explain with example. Inner Join Inner join is the most common