Java Solution

Construct Binary Tree from Preorder and Inorder Traversal LeetCode Solution

Here, We see Construct Binary Tree from Preorder and Inorder Traversal LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches. List of all LeetCode Solution Construct Binary Tree from Preorder and Inorder Traversal LeetCode Solution Problem Statement Given two integer arrays preorder and inorder where preorder is the preorder traversal […]

Construct Binary Tree from Preorder and Inorder Traversal LeetCode Solution Read More »

Leetcode Solution

Binary Tree Zigzag Level Order Traversal LeetCode Solution

Here, We see Binary Tree Zigzag Level Order Traversal LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches. List of all LeetCode Solution Binary Tree Zigzag Level Order Traversal LeetCode Solution Problem Statement Given the root of a binary tree, return the zigzag level order traversal of

Binary Tree Zigzag Level Order Traversal LeetCode Solution Read More »

Leetcode Solution

3Sum Closest LeetCode Solution

Here, We see 3Sum Closest LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches. List of all LeetCode Solution 3Sum Closest LeetCode Solution Problem Statement Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum

3Sum Closest LeetCode Solution Read More »

Leetcode Solution

Container With Most Water LeetCode Solution

Here, We see Container With Most Water LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches. List of all LeetCode Solution Container With Most Water LeetCode Solution Problem Statement You are given an integer array height of length n. There are n vertical lines drawn such that the two

Container With Most Water LeetCode Solution Read More »

Leetcode Solution

Out of Boundary Paths LeetCode Solution

Here, We see Out of Boundary Paths LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches. List of all LeetCode Solution Out of Boundary Paths LeetCode Solution Problem Statement There is an m x n grid with a ball. The ball is initially at the position [startRow,

Out of Boundary Paths LeetCode Solution Read More »

Leetcode Solution

Remove Duplicates from Sorted Array LeetCode Solution

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Remove Duplicates from Sorted Array LeetCode Solution Read More »

Leetcode Solution

Best Time to Buy and Sell Stock II LeetCode Solution

You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day. Find and return the maximum profit you can achieve.

Best Time to Buy and Sell Stock II LeetCode Solution Read More »

Leetcode Solution

Two Sum LeetCode Solution

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

Two Sum LeetCode Solution Read More »

Leetcode Solution

Add Two Numbers LeetCode Solution

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

Add Two Numbers LeetCode Solution Read More »

Leetcode Solution

Median of Two Sorted Arrays LeetCode Solution

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Median of Two Sorted Arrays LeetCode Solution Read More »

Leetcode Solution

Longest Palindromic Substring LeetCode Solution

Given a string s, return the longest palindromic substring in s. A palindrome is a string which reads the same in both directions. For example, S = “aba” is a palindrome, S = “abc” is not.

Longest Palindromic Substring LeetCode Solution Read More »

Leetcode Solution
Scroll to Top