LeetCode-Solutions
LeetCode-Solutions copied to clipboard
A compilation of all the Leetcode solutions.
class Solution { public: int poorPigs(int buckets, int minutesToDie, int minutesToTest) { return ceil(log(buckets) / log(minutesToTest / minutesToDie + 1)); } };
## **`Title`** - Adding solution for 1631. Path With Minimum Effort **What will change** - Adding solution for leetcode problem 1631 ### Type of Issue - - [x] Adding New...
## **`Title`** - Adding C++ code for 1584. Min Cost to Connect All Points **What will change** - Adding solution for leetcode problem 1584 ### Type of Issue - -...
## **`Title`** - Adding C++ code for 99. Recover Binary Search Tree **What will change** - Adding solution for leetcode problem 99 ### Type of Issue - - [x] Adding...
## **`Title`** - Adding C++ code for 538. Convert BST to Greater Tree **What will change** - Adding solution for leetcode problem 538 ### Type of Issue - - [x]...
## **`Title`** - Adding C++ code for 153. Find Minimum in Rotated Sorted Array **What will change** - Adding solution for leetcode problem 153 ### Type of Issue - -...
## **`Title`** - Blind Curated 75 **What will change** - Creating a folder which contains all solutions of problems from blind curated 75 of Leetcode ### Type of Issue -...
## **`Title`** - 902. Numbers At Most N Given Digit Set **What will change** - adding a new file with a solution for 902. Numbers At Most N Given Digit...
## **`Title`** - Adding code for 336. Palindrome Pairs **What will change** - Adding C++ code for leetcode problem 336 ### Type of Issue - - [x] Adding New Code...
## **`Title`** - Solution for 133. Clone Graph **What will change** - Adding C++ code for leetcode problem 133 ### Type of Issue - - [x] Adding New Code ###...