Sukriti's Notebook

Dynamic Programmin Problems

  1. House Robber I : Solution + Discussion
  2. House Robber II : Solution + Discussion
  3. House Robber III : Solution + Discussion

Must Read

  1. https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/1322101/C%2B%2BJavaPython-MaxHeap-MinHeap-Binary-Search-Picture-Explain-Clean-and-Concise

Google Kickstart Template

#include "bits/stdc++.h"
using namespace std;
 
#define endl "\n"
#define F   first
#define S   second
#define ll  long long
#define vi  vector<ll>
#define pb  push_back
#define pii pair<ll,ll>
#define vii vector<pii>
#define vb  vector<bool>
#define vc  vector<char>
#define vs  vector<string> 
#define vvi vector<vi>
#define vvb vector<vb>
#define vvc vector<vc>

#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define print(v) for(auto& it:v)cout<<it<<" ";
#define calc_fact(n) tgamma(n+1)
#define inf 9223372036854775807LL
#define MOD 1000000007
#define mod 998244353

template<typename T, typename U> static inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static inline void amax(T &x, U y) { if(x < y) x = y; }


void solver(){
    
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
   
    ll test = 1;
    cin>>test;
    for(ll t=1;t<=test;t++){
        cout<<"Case #"<<t<<": ";
        solver();
    }
}

EMBED PLAYGROUNDS

Comments (0)