LeetCode-Solutions icon indicating copy to clipboard operation
LeetCode-Solutions copied to clipboard

This repository consists of solutions to the problem from LeetCode platform. Subscribe to our Channel for more updates

Results 198 LeetCode-Solutions issues
Sort by recently updated
recently updated
newest added

## Description Added multiple approaches to the LeetCode problem 1143. Longest Common Subsequence (memoization -> tabulation -> space optimization) in JAVA. ## Put check marks: ## Have you made changes...

Solved issue #439 # Pull Request Template ## Description Please include a summary of the problem and about the approach to solve the solution. Please also include relevant motivation and...

# Pull Request Template ## Description Please include a summary of the problem and about the approach to solve the solution. Please also include relevant motivation and context. List any...

# Pull Request Template ## Description /** * 34 Find First and Last Position of Element in Sorted Array * Medium * * Given an array of integers nums sorted...

Solved the problem using the concept of digit dynamic programming. # Pull Request Template ## Description Solved the problem using the concept of digit dynamic programming. It is accepted on...

# Pull Request Template ## Description Please include a summary of the problem and about the approach to solve the solution. Please also include relevant motivation and context. List any...

## [1534. Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets. Approach used is...

# Pull Request Template ## [1534. Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) Given an array of integers arr, and three integers a, b and c. You need to find the number of good...

# Pull Request Template ## Description Please include a summary of the problem and about the approach to solve the solution. Please also include relevant motivation and context. List any...