Surya Pratap SuryaPratapK
SuryaPratapK
/ Count the Number of Good Subarrays | Leetcode 2537
Created
April 14, 2025 19:31
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 { | |
| using ll = long long; | |
| public: | |
| long long countGood(vector<int>& nums, int k) { | |
| ll n = nums.size(); | |
| ll left = 0, right = 0; | |
| ll good_subarrays = 0; | |
| unordered_map<ll,ll> freq; | |
| ll equal_pairs = 0; |
SuryaPratapK
/ Count Good Triplets in an Array | Leetcode 2179
Created
April 13, 2025 16: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 { | |
| using ll = long long; | |
| vector<ll> seg_tree; | |
| void updateSegTree(ll st_idx,ll start,ll end,ll& query_idx){ | |
| if(end<query_idx or start>query_idx)//Case-1: No Overlap | |
| return; | |
| if(start==end){//Case-2: Total Overlap | |
| seg_tree[st_idx]++; | |
| return; |
SuryaPratapK
/ Find the Count of Good Integers | Leetcode 3272
Created
April 11, 2025 06:32
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 | |
| ll k_palindromes = 0; | |
| unordered_set<ll> done; | |
| vector<ll> fact; | |
| void precomputeFactorial(int& n){ | |
| fact[0] = 1; | |
| fact[1] = 1; | |
| for(ll i=2;i<=10;++i) |
SuryaPratapK
/ Count the Number of Powerful Integers | Leetcode 2999
Created
April 9, 2025 19:17
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 | |
| #define MAX_DIGITS 17 | |
| ll dp[MAX_DIGITS][2]; | |
| // Helper: Check if number should be subtracted based on suffix and digit constraints | |
| static bool checkSubtract(const string& num_str, ll num_digits, const string& suffix, int limit) { | |
| if (num_digits < suffix.size()) return false; | |
| string suffix_of_num = num_str.substr(num_digits - suffix.size()); |
SuryaPratapK
/ Largest Divisible Subset | Leetcode 368
Created
April 6, 2025 09:19
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> largestDivisibleSubset(vector<int>& nums) { | |
| int n = nums.size(); | |
| vector<int> ans; | |
| //Step-1: Sort the array and Find LIS length | |
| sort(nums.begin(),nums.end()); | |
| int lis = 1; | |
| vector<int> dp(n+1,1); |
SuryaPratapK
/ Sum of All Subset XOR Totals | Leetcode 1863
Created
April 5, 2025 10:39
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 subsetXORSum(vector<int>& nums) { | |
| int n = nums.size(); | |
| int orr = 0; | |
| for(int ele: nums) | |
| orr |= ele; | |
| return orr * (1<<(n-1)); | |
| } | |
| }; |
SuryaPratapK
/ Maximum Value of an Ordered Triplet I and II | Leetcode 2874 | Leetcode 2873
Created
April 2, 2025 04:26
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 maximumTripletValue(vector<int>& nums) { | |
| int n = nums.size(); | |
| //Step-1: Find right_max for all indices | |
| vector<int> right_max(n); | |
| int max_val = nums[n-1];//last element | |
| for(int i=n-2;i>0;--i){ | |
| right_max[i] = max_val; |
SuryaPratapK
/ Solving Questions With Brainpower | Leetcode 2140
Created
April 1, 2025 06: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 | |
| ll findMaxPoints(vector<vector<int>>& questions,int pos,vector<ll>& mem){ | |
| if(pos >= questions.size()) | |
| return 0; | |
| if(mem[pos]!=-1) | |
| return mem[pos]; | |
| ll exclude = findMaxPoints(questions,pos+1,mem); |
SuryaPratapK
/ Lowest Common Ancestor of Deepest Leaves | Leetcode 1123
Created
March 27, 2025 15:38
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
| /** | |
| * Definition for a binary tree node. | |
| * struct TreeNode { | |
| * int val; | |
| * TreeNode *left; | |
| * TreeNode *right; | |
| * TreeNode() : val(0), left(nullptr), right(nullptr) {} | |
| * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} | |
| * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} | |
| * }; |
SuryaPratapK
/ Count Good Numbers | Leetcode 1922
Created
March 27, 2025 15:18
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 | |
| int MOD = 1000000007; | |
| ll binaryExponentiation(ll a,ll b){ | |
| ll res = 1; | |
| while(b){ | |
| if(b&1) | |
| res = (res * a) % MOD; | |
| a = (a * a) % MOD; |