-
Cache Addresses
Virtual memory is a facility that allows program to address memory from a logical point of view, without regard to the amount of main memory physically available. When virtual memory is used all the address fields of machine instruction contain virtual addresses from read to write, from main memory, a...
-
30 Days of Code [Day 30]
QUESTION : 213. House Robber 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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public: int findmx(vi&...
-
30 Days of Code [Day 29]
QUESTION : 198. House Robber #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public: int rob(vector<int>& nums)...
-
30 Days of Code [Day 28]
QUESTION : 167. Two Sum II - Input array is sorted USING 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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0);...
-
30 Days of Code [Day 27]
QUESTION : 283. Move Zeroes #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public: void moveZeroes(vector<int>& nums)...
-
30 Days of Code [Day 26]
QUESTION : 189. Rotate Array #define vi vector<int> #define pii pair<int, int> #define pb push_back #define pf push_front #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public:...
-
30 Days of Code [Day 25]
QUESTION : 977. Squares of a Sorted Array #define vi vector<int> #define pii pair<int, int> #define pb push_back #define pf push_front #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class...
-
30 Days of Code [Day 24]
QUESTION : 35. Search Insert Position #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public: int searchInsert(vector<int>&...
-
30 Days of Code [Day 23]
QUESTION : 278. First Bad Version // The API isBadVersion is defined for you. // bool isBadVersion(int version); #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...
-
30 Days of Code [Day 22]
QUESTION : 746. Min Cost Climbing Stairs #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 ) #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); class Solution { public: int...