-
30 Days of Code [Day 11]
QUESTION : 41. First Missing Positive VERY BAD SOLUTION with maps #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: int firstMissingPositive(vector<int>&...
-
30 Days of Code [Day 10]
QUESTION : 42. Trapping Rain Water Time Complexity : O(n) Space Complexity : O(2n) #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution {...
-
30 Days of Code [Day 9]
QUESTION : 43. Multiply Strings #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: string multiply(string num1, string num2) { if(num1 ==...
-
30 Days of Code [Day 8]
QUESTION : Equal Difference #include<bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define vi vector<int> #define vvi vector<vi> #define vl vector<long> #define vvl vector<vl> #define pii pair<int, int> #define pll pair<long, long> #define endl "\n" #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define printv(v) for(auto...
-
30 Days of Code [Day 7]
QUESTION : 45. Jump Game II #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: int jump(vector<int>& nums) { int jumps =...
-
30 Days of Code [Day 6]
QUESTION : 44. Wildcard Matching #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: bool isMatch(string s, string p) { int n...
-
30 Days of Code [Day 5]
QUESTION : 46. Permutations #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: vector<vector<int>> permute(vector<int>& nums) { vector<vi> res; sort(all(nums)); res.pb(nums); while(next_permutation(all(nums)))...
-
30 Days of Code [Day 4]
QUESTION : 47. Permutations II USING MAP AND BACKTRACKING #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: int Length; vector<vi> res;...
-
30 Days of Code [Day 3]
QUESTION : 48. Rotate Image #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define fv(V) for( auto &it : V ) class Solution { public: void rotate(vector<vector<int>>& matrix) { fo(i,0,matrix.size()){ fo(j,0,i) swap(matrix[i][j], matrix[j][i]);...
-
30 Days of Code [Day 2]
QUESTION : 49. Group Anagrams #define vi vector<int> #define pii pair<int, int> #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() #define fo(i,s,n) for(int i=s;i<n;++i) #define of(i,s,n) for(int i=s-1;i>=n;--i) #define printv(v) for(auto &x : v){cout<<x<<" ";}cout<<endl; #define fv(V) for( auto &x : V ) class Solution { public: vector<vector<string>>...