Eeclaircpincompetitive-programming.hashnode.dev00Koko Eating bananas - LeetCodeJul 28, 2024 · 2 min read · Problem Link C++ Code class Solution { bool check(int x, vector<int> &piles, int h, int n) { long long hours = 0; for(int i=0; i<n; i++) { if(piles[i]%x == 0) { hours += piles[i]/x; } el...Join discussion
Eeclaircpincompetitive-programming.hashnode.dev00Find Peak Element - LeetCodeJul 28, 2024 · 2 min read · Problem Link C++ Code class Solution { public: int findPeakElement(vector<int>& nums) { int n = nums.size(); if(n == 1) return 0; int low = 0; int high = n-1; while(low <= high) { ...Join discussion
Eeclaircpincompetitive-programming.hashnode.dev00Find Minimum in Rotated Sorted Array - LeetCodeJul 28, 2024 · 1 min read · Problem Link C++ Code class Solution { public: int findMin(vector<int>& nums) { int low = 0; int high = nums.size() - 1; int ans = INT_MAX; while(low <= high) { int mid = low + (high-low)/2; ...Join discussion
Eeclaircpincompetitive-programming.hashnode.dev00Search in Rotated Sorted Array II - LeetCodeJul 28, 2024 · 2 min read · Problem Link C++ Code class Solution { public: bool search(vector<int>& nums, int target) { int low = 0, high = nums.size()-1; while(low <= high) { int mid = low + (high-low)/2; if(nums[mid] == target) ...Join discussion
Eeclaircpincompetitive-programming.hashnode.dev00Pow(x, n) - LeetCodeJul 27, 2024 · 1 min read · Problem Link C++ Code class Solution { double pow(double x, long long n) { if(n==0) return 1; if(n%2==0) { return pow(x*x, n/2); } else { return x*pow(x, n-1); } } publi...Join discussion