Surya Pratap SuryaPratapK
SuryaPratapK
/ Create Grid With Exactly K Paths I | Leetcode 3988
Created
July 13, 2026 14:35
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| vector<string> createGrid(int m, int n, int k) { | |
| vector<string> grid; | |
| //Step-1: Fill grid with obstacles except 1st row and last col. This is for 1st path | |
| // On a 1*N or M*1 grid, only 1 path is possible | |
| for(int i=0;i<m;++i){ | |
| if(i==0) | |
| grid.push_back(string(n,'.'));//all free cells | |
| else |
SuryaPratapK
/ Divisible Game | Leetcode 3984
Created
July 6, 2026 17:46
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| #define MOD 1000000007 | |
| void getPrimes(vector<int>& nums,set<int>& primes){ | |
| for(int ele: nums){ | |
| for(int i=2;i*i<=ele;++i){ | |
| if(ele%i==0){ | |
| primes.insert(i); | |
| while(ele%i==0) | |
| ele/=i; |
SuryaPratapK
/ Maximum Subarray Sum After Multiplier | Leetcode 3976
Created
June 29, 2026 14:53
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Solution-1: TC: O(N), SC: O(N) | |
| class Solution { | |
| #define ll long long | |
| ll transform(const int& ele,const int& k,const bool is_positive){ | |
| if(is_positive) | |
| return 1LL*ele*k; | |
| return ele>=0? floor(ele/k) : ceil(ele/k); | |
| } |
SuryaPratapK
/ Shortest Path With At Most K Consecutive Identical Characters | Leetcode 3970
Created
June 22, 2026 10:37
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| struct Node { | |
| int u; | |
| int count; | |
| int wt; | |
| // Min-heap comparison based on weight | |
| bool operator>(const Node& other) const { | |
| return wt > other.wt; | |
| } |
SuryaPratapK
/ Maximum Sum of M Non-Overlapping Subarrays I | Leetcode 3956
Created
June 9, 2026 07:13
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| #define ll long long | |
| public: | |
| long long maximumSum(vector<int>& nums, int m, int l, int r) { | |
| int n = nums.size(); | |
| //Step-1: Build PrefixSum array | |
| vector<ll> psum(n+1); | |
| for(int i=1;i<=n;++i) | |
| psum[i] = psum[i-1] + nums[i-1]; |
SuryaPratapK
/ Maximum Number of Items From Sale II | Leetcode 3947
Created
June 2, 2026 05:03
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| #define ll long long | |
| public: | |
| int maximumSaleItems(vector<vector<int>>& items, int budget) { | |
| int n=items.size(); | |
| //Step-1: Find cheapest and max_factor O(N) | |
| int cheapest = INT_MAX; | |
| int max_factor = INT_MIN; | |
| for(int i=0;i<n;++i){ |
SuryaPratapK
/ Minimum Operations to Sort a Permutation | Leetcode 3942
Created
May 25, 2026 12:37
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| bool checkIfIncreasing(vector<int>& nums,int& min_idx,int& n){ | |
| int i; | |
| for(i=min_idx;i<min_idx+n;++i){ | |
| if(nums[(i+1)%n]-1 != nums[i%n]) | |
| break; | |
| } | |
| if((i+1)%n == min_idx) | |
| return true; | |
| return false; |
SuryaPratapK
/ Largest Local Values in a Matrix II | Leetcode 3933
Created
May 18, 2026 18:50
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| int countLocalMaximums(vector<vector<int>>& matrix) { | |
| int n = matrix.size(), m = matrix[0].size(); | |
| static int psum[201][205][205]; | |
| memset(psum, 0, sizeof(psum)); | |
| /* | |
| Step-1: Find PrefixSum for count of values > matrix[i][j] |
SuryaPratapK
/ Minimize Array Sum Using Divisible Replacements | Leetcode 3927
Created
May 11, 2026 11:56
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //Solution-1: Space optimized solution | |
| //TC: O(NlogN + M (logN)^2) | |
| //SC: O(N) | |
| class Solution { | |
| #define ll long long | |
| public: | |
| long long minArraySum(vector<int>& nums) { | |
| int n = nums.size(); | |
| //Step-1: Build ordered_map using the nums array | |
| map<ll,ll> freq; |
SuryaPratapK
/ Minimum Cost to Move Between Indices | Leetcode 3919
Created
May 4, 2026 08:05
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| vector<int> minCost(vector<int>& nums, vector<vector<int>>& queries) { | |
| int n = nums.size(); | |
| // Step-1: Calculate Prefix_Sum | |
| vector<int> prefix_sum(n+1); | |
| prefix_sum[1] = 1; | |
| int curr_cost; | |
| for(int i=1;i<n-1;++i){ |
NewerOlder