From 60c08d715278120b77527f97b2d2731e097b3d2c Mon Sep 17 00:00:00 2001 From: neha965166 <107788397+neha965166@users.noreply.github.com> Date: Sat, 1 Oct 2022 14:11:55 +0530 Subject: [PATCH 001/290] Hacktoberfest --- Kth_LargestElem.cpp | 99 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 99 insertions(+) create mode 100644 Kth_LargestElem.cpp diff --git a/Kth_LargestElem.cpp b/Kth_LargestElem.cpp new file mode 100644 index 0000000..3bc0197 --- /dev/null +++ b/Kth_LargestElem.cpp @@ -0,0 +1,99 @@ +// Kth_LargestElem.cpp +// CPP code for finding K-th largest Node using O(1) +// extra memory and reverse Morris traversal. +#include +using namespace std; + +struct Node { + int data; + struct Node *left, *right; +}; + +// helper function to create a new Node +Node* newNode(int data) +{ + Node* temp = new Node; + temp->data = data; + temp->right = temp->left = NULL; + return temp; +} + +Node* KthLargestUsingMorrisTraversal(Node* root, int k) +{ + Node* curr = root; + Node* Klargest = NULL; + + // count variable to keep count of visited Nodes + int count = 0; + + while (curr != NULL) { + // if right child is NULL + if (curr->right == NULL) { + + // first increment count and check if count = k + if (++count == k) + Klargest = curr; + + // otherwise move to the left child + curr = curr->left; + } + + else { + + // find inorder successor of current Node + Node* succ = curr->right; + + while (succ->left != NULL && succ->left != curr) + succ = succ->left; + + if (succ->left == NULL) { + + // set left child of successor to the + // current Node + succ->left = curr; + + // move current to its right + curr = curr->right; + } + + // restoring the tree back to original binary + // search tree removing threaded links + else { + + succ->left = NULL; + + if (++count == k) + Klargest = curr; + + // move current to its left child + curr = curr->left; + } + } + } + + return Klargest; +} + +int main() +{ + // Your C++ Code + /* Constructed binary tree is + 4 + / \ + 2 7 + / \ / \ + 1 3 6 10 */ + + Node* root = newNode(4); + root->left = newNode(2); + root->right = newNode(7); + root->left->left = newNode(1); + root->left->right = newNode(3); + root->right->left = newNode(6); + root->right->right = newNode(10); + + cout << "Finding K-th largest Node in BST : " + << KthLargestUsingMorrisTraversal(root, 2)->data; + + return 0; +} From 23812f850454fc0f8ec14b8058a4d02aaead68ad Mon Sep 17 00:00:00 2001 From: smartytushar <114435244+smartytushar@users.noreply.github.com> Date: Sat, 1 Oct 2022 14:17:26 +0530 Subject: [PATCH 002/290] I want T-shirt --- KadaneAlgo | Bin 0 -> 23080 bytes KadaneAlgo.cpp | 66 ++++++++++++++-------------- KadaneAlgo.cpp:tests | 9 ++++ flipBit.cpp | 101 +++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 144 insertions(+), 32 deletions(-) create mode 100644 KadaneAlgo create mode 100644 KadaneAlgo.cpp:tests create mode 100644 flipBit.cpp diff --git a/KadaneAlgo b/KadaneAlgo new file mode 100644 index 0000000000000000000000000000000000000000..9714bd0d08f287eaeac4ca752c4fd318ea5ae2f8 GIT binary patch literal 23080 zcmeHPeRx#WnZJ_|hzd!dup+i)RM-W9A(JnIl{$e8-qZvGNfg`Sbuu$aW}VEWGj|}^ zvP7eV$svT%Rg+gGa$F{%V@4w~h5w+Q{;fQXUlAUNl30Nq()YS9*zMN2L#1 zuqLU@ZwvHfRk6slL^ktQ>1UpHc!KLwQfhAsYon3Qx|+4o(3)r@mg-;AUthPTuEvv$ zd#VJV{GvRlPhGXSgPLQ6Fs???77IB|{H@nK^^-q+{hl4KeEWwlf2Z?~dsA;8zDwGm zJV}NE>B}aT>31MPGFJKTF1kots1ZitZ}2-7{#kG06LX4|_s-q8X#d=ef|2LX0T^14 zgZCP+TzD!EPTuB{e>#u-a31_b9(++A{74@B#ytMC6`G&RX^_m?#53IcLK;I|043eSQSQk4}SBtCEAS*7IQJ=D2(Gr_`n8{)G8Ri2b6H1 zFB{j;&y!{-xM~&k?K;gcx_jd>BWVT_reSDCQ+taM3Mazdk)#<;w6|=G#$)03KxZ^; z@p5zCzqu`vNcy)%G($%FMKm5w`a^b%ur{+g7>NnUtdGQ#MrR-yu4#%z%to(&hY*M+ zn}Tho*Bk5!Bn&eVh?oHU{;j~OAsq=C@uZmu2YQ>@jrK~z-&SW3%V-OmeTi@|l8nSD zgEq4!7)~UVth}|!U9q6CGh+6j)S*b+-zhUKEYDy&a;!C4uMR4fMIkm?h1lF?uCrW4 z5p$NN+Khz#t!;63G@derIjXSMO(?2eH*F{(wOUX%7}_d$lM(E>$><71qFOK-58i}! z4E6_%fEn(Oz>r9EMPh+y)$kT8Nv{F|Dd&6W3H ziYn6H$$U9~%6V&qFBTuqj}jlG0TDr0@Bx-D^$E5;|H<^RD=nPHSUI*5a>9Y50CpI4 z;AJ+dX=4t&+<~8R;JmaF+(`%Sy#9SYOPS^uE|LJ`^-eg=FEYsMo$y5x1npt_a}ejD zKydpUI9IX2`yIHP%ZM@Hz~!7w_?-@%@|Izr19#5b`yDv>B*Q@mF58lL_d9TO7&{zt z;OE+?rX64Ptq>O&>Zuf?=^ z`-oYTIi?T(r1Viy1)16^z!RC})ga|dHInZk&cyg{GMUUik*0}dV*I$BrU_+Y{D_^V ziDY8@pY1eFAQR(Xu+ubgOpM=cr)k2N7{A3%(?l^b{vkU}6U4-Lz)sV|FfqQxPSb=i zG2UROX(E^y_u6Ti04BySl4+FgF%OllQ4{4uxRL zq)U|aTezKd`um2Ge#M#gzS5LFeuJKVK_5JMs;4{-i&?6HJP9K<{DlZp;szA5#qerBQcdrURg7D`PgnAl(y3=c`p~T9D@Zr(pY)FCNBv{M(oz2@qDTEFi46Il860!1^Pk-P;UWJ? zeZM}u@OHxWA^!>8b!xVE9a4duHrz59Tk zPVIA+?*z)19&JkhWb8*&%kPCM>>om|_v`7$QF&KTUF{@z2oOpP_F+B!h(7oTq8$UM zojXObEvPB|Y=dY4eQ?AjtK={(tc0%X*!L;^1EKN9SM{4lD#+F?FKDMI1??X(OOjQ#?>hI($ksDp#MJCOHWYg z;pmWm#A=JjL`9L{pD%^rfBqTn57+LQ2j|j9$Nmm_V-tj>{iOPYzRG`SLNC8`WTL!c zUK&yp^umfozlM^d(G0E!!F!sC11f%2iu<@+jm>g?+AkJTdm~3ax#hJVXC6$^htea`w8@@ zcgh~sEkwhkA87bs!wn5a)>TuH-hDcqnjGAH+LfxhW%pzzgDZI@@~mEiJX?h3qR*`) zH)`F0^r4agO2LCuf5Ig=)l+{=st?m#GIju6dny+zhavyzOZ<~L(DM`&f`2?VC5N7m zPPTh8oq8ShI60&Zb-bQ_7TJGWTt6L?=_10X{K%^i&9C4_4rA%m$#lmkjExQX7N`BE zhy0_+rW0CeYQiz}$;DRpp{Z`DV-%OZ@Z=piMAnmt|MZz|k+VOTg=+dS#sg80CPcG~ zfEt6YqYhAhT>2O){FC}n1qh-T-5=RKo8m9cB8C`OX*_JWu6cOwcB`9jzxmupPZ;JN2JOyShB(OK+pjCgxjOX;8job86)w*fW1-YG9@YW@=!j24-qt zrUw2OYJi^8pDjoUTAERu)*W;UPD^<=em?vL@Dn#JQb0-Ol%Gb29vM(Rw92K&0rUuf zY|yPf-QLqJJyxz7mOdgNnlq3-1^F!ad@HHpX@&>^rbn56iVBHv899LP6lIPujCD1I z%A4f<6?pUQnF>@JB@Y%`I;U zdi~!QiR$kD{6Z?ewxzX+ime$VKd0)}<{w#gG116^ke}$v+sF43#X1|SXHCP3EJGeV z2TC6N29!J?KHWzB7IZ1-&q1#QeG_yK=+{8Wz)M77;0>ZMaFi$v{DCM8JV_J=gd7YE zQyK;yBMJi#3F^{b6tq~|Bj_CMxS-`4t$fMAuLZr*vIhg?AA0TTa<}GAy3f@%#zWzdd&4dOZ5Jin8=`nuwx+Rq z2VRufVc<4TgX_ZL_dE!M-l;5pC6gHiodhjKU6lSllW~Kd0DS`Z5mZJ!T4@q=8|ZP| zy!L~7;QR>ahe1a{KL%P4y|06A104bF2YniJKWOpmxa9(^0X+fwY0yc~$3YiE|5?z3 zprvRG+8EFes$1R4e)r?Ld8_8?uW(&BcTVX(=#u}mXNG(heY|mw=r_xN(ObOAm#wmC zWfhys7Qe6jyq%>3+LcQ#zqESU#b68l4}y+CPAC$HKz2?1Mu8tAfCJ@49k6{OlM(N! z{ACq)6m6V0y9EvbCqC8d`=;Ul6nr1};{BJ@Z<^A78T=~n=^>FO`8`woxhVI>Y51$b zC;z&f`bFD?0rIaI{7-|w+Q|=2*^h$%74SuU$o#LG;_n6j7W9?NocggT{)6D}2mg5| zzv!3{pmzBw_*>9k+tJo``L4dJ_@lG-mJH4=ZYqK#`AK^aJn%!btMsF5DxZbW??PW} z$;ziu2#|ga`1gW;fs@~A={Evvr~F|*O#Dq{6?YXil`Z~gvA@hcJj-9UVsA-fS>+wG z^|JcGIaihWVrBIWWt9zOD>jt5H zfteckzfc2m|B>8pB=;9#iWWhov=@rPT#MKno%pswyK}L{5OXu4a=#PbZiso6B$ilW z_WmZC*C~jb1kg9$&crEwkk^U!9L)DIOtcfsmwRVc(AT|SDF}|X3=fv@>z`03~jTLLCxRQ`UkI~TQ zM67tRV;{4VTdc{^atftkX_odXo=jv18i$L}C>734m%!*L4dFfozld=;&Lb%T-SfHN z&%TXTn)0Kt2|rhkdgujC_T~IRvJ`gV=fY?!$9)0f&wl)J`TtcRzd&=l5kZjoJ|f}^ zw2Rz`AV~Z<5nrHP>?U*yKPlo%w7V7m>3aZ|wm@6vMg&2QmrG!f@D*+W+xAy8zEZ)j zWc*SE-@^E6#-;r}#w!(^o^4RRH46SM#_JXQ=Zs&W;PiZj?D!P?d`uXGH!Ao##&re1 zmholbjVEls$er~bl=Zy+p#dt`;-_LlDg5Sz`RKdT@c%Op* zjB!)J-(~D0qVL+Z6mWjNhr?M;YI%;D2CzpMozcvHba%f?vV- zegzLPen7$hiSdI9eu(k=6#QAn?^keoI70RFpn@;Q{6zR61;3i{?|CoXgGX8M|{|4iqQ1Is% z|D=Mu;4t~KU%^)~{wW3TVEoexzK8M8DEQYHKcL{xF#cHu&oKTu1;6wh%g@g%cn9ML z6?}m4FDUo}jDJzVpJn_@3hu&!p6cg51z*khmlgav#=oNAw=(`!1^)))_bd1b#=oZE z#kip$f4;8Z9>yO~@aq|WP{D6w{2L1X5aZue@Lw?gkb;+B;-~qyjz6ksvAVTZ%ecIs zyMS@(@44pREs%F%T@?CT7IctY@&+w9a;&e6a`FdEWgVCh_Rm}|eOTC8bjJE>FXQU^ z;q$`Ind__X0|(0;-FL6-NkdF+3e<)2`AS@x&$$S*^?E+{&49X^^zehC(!3#c=2d7o!bD+O-5 zZAadPb|LxE`4+U6Iq%COe^(y-0pL_W6+YXvh*iMC< zFyJT2f06suYR=|-;M5P*e)W%N#|qdv#MiI%YMGE}MCtp9JpacosoZk^HxmdRRj34t#*~#dI&irNDE2x9MX$|H1jLW%+A` z9Zon%3b@;mmeJet$bW|I|BUS;DZ)c}>^uoP*LS3&z;o5J7EG8)GliXfL2c@LQN!#t z@I7KIoWw_mp}5f%6&z41Bm4F#?H1V3!e& znTcImS0d0GHbSZ1-d#{}qzp)!S)x}5LV;MgA=(}H1pE5L$Cb_Ab$yX=FuXI83>(3C z4Bw8Xg7mdzo7wEG4n*<&WB?ArOt%HrMY?101iqUjiF(6`#3>sjH?PCzvauAtuIz8F z@}h*{u0Sek8uSIG(HD?~uz8lRe;H~s;Y-wl0l~9M z^#u~)*jc5>)-(mEu?o-`2%SZcT}uRF-P4$3sbt@@nbz8w;_43v@((`VI&K9qx!?o% zX&P2$P2bRStzd)?g-!HWOcX{Nrj#A{Y(7Mv%bQ^%Vhvf|N^9ir>kK99SbANz5ipV% zTjf@JZLVs*WVQe_4rTdS(@)~YJJwW>sG)nFA& z10~L6p*1oVSdp8N!ih40SO~+awbrI|Wdw)A$e|HyR-?%<-e2DpiDHa3;yC!l*tE5w z#c%jGH_|yY1`bFv{5per<5taRynb^-OVdX1vR3^#Ud9QClWgpquGzGy&5u)J8a6ch zVKp2Im;tdK4{R34$rw#Ifo4;$*%b|RC)*%_Wp?f(SbRQlXbK;XVl-VNPLGKhDJ)K` zk;6W*CC3pnigwodEX>1kEOZEqIG;tj(XZ--l5wL4RZGY5;O->8HE$`b^LP|}s08EU ztQ=>#ts`Wz-4OR11s-9eWV=L| zai+4ULDo3NNcJoHcp^m~H4})PQ8S`P&^balp65)3+O9}{IOII52YFEsBWDtH3{Ph= zDdTkiX7>>Ls366tbx=<*nG!u(H1S{KFeD|HY*&(Dv&(;G$t%xt7!>us#F=Vz>59{a zs1S4`FA70NKB-RNASiT`rhfm{tJ{sXD*7*VMfDkUC9o1-8|q%mnhA^c$XFzX^RxOi4{ox;9y~Pg^d;hb z;e@%%0d=M#IB+f!VyIz5(;73-tqJj-K(a^kgm%S{g+nN##B$nS*@nDASi9f>%nmetogU zk<@J^?Z0@flNIWaa_VnmeMy&PNl(2mmvED!FZZ)Z>Xw2`<@0h0Ux&zlVegVG|3S`Q z(i#@TYdjHD{{ukrO2jVz3D%cX?*F1PQr$^?xeqG>j8tU)_C6ZUQ0hZO1hxJ@1eEq> zNqxEBMp6&!N&lssr2hau?e&srxi3f3R@RqoB>iVt8%BicRO-w9JCe%%XEJ}OFU$W) z*5AMeVE+k)rqu^N5fWNs_tA-+y8)~?`AzoN7M#(U<#>Bt0e-nM!+-eqYfa<$NXmvRyHj0jVd=KCI}={gRU6bxKxH>+dnvm+h~) zS)6GpUk{AhY?*!v5o$lFFZW4F`k)kKs^$fz8YE1< z=ac8ls`VxHC4Ch-c!go>%l%pU8nQOkU#-+sTI#MC;hOR#fQcwEz z05GaQTc7ujw(^UPL!{&gQeV>9PjaU)#m4cHhO)U66Hdx99co)#!_(}ie_=DH|w(mlb|L8s|QX;Qs a#$~>o6qmbFM8Rs=VoA`xE@x1Z+J6K6Egz8p literal 0 HcmV?d00001 diff --git a/KadaneAlgo.cpp b/KadaneAlgo.cpp index a9628b7..e68c28a 100644 --- a/KadaneAlgo.cpp +++ b/KadaneAlgo.cpp @@ -30,17 +30,18 @@ typedef tree, null_type, less>, rb_tree_tag, tree_ void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ } + long long maxSubarraySum(int arr[], int n) { /* @@ -48,50 +49,51 @@ long long maxSubarraySum(int arr[], int n) Don't read input, it is passed as function argument. No need to print anything. Taking input and printing output is handled automatically. - */ - long long curr=0; - long long maxTillNow=0; - for(int i=0;i> n; - int arr[n]; - for(int i=0;i>arr[i]; - } + int arr[n]; - cout<> arr[i]; + } - // code + cout << maxSubarraySum(arr, n) << endl; - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +int flipBits(int* arr, int n) { + + int count = 0; + int MaxCount = 0; + int x = 0; + + for(int i = 0; i < n-1; i++) { + if(arr[i] == 0) { + count++; + } + + else { + count--; + x++; + } + + if(count > MaxCount) MaxCount = count; + if(count < 0) count = 0; + } + + + return MaxCount + x; + + +} + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + int n; + cin >> n; + + int arr[n]; + + for(int i = 0; i < n; i++) { + cin >> arr[i]; + } + + cout << flipBits(arr, n) << endl; + + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< Date: Sat, 1 Oct 2022 14:39:34 +0530 Subject: [PATCH 003/290] I want T-shirt --- README.md | 13 + Seller.html | 1212 ++++++++++++++++++++++++++++++++++++++++++ kids.html | 682 ++++++++++++++++++++++++ login1.html | 62 +++ offers.html | 139 +++++ product.html | 1194 +++++++++++++++++++++++++++++++++++++++++ recoverpassword.html | 21 + rpassword.html | 24 + seller-login.html | 82 +++ seller-signup.html | 93 ++++ 10 files changed, 3522 insertions(+) create mode 100644 README.md create mode 100644 Seller.html create mode 100644 kids.html create mode 100644 login1.html create mode 100644 offers.html create mode 100644 product.html create mode 100644 recoverpassword.html create mode 100644 rpassword.html create mode 100644 seller-login.html create mode 100644 seller-signup.html diff --git a/README.md b/README.md new file mode 100644 index 0000000..67dc4b4 --- /dev/null +++ b/README.md @@ -0,0 +1,13 @@ +# TMN-Ecommerce Site + +#### Contributors till now: + +1. Pushp Ratan - Footer, Navigation + +2. Atmagyan Singh - Cart, Login Page, Signup Page + +3. Chukka Keerthi - Slider + +4. Ananya - Home Page + +5. Harsh - Cart diff --git a/Seller.html b/Seller.html new file mode 100644 index 0000000..bb9946a --- /dev/null +++ b/Seller.html @@ -0,0 +1,1212 @@ + + + + + + + + + + Seller Dashboard + + + + + + + + +
+ + + +
+ +
+ + Seller_Profile_Picture + +

Alexander Hipp

+
+ +
+ Your Profile + Product List + + Offers Available + + Current Orders + Completed Orders + +
+
+ + +
+

+ Your Profile +

+
+ +
+
+

Full Name

+

Profile Id

+

Email Id

+

Mobile No

+ +
+
+

+

+

+

+ +
+
+
+ +
+

+ Product List +

+
+ +
+ + + + +
+ Product2 +
+

x

+

BIBA 1

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ Product2 +
+

x

+

BIBA 2

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ Product2 +
+

x

+

BIBA 3

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ Product2 +
+

x

+

BIBA 4

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ Product2 +
+

x

+

BIBA 5

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ Product2 +
+

x

+

BIBA 6

+

Women White Pochu

+

₹ 400/-

+

400 pieces + available

+
+ + + + + +
+
+
+
+ + + +
+ + Add Items + +
+ +
+
+
ADD PRODUCT
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+ +
+
+ + +
+
+
+
+ + +
+

+ Offers Available +

+
+ +
+ + +
+
+

x

+

Offer 1

+
+
+
+
+

x

+

Offer 2

+
+
+
+
+

x

+

Offer 3

+
+
+
+
+

x

+

Offer 4

+
+
+
+ +
+ + Add Offer +
+ +
+
+
ADD OFFER
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+ +
+
+ + +
+
+
+
+ + +
+ +

Current Orders

+
+ +
+ +
+
+ +
+
+

+ White Digital Watch 1 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 2 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 3 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 4 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+ +
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+ +
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+ +
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+
+
+ +
+
+

+ White Digital Watch 5 +

+

₹ 400/-

+

+ Status: In Transit +

+

+ Product ID: A12P90182 +

+
+ Approve ✔ + Decline ✘ +
+
+
+ +
+ +
+
+
Customer Details
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+
+ +
+ +
+
+ + +
+
+ + +
+
+
+
+ + +
+

Completed Orders

+
+ +
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+ +
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+ +
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+
+

+ White Digital Watch +

+

₹ 400/-

+

+ Status: Delivered +

+

+ Product ID: A12P90182 +

+
+
+
+
+ +
+ + + + + + + + + \ No newline at end of file diff --git a/kids.html b/kids.html new file mode 100644 index 0000000..8497b7d --- /dev/null +++ b/kids.html @@ -0,0 +1,682 @@ + + + + + + + + kids + + + + + + + + + + + + + + + +
+ + + + + +
+
+ MEN +
+
+ + + +
+
+
+ WOMEN +
+
+ + + +
+
+
+ TEEN +
+
+ + +
+
+
+ KIDS +
+
+ + + +
+
+
+
+ LogIn/SignUp + About Us +
+ +
+ + + + + + +
+
Home / Casual Shirts For Men
+
+ Casual Shirts For Men - 8563 items +
+ +
+
+
FILTERS
+
+
+

Brands

+ + +
+ +
+ +
+ +
+ +
+ +
+
+ +
+

Price

+ +
+ + +
+ +
+ +
+ +
+
+ + +
+
+ +
+
+ +
+
+
+
+
+ + + + + + + + + + +
+ + + + + + + + + + diff --git a/login1.html b/login1.html new file mode 100644 index 0000000..b84022f --- /dev/null +++ b/login1.html @@ -0,0 +1,62 @@ + + + + + + + + + Document + + +
+ + +
+
+
+

Welcome Back!

+

To keep shopping please login with your personal info

+ +
+
+

Hello, Customer!

+

Enter your personal details and start shopping.

+ +
+
+
+
+ + + + diff --git a/offers.html b/offers.html new file mode 100644 index 0000000..3b541af --- /dev/null +++ b/offers.html @@ -0,0 +1,139 @@ + + + + + + + + Offers Available + + + + + + +
+
+
+ + Seller_Profile_Picture + +

Alexander Hipp

+
+ +
+ + Your Profile + Product List + Offers + Available + Current Orders + Completed Orders + +
+
+ +
+
+

+ Offers Available +

+
+
+ +
+ +
+

Offer 1

+
+
+

Offer 2

+
+
+

Offer 3

+
+
+

Offer 4

+
+
+

Offer 5

+
+
+

Offer 6

+
+ +
+
+
+ + + + + \ No newline at end of file diff --git a/product.html b/product.html new file mode 100644 index 0000000..f44df0d --- /dev/null +++ b/product.html @@ -0,0 +1,1194 @@ + + + + + + + + Products by category + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ MEN +
+
+ + + +
+
+
+ WOMEN +
+
+ + + +
+
+
+ TEEN +
+
+ + +
+
+
+ KIDS +
+
+ + + +
+
+
+
+ LogIn/SignUp + About Us +
+ +
+ +
+ +
+
+
+ fila +
+
+
+ +
+ +
+
+
+ fila +
+
+
+ fila +
+
+ fila +
+
+ fila +
+
+ fila +
+
+ fila +
+
+
+
+

Product Details

+

+

+
+
+
+

Color

+

Grey

+
+
+

Outer material

+

PU

+
+
+

Model name

+

IZUNA

+
+
+

Ideal for

+

Men

+
+
+

Occasion

+

Sports

+
+
+

Sole material

+

IM EVA

+
+
+

Pack of

+

1

+
+ +
+
+
+
+
+

Customer Reviews

+

Add Review

+

+

+
+
+
+
+

4*

+

Very lightweight and beautiful color loved it

+
+
+

Tulika Agarwal | 24 Mar 2022

+
+
+ 7 +
+
+ 2 +
+
+
+
+
+
+

4*

+

This is very faboulour shoes I like it

+
+
+

Priyanka Sharma | 22 Mar 2022

+
+
+ 11 +
+
+ 4 +
+
+
+
+
+
+

3*

+

Superrr 😍😍😍

+
+
+

Jamini Nagesh | 21 Mar 2022

+
+
+ 3 +
+
+ 1 +
+
+
+
+
+
+

4*

+

Superrr and Loved it 😍😍

+
+
+

Meghana Sheety | 20 Mar 2022

+
+
+ 4 +
+
+ 3 +
+
+
+
+
+ View + More Reviews +
+
+
+
+ +
+

PUMA

+

ZOD Runner NM Running Shoes For Men (Blue)

+
₹2,399
+
+

⭐⭐⭐⭐⭐

+

96

+ reviews +
+
+ +

+ Choose Color

+
+
+ fila +
+
+ fila +
+
+ gosto +
+
+ +
+
+

+ Choose your size +

+ + +
+
+

XS

+

S

+

M

+

L

+

XL

+

XXL

+
+
+

Size Chart

+ +
+
+
+
+ deliver location +
+

Deliver to

+
+
+ + +
+

+

+
+ +
+ +
+
+
+
ADD TO BAG
+
+
+ + + +
+
+
+
+
+
+ + +
+

Similar Products

+
+ +
+
+ adidas +
+
+

ADIDAS

+

Glarus M Running Sports Shoes For Men (Blue)

+
+
₹1,374
+

₹2,499

+ 45% off +
+
+
+ + + +
+
+ adidas +
+
+

Ciffra

+

STUMPER Rnning Shoes For Men (Blue)

+
+
₹299
+

₹999

+ 70% off +
+
+
+ + + +
+
+ adidas +
+
+

FILA

+

KARTO Sports Running Shoes For Men (Red)

+
+
₹1,047
+

₹2,499

+ 58% off +
+
+
+ + + +
+
+ adidas +
+
+

PUMA

+

Softride Enzo NXT Running Shoes For Men (Black)

+
+
₹3,189
+

₹5,499

+ 42% off +
+
+
+ + + +
+
+ adidas +
+
+

WROGN ACTIVE

+

Running Sports Shoes For Men (Maroon)

+
+
₹1,047
+

₹2,499

+ 58% off +
+
+
+ + + +
+
+ adidas +
+
+

SKETCHERS

+

EQUALIZER 4.0 - GENERATION Casuals For Men (Navy)

+
+
₹3,299
+

₹5,499

+ 40% off +
+
+
+ + + +
+
+ puma tree +
+
+

PUMA

+

Supertec Zero Running Shoes For Men (Green)

+
+
₹3,599
+

₹5,999

+ 40% off +
+
+
+ + + +
+
+ puma Two +
+
+

PUMA

+

Zod Runner NM Running Shoes For Men (Blue)

+
+
₹2,399
+

₹3,999

+ 40% off +
+
+
+ +
+
+ + +
+

Recently Viewed

+
+
+
+ adidas +
+
+

PUMA

+

Zod Runner NM Running Shoes For Men (Grey)

+
+
₹2,399
+

₹3,999

+ 40% off +
+
+
+
+
+ + +
+
+

Add Review and Ratings

+
+ +
+ +
+
+

Rating

+
+

1

+

2

+

3

+

4

+

5

+
+
+ +
+ +
+
+
+ + +
+
+
+ + +
+
+
Size ChartClose
+
+
+
+

UK/India

+

Length (in cm)

+

Brand Size

+

Euro

+
+
+

3

+

23.5

+

3

+

36

+
+
+

5

+

25.4

+

5

+

38

+
+
+

4

+

24.4

+

4

+

37

+
+
+

7

+

27

+

7

+

40

+
+
+

6

+

26

+

6

+

39

+
+
+

9

+

28.5

+

9

+

42

+
+
+

8

+

27.9

+

8

+

41

+
+
+
+
+

Not sure about your shoe size? Follow these simple steps to + figure it out: +

+

1. Place your foot on a blank sheet of paper

+

2. Make one marking at your longest toe and one marking at the + backside of your heel +

+

3. Measure (in centimetres) the length of your foot between these + two markings +

+
+
+ foot +
+
+
+
+
+ + +
+ + + + + + + + + + + \ No newline at end of file diff --git a/recoverpassword.html b/recoverpassword.html new file mode 100644 index 0000000..45af85a --- /dev/null +++ b/recoverpassword.html @@ -0,0 +1,21 @@ + + TMN + + + + + + + +
+ + Submit +

+

Didn't get it?

+ +
+ + + + \ No newline at end of file diff --git a/rpassword.html b/rpassword.html new file mode 100644 index 0000000..77f0496 --- /dev/null +++ b/rpassword.html @@ -0,0 +1,24 @@ + + + + + + + + + + + Recover + + +
+
+
Email verification
Enter the code we just send on your Email-id:
ecommerce.techmihirnaik@gmail.com +
+
Don't receive the code?Resend
+
+
+ + + + diff --git a/seller-login.html b/seller-login.html new file mode 100644 index 0000000..b04a4a4 --- /dev/null +++ b/seller-login.html @@ -0,0 +1,82 @@ + + + + + + + + Document + + + + + + + + + + +
+ + +
+
+
+
+
+ +
+
+
+ +
+ + +
+ +
+ + +
+
+ +
+ Not registered yet? Register here +
+
+
+
+ +
+

+ The best offer
+ for your business +

+

+ Sell with us. Earn profit with everything at ease. Maintain and track orders, receive payments + and manage your business +

+
+ + +
+
+
+ + + + diff --git a/seller-signup.html b/seller-signup.html new file mode 100644 index 0000000..266389c --- /dev/null +++ b/seller-signup.html @@ -0,0 +1,93 @@ + + + + + + + + Document + + + + + + + + + + +
+ + +
+
+
+

+ The best offer
+ for your business +

+

+ Sell with us. Earn profit with everything at ease. Maintain and track orders, receive payments + and manage your business +

+
+ +
+
+
+ +
+
+
+ +
+ + +
+ +
+ + +
+ +
+ + +
+ +
+ + +
+ +
+ +
+ + Have an account? Sign In +
+
+
+
+
+
+
+ + + + From a37a6914e8af26c84b750135b72f480902f4e802 Mon Sep 17 00:00:00 2001 From: Anuj Maurya <82217794+assccii@users.noreply.github.com> Date: Sun, 2 Oct 2022 09:35:58 +0530 Subject: [PATCH 004/290] Stack using Queues --- stack_using_queue.cpp | 62 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 stack_using_queue.cpp diff --git a/stack_using_queue.cpp b/stack_using_queue.cpp new file mode 100644 index 0000000..15053ab --- /dev/null +++ b/stack_using_queue.cpp @@ -0,0 +1,62 @@ +//{ Driver Code Starts +#include +using namespace std; + +class QueueStack{ +private: + queue q1; + queue q2; +public: + void push(int); + int pop(); +}; + + +int main() +{ + int T; + cin>>T; + while(T--) + { + QueueStack *qs = new QueueStack(); + + int Q; + cin>>Q; + while(Q--){ + int QueryType=0; + cin>>QueryType; + if(QueryType==1) + { + int a; + cin>>a; + qs->push(a); + }else if(QueryType==2){ + cout<pop()<<" "; + + } + } + cout< Date: Sat, 8 Oct 2022 17:41:07 +0530 Subject: [PATCH 005/290] add java program --- Kids_With_the_Greatest_Number_of_Candies | 26 ++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Kids_With_the_Greatest_Number_of_Candies diff --git a/Kids_With_the_Greatest_Number_of_Candies b/Kids_With_the_Greatest_Number_of_Candies new file mode 100644 index 0000000..358b583 --- /dev/null +++ b/Kids_With_the_Greatest_Number_of_Candies @@ -0,0 +1,26 @@ +// Leetcode - 1431. Kids With the Greatest Number of Candies +// https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/ + + + +class Solution { + public List kidsWithCandies(int[] candies, int extraCandies) { + ArrayList list = new ArrayList(); + int max = Integer.MIN_VALUE; + for(int i=0;i= max){ + list.add(true); + }else{ + list.add(false); + } + } + + return list; + } +} From c130b22d3429eb59db2c402b62c2c2d86d5d6080 Mon Sep 17 00:00:00 2001 From: Utkarsh Date: Sat, 8 Oct 2022 21:33:56 +0530 Subject: [PATCH 006/290] Added Binary Search in 2D Arrays (C++) --- .gitignore | 1047 ------------------- 01Matrix.cpp | 125 --- AllAnagram.cpp | 96 -- BSTIterator.cpp | 120 --- BalancedBinaryTree.cpp | 116 --- BallFall.cpp | 115 -- BasicCalculator.cpp | 105 -- BestTimeBuySellStock.cpp | 131 --- BinarySearch.cpp | 103 -- BinaryTreeLevelOrderTraversal.cpp | 106 -- BinaryTreerightSideView.cpp | 119 --- BullsAndCow.cpp | 94 -- BusRoutes.cpp | 115 -- BuySellStock.cpp | 90 -- ClimbingStair.cpp | 84 -- Combinations.cpp | 97 -- ContainerWithMostWater.cpp | 84 -- CourseScheduleII.cpp | 114 -- CubeSumPair.cpp | 96 -- FirstBadVersion.cpp | 96 -- FirstLastPositionSortedArr.cpp | 127 --- FloodFill.cpp | 105 -- HappyNumber.cpp | 90 -- HouseRobber.cpp | 98 -- ImpQueueUsingStack.cpp | 114 -- InsertMergeInterval.cpp | 112 -- IntegertoRoman.cpp | 143 --- IsSubsequence.cpp | 125 --- IsomorphicStrings.cpp | 110 -- KInversePairsArray.cpp | 110 -- KadaneAlgo | Bin 23080 -> 0 bytes KadaneAlgo.cpp | 99 -- KadaneAlgo.cpp:tests | 9 - Kids_With_the_Greatest_Number_of_Candies | 26 - KthSmallLargeElem.cpp | 94 -- Kth_LargestElem.cpp | 99 -- LCAofBST.cpp | 114 -- LCAofBinaryTree.cpp | 98 -- Leetcode105.cpp | 162 --- Leetcode1074.cpp | 87 -- Leetcode30.cpp | 106 -- Leetcode315.cpp | 147 --- LinkedListCycleII.cpp | 101 -- LongestPalindrome.cpp | 92 -- LongestPalindrome2Words.cpp | 103 -- Matchsticks_Square.cpp | 128 --- MaxXorQueries.cpp | 122 --- MaximumPerformanceTeam.cpp | 99 -- MaximumUnitsTruck.cpp | 86 -- MergeTwoSortedLists.cpp | 122 --- MiddleofLinkedList.cpp | 93 -- MinStack.cpp | 116 --- MinimizeMalwareSpreadII.cpp | 111 -- MyCalendar.cpp | 128 --- N-aryTreePreorderTraversal.cpp | 111 -- NarrylevelOrder.cpp | 122 --- NoOfIslands.cpp | 110 -- NumberProvinces.cpp | 105 -- NumberofMatchingSubsequences.cpp | 110 -- PalindromeLinkedList.cpp | 136 --- PartitionEqualSubset.cpp | 110 -- PartitionList.cpp | 111 -- PathSumIII.cpp | 123 --- PivotElement.cpp | 102 -- PoorPig.cpp | 81 -- PopulatingNextRightPointer.cpp | 132 --- PrefixTree.js | 66 -- README.md | 13 - RangeSumQuery.cpp | 154 --- ReduceArrSize2Half.cpp | 98 -- ReverseInteger.js | 14 - ReverseLinkedList.cpp | 112 -- ReverseLinkedListII.cpp | 158 --- RotateImage.cpp | 84 -- Search2DMatrixII.cpp | 127 --- Seller.html | 1212 ---------------------- SplitArrConsecuSubseq.cpp | 99 -- StringMultiply.cpp | 103 -- StringtoInteger.cpp | 93 -- ValidateBST.cpp | 96 -- WordLadder.cpp | 152 --- WordSubsets.cpp | 109 -- asteroidCollision.cpp | 89 -- averageOfLevelsBT.cpp | 116 --- backspaceCompare.cpp | 105 -- bagOfTokensScore.cpp | 102 -- characterReplacement.cpp | 94 -- checkInclusion.cpp | 86 -- coinChange.cpp | 101 -- coinchange2.cpp | 103 -- combinationSum.cpp | 100 -- combinationSum4.cpp | 93 -- countVowelPermutation.cpp | 131 --- decodeString.cpp | 108 -- deleteDuplicates.cpp | 106 -- diagonalSort.cpp | 115 -- diameterOfBinaryTree.cpp | 108 -- duplicateArray.cpp | 133 --- fib.cpp | 86 -- findAndReplacePattern.cpp | 115 -- findPeakElement | Bin 34952 -> 0 bytes findPeakElement.cpp | 129 --- firstUniqChar.cpp | 94 -- flattenBinaryTree2LL.cpp | 109 -- flipBit.cpp | 101 -- flipbits.cpp | 112 -- goodNodesBT.cpp | 110 -- hammingWeight.cpp | 84 -- inorderTraversal.cpp | 105 -- intern.cpp | 57 - invertTree.cpp | 101 -- isPower2.cpp | 78 -- isSameTree.cpp | 91 -- isSubtree.cpp | 122 --- kids.html | 682 ------------ kthSmallest.cpp | 88 -- kthSmallestElementBST.cpp | 124 --- lastStoneWeight.cpp | 102 -- lengthOfLIS.cpp | 108 -- lengthOfLongestSubstring.cpp | 95 -- letterCasePermutation.cpp | 107 -- login1.html | 62 -- longestCommonPrefix.cpp | 95 -- maxAreaOfIsland.cpp | 118 --- maxProductSubArr.cpp | 93 -- maxSumSubmatrix.cpp | 93 -- maxsumrectangle.cpp | 84 -- merge2SortedLL.cpp | 111 -- mergeTrees.cpp | 108 -- minCostClimbingStairs.cpp | 106 -- minRefuelStops.cpp | 89 -- minSubArrayLen.cpp | 90 -- minWindowSubstr.cpp | 123 --- mirrorReflection.cpp | 90 -- ninjaTraining.cpp | 134 --- numberOfWeakCharacters.cpp | 94 -- numsSameConsecDiff.cpp | 106 -- oddEvenList.cpp | 133 --- offers.html | 139 --- orangesRotting.cpp | 117 --- pacificAtlantic.cpp | 132 --- pascalTraingle.cpp | 74 -- permutation.cpp | 96 -- populateNextRight.cpp | 121 --- product.html | 1194 --------------------- pruneTree.cpp | 105 -- pseudoPalindromicPaths.cpp | 115 -- recoverpassword.html | 21 - removeNthFromEnd.cpp | 103 -- removeStones.cpp | 126 --- reorderedPowerOf2.cpp | 107 -- reverseBits.cpp | 84 -- romanToInt.cpp | 101 -- rpassword.html | 24 - search2DMatrix.cpp | 101 -- seller-login.html | 82 -- seller-signup.html | 93 -- shortestPathBinaryMatrix.cpp | 0 singleNumber.cpp | 78 -- sortList.cpp | 157 --- sortedArrayToBST.cpp | 105 -- spiralOrder.cpp | 117 --- stack_using_queue.cpp | 62 -- subArraySumK.cpp | 99 -- symmetricTree.cpp | 104 -- taskScheduler.cpp | 112 -- threeSum.cpp | 110 -- threeSumClosest.cpp | 107 -- topKFrequentElement.cpp | 99 -- topKFrequentWords.cpp | 109 -- tree2str.cpp | 69 -- triangle.cpp | 85 -- twoSum.cpp | 85 -- uniqueMorseRepresentations.cpp | 100 -- uniquePaths.cpp | 86 -- validAnagram.js | 26 - validUtf8.cpp | 99 -- verticalTraversal.cpp | 123 --- 178 files changed, 21658 deletions(-) delete mode 100644 .gitignore delete mode 100644 01Matrix.cpp delete mode 100644 AllAnagram.cpp delete mode 100644 BSTIterator.cpp delete mode 100644 BalancedBinaryTree.cpp delete mode 100644 BallFall.cpp delete mode 100644 BasicCalculator.cpp delete mode 100644 BestTimeBuySellStock.cpp delete mode 100644 BinarySearch.cpp delete mode 100644 BinaryTreeLevelOrderTraversal.cpp delete mode 100644 BinaryTreerightSideView.cpp delete mode 100644 BullsAndCow.cpp delete mode 100644 BusRoutes.cpp delete mode 100644 BuySellStock.cpp delete mode 100644 ClimbingStair.cpp delete mode 100644 Combinations.cpp delete mode 100644 ContainerWithMostWater.cpp delete mode 100644 CourseScheduleII.cpp delete mode 100644 CubeSumPair.cpp delete mode 100644 FirstBadVersion.cpp delete mode 100644 FirstLastPositionSortedArr.cpp delete mode 100644 FloodFill.cpp delete mode 100644 HappyNumber.cpp delete mode 100644 HouseRobber.cpp delete mode 100644 ImpQueueUsingStack.cpp delete mode 100644 InsertMergeInterval.cpp delete mode 100644 IntegertoRoman.cpp delete mode 100644 IsSubsequence.cpp delete mode 100644 IsomorphicStrings.cpp delete mode 100644 KInversePairsArray.cpp delete mode 100644 KadaneAlgo delete mode 100644 KadaneAlgo.cpp delete mode 100644 KadaneAlgo.cpp:tests delete mode 100644 Kids_With_the_Greatest_Number_of_Candies delete mode 100644 KthSmallLargeElem.cpp delete mode 100644 Kth_LargestElem.cpp delete mode 100644 LCAofBST.cpp delete mode 100644 LCAofBinaryTree.cpp delete mode 100644 Leetcode105.cpp delete mode 100644 Leetcode1074.cpp delete mode 100644 Leetcode30.cpp delete mode 100644 Leetcode315.cpp delete mode 100644 LinkedListCycleII.cpp delete mode 100644 LongestPalindrome.cpp delete mode 100644 LongestPalindrome2Words.cpp delete mode 100644 Matchsticks_Square.cpp delete mode 100644 MaxXorQueries.cpp delete mode 100644 MaximumPerformanceTeam.cpp delete mode 100644 MaximumUnitsTruck.cpp delete mode 100644 MergeTwoSortedLists.cpp delete mode 100644 MiddleofLinkedList.cpp delete mode 100644 MinStack.cpp delete mode 100644 MinimizeMalwareSpreadII.cpp delete mode 100644 MyCalendar.cpp delete mode 100644 N-aryTreePreorderTraversal.cpp delete mode 100644 NarrylevelOrder.cpp delete mode 100644 NoOfIslands.cpp delete mode 100644 NumberProvinces.cpp delete mode 100644 NumberofMatchingSubsequences.cpp delete mode 100644 PalindromeLinkedList.cpp delete mode 100644 PartitionEqualSubset.cpp delete mode 100644 PartitionList.cpp delete mode 100644 PathSumIII.cpp delete mode 100644 PivotElement.cpp delete mode 100644 PoorPig.cpp delete mode 100644 PopulatingNextRightPointer.cpp delete mode 100644 PrefixTree.js delete mode 100644 README.md delete mode 100644 RangeSumQuery.cpp delete mode 100644 ReduceArrSize2Half.cpp delete mode 100644 ReverseInteger.js delete mode 100644 ReverseLinkedList.cpp delete mode 100644 ReverseLinkedListII.cpp delete mode 100644 RotateImage.cpp delete mode 100644 Search2DMatrixII.cpp delete mode 100644 Seller.html delete mode 100644 SplitArrConsecuSubseq.cpp delete mode 100644 StringMultiply.cpp delete mode 100644 StringtoInteger.cpp delete mode 100644 ValidateBST.cpp delete mode 100644 WordLadder.cpp delete mode 100644 WordSubsets.cpp delete mode 100644 asteroidCollision.cpp delete mode 100644 averageOfLevelsBT.cpp delete mode 100644 backspaceCompare.cpp delete mode 100644 bagOfTokensScore.cpp delete mode 100644 characterReplacement.cpp delete mode 100644 checkInclusion.cpp delete mode 100644 coinChange.cpp delete mode 100644 coinchange2.cpp delete mode 100644 combinationSum.cpp delete mode 100644 combinationSum4.cpp delete mode 100644 countVowelPermutation.cpp delete mode 100644 decodeString.cpp delete mode 100644 deleteDuplicates.cpp delete mode 100644 diagonalSort.cpp delete mode 100644 diameterOfBinaryTree.cpp delete mode 100644 duplicateArray.cpp delete mode 100644 fib.cpp delete mode 100644 findAndReplacePattern.cpp delete mode 100755 findPeakElement delete mode 100644 findPeakElement.cpp delete mode 100644 firstUniqChar.cpp delete mode 100644 flattenBinaryTree2LL.cpp delete mode 100644 flipBit.cpp delete mode 100644 flipbits.cpp delete mode 100644 goodNodesBT.cpp delete mode 100644 hammingWeight.cpp delete mode 100644 inorderTraversal.cpp delete mode 100644 intern.cpp delete mode 100644 invertTree.cpp delete mode 100644 isPower2.cpp delete mode 100644 isSameTree.cpp delete mode 100644 isSubtree.cpp delete mode 100644 kids.html delete mode 100644 kthSmallest.cpp delete mode 100644 kthSmallestElementBST.cpp delete mode 100644 lastStoneWeight.cpp delete mode 100644 lengthOfLIS.cpp delete mode 100644 lengthOfLongestSubstring.cpp delete mode 100644 letterCasePermutation.cpp delete mode 100644 login1.html delete mode 100644 longestCommonPrefix.cpp delete mode 100644 maxAreaOfIsland.cpp delete mode 100644 maxProductSubArr.cpp delete mode 100644 maxSumSubmatrix.cpp delete mode 100644 maxsumrectangle.cpp delete mode 100644 merge2SortedLL.cpp delete mode 100644 mergeTrees.cpp delete mode 100644 minCostClimbingStairs.cpp delete mode 100644 minRefuelStops.cpp delete mode 100644 minSubArrayLen.cpp delete mode 100644 minWindowSubstr.cpp delete mode 100644 mirrorReflection.cpp delete mode 100644 ninjaTraining.cpp delete mode 100644 numberOfWeakCharacters.cpp delete mode 100644 numsSameConsecDiff.cpp delete mode 100644 oddEvenList.cpp delete mode 100644 offers.html delete mode 100644 orangesRotting.cpp delete mode 100644 pacificAtlantic.cpp delete mode 100644 pascalTraingle.cpp delete mode 100644 permutation.cpp delete mode 100644 populateNextRight.cpp delete mode 100644 product.html delete mode 100644 pruneTree.cpp delete mode 100644 pseudoPalindromicPaths.cpp delete mode 100644 recoverpassword.html delete mode 100644 removeNthFromEnd.cpp delete mode 100644 removeStones.cpp delete mode 100644 reorderedPowerOf2.cpp delete mode 100644 reverseBits.cpp delete mode 100644 romanToInt.cpp delete mode 100644 rpassword.html delete mode 100644 search2DMatrix.cpp delete mode 100644 seller-login.html delete mode 100644 seller-signup.html delete mode 100644 shortestPathBinaryMatrix.cpp delete mode 100644 singleNumber.cpp delete mode 100644 sortList.cpp delete mode 100644 sortedArrayToBST.cpp delete mode 100644 spiralOrder.cpp delete mode 100644 stack_using_queue.cpp delete mode 100644 subArraySumK.cpp delete mode 100644 symmetricTree.cpp delete mode 100644 taskScheduler.cpp delete mode 100644 threeSum.cpp delete mode 100644 threeSumClosest.cpp delete mode 100644 topKFrequentElement.cpp delete mode 100644 topKFrequentWords.cpp delete mode 100644 tree2str.cpp delete mode 100644 triangle.cpp delete mode 100644 twoSum.cpp delete mode 100644 uniqueMorseRepresentations.cpp delete mode 100644 uniquePaths.cpp delete mode 100644 validAnagram.js delete mode 100644 validUtf8.cpp delete mode 100644 verticalTraversal.cpp diff --git a/.gitignore b/.gitignore deleted file mode 100644 index 3af1e24..0000000 --- a/.gitignore +++ /dev/null @@ -1,1047 +0,0 @@ -##### Windows -# Windows thumbnail cache files -Thumbs.db -Thumbs.db:encryptable -ehthumbs.db -ehthumbs_vista.db - -# Dump file -*.stackdump - -# Folder config file -[Dd]esktop.ini - -# Recycle Bin used on file shares -$RECYCLE.BIN/ - -# Windows Installer files -*.cab -*.msi -*.msix -*.msm -*.msp - -# Windows shortcuts -*.lnk - -##### Linux -*~ - -# temporary files which can be created if a process still has a handle open of a deleted file -.fuse_hidden* - -# KDE directory preferences -.directory - -# Linux trash folder which might appear on any partition or disk -.Trash-* - -# .nfs files are created when an open file is removed but is still being accessed -.nfs* - -##### MacOS -# General -.DS_Store -.AppleDouble -.LSOverride - -# Thumbnails -._* - -# Files that might appear in the root of a volume -.DocumentRevisions-V100 -.fseventsd -.Spotlight-V100 -.TemporaryItems -.Trashes -.VolumeIcon.icns -.com.apple.timemachine.donotpresent - -# Directories potentially created on remote AFP share -.AppleDB -.AppleDesktop -Network Trash Folder -Temporary Items -.apdisk - -##### Android -# Built application files -*.apk -*.ap_ -*.aab - -# Files for the ART/Dalvik VM -*.dex - -# Java class files -*.class - -# Generated files -bin/ -gen/ -out/ -# Uncomment the following line in case you need and you don't have the release build type files in your app -# release/ - -# Gradle files -.gradle/ -build/ - -# Local configuration file (sdk path, etc) -local.properties - -# Proguard folder generated by Eclipse -proguard/ - -# Log Files -*.log - -# Android Studio Navigation editor temp files -.navigation/ - -# Android Studio captures folder -captures/ - -# IntelliJ -*.iml -.idea/workspace.xml -.idea/tasks.xml -.idea/gradle.xml -.idea/assetWizardSettings.xml -.idea/dictionaries -.idea/libraries -# Android Studio 3 in .gitignore file. -.idea/caches -.idea/modules.xml -# Comment next line if keeping position of elements in Navigation Editor is relevant for you -.idea/navEditor.xml - -# Keystore files -# Uncomment the following lines if you do not want to check your keystore files in. -#*.jks -#*.keystore - -# External native build folder generated in Android Studio 2.2 and later -.externalNativeBuild - -# Google Services (e.g. APIs or Firebase) -# google-services.json - -# Freeline -freeline.py -freeline/ -freeline_project_description.json - -# fastlane -fastlane/report.xml -fastlane/Preview.html -fastlane/screenshots -fastlane/test_output -fastlane/readme.md - -# Version control -vcs.xml - -# lint -lint/intermediates/ -lint/generated/ -lint/outputs/ -lint/tmp/ -# lint/reports/ - -##### Backup -*.bak -*.gho -*.ori -*.orig -*.tmp - -##### GPG -secring.* - -##### Dropbox -# Dropbox settings and caches -.dropbox -.dropbox.attr -.dropbox.cache - -##### SynopsysVCS -# Waveform formats -*.vcd -*.vpd -*.evcd -*.fsdb - -# Default name of the simulation executable. A different name can be -# specified with this switch (the associated daidir database name is -# also taken from here): -o / -simv - -# Generated for Verilog and VHDL top configs -simv.daidir/ -simv.db.dir/ - -# Infrastructure necessary to co-simulate SystemC models with -# Verilog/VHDL models. An alternate directory may be specified with this -# switch: -Mdir= -csrc/ - -# Log file - the following switch allows to specify the file that will be -# used to write all messages from simulation: -l -*.log - -# Coverage results (generated with urg) and database location. The -# following switch can also be used: urg -dir .vdb -simv.vdb/ -urgReport/ - -# DVE and UCLI related files. -DVEfiles/ -ucli.key - -# When the design is elaborated for DirectC, the following file is created -# with declarations for C/C++ functions. -vc_hdrs.h - -##### SVN -.svn/ - -##### Mercurial -.hg/ -.hgignore -.hgsigs -.hgsub -.hgsubstate -.hgtags - -##### Bazaar -.bzr/ -.bzrignore - -##### CVS -/CVS/* -**/CVS/* -.cvsignore -*/.cvsignore - -##### TortoiseGit -# Project-level settings -/.tgitconfig - -##### PuTTY -# Private key -*.ppk - -##### Vim -# Swap -[._]*.s[a-v][a-z] -!*.svg # comment out if you don't need vector files -[._]*.sw[a-p] -[._]s[a-rt-v][a-z] -[._]ss[a-gi-z] -[._]sw[a-p] - -# Session -Session.vim -Sessionx.vim - -# Temporary -.netrwhist -*~ -# Auto-generated tag files -tags -# Persistent undo -[._]*.un~ - -##### Emacs -# -*- mode: gitignore; -*- -*~ -\#*\# -/.emacs.desktop -/.emacs.desktop.lock -*.elc -auto-save-list -tramp -.\#* - -# Org-mode -.org-id-locations -*_archive - -# flymake-mode -*_flymake.* - -# eshell files -/eshell/history -/eshell/lastdir - -# elpa packages -/elpa/ - -# reftex files -*.rel - -# AUCTeX auto folder -/auto/ - -# cask packages -.cask/ -dist/ - -# Flycheck -flycheck_*.el - -# server auth directory -/server/ - -# projectiles files -.projectile - -# directory configuration -.dir-locals.el - -# network security -/network-security.data - -##### SublimeText -# Cache files for Sublime Text -*.tmlanguage.cache -*.tmPreferences.cache -*.stTheme.cache - -# Workspace files are user-specific -*.sublime-workspace - -# Project files should be checked into the repository, unless a significant -# proportion of contributors will probably not be using Sublime Text -# *.sublime-project - -# SFTP configuration file -sftp-config.json -sftp-config-alt*.json - -# Package control specific files -Package Control.last-run -Package Control.ca-list -Package Control.ca-bundle -Package Control.system-ca-bundle -Package Control.cache/ -Package Control.ca-certs/ -Package Control.merged-ca-bundle -Package Control.user-ca-bundle -oscrypto-ca-bundle.crt -bh_unicode_properties.cache - -# Sublime-github package stores a github token in this file -# https://packagecontrol.io/packages/sublime-github -GitHub.sublime-settings - -##### Notepad++ -# Notepad++ backups # -*.bak - -##### TextMate -*.tmproj -*.tmproject -tmtags - -##### VisualStudioCode -.vscode/* -!.vscode/settings.json -!.vscode/tasks.json -!.vscode/launch.json -!.vscode/extensions.json -*.code-workspace - -# Local History for Visual Studio Code -.history/ - -##### NetBeans -**/nbproject/private/ -**/nbproject/Makefile-*.mk -**/nbproject/Package-*.bash -build/ -nbbuild/ -dist/ -nbdist/ -.nb-gradle/ - -##### JetBrains -# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio, WebStorm and Rider -# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 - -# User-specific stuff -.idea/**/workspace.xml -.idea/**/tasks.xml -.idea/**/usage.statistics.xml -.idea/**/dictionaries -.idea/**/shelf - -# Generated files -.idea/**/contentModel.xml - -# Sensitive or high-churn files -.idea/**/dataSources/ -.idea/**/dataSources.ids -.idea/**/dataSources.local.xml -.idea/**/sqlDataSources.xml -.idea/**/dynamic.xml -.idea/**/uiDesigner.xml -.idea/**/dbnavigator.xml - -# Gradle -.idea/**/gradle.xml -.idea/**/libraries - -# Gradle and Maven with auto-import -# When using Gradle or Maven with auto-import, you should exclude module files, -# since they will be recreated, and may cause churn. Uncomment if using -# auto-import. -# .idea/artifacts -# .idea/compiler.xml -# .idea/jarRepositories.xml -# .idea/modules.xml -# .idea/*.iml -# .idea/modules -# *.iml -# *.ipr - -# CMake -cmake-build-*/ - -# Mongo Explorer plugin -.idea/**/mongoSettings.xml - -# File-based project format -*.iws - -# IntelliJ -out/ - -# mpeltonen/sbt-idea plugin -.idea_modules/ - -# JIRA plugin -atlassian-ide-plugin.xml - -# Cursive Clojure plugin -.idea/replstate.xml - -# Crashlytics plugin (for Android Studio and IntelliJ) -com_crashlytics_export_strings.xml -crashlytics.properties -crashlytics-build.properties -fabric.properties - -# Editor-based Rest Client -.idea/httpRequests - -# Android studio 3.1+ serialized cache file -.idea/caches/build_file_checksums.ser - -##### Eclipse -.metadata -bin/ -tmp/ -*.tmp -*.bak -*.swp -*~.nib -local.properties -.settings/ -.loadpath -.recommenders - -# External tool builders -.externalToolBuilders/ - -# Locally stored "Eclipse launch configurations" -*.launch - -# PyDev specific (Python IDE for Eclipse) -*.pydevproject - -# CDT-specific (C/C++ Development Tooling) -.cproject - -# CDT- autotools -.autotools - -# Java annotation processor (APT) -.factorypath - -# PDT-specific (PHP Development Tools) -.buildpath - -# sbteclipse plugin -.target - -# Tern plugin -.tern-project - -# TeXlipse plugin -.texlipse - -# STS (Spring Tool Suite) -.springBeans - -# Code Recommenders -.recommenders/ - -# Annotation Processing -.apt_generated/ -.apt_generated_test/ - -# Scala IDE specific (Scala & Java development for Eclipse) -.cache-main -.scala_dependencies -.worksheet - -# Uncomment this line if you wish to ignore the project description file. -# Typically, this file would be tracked if it contains build/dependency configurations: -#.project - -##### Qt -# C++ objects and libs -*.slo -*.lo -*.o -*.a -*.la -*.lai -*.so -*.so.* -*.dll -*.dylib - -# Qt-es -object_script.*.Release -object_script.*.Debug -*_plugin_import.cpp -/.qmake.cache -/.qmake.stash -*.pro.user -*.pro.user.* -*.qbs.user -*.qbs.user.* -*.moc -moc_*.cpp -moc_*.h -qrc_*.cpp -ui_*.h -*.qmlc -*.jsc -Makefile* -*build-* -*.qm -*.prl - -# Qt unit tests -target_wrapper.* - -# QtCreator -*.autosave - -# QtCreator Qml -*.qmlproject.user -*.qmlproject.user.* - -# QtCreator CMake -CMakeLists.txt.user* - -# QtCreator 4.8< compilation database -compile_commands.json - -# QtCreator local machine specific files for imported projects -*creator.user* - -##### VisualStudio -##### VisualStudio -## Ignore Visual Studio temporary files, build results, and -## files generated by popular Visual Studio add-ons. -## -## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore - -# User-specific files -*.rsuser -*.suo -*.user -*.userosscache -*.sln.docstates - -# User-specific files (MonoDevelop/Xamarin Studio) -*.userprefs - -# Mono auto generated files -mono_crash.* - -# Build results -[Dd]ebug/ -[Dd]ebugPublic/ -[Rr]elease/ -[Rr]eleases/ -x64/ -x86/ -[Ww][Ii][Nn]32/ -[Aa][Rr][Mm]/ -[Aa][Rr][Mm]64/ -bld/ -[Bb]in/ -[Oo]bj/ -[Ll]og/ -[Ll]ogs/ - -# Visual Studio 2015/2017 cache/options directory -.vs/ -# Uncomment if you have tasks that create the project's static files in wwwroot -#wwwroot/ - -# Visual Studio 2017 auto generated files -Generated\ Files/ - -# MSTest test Results -[Tt]est[Rr]esult*/ -[Bb]uild[Ll]og.* - -# NUnit -*.VisualState.xml -TestResult.xml -nunit-*.xml - -# Build Results of an ATL Project -[Dd]ebugPS/ -[Rr]eleasePS/ -dlldata.c - -# Benchmark Results -BenchmarkDotNet.Artifacts/ - -# .NET Core -project.lock.json -project.fragment.lock.json -artifacts/ - -# ASP.NET Scaffolding -ScaffoldingReadMe.txt - -# StyleCop -StyleCopReport.xml - -# Files built by Visual Studio -*_i.c -*_p.c -*_h.h -*.ilk -*.meta -*.obj -*.iobj -*.pch -*.pdb -*.ipdb -*.pgc -*.pgd -*.rsp -*.sbr -*.tlb -*.tli -*.tlh -*.tmp -*.tmp_proj -*_wpftmp.csproj -*.log -*.vspscc -*.vssscc -.builds -*.pidb -*.svclog -*.scc - -# Chutzpah Test files -_Chutzpah* - -# Visual C++ cache files -ipch/ -*.aps -*.ncb -*.opendb -*.opensdf -*.sdf -*.cachefile -*.VC.db -*.VC.VC.opendb - -# Visual Studio profiler -*.psess -*.vsp -*.vspx -*.sap - -# Visual Studio Trace Files -*.e2e - -# TFS 2012 Local Workspace -$tf/ - -# Guidance Automation Toolkit -*.gpState - -# ReSharper is a .NET coding add-in -_ReSharper*/ -*.[Rr]e[Ss]harper -*.DotSettings.user - -# TeamCity is a build add-in -_TeamCity* - -# DotCover is a Code Coverage Tool -*.dotCover - -# AxoCover is a Code Coverage Tool -.axoCover/* -!.axoCover/settings.json - -# Coverlet is a free, cross platform Code Coverage Tool -coverage*[.json, .xml, .info] - -# Visual Studio code coverage results -*.coverage -*.coveragexml - -# NCrunch -_NCrunch_* -.*crunch*.local.xml -nCrunchTemp_* - -# MightyMoose -*.mm.* -AutoTest.Net/ - -# Web workbench (sass) -.sass-cache/ - -# Installshield output folder -[Ee]xpress/ - -# DocProject is a documentation generator add-in -DocProject/buildhelp/ -DocProject/Help/*.HxT -DocProject/Help/*.HxC -DocProject/Help/*.hhc -DocProject/Help/*.hhk -DocProject/Help/*.hhp -DocProject/Help/Html2 -DocProject/Help/html - -# Click-Once directory -publish/ - -# Publish Web Output -*.[Pp]ublish.xml -*.azurePubxml -# Note: Comment the next line if you want to checkin your web deploy settings, -# but database connection strings (with potential passwords) will be unencrypted -*.pubxml -*.publishproj - -# Microsoft Azure Web App publish settings. Comment the next line if you want to -# checkin your Azure Web App publish settings, but sensitive information contained -# in these scripts will be unencrypted -PublishScripts/ - -# NuGet Packages -*.nupkg -# NuGet Symbol Packages -*.snupkg -# The packages folder can be ignored because of Package Restore -**/[Pp]ackages/* -# except build/, which is used as an MSBuild target. -!**/[Pp]ackages/build/ -# Uncomment if necessary however generally it will be regenerated when needed -#!**/[Pp]ackages/repositories.config -# NuGet v3's project.json files produces more ignorable files -*.nuget.props -*.nuget.targets - -# Microsoft Azure Build Output -csx/ -*.build.csdef - -# Microsoft Azure Emulator -ecf/ -rcf/ - -# Windows Store app package directories and files -AppPackages/ -BundleArtifacts/ -Package.StoreAssociation.xml -_pkginfo.txt -*.appx -*.appxbundle -*.appxupload - -# Visual Studio cache files -# files ending in .cache can be ignored -*.[Cc]ache -# but keep track of directories ending in .cache -!?*.[Cc]ache/ - -# Others -ClientBin/ -~$* -*~ -*.dbmdl -*.dbproj.schemaview -*.jfm -*.pfx -*.publishsettings -orleans.codegen.cs - -# Including strong name files can present a security risk -# (https://github.com/github/gitignore/pull/2483#issue-259490424) -#*.snk - -# Since there are multiple workflows, uncomment next line to ignore bower_components -# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) -#bower_components/ - -# RIA/Silverlight projects -Generated_Code/ - -# Backup & report files from converting an old project file -# to a newer Visual Studio version. Backup files are not needed, -# because we have git ;-) -_UpgradeReport_Files/ -Backup*/ -UpgradeLog*.XML -UpgradeLog*.htm -ServiceFabricBackup/ -*.rptproj.bak - -# SQL Server files -*.mdf -*.ldf -*.ndf - -# Business Intelligence projects -*.rdl.data -*.bim.layout -*.bim_*.settings -*.rptproj.rsuser -*- [Bb]ackup.rdl -*- [Bb]ackup ([0-9]).rdl -*- [Bb]ackup ([0-9][0-9]).rdl - -# Microsoft Fakes -FakesAssemblies/ - -# GhostDoc plugin setting file -*.GhostDoc.xml - -# Node.js Tools for Visual Studio -.ntvs_analysis.dat -node_modules/ - -# Visual Studio 6 build log -*.plg - -# Visual Studio 6 workspace options file -*.opt - -# Visual Studio 6 auto-generated workspace file (contains which files were open etc.) -*.vbw - -# Visual Studio LightSwitch build output -**/*.HTMLClient/GeneratedArtifacts -**/*.DesktopClient/GeneratedArtifacts -**/*.DesktopClient/ModelManifest.xml -**/*.Server/GeneratedArtifacts -**/*.Server/ModelManifest.xml -_Pvt_Extensions - -# Paket dependency manager -.paket/paket.exe -paket-files/ - -# FAKE - F# Make -.fake/ - -# CodeRush personal settings -.cr/personal - -# Python Tools for Visual Studio (PTVS) -__pycache__/ -*.pyc - -# Cake - Uncomment if you are using it -# tools/** -# !tools/packages.config - -# Tabs Studio -*.tss - -# Telerik's JustMock configuration file -*.jmconfig - -# BizTalk build output -*.btp.cs -*.btm.cs -*.odx.cs -*.xsd.cs - -# OpenCover UI analysis results -OpenCover/ - -# Azure Stream Analytics local run output -ASALocalRun/ - -# MSBuild Binary and Structured Log -*.binlog - -# NVidia Nsight GPU debugger configuration file -*.nvuser - -# MFractors (Xamarin productivity tool) working folder -.mfractor/ - -# Local History for Visual Studio -.localhistory/ - -# BeatPulse healthcheck temp database -healthchecksdb - -# Backup folder for Package Reference Convert tool in Visual Studio 2017 -MigrationBackup/ - -# Ionide (cross platform F# VS Code tools) working folder -.ionide/ - -# Fody - auto-generated XML schema -FodyWeavers.xsd - -##### Gradle -.gradle -**/build/ -!src/**/build/ - -# Ignore Gradle GUI config -gradle-app.setting - -# Avoid ignoring Gradle wrapper jar file (.jar files are usually ignored) -!gradle-wrapper.jar - -# Cache of project -.gradletasknamecache - -# # Work around https://youtrack.jetbrains.com/issue/IDEA-116898 -# gradle/wrapper/gradle-wrapper.properties - -##### CMake -CMakeLists.txt.user -CMakeCache.txt -CMakeFiles -CMakeScripts -Testing -Makefile -cmake_install.cmake -install_manifest.txt -compile_commands.json -CTestTestfile.cmake -_deps - -##### C++ -# Prerequisites -*.d - -# Compiled Object files -*.slo -*.lo -*.o -*.obj - -# Precompiled Headers -*.gch -*.pch - -# Compiled Dynamic libraries -*.so -*.dylib -*.dll - -# Fortran module files -*.mod -*.smod - -# Compiled Static libraries -*.lai -*.la -*.a -*.lib - -# Executables -*.exe -*.out -*.app - -# C/C++ binary extension file -*.bin - -##### C -# Prerequisites -*.d - -# Object files -*.o -*.ko -*.obj -*.elf - -# Linker output -*.ilk -*.map -*.exp - -# Precompiled Headers -*.gch -*.pch - -# Libraries -*.lib -*.a -*.la -*.lo - -# Shared objects (inc. Windows DLLs) -*.dll -*.so -*.so.* -*.dylib - -# Executables -*.exe -*.out -*.app -*.i*86 -*.x86_64 -*.hex - -# Debug files -*.dSYM/ -*.su -*.idb -*.pdb - -# Kernel Module Compile Results -*.mod* -*.cmd -.tmp_versions/ -modules.order -Module.symvers -Mkfile.old -dkms.conf - -# Raspberry Pi Pico Object file -*.uf2 -# Raspberry Pi Pico disassembler file -*.dis - -*:tests \ No newline at end of file diff --git a/01Matrix.cpp b/01Matrix.cpp deleted file mode 100644 index e289c7a..0000000 --- a/01Matrix.cpp +++ /dev/null @@ -1,125 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector> updateMatrix(vector>& mat) { - queue> q; - - vector> ans(mat.size(), vector(mat[0].size(), -1)); - - for(int i = 0; i < mat.size(); i++) { - for(int j = 0; j < mat[0].size(); j++) { - if(mat[i][j] == 0) { - q.push({i, j}); - ans[i][j] = 0; - } - } - } - - int m = mat.size(); - int n = mat[0].size(); - - while(not q.empty()) { - int i = q.front().first; - int j = q.front().second; - - if(checkvalid(i+1, j, m, n) and ans[i+1][j] == -1) { - q.push({i+1, j}); - ans[i+1][j] = ans[i][j]+1; - } - - if(checkvalid(i-1, j, m, n) and ans[i-1][j] == -1) { - q.push({i-1, j}); - ans[i-1][j] = ans[i][j]+1; - } - - if(checkvalid(i, j+1, m, n) and ans[i][j+1] == -1) { - q.push({i, j+1}); - ans[i][j+1] = ans[i][j]+1; - } - - if(checkvalid(i, j-1, m, n) and ans[i][j-1] == -1) { - q.push({i, j-1}); - ans[i][j-1] = ans[i][j]+1; - } - - q.pop(); - } - - return ans; - - } - - bool checkvalid(int i, int j, int m, int n) { - if(i < 0 or j < 0 or i >= m or j >= n) return false; - - return true; - } - -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector findAnagrams(string s, string p) { - int len_s = s.size(); - int len_p = p.size(); - - if(len_s < len_p) return {}; - - vector p_freq(26, 0); - vector window(26, 0); - - for(int i = 0; i < len_p; i++) { - p_freq[p[i]- 'a']++; - window[s[i]- 'a']++; - } - - vector ans; - - if(p_freq == window) ans.push_back(0); - - for(int i = len_p; i < len_s; i++) { - window[s[i-len_p] - 'a']--; // Ascii of s[i-len_p] - ascii of 'a' --index - window[s[i] - 'a']++; - if(p_freq == window) ans.push_back(i-len_p+1); - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -/** - * 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) {} - * }; - */ -class BSTIterator { -public: - - vector v; - int i = 0; - - void inorder(TreeNode* root) { - if(not root) return; - - inorder(root -> left) - v.push_back(root -> val); - inorder(root -> right); - } - - BSTIterator(TreeNode* root) { - inorder(root); - } - - int next() { - return v[i++]; - } - - bool hasNext() { - return inext(); - * bool param_2 = obj->hasNext(); - */ - - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -// 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) {} -}; - -class Solution { -public: - - int heightBT(TreeNode* root) { - if(root == nullptr) return 0; - - return max(heightBT(root -> left), heightBT(root -> right)) + 1; - } - - void inOrderUtil(TreeNode* root, bool &ans) { - if(root != nullptr) { - inOrderUtil(root -> left, ans); - - int d1 = heightBT(root -> left); - int d2 = heightBT(root -> right); - int diff = abs(d1 - d2); - - if(diff > 1) - ans = ans && false; - - - inOrderUtil(root -> right, ans); - } - } - - bool isBalanced(TreeNode* root) { - bool ans = true; - inOrderUtil(root, ans); - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - vector findBall(vector>& grid) { - // Approach 1 :-> Brute Force - int n = grid.size(); - int m = grid[0].size(); - - vector ans(m); - - for(int j = 0; j < m; j++) { - int cpos = j; - int npos = -1; - for(int i = 0; i < n; i++) { - npos = cpos + grid[i][cpos]; - - if(npos < 0 or npos >= m or grid[i][cpos] != grid[i][npos]){ - cpos = -1; - break; - } - cpos = npos; - } - ans[j] = cpos; - - } - - return ans; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int m, n; - - cin >> m >> n; - - vector> grid(m, vector(n, 0)); - - for(int i = 0; i < m; i++) { - for(int j = 0; j < n; j++) { - cin >> grid[i][j]; - } - } - - Solution ans; - - - vector res = ans.findBall(grid); - - for(auto ball : res) { - cout << ball << " "; - } - - cout << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int calculate(string s) { - int len = s.length(); - if(len == 0) return 0; - int curNum = 0, lastNum = 0, result = 0; - char sign = '+'; - for(int i = 0; i < len; i++) { - char curChar = s[i]; - if(isdigit(curChar)) { - curNum = (curNum*10) + (curChar - '0'); - } - if(not isdigit(curChar) and not iswspace(curChar) or i == len - 1) { - if(sign == '+' or sign == '-') { - result += lastNum; - lastNum = (sign == '+') ? curNum : -curNum; - } - else if(sign == '*'){ - lastNum = lastNum * curNum; - } - else if(sign == '/') { - lastNum = lastNum / curNum; - } - - sign = curChar; - curNum = 0; - } - } - - result += lastNum; - cerr << result << endl; - return result; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int findMaxProfit(int i, int canBuy, int k, vector& prices, vector>>& dp) { - if(k == 0) return 0; - if(i == prices.size()) return 0; - - int maxProfit = 0; - - if(dp[i][canBuy][k] != -1) return dp[i][canBuy][k]; - - if(canBuy) { - int buy = -prices[i] + findMaxProfit(i+1, 0, k, prices, dp); - int notBuy = 0 + findMaxProfit(i+1, 1, k, prices, dp); - maxProfit = max(buy, notBuy); - } - else { - int sell = prices[i] + findMaxProfit(i+1, 1, k-1, prices, dp); - int notSell = 0 + findMaxProfit(i+1, 0, k, prices, dp); - maxProfit = max(sell, notSell); - } - - return maxProfit; - } - - int maxProfit(int k, vector& prices) { - vector>> dp(n+1, vector>(2, vector(k+1, -1))); - return findMaxProfit(0, 1, k, prices, dp); - } -}; - - - -class Solution { -public: - int maxProfit(int k, vector& prices) { - int n = prices.size(); - int tt = k; - - vector>> dp(n+1, vector>(2, vector(k+1, 0))); - - for(int i = n-1; i >= 0; i--) { - for(int canBuy = 0; canBuy <= 1; canBuy++) { - for(int k = 1; k <= tt; k++) { - int maxProfit = 0; - if(canBuy) { - int buy = -prices[i] + dp[i+1][0][k]; - int notBuy = 0 + dp[i+1][1][k]; - maxProfit = max(buy, notBuy); - } - else { - int sell = prices[i] + dp[i+1][1][k-1]; - int notSell = 0 + dp[i+1][0][k]; - maxProfit = max(sell, notSell); - } - dp[i][canBuy][k] = maxProfit; - } - } - } - - return dp[0][1][tt]; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -class Solution { -public: - int search(vector& nums, int target) { - int low = 0; int n = nums.size(); - int high = n - 1; - - - while(low <= high){ - int mid = (low + high) / 2; - if(target == nums[mid]) - return mid; - else if(target < nums[mid]) - high = mid - 1; - else - low = mid + 1; - } - - return -1; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - int target; - - cin >> target; - - vector nums(n); - - for(auto i = 0; i < n; i++){ - cin >> nums[i]; - } - - - Solution ans; - - cout << ans.search(nums, target) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - vector> levelOrder(TreeNode* root) { - vector> v; - queueq; - q.push(root); - if(root == NULL) - return v; - - while(not q.empty()){ - int x = q.size(); - vector v1; - while(x--){ - TreeNode* front = q.front(); - q.pop(); - if(front->left != NULL) - q.push(front->left); - if(front->right != NULL) - q.push(front->right); - - v1.push_back(front->val); - } - v.push_back(v1); - } - return v; - } -}; - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - // 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) {} - }; - -class Solution { -public: - vector rightSideView(TreeNode* root) { - - vector ans; - - queue que; - - que.push(root); - - if(root == nullptr) return ans; - - while(true) { - int size = que.size(); - - if(size == 0) return ans; - - int data = 0; - - while(size > 0) { - - TreeNode* temp = que.front(); - que.pop(); - - data = temp -> val; - - if(temp -> left != nullptr) que.push(temp -> left); - if(temp -> right != nullptr) que.push(temp -> right); - size--; - } - - ans.push_back(data); - } - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - string getHint(string secret, string guess) { - int secretFre[10] = {0}; - int guessFre[10] = {0}; - - int bull = 0; - int cow = 0; - // BULL - for(int i = 0; i < secret.size(); i++) { - if(secret[i] == guess[i]) - bull++; - else { - secretFre[secret[i] - '0']++; - guessFre[guess[i] - '0']++; - } - } - - for(int i = 0; i < 10; i++) { - cow += min(secretFre[i], guessFre[i]); - } - - return to_string(bull) + "A" + to_string(cow) + "B"; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - int numBusesToDestination(vector>& routes, int source, int target) { - unordered_map> stop_routes; - - for(int i = 0; i < routes.size(); i++) { - for(int j : routes[i]) - stop_routes[j].insert(i); - } - - queue> to_visit; - - to_visit.push({source, 0}); - - unordered_set stops_visited = {source}; - - while(not to_visit.empty()) { - int stop = to_visit.front().first; - int bus_n = to_visit.front().second; - - if(stop == target) { - return bus_n; - } - - to_visit.pop(); - - for(const auto& route : stop_routes[stop]) { - for(const auto& next_stop : routes[route]) { - auto it = stops_visited.insert(next_stop); - if(it.second) - to_visit.push({next_stop, bus_n+1}); - } - - routes[route].clear (); - } - } - - return -1; - } -}; - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int maxProfit(vector& prices) { - int maxProfit = 0; - int minPrice = INT_MAX; - - for(int i = 0; i < prices.size(); i++){ - minPrice = min(minPrice, prices[i]); - maxProfit = max(maxProfit, prices[i] - minPrice); - } - - return maxProfit; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - cin >> n; - vector prices(n); - - for(auto i = 0; i < n; i++){ - cin >> prices[i]; - } - - Solution ans; - - cout << ans.maxProfit(prices) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -class Solution { -public: - int climbStairs(int n) { - int t[2] = {1, 1}; - - for(n -= 2; n > 0; n -= 2) { - t[0] += t[1]; - t[1] += t[0]; - } - if(n < 0) return t[1]; - - return t[0]+t[1]; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - Solution result; - - cout << result.climbStairs(n) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - void add(int i, int n, int k, vector& v, vector>& res, int count) { - for(int j = i; j <= n; j++) { - v[count - 1] = j; - - if(count == k) - res.push_back(v); - else - add(j+1, n, k, v, res, count+1); - } - } - - vector> combine(int n, int k) { - vector v; - - vector> res; - - for(int i = 0; i < k; i++) { - v.push_back(0); - } - - add(1, n, k, v, res, 1); - - return res; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int maxArea(vector& height) { - int left = 0; - int right = height.size()-1; - - int ans = 0; - - while(left <= right) { - ans = max(min(height[left], height[right])*(right-left), ans); - if(height[left] <= height[right]) - left++; - else - right--; - } - - return ans; - } -}; - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - -class Solution { -public: - - bool dfs(vector>& graph, vector& colors, vector& res, int i) { - colors[i] = 1; - - for(auto neighbor : graph[i]) { - if(colors[neighbor] == 1) return true; - if(colors[neighbor] == 0) { - if(dfs(graph, colors, res, neighbor)) return true; - } - } - - colors[i] = 2; - res.push_back(i); - - return false; - } - - - vector findOrder(int numCourses, vector>& prerequisites) { - vector colors(numCourses, 0), res; - vector> graph(numCourses); - - // Build Graph - - for(auto pre : prerequisites) { - graph[pre[0]].push_back(pre[1]); - } - - for(int i = 0; i < numCourses; i++) { - if(not colors[i]) { - if(dfs(graph, colors, res, i)) return {}; - } - } - - return res; - } -}; - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -bool isPerfectCube(int N) { - for(int i = 1; i*i*i <= N; i++) { - if(i*i*i == N) return true; - } - return false; -} - - -int countCubeSumPairs(int n) { - // Write your code here. - - int cnt = 0; - if(isPerfectCube(n)) { - cnt++; - } - - for(int A = 1; A*A*A <= n; A++) { - int toCheck = n-(A*A*A); - if(isPerfectCube(toCheck)) { - cnt++; - } - } - - return cnt; - -} - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - - cin >> n; - - cout << countCubeSumPairs(n) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -// The API isBadVersion is defined for you. -// bool isBadVersion(int version); - -class Solution { -public: - - int firstBadVersion(int n) { - int low = 0, int high = n; - int ans = 0; - - while(low <= high) { - int mid = low + (high - low)/2; - if(isBadVersion(mid)){ - high = mid - 1; - ans = mid; - } - else{ - low = mid + 1; - } - } - - return ans; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n, m; - - cin >> n >> m; - - Solution ans; - - cout << ans.firstBadVersion(n) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - vector searchRange(vector& nums, int target) { - int low = 0; - int high = nums.size()-1; - - vector ans(2, -1); - - while (low <= high) { - int mid = low + (high - low) / 2; - - if(nums[mid] == target) { - ans[0] = mid; - high = mid - 1; - } - else if(nums[mid] < target) { - low = mid + 1; - } - else - high = mid - 1; - } - - low = 0; - high = nums.size()-1; - - while(low <= high) { - int mid = low + (high - low) / 2; - if(nums[mid] == target) { - ans[1] = mid; - low = mid + 1; - } - else if(nums[mid] < target){ - low = mid + 1; - } - else - high = mid - 1; - } - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - cin >> n; - int target; - cin >> target; - - vector nums(n); - - for(int i = 0; i < nums.size(); i++) { - cin >> nums[i]; - } - - Solution ans; - - // vector result; - - cout << ans.searchRange(nums, target) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - bool isValid(vector> &image, int i, int j, int n, int m, int color) { - if(i >= 0 and i < n and j >= 0 and j < m and image[i][j] == color) - return true; - - return false; - } - - void floodFillRec(vector> &image, int sr, int sc, int n, int m, int color, int newColor) { - image[sr][sc] = newColor; - - if(isValid(image, sr+1, sc, n, m, color)) - floodFillRec(image, sr+1, sc, n, m, color, newColor); - if(isValid(image, sr-1, sc, n, m, color)) - floodFillRec(image, sr-1, sc, n, m, color, newColor); - if(isValid(image, sr, sc+1, n, m, color)) - floodFillRec(image, sr, sc+1, n, m, color, newColor); - if(isValid(image, sr, sc-1, n, m, color)) - floodFillRec(image, sr, sc-1, n, m, color, newColor); - } - - vector> floodFill(vector>& image, int sr, int sc, int newColor) { - int n = image.size(); - int m = image[0].size(); - - int color = image[sr][sc]; - - if(color == newColor) return image; - - floodFillRec(image, sr, sc, n, m, color, newColor); - - return image; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - bool isHappy(int n) { - if(n < 7 and n != 1) return false; - if(n == 1) return true; - - int ans = 0; - - while(n != 0) { - ans += pow(n%10, 2); - n /= 10; - } - - return isHappy(ans); - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - Solution s; - - cout << s.isHappy(n) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int rob(vector& nums) { - int n = nums.size(); - - - int prev = nums[0]; - int prev2 = 0; - - for(int i = 0; i < n; i++) { - int take = nums[i]; - if(i > 1) take += prev2; - - int notTake = 0 + prev; - - int curi = max(take, notTake); - prev2 = prev; - prev = curi; - } - - return prev; - } -}; - - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class MyQueue { -public: - - stackinput, output; - - MyQueue() { - - } - - void push(int x) { - input.push(x); - } - - int pop() { - int val = peek(); - output.pop(); - return val; - } - - int peek() { - if(output.empty()) { - while(input.empty() == false) { - output.push(input.top()); - input.pop(); - } - } - - return output.top(); - } - - bool empty() { - return input.empty() and output.empty(); - } -}; - -/** - * Your MyQueue object will be instantiated and called as such: - * MyQueue* obj = new MyQueue(); - * obj->push(x); - * int param_2 = obj->pop(); - * int param_3 = obj->peek(); - * bool param_4 = obj->empty(); - */ - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector> insert(vector>& intervals, vector& newInterval) { - int flag = 1; - - for(int i = 0; i < intervals.size(); i++) { - if(newInterval[0] < intervals[i][0]) { - flag = 0; - intervals.insert(intervals.begin()+i, newInterval); - break; - } - } - - if(flag) { - intervals.insert(intervals.end(), newInterval); - } - - vector> ans; - - int start = intervals[0][0]; - int end = intervals[0][1]; - - for(int i = 1; i < intervals.size(); i++) { - if(intervals[i][0] <= end) { - end = max(end, intervals[i][1]); - } - - else { - ans.push_back({start, end}); - start = intervals[i][0]; - end = intervals[i][1]; - } - } - - ans.push_back({start, end}); - - return ans; - - } -}; - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - string intToRoman(int num) { - string roman = ""; - - while(num >= 1000){ - roman = roman + "M"; - num -= 1000; - } - - if(num >= 900){ - roman = roman + "CM"; - num -= 900; - } - - while(num >= 500){ - roman = roman + "D"; - num -= 500; - } - - if(num >= 400){ - roman = roman + "CD"; - num -= 400; - } - - while(num >= 100){ - roman = roman + "C"; - num -= 100; - } - - if(num >= 90){ - roman = roman + "XC"; - num -= 90; - } - - while(num >= 50){ - roman = roman + "L"; - num -= 50; - } - - if(num >= 40){ - roman = roman + "XL"; - num -= 40; - } - - while(num >= 10){ - roman = roman + "X"; - num -= 10; - } - - if(num == 9){ - roman = roman + "IX"; - num -= 9; - } - - while(num >= 5){ - roman = roman + "V"; - num -= 5; - } - - if(num == 4){ - roman = roman + "IV"; - num -= 4; - } - - while(num >= 1){ - roman = roman + "I"; - num -= 1; - } - return roman; - } - -}; - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int num; - cin >> num; - - Solution s; - - string str = s.intToRoman(num); - - cout << str << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - // bool isSubsequence(string s, string t) { - // if(s == "") return true; - // if(t == "") return false; - - // if(s.size() == 1 and t.size() == 1) return s[0] == t[0]; - - // int a = 0; - - // for(int i = 0; i < t.size(); i++){ - // if(s[a] == t[i]) - // a += 1; - // } - - - // if(a == s.size()) return true; - - // else - // return false; - // } - - - bool isSubsequence(string s, string t) { - unordered_map> hg; - - for(int i = 0; i < t.length(); i++) { - hg[t[i]].push_back(i); - } - - int prev = -1; - - for(auto c : s) { - auto it = hg.find(c); - if(it == hg.end()) - return false; - auto vec = it->second; - int pos = upper_bound(vec.begin(), vec.end(), prev) - vec.begin(); - if(pos == vec.size()) return false; - - prev = vec[pos]; - } - - return true; - } - - -}; - - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - string s, t; - - getline(cin, s); - getline(cin, t); - - // cin >> s >> t; - - Solution ans; - - bool result = ans.isSubsequence(s, t); - - cout << result << end; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - // bool isIsomorphic(string s, string t) { - // int seen[128] = {}; - // for(int i = 0; i < s.size(); i++){ - // char c = s[i]; - // if(not seen[c]){ - // for(char k : seen){ - // if(k == t[i]) - // return false; - // } - // seen[c] = t[i]; - // } - // else if(seen[c] != t[i]) - // return false; - // } - // return true; - // } - - - bool isIsomorphic(string s, string t) { - char map_s[128] = {0}; - char map_t[128] = {0}; - - for(int i = 0; i < s.size(); i++) { - if(map_s[s[i]] != map_t[t[i]]) return false; - map_s[s[i]] = i+1; - map_t[t[i]] = i+1; - } - - return true; - } - - -}; - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - string s, t; - - getline(cin, s); - getline(cin, t); - - Solution ans; - - bool result = ans.isIsomorphic(s, t); - - if(result) - cout << "true" << endl; - else - cout << "false" << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -//Top Down Method - -// class Solution { -// public: - -// int dp[1001][1001] = {}; - -// int kInversePairs(int n, int k) { -// if(k <= 0) return k == 0; -// if(dp[n][k] == 0){ -// dp[n][k] = 1; -// for(auto i = 0; i < n; i++){ -// dp[n][k] = (dp[n][k] + kInversePairs(n-1, k-i))%mod; -// } -// } - -// return dp[n][k] - 1; -// } -// }; - - -// Bottom Up Method - - -class Solution { -public: - - int dp[1001][1001] = {}; - - int kInversePairs(int n, int k) { - int dp[1001][1001] = {1}; - for(int N = 1; N <= n; N++){ - for(int K = 0; K <= k; K++){ - for(int i = 0; i <= min(,K N-1); i++){ - dp[N][k] = (dp[N][K] + dp[N-1][K-i])%mod; - } - } - } - - return dp[n][k]; - } - -}; - - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "<V$svT%Rg+gGa$F{%V@4w~h5w+Q{;fQXUlAUNl30Nq()YS9*zMN2L#1 zuqLU@ZwvHfRk6slL^ktQ>1UpHc!KLwQfhAsYon3Qx|+4o(3)r@mg-;AUthPTuEvv$ zd#VJV{GvRlPhGXSgPLQ6Fs???77IB|{H@nK^^-q+{hl4KeEWwlf2Z?~dsA;8zDwGm zJV}NE>B}aT>31MPGFJKTF1kots1ZitZ}2-7{#kG06LX4|_s-q8X#d=ef|2LX0T^14 zgZCP+TzD!EPTuB{e>#u-a31_b9(++A{74@B#ytMC6`G&RX^_m?#53IcLK;I|043eSQSQk4}SBtCEAS*7IQJ=D2(Gr_`n8{)G8Ri2b6H1 zFB{j;&y!{-xM~&k?K;gcx_jd>BWVT_reSDCQ+taM3Mazdk)#<;w6|=G#$)03KxZ^; z@p5zCzqu`vNcy)%G($%FMKm5w`a^b%ur{+g7>NnUtdGQ#MrR-yu4#%z%to(&hY*M+ zn}Tho*Bk5!Bn&eVh?oHU{;j~OAsq=C@uZmu2YQ>@jrK~z-&SW3%V-OmeTi@|l8nSD zgEq4!7)~UVth}|!U9q6CGh+6j)S*b+-zhUKEYDy&a;!C4uMR4fMIkm?h1lF?uCrW4 z5p$NN+Khz#t!;63G@derIjXSMO(?2eH*F{(wOUX%7}_d$lM(E>$><71qFOK-58i}! z4E6_%fEn(Oz>r9EMPh+y)$kT8Nv{F|Dd&6W3H ziYn6H$$U9~%6V&qFBTuqj}jlG0TDr0@Bx-D^$E5;|H<^RD=nPHSUI*5a>9Y50CpI4 z;AJ+dX=4t&+<~8R;JmaF+(`%Sy#9SYOPS^uE|LJ`^-eg=FEYsMo$y5x1npt_a}ejD zKydpUI9IX2`yIHP%ZM@Hz~!7w_?-@%@|Izr19#5b`yDv>B*Q@mF58lL_d9TO7&{zt z;OE+?rX64Ptq>O&>Zuf?=^ z`-oYTIi?T(r1Viy1)16^z!RC})ga|dHInZk&cyg{GMUUik*0}dV*I$BrU_+Y{D_^V ziDY8@pY1eFAQR(Xu+ubgOpM=cr)k2N7{A3%(?l^b{vkU}6U4-Lz)sV|FfqQxPSb=i zG2UROX(E^y_u6Ti04BySl4+FgF%OllQ4{4uxRL zq)U|aTezKd`um2Ge#M#gzS5LFeuJKVK_5JMs;4{-i&?6HJP9K<{DlZp;szA5#qerBQcdrURg7D`PgnAl(y3=c`p~T9D@Zr(pY)FCNBv{M(oz2@qDTEFi46Il860!1^Pk-P;UWJ? zeZM}u@OHxWA^!>8b!xVE9a4duHrz59Tk zPVIA+?*z)19&JkhWb8*&%kPCM>>om|_v`7$QF&KTUF{@z2oOpP_F+B!h(7oTq8$UM zojXObEvPB|Y=dY4eQ?AjtK={(tc0%X*!L;^1EKN9SM{4lD#+F?FKDMI1??X(OOjQ#?>hI($ksDp#MJCOHWYg z;pmWm#A=JjL`9L{pD%^rfBqTn57+LQ2j|j9$Nmm_V-tj>{iOPYzRG`SLNC8`WTL!c zUK&yp^umfozlM^d(G0E!!F!sC11f%2iu<@+jm>g?+AkJTdm~3ax#hJVXC6$^htea`w8@@ zcgh~sEkwhkA87bs!wn5a)>TuH-hDcqnjGAH+LfxhW%pzzgDZI@@~mEiJX?h3qR*`) zH)`F0^r4agO2LCuf5Ig=)l+{=st?m#GIju6dny+zhavyzOZ<~L(DM`&f`2?VC5N7m zPPTh8oq8ShI60&Zb-bQ_7TJGWTt6L?=_10X{K%^i&9C4_4rA%m$#lmkjExQX7N`BE zhy0_+rW0CeYQiz}$;DRpp{Z`DV-%OZ@Z=piMAnmt|MZz|k+VOTg=+dS#sg80CPcG~ zfEt6YqYhAhT>2O){FC}n1qh-T-5=RKo8m9cB8C`OX*_JWu6cOwcB`9jzxmupPZ;JN2JOyShB(OK+pjCgxjOX;8job86)w*fW1-YG9@YW@=!j24-qt zrUw2OYJi^8pDjoUTAERu)*W;UPD^<=em?vL@Dn#JQb0-Ol%Gb29vM(Rw92K&0rUuf zY|yPf-QLqJJyxz7mOdgNnlq3-1^F!ad@HHpX@&>^rbn56iVBHv899LP6lIPujCD1I z%A4f<6?pUQnF>@JB@Y%`I;U zdi~!QiR$kD{6Z?ewxzX+ime$VKd0)}<{w#gG116^ke}$v+sF43#X1|SXHCP3EJGeV z2TC6N29!J?KHWzB7IZ1-&q1#QeG_yK=+{8Wz)M77;0>ZMaFi$v{DCM8JV_J=gd7YE zQyK;yBMJi#3F^{b6tq~|Bj_CMxS-`4t$fMAuLZr*vIhg?AA0TTa<}GAy3f@%#zWzdd&4dOZ5Jin8=`nuwx+Rq z2VRufVc<4TgX_ZL_dE!M-l;5pC6gHiodhjKU6lSllW~Kd0DS`Z5mZJ!T4@q=8|ZP| zy!L~7;QR>ahe1a{KL%P4y|06A104bF2YniJKWOpmxa9(^0X+fwY0yc~$3YiE|5?z3 zprvRG+8EFes$1R4e)r?Ld8_8?uW(&BcTVX(=#u}mXNG(heY|mw=r_xN(ObOAm#wmC zWfhys7Qe6jyq%>3+LcQ#zqESU#b68l4}y+CPAC$HKz2?1Mu8tAfCJ@49k6{OlM(N! z{ACq)6m6V0y9EvbCqC8d`=;Ul6nr1};{BJ@Z<^A78T=~n=^>FO`8`woxhVI>Y51$b zC;z&f`bFD?0rIaI{7-|w+Q|=2*^h$%74SuU$o#LG;_n6j7W9?NocggT{)6D}2mg5| zzv!3{pmzBw_*>9k+tJo``L4dJ_@lG-mJH4=ZYqK#`AK^aJn%!btMsF5DxZbW??PW} z$;ziu2#|ga`1gW;fs@~A={Evvr~F|*O#Dq{6?YXil`Z~gvA@hcJj-9UVsA-fS>+wG z^|JcGIaihWVrBIWWt9zOD>jt5H zfteckzfc2m|B>8pB=;9#iWWhov=@rPT#MKno%pswyK}L{5OXu4a=#PbZiso6B$ilW z_WmZC*C~jb1kg9$&crEwkk^U!9L)DIOtcfsmwRVc(AT|SDF}|X3=fv@>z`03~jTLLCxRQ`UkI~TQ zM67tRV;{4VTdc{^atftkX_odXo=jv18i$L}C>734m%!*L4dFfozld=;&Lb%T-SfHN z&%TXTn)0Kt2|rhkdgujC_T~IRvJ`gV=fY?!$9)0f&wl)J`TtcRzd&=l5kZjoJ|f}^ zw2Rz`AV~Z<5nrHP>?U*yKPlo%w7V7m>3aZ|wm@6vMg&2QmrG!f@D*+W+xAy8zEZ)j zWc*SE-@^E6#-;r}#w!(^o^4RRH46SM#_JXQ=Zs&W;PiZj?D!P?d`uXGH!Ao##&re1 zmholbjVEls$er~bl=Zy+p#dt`;-_LlDg5Sz`RKdT@c%Op* zjB!)J-(~D0qVL+Z6mWjNhr?M;YI%;D2CzpMozcvHba%f?vV- zegzLPen7$hiSdI9eu(k=6#QAn?^keoI70RFpn@;Q{6zR61;3i{?|CoXgGX8M|{|4iqQ1Is% z|D=Mu;4t~KU%^)~{wW3TVEoexzK8M8DEQYHKcL{xF#cHu&oKTu1;6wh%g@g%cn9ML z6?}m4FDUo}jDJzVpJn_@3hu&!p6cg51z*khmlgav#=oNAw=(`!1^)))_bd1b#=oZE z#kip$f4;8Z9>yO~@aq|WP{D6w{2L1X5aZue@Lw?gkb;+B;-~qyjz6ksvAVTZ%ecIs zyMS@(@44pREs%F%T@?CT7IctY@&+w9a;&e6a`FdEWgVCh_Rm}|eOTC8bjJE>FXQU^ z;q$`Ind__X0|(0;-FL6-NkdF+3e<)2`AS@x&$$S*^?E+{&49X^^zehC(!3#c=2d7o!bD+O-5 zZAadPb|LxE`4+U6Iq%COe^(y-0pL_W6+YXvh*iMC< zFyJT2f06suYR=|-;M5P*e)W%N#|qdv#MiI%YMGE}MCtp9JpacosoZk^HxmdRRj34t#*~#dI&irNDE2x9MX$|H1jLW%+A` z9Zon%3b@;mmeJet$bW|I|BUS;DZ)c}>^uoP*LS3&z;o5J7EG8)GliXfL2c@LQN!#t z@I7KIoWw_mp}5f%6&z41Bm4F#?H1V3!e& znTcImS0d0GHbSZ1-d#{}qzp)!S)x}5LV;MgA=(}H1pE5L$Cb_Ab$yX=FuXI83>(3C z4Bw8Xg7mdzo7wEG4n*<&WB?ArOt%HrMY?101iqUjiF(6`#3>sjH?PCzvauAtuIz8F z@}h*{u0Sek8uSIG(HD?~uz8lRe;H~s;Y-wl0l~9M z^#u~)*jc5>)-(mEu?o-`2%SZcT}uRF-P4$3sbt@@nbz8w;_43v@((`VI&K9qx!?o% zX&P2$P2bRStzd)?g-!HWOcX{Nrj#A{Y(7Mv%bQ^%Vhvf|N^9ir>kK99SbANz5ipV% zTjf@JZLVs*WVQe_4rTdS(@)~YJJwW>sG)nFA& z10~L6p*1oVSdp8N!ih40SO~+awbrI|Wdw)A$e|HyR-?%<-e2DpiDHa3;yC!l*tE5w z#c%jGH_|yY1`bFv{5per<5taRynb^-OVdX1vR3^#Ud9QClWgpquGzGy&5u)J8a6ch zVKp2Im;tdK4{R34$rw#Ifo4;$*%b|RC)*%_Wp?f(SbRQlXbK;XVl-VNPLGKhDJ)K` zk;6W*CC3pnigwodEX>1kEOZEqIG;tj(XZ--l5wL4RZGY5;O->8HE$`b^LP|}s08EU ztQ=>#ts`Wz-4OR11s-9eWV=L| zai+4ULDo3NNcJoHcp^m~H4})PQ8S`P&^balp65)3+O9}{IOII52YFEsBWDtH3{Ph= zDdTkiX7>>Ls366tbx=<*nG!u(H1S{KFeD|HY*&(Dv&(;G$t%xt7!>us#F=Vz>59{a zs1S4`FA70NKB-RNASiT`rhfm{tJ{sXD*7*VMfDkUC9o1-8|q%mnhA^c$XFzX^RxOi4{ox;9y~Pg^d;hb z;e@%%0d=M#IB+f!VyIz5(;73-tqJj-K(a^kgm%S{g+nN##B$nS*@nDASi9f>%nmetogU zk<@J^?Z0@flNIWaa_VnmeMy&PNl(2mmvED!FZZ)Z>Xw2`<@0h0Ux&zlVegVG|3S`Q z(i#@TYdjHD{{ukrO2jVz3D%cX?*F1PQr$^?xeqG>j8tU)_C6ZUQ0hZO1hxJ@1eEq> zNqxEBMp6&!N&lssr2hau?e&srxi3f3R@RqoB>iVt8%BicRO-w9JCe%%XEJ}OFU$W) z*5AMeVE+k)rqu^N5fWNs_tA-+y8)~?`AzoN7M#(U<#>Bt0e-nM!+-eqYfa<$NXmvRyHj0jVd=KCI}={gRU6bxKxH>+dnvm+h~) zS)6GpUk{AhY?*!v5o$lFFZW4F`k)kKs^$fz8YE1< z=ac8ls`VxHC4Ch-c!go>%l%pU8nQOkU#-+sTI#MC;hOR#fQcwEz z05GaQTc7ujw(^UPL!{&gQeV>9PjaU)#m4cHhO)U66Hdx99co)#!_(}ie_=DH|w(mlb|L8s|QX;Qs a#$~>o6qmbFM8Rs=VoA`xE@x1Z+J6K6Egz8p diff --git a/KadaneAlgo.cpp b/KadaneAlgo.cpp deleted file mode 100644 index e68c28a..0000000 --- a/KadaneAlgo.cpp +++ /dev/null @@ -1,99 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -long long maxSubarraySum(int arr[], int n) -{ - /* - Don't write main(). - Don't read input, it is passed as function argument. - No need to print anything. - Taking input and printing output is handled automatically. - */ - - long long curr = 0; - long long MaxSum = 0; - - for(int i = 0; i < n-1; i++) { - curr += arr[i]; - - MaxSum = max(MaxSum, curr); - if(curr < 0) curr = 0; - } - - - return MaxSum; - -} - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - long long n; - cin >> n; - - int arr[n]; - - for(int i = 0; i < n; i++) { - cin >> arr[i]; - } - - cout << maxSubarraySum(arr, n) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< kidsWithCandies(int[] candies, int extraCandies) { - ArrayList list = new ArrayList(); - int max = Integer.MIN_VALUE; - for(int i=0;i= max){ - list.add(true); - }else{ - list.add(false); - } - } - - return list; - } -} diff --git a/KthSmallLargeElem.cpp b/KthSmallLargeElem.cpp deleted file mode 100644 index e979598..0000000 --- a/KthSmallLargeElem.cpp +++ /dev/null @@ -1,94 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -vector kthSmallLarge(vector &arr, int n, int k) { - // Write your code here. - vector result(2); - - // Min_Heap - priority_queue, greater> min_heap(arr.begin(), arr.end()); - - // pop from min_heap k-1 times - - for(int i = 1; i < k; i++){ - min_heap.pop(); - } - - result[0] = min_heap.top(); - - // Max_Heap - - priority_queue max_heap(arr.begin(), arr.end()); - - for(int i = 1; i < k; i++){ - max_heap.pop(); - } - - result[1] = max_heap.top(); - - return result; -} - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -using namespace std; - -struct Node { - int data; - struct Node *left, *right; -}; - -// helper function to create a new Node -Node* newNode(int data) -{ - Node* temp = new Node; - temp->data = data; - temp->right = temp->left = NULL; - return temp; -} - -Node* KthLargestUsingMorrisTraversal(Node* root, int k) -{ - Node* curr = root; - Node* Klargest = NULL; - - // count variable to keep count of visited Nodes - int count = 0; - - while (curr != NULL) { - // if right child is NULL - if (curr->right == NULL) { - - // first increment count and check if count = k - if (++count == k) - Klargest = curr; - - // otherwise move to the left child - curr = curr->left; - } - - else { - - // find inorder successor of current Node - Node* succ = curr->right; - - while (succ->left != NULL && succ->left != curr) - succ = succ->left; - - if (succ->left == NULL) { - - // set left child of successor to the - // current Node - succ->left = curr; - - // move current to its right - curr = curr->right; - } - - // restoring the tree back to original binary - // search tree removing threaded links - else { - - succ->left = NULL; - - if (++count == k) - Klargest = curr; - - // move current to its left child - curr = curr->left; - } - } - } - - return Klargest; -} - -int main() -{ - // Your C++ Code - /* Constructed binary tree is - 4 - / \ - 2 7 - / \ / \ - 1 3 6 10 */ - - Node* root = newNode(4); - root->left = newNode(2); - root->right = newNode(7); - root->left->left = newNode(1); - root->left->right = newNode(3); - root->right->left = newNode(6); - root->right->right = newNode(10); - - cout << "Finding K-th largest Node in BST : " - << KthLargestUsingMorrisTraversal(root, 2)->data; - - return 0; -} diff --git a/LCAofBST.cpp b/LCAofBST.cpp deleted file mode 100644 index b19be30..0000000 --- a/LCAofBST.cpp +++ /dev/null @@ -1,114 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - - -/** - * Definition for a binary tree node. - * struct TreeNode { - * int val; - * TreeNode *left; - * TreeNode *right; - * TreeNode(int x) : val(x), left(NULL), right(NULL) {} - * }; - */ - -class Solution { -public: - TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { - if(root == NULL or root->val == p->val or root->val == q->val) return root; - - TreeNode* a = NULL, *b == NULL; - - if(root -> val > p -> val and root -> val > q -> val) - a = lowestCommonAncestor(root -> left, p, q); - else if(root -> val < p -> val and root -> val < q -> val) - b = lowestCommonAncestor(root -> right, p, q); - - else{ - a = lowestCommonAncestor(root -> left, p, q); - b = lowestCommonAncestor(root -> right, p, q); - } - - if(a == NULL and b == NULL) return NULL; - - if(a != NULL and b == NULL) return a; - - if(a == NULL and b != NULL) return b; - - if(a != NULL and b != NULL) return root; - - return root; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * Definition for a binary tree node. - * struct TreeNode { - * int val; - * TreeNode *left; - * TreeNode *right; - * TreeNode(int x) : val(x), left(NULL), right(NULL) {} - * }; - */ -class Solution { -public: - TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { - if(root == NULL) return NULL; - - if(root == p or root == q) return root; - - TreeNode* left = lowestCommonAncestor(root -> left, p, q); - - TreeNode* right = lowestCommonAncestor(root -> right, p, q); - - if(left and right) return root; - - if(left) return left; - - if(right) return right; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - // 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) {} - }; - -class Solution { -public: - - - TreeNode* buildT(vector &preorder, int preStart, int preEnd, vector &inorder, int inStart, int inEnd, map inMap){ - if(preStart > preEnd or inStart > inEnd) return NULL; - TreeNode* root = new TreeNode(preorder[preStart]); - - int inRoot = inMap[root->val]; - int numLeft = inRoot - inStart; - - root->left = buildT(preorder, preStart+1, preStart+numLeft, inorder, inStart, inRoot-1, inMap); - root->right = buildT(preorder, preStart+numLeft+1, preEnd, inorder, inRoot+1, inEnd, inMap); - - return root; - } - - TreeNode* buildTree(vector& preorder, vector& inorder) { - map inMap; - - for(int i = 0; i < inorder.size(); i++){ - inMap[inorder[i]] = i; - } - - TreeNode* root = buildT(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1, inMap); - - return root; - } - -}; -*/ - - - - - - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - int startp = 0; - - TreeNode* construct(vector& preorder, vector& inorder, int starti, int endi) { - if(starti > endi) return NULL; - - TreeNode* root = new TreeNode(preorder[startp++]); - int k = 0; - - for(int i = starti; i <= endi; i++) { - if(inorder[i] == root->val) { - k = i; - break; - } - } - root->left = construct(preorder, inorder, starti, k-1); - root->right = construct(preorder, inorder, k+1, endi); - - return root; - } - - - TreeNode* buildTree(vector& preorder, vector& inorder) { - int n = preorder.size(); - if(n <= 0) return NULL; - return construct(preorder, inorder, 0, n-1); - } -}; - - - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int numSubmatrixSumTarget(vector>& matrix, int target) { - int res = 0, m = matrix.size(), n = matrix[0].size(); - for(int i = 0; i < m; i++){ - for(int j = 1; j < n; j++){ - matrix[i][j] += matrix[i][j-1]; - } - } - unordered_map counter; - for(int i = 0; i < n; i++){ - for(int j = i; j < n; j++){ - counter = {{0, 1}}; - int cur = 0; - for(int k = 0; k < m; k++) { - cur += matrix[k][j] - (i > 0 ? matrix[k][i-1] : 0); - res += counter.find(cur - target) != counter.end() ? counter[cur - target] : 0; - counter[cur]++; - } - } - } - - return res; - } -}; - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - vector findSubstring(string s, vector& words) { - int len = words[0].size(), noOfWords = words.size(); - - unordered_map wordsMap; - - vector result; - - if(len*noOfWords > s.size()) return result; - - for(string word : words) - wordsMap[word]++; - for(int idx = 0; idx <= s.length()-(noOfWords*len); idx++) { - unordered_map wordsUsedMap; - - for(int chunkIdx = idx; chunkIdx < idx + (noOfWords*len); chunkIdx += len) { - string cur = s.substr(chunkIdx, len); - if(wordsMap.find(cur) == wordsMap.end()) - break; - wordsUsedMap[cur]++; - - if(wordsUsedMap[cur] > wordsMap[cur]) - break; - } - if(wordsUsedMap == wordsMap) - result.push_back(idx); - } - - return result; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - // Merge Sort - - - void merge(vector> &arr, vector&count, int l, int mid, int r) { - vector> temp(r-l+1); - - int i = l, j = mid+1, k = 0; - - while(i <= mid and j <= r) { - if(arr[i].first <= arr[j].first) - temp[k++] = arr[j++]; - else { - count[arr[i].second] += r-j+1; - temp[k++] = arr[i++]; - } - } - - while(i <= mid) { - temp[k++] = arr[i++]; - } - while(j <= r) { - temp[k++] = arr[j++]; - } - - for(int x = l; x <= r; x++) { - arr[x] = temp[x-l]; - } - } - - - - void merge_sort(vector> &arr, vector &count, int l, int r) { - if(l >= r) { - return; - } - - int mid = (l+r)/2; - merge_sort(arr, count, l, mid); - merge_sort(arr, count, mid+1, r); - merge(arr, count, l, mid, r); - - } - - - - vector countSmaller(vector& nums) { - int n = nums.size(); - vector> arr(n); - for(int i = 0; i < n; i++){ - arr[i] = {nums[i], i}; - } - vector count(n, 0); - merge_sort(arr, count, 0, n-1); - - return count; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - /*int n; - cin >> n; - - vector nums; - - for(int i = 0; i < n; i++){ - cin >> nums[i]; - } - - Solution ans; - - vector result; - - for(int i = 0; i < n; i++){ - result[i] = ans.countSmaller(nums); - } - - for(int i = 0; i < n; i++){ - cout << result[i] << endl; - }*/ - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode(int x) : val(x), next(NULL) {} - * }; - */ -class Solution { -public: - ListNode *detectCycle(ListNode *head) { - if(head == nullptr or head->next == nullptr) - return NULL; - ListNode *slow = head; - ListNode *fast = head; - ListNode *entry = head; - - while(fast -> next and fast -> next -> next) { - slow = slow -> next; - fast = fast -> next -> next; - - if(slow == fast){ - while(slow != entry){ - slow = slow -> next; - entry = entry -> next; - } - return entry; - } - } - return NULL; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int longestPalindrome(string s) { - unordered_map counts; - for(char c : s) counts[c]++; - - int result = 0; - bool odd_found = false; - for(auto &c : counts) { - if(c.second % 2 == 0) { - result += c.second; - } - else { - odd_found = true; - result += c.second - 1; - } - } - - if(odd_found) result++; - return result; - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - string s; - - getline(cin, s); - - Solution ans; - - cout << ans.longestPalindrome(s) << end; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int longestPalindrome(vector& words) { - mapm; - - for(auto i: words) - m[i]++; - - int ans = 0; - int mid = 0; - - for(auto i : m) { - string rev = i.first; - reverse(rev.begin(), rev.end()); - - if(m[rev] != 0) { - if(rev != i.first) - ans += 4*min(m[i.first], m[rev]); - else { - ans += (m[i.first]/2)*4; - - if(m[i.first]%2) - mid = 1; - } - } - m.erase(rev); - m.erase(i.first); - } - - return ans+mid*2; - - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - - bool dfs(vector& matchsticks, int target, vector&sides, int idx){ - // Base Case - if(idx == matchsticks.size()){ - if(sides[0] == sides[1] and sides[1] == sides[2] and sides[2] == sides[3]) - return true; - return false; - } - - for(int i = 0; i < 4; i++){ - if(sides[i] + matchsticks[idx] > target) //Optimization 1 - continue; - - int j = i-1; - while(j >= 0){ // Optimization 3 - if(sides[j] == sides[i]){ - break; - } - - j--; - } - - if(j != -1) - continue; - - sides[i] += matchsticks[idx]; - if(dfs(matchsticks, target, sides, idx + 1)) - return true; - sides[i] -= matchsticks[idx]; //backtrack - } - return false; - } - - bool makesquare(vector& matchsticks) { - // Edge Case - if(matchsticks.size() == 0) - return false; - - int sum = 0; - for(int i = 0; i < matchsticks.size(); i++){ - sum += matchsticks[i]; - } - - int target = sum / 4; - - vector sides(4, 0); - - sort(matchsticks.begin(), matchsticks.end(), greater()); // Optimization 2 - - return dfs(matchsticks, target, sides, 0); - } -}; - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - vector matches(n); - - loop(i, 0, n){ - cin >> matches[i]; - } - - Solution mksqr = makesquare(matches); - - if(mksqr) - cout << "TRUE"<< endl; - else - cout << "FALSE" << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - -// Brute Force Approach -vector maxXorQueries(vector &arr, vector >&queries) { - int n = arr.size(); - int m = queries.size(); - - vector result(m, -1); - - for(int i = 0; i < m; i++) { - for(int j = 0; j < n; j++){ - if(arr[i] <= queries[i][1]) - result[i] = max(result[i], arr[j]^queries[i][0]); - } - } - - return result; -} - -// optimized solution - -vector maxXorQueries(vector &arr, vector> &queries) { - int m = queries.size(); - vector result(m, -1); - - sort(arr.begin(), arr.end()); - - for(int i = 0; i < m; i++){ - if(queries[i][1] < arr[0]) - continue; - int left = 0; - int right = upper_bound(arr.begin(), arr.end(), queries[i][1]) - arr.begin(); - int ans = 0; - int cur = 0; - - for(int j = 30; j >= 0; j--){ - if(queries[i][0] & (1 << j)) { - if(not(arr[left] & (1 << j))){ - ans = ans | (1 << j); - right = lower_bound(begin() + left, arr.begin() + right, cur + (1 << j)) - arr.begin(); - } - else{ - cur = cur | (1 << j); - } - } - else { - if(arr[right - 1] & (1 << j)) { - ans = ans | (1 << j); - cur = cur | (1 << j); - left = lower_bound(begin() + left, arr.begin() + right, cur) - arr.begin(); - } - } - } - - result[i] = ans; - } - - return result; -} - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int maxPerformance(int n, vector& speed, vector& efficiency, int k) { - vector> v; - - priority_queue, greater> pq; - - for (int i = 0; i < n; i++) { - v.push_back({efficiency[i], speed[i]}); - } - - long sum = 0, ans = 0; - - sort(v.begin(), v.end()); - - for(auto i = n-1; i >= 0; i--) { - sum += v[i].second; - pq.push(v[i].second); - if(pq.size() > k) { - sum -= pq.top(); - pq.pop(); - } - - ans = max(ans, sum*v[i].first); - } - - return ans%1000000007; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - -bool compare(vector v1, vector v2){ - return v1[1] > v2[1]; -} - -class Solution { -public: - int maximumUnits(vector>& boxTypes, int truckSize) { - int totalUnits = 0, i = 0; - sort(boxTypes.begin(), boxTypes.end(), compare); - - while(truckSize > 0 and i < boxTypes.size()){ - if(boxTypes[i][0] <= truckSize){ - totalUnits += boxTypes[i][0]*boxTypes[i][1]; - truckSize -= boxTypes[i][0]; - } - else{ - int canTake = truckSize; - truckSize -= canTake; - totalUnits += canTake * boxTypes[i][1]; - } - - i++; - } - return totalUnits; - } - -}; - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - // code - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) { - ListNode *finalHead = NULL, *finalTail = NULL; - - if(list1 == NULL) return list2; - if(list2 == NULL) return list1; - - while(list1 != NULL and list2 != NULL){ - if(finalHead == NULL and finalTail == NULL){ - if(list1->val > list2->val){ - finalHead = list2; - finalTail = list2; - list2 = list2->next; - } - else{ - finalHead = list1; - finalTail = list1; - list1 = list1->next; - } - } - else{ - if(list1->val < list2->val){ - finalTail->next = list1; - finalTail = finalTail->next; - list1 = list1->next; - } - else{ - finalTail->next = list2; - finalTail = finalTail->next; - list2 = list2->next; - } - } - - } - - if(list1 != NULL){ - finalTail -> next = list1; - } - if(list2 != NULL) { - finalTail -> next = list2; - } - - return finalHead; - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* middleNode(ListNode* head) { - ListNode *slow = head; - ListNode *fast = head; - - while(fast != nullptr and fast->next != nullptr) { - slow = slow -> next; - fast = fast -> next -> next; - } - return slow; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class MinStack { - - stackst1, st2; - long long mini; - -public: - MinStack() { - - } - - void push(int val) { - if(st2.empty() or val <= st2.top()) st2.push(val); - - st1.push(val); - } - - void pop() { - - if(st1.top() == st2.top()) { - st2.pop(); - } - - st1.pop(); - - } - - int top() { - - return st1.top(); - } - - int getMin() { - return st2.top(); - } -}; - -/** - * Your MinStack object will be instantiated and called as such: - * MinStack* obj = new MinStack(); - * obj->push(val); - * obj->pop(); - * int param_3 = obj->top(); - * int param_4 = obj->getMin(); - */ - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -void dfs(int node, set &vis, vector> &graph, int &cnt) { - if(vis.count(node)){ - return; - } - - cnt++; - - vis.insert(node); - - for(int nbr = 0; nbr < graph.size(); nbr++) { - if(graph[node][nbr] and node != nbr) - dfs(nbr, vis, graph, cnt); - } - - return; -} - - -int minMalwareSpread(vector>& graph, vector& initial) { - // Write your code here - int n = graph.size(); - - int minCount = n + 1; - - int nodeRemove = -1; - - sort(initial.begin(), initial.end()); - - for(int nodeToRemove : initial) { - set vis; - vis.insert(nodeToRemove); - int cnt = 0; - for(int infectedNode : initial) { - dfs(infectedNode, vis, graph, cnt); - } - - if(minCount > cnt) { - minCount = cnt; - nodeRemove = nodeToRemove; - } - } - - return nodeRemove; -} - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class MyCalendar { -public: - - vector> v; - MyCalendar() { - - } - - bool book(int start, int end) { - for(auto x : v) { - if(start < x.second and x.first < end) { - return false; - } - } - - v.push_back({start, end}); - - return true; - } -}; - - - - -class MyCalendar { -public: - - set> v; - MyCalendar() { - - } - - bool book(int start, int end) { - auto it = v.upper_bound({start, end}); - if(it != v.end() and it -> second < end) return false; - - v.insert({end, start}); - - return true; - } -}; - - - - - - - - - -/** - * Your MyCalendar object will be instantiated and called as such: - * MyCalendar* obj = new MyCalendar(); - * bool param_1 = obj->book(start,end); - */ - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/* -// Definition for a Node. -class Node { -public: - int val; - vector children; - - Node() {} - - Node(int _val) { - val = _val; - } - - Node(int _val, vector _children) { - val = _val; - children = _children; - } -}; -*/ - -class Solution { -public: - - void preorderHelper(Node* root, vector &toReturn){ - toReturn.push_back(root->_val); - for(int i = 0; i < root->_children.size(); i++){ - preorderHelper(root->_children[i], toReturn); - } - } - - vector preorder(Node* root) { - vector toReturn; - - if(root == NULL) - return toReturn; - - preorderHelper(root, toReturn); - - return toReturn; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/* -// Definition for a Node. -class Node { -public: - int val; - vector children; - - Node() {} - - Node(int _val) { - val = _val; - } - - Node(int _val, vector _children) { - val = _val; - children = _children; - } -}; -*/ - -class Solution { - vector> ans; -public: - vector> levelOrder(Node* root) { - if(root == NULL) return {}; - - queueq; - - q.push(root); - - while(not q.empty()) { - int n = q.size(); - - vectorv; - - for(int i = 0; i < n; i++) { - Node* temp = q.front(); - - q.pop(); - - for(auto child : temp->children) { - q.push(child); - } - - v.push_back(temp -> val); - } - - ans.push_back(v); - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - - bool isValid(int i, int j, int n, int m, vector> &grid) { - if(i >= 0 and i < n and j >= 0 and j < m and grid[i][j] == '1') - return true; - - return false; - } - - void numIslandsRec(int i, int j, int n, int m, vector >& grid) { - grid[i][j] = '0'; - - if(isValid(i+1, j, n, m, grid)) - numIslandsRec(i+1, j, n, m, grid); - if(isValid(i-1, j, n, m, grid)) - numIslandsRec(i-1, j, n, m, grid); - if(isValid(i, j+1, n, m, grid)) - numIslandsRec(i, j+1, n, m, grid); - if(isValid(i, j-1, n, m, grid)) - numIslandsRec(i, j-1, n, m, grid); - } - - int numIslands(vector>& grid) { - int n = grid.size(); - int m = grid[0].size(); - int as = 0; - for(int i = 0; i < n; i++){ - for(int j = 0; j < m; j++) { - if(grid[i][j] == '1') { - ans++; - numIslandsRec(i, j, n, m, grid); - } - } - } - return ans; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -private: - void dfs(int s, int n, vector>& isConnected, vector& visited) { - visited[s] = true; - - vectoradjLs; - for(int i = 0; i < n; i++) { - int x = isConnected[s][i]; - - if(x == 1) - adjLs.push_back(i); - } - - for(auto x: adjLs) { - if(not visited[x]) { - dfs(x, n, isConnected, visited); - } - } - } -public: - - int findCircleNum(vector>& isConnected) { - int n = isConnected.size(); - - vectorvisited(n, false); - int cnt = 0; - for(int i = 0; i < n; i++) { - if(not visited[i]) { - cnt++; - dfs(i, n, isConnected, visited); - } - } - - return cnt; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -class Solution { -public: - int numMatchingSubseq(string s, vector& words) { - vector> charIndexes(26); - for(int i = 0; i < s.size(); i++) { - charIndexes[s[i] - 'a'].push_back(i); - } - int count = 0; - - for(int i = 0; i < words.size(); i++){ - bool isSubseq = true; - int lastCharIndex = -1; - - for(char w : words[i]) { - auto it = upper_bound(charIndexes[w - 'a'].begin(), charIndexes[w - 'a'].end(), lastCharIndex); - if(it == charIndexes[w - 'a'].end()){ - isSubseq = false; - break; - } - else { - lastCharIndex = *it; - } - } - if(isSubseq) - count++; - } - - return count; - } -}; - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int nums; - - cin >> nums; - - string s; - vector words(nums); - - cin >> s; - for(int i = 0; i < words.size(); i++){ - cin >> words[i]; - } - - Solution ans; - - int result = ans.numMatchingSubseq(s, words); - - cout << result << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - - ListNode* reverseList(ListNode* head) { - if(head == nullptr) return NULL; - - ListNode* p = nullptr, *c = head, *n = head -> next; - while(c != nullptr) { - c -> next = p; - p = c; - c = n; - if(n != nullptr) n = n -> next; - } - - return p; - } - - - void print(ListNode* head) { - while(head) { - cout << head -> val << " "; - head = head -> next; - } - cout << endl; - } - - - bool isPalindrome(ListNode* head) { - ListNode* slow = head; - ListNode*fast = head; - - while(fast -> next != NULL and fast -> next -> next != NULL) { - slow = slow -> next; - fast = fast -> next -> next; - } - - slow -> next = reverseList(slow -> next); - ListNode* start = head, *mid = slow -> next; - - while(mid != nullptr) { - if(mid -> val != start -> val) return false; - - start = start -> next; - mid = mid -> next; - } - - print(head); - slow -> next = reverseList(slow -> next); - print(head); - - return true; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - bool subsetSum(int n, int k, vector& nums) { - - vector prev(k+1, 0), cur(k+1, 0); - - prev[0] = cur[0] = true; - - if(nums[0] <= k) prev[nums[0]] = true; - - for(int ind = 1; ind < n; ind++) { - for(int target = 1; target <= k; target++) { - bool notTake = prev[target]; - bool take = false; - if(nums[ind] <= target) take = prev[target - nums[ind]]; - cur[target] = take | notTake; - } - prev = cur; - } - - return prev[k]; - } - - bool canPartition(vector& nums) { - int totsum = 0; - - for(int i = 0; i < nums.size(); i++) - totsum += nums[i]; - - - if(totsum % 2) return false; - - int target = totsum / 2; - - return subsetSum(nums.size(), target, nums); - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* partition(ListNode* head, int x) { - if(head == nullptr){ - return NULL; - } - ListNode* smallerEle = new ListNode(-1); - ListNode* greaterEle = new ListNode(-1); - smallerEle -> next = head; - greaterEle -> next = head; - - ListNode* smallerEleHead = smallerEle; - ListNode* greaterEleHead = greaterEle; - - while(head != nullptr) { - if(head->val < x) { - smallerEle -> next = head; - smallerEle = smallerEle -> next; - } - else { - greaterEle -> next = head; - greaterEle = greaterEle->next; - } - head = head -> next; - } - - greaterEle -> next = nullptr; - smallerEle -> next = greaterEleHead -> next; - - return smallerEleHead->next; - } -}; - - - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * 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) {} - * }; - */ -class Solution { - public: - - int ans = 0; - void helper(TreeNode* root, int sum, unordered_map&ma, long long temp = 0ll) { - - if(root == nullptr) return; - - temp += 1ll*root -> val; - - ma[temp]++; - - if(ma.find(temp - sum) != ma.end()) { - ans += ma[temp - sum]; - if(sum == 0) ans--; - } - - helper(root -> left, sum, ma, temp); - helper(root -> right, sum, ma, temp); - - ma[temp]--; - - if(ma[temp] == 0) ma.erase(temp); - temp = root -> val; - - } - - int pathSum(TreeNode* root, int targetSum) { - if(root == nullptr) return 0; - - unordered_mapma; - - ma[0]++; - - helper(root, targetSum, ma); - - return ans; - } - -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int pivotIndex(vector& nums) { - int leftSum = 0; - int rightSum = 0; - int sum = 0; - - for(int i = 0; i < nums.size(); i++){ - sum += nums[i]; - } - - rightSum = sum; - - for(int i = 0; i < nums.size(); i++){ - rightSum -= nums[i]; - if(rightSum == leftSum){ - return i; - } - - leftSum += nums[i]; - } - - return -1; - } -}; - - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; cin >> n; - - vector nums(n); - - for(int i = 0; i < n; i++){ - cin >> nums[i]; - } - - Solution s; - - int result = s.pivotIndex(nums); - - cout << result << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - int poorPigs(int buckets, int minutesToDie, int minutesToTest) { - int t = minutesToTest / minutesToDie; - - return ceil(log(buckets)/log(t+1)); - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/* -// Definition for a Node. -class Node { -public: - int val; - Node* left; - Node* right; - Node* next; - - Node() : val(0), left(NULL), right(NULL), next(NULL) {} - - Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {} - - Node(int _val, Node* _left, Node* _right, Node* _next) - : val(_val), left(_left), right(_right), next(_next) {} -}; -*/ - -class Solution { -public: - Node* connect(Node* root) { - if(root == NULL) return root; - - queueq; - q.push(root); - - while(not q.empty()) { - - int size = q.size(); - - if(size == 0) - return root; - - while(size > 0) { - Node* temp; - - if(size > 1) { - temp = q.front(); - q.pop(); - - Node* nextAdd = q.front(); - temp -> next = nextAdd; - } - else { - temp = q.front(); - q.pop(); - } - - if(temp -> left != NULL) - q.push(temp -> left); - - if(temp -> right != NULL) - q.push(temp -> right); - - size--; - } - } - - return root; - - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - -class NumArray { -public: - - int n; - vector seg; - - - int build(const vector &nums, int left, int right, int node){ - int middle; - int leftSum, rightSum; - - if(left == right) return seg[node] = nums[left]; - - middle = (left + right) / 2; - - leftSum = build(nums, left, middle, 2*node+1); - rightSum = build(nums, middle+1, right, 2*node+2); - - return seg[node] = leftSum + rightSum; - } - - - - int sumRange(int left, int right, int ss, int se, int node) { - int leftSum; - int rightSum; - - int middle; - - if(right < ss or left > se) return 0; - if(left <= ss and se <= right) return seg[node]; - - middle = (ss+se)/2; - - leftSum = sumRange(left, right, ss, middle, 2*node+1); - rightSum = sumRange(left, right, middle+1, se, 2*node+2); - - return leftSum+rightSum; -} - - -int update(int index, int newVal, int ss, int se, int node) { - int leftSum; - int rightSum; - int middle; - - if(index < ss or index > se) return seg[node]; - if(ss == se) return seg[node] = newVal; - - middle = (ss+se)/2; - - leftSum = update(index, newVal, ss, middle, 2*node+1); - rightSum = update(index, newVal, middle+1, se, 2*node+2); - - return seg[node] = leftSum+rightSum; -} - - - - NumArray(vector& nums) { - n = nums.size(); - seg.resize(4*n); - build(nums, 0, n-1, 0); - } - - void update(int index, int val) { - update(index, val, 0, n-1, 0); - } - - int sumRange(int left, int right) { - return sumRange(left, right, 0, n-1, 0); - } -}; - -/** - * Your NumArray object will be instantiated and called as such: - * NumArray* obj = new NumArray(nums); - * obj->update(index,val); - * int param_2 = obj->sumRange(left,right); - */ - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int minSetSize(vector& arr) { - unordered_map m; - - for (int i = 0; i < arr.size(); i++) { - m[arr[i]]++; - } - - multiset> s; - - for(auto n : m) { - s.insert(n.second); - } - - int size = arr.size(); - int cnt = 0; - int ans = 0; - - for(auto it = s.begin(); cnt*2 < size; ++it) { - ans++; - cnt += *it; - } - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< { - if(x < 0){ - return -1*reverse(-x); - } - - const solution = (x+"").split('').reverse().join(''); - - return (solution > 2**31-1) ? 0 : solution; - -}; \ No newline at end of file diff --git a/ReverseLinkedList.cpp b/ReverseLinkedList.cpp deleted file mode 100644 index 3bb9232..0000000 --- a/ReverseLinkedList.cpp +++ /dev/null @@ -1,112 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - // ListNode* reverseList(ListNode* head) { - // if(not head or not head->next){ - // return head; - // } - // ListNode *prev = NULL; - // ListNode *curr = head; - // ListNode *next = head->next; - - - // while(next){ - // curr->next = prev; - // prev = curr; - // curr = next; - // next = next->next; - // } - - // curr->next = prev; - - // return curr; - - // } - - - ListNode* reverseList(ListNode* head) { - if(not head or not head->next) return head; - - auto ans = reverseList(head -> next); - head -> next -> next = head; - head->next = NULL; - - return ans; - } - -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - - ListNode* reverse(ListNode* head){ - ListNode* prev = NULL, *next = NULL, *current = head; - while(current != NULL){ - next = current->next; - current->next = prev; - prev = current; - current = next; - } - - return prev; - } - - - // ListNode* reverseBetween(ListNode* head, int left, int right) { - // ListNode* current = head, *prev = NULL; - // int count = 1; - // while(count != left) { - // prev = current; - // current = current->next; - // count++; - // } - - // ListNode* start = current; - // while(count != right){ - // current = current->next; - // count++; - // } - - // ListNode* rest = current->next; - // current->next = NULL; - - // ListNode* newHead = reverse(start); - // if(prev != NULL){ - // prev->next = newHead; - // } - // current = newHead; - // while(current->next != NULL){ - // current = current->next; - // } - - // current->next = rest; - - // if(left == 1){ - // return newHead; - // } - // else{ - // return head; - // } - // } - - - - ListNode* reverseBetween(ListNode* head, int left, int right) { - if(head == NULL or left == right) return head; - - ListNode* prev = NULL, *tail = NULL, *temp = NULL; - ListNode dummy(NULL); - prev = &dummy; - dummy.next = head; - - for(int i = 0; i < left -1; i++){ - prev = prev -> next; - } - - - tail = prev -> next; - for(int i = 0; i < right-left; i++){ - temp = prev -> next; - prev -> next = tail -> next; - tail -> next = tail -> next -> next; - prev -> next -> next = temp; - } - - return dummy.next; - } - - -}; - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - void rotate(vector>& matrix) { - int row = matrix.size(); - for(int i = 0; i < row; i++) { - for(int j = 0; j < i; j++) { - swap(matrix[i][j], matrix[j][i]); - } - } - - for(int i = 0; i < row; i++) { - reverse(matrix[i].begin(), matrix[i].end()); - } - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - bool binary_search(vector> &matrix, int &target, int row) { - int l = 0; - int r = matrix[0].size()-1; - - while(l <= r) { - int mid = l + (r - l) / 2; - - if(matrix[row][mid] == target) - return true; - - else if(matrix[row][mid] > target) - r = mid - 1; - - else - l = mid + 1; - } - - return false; - } - -/* - bool searchMatrix(vector>& matrix, int target) { - int n = matrix.size(); - for(int i = 0; i < n; i++) { - if(binary_search(matrix, target, i)) { - return true; - } - } - return false; - }*/ - - - - - bool searchMatrix(vector>& matrix, int target) { - int m = matrix.size(); - if(m == 0) return false; - - int n = matrix[0].size(); - int i = 0, j = n-1; - - while(i < m and j >= 0){ - if(matrix[i][j] == target) - return true; - else if(matrix[i][j] > target) - j--; - else - i++; - } - return false; - } - - - -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - - - Seller Dashboard - - - - - - - - -
- - - -
- -
- - Seller_Profile_Picture - -

Alexander Hipp

-
- -
- Your Profile - Product List - - Offers Available - - Current Orders - Completed Orders - -
-
- - -
-

- Your Profile -

-
- -
-
-

Full Name

-

Profile Id

-

Email Id

-

Mobile No

- -
-
-

-

-

-

- -
-
-
- -
-

- Product List -

-
- -
- - - - -
- Product2 -
-

x

-

BIBA 1

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- Product2 -
-

x

-

BIBA 2

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- Product2 -
-

x

-

BIBA 3

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- Product2 -
-

x

-

BIBA 4

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- Product2 -
-

x

-

BIBA 5

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- Product2 -
-

x

-

BIBA 6

-

Women White Pochu

-

₹ 400/-

-

400 pieces - available

-
- - - - - -
-
-
-
- - - -
- + Add Items - -
- -
-
-
ADD PRODUCT
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
- -
-
- - -
-
-
-
- - -
-

- Offers Available -

-
- -
- - -
-
-

x

-

Offer 1

-
-
-
-
-

x

-

Offer 2

-
-
-
-
-

x

-

Offer 3

-
-
-
-
-

x

-

Offer 4

-
-
-
- -
- + Add Offer -
- -
-
-
ADD OFFER
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
- -
-
- - -
-
-
-
- - -
- -

Current Orders

-
- -
- -
-
- -
-
-

- White Digital Watch 1 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 2 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 3 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 4 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
- -
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
- -
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
- -
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
-
-
- -
-
-

- White Digital Watch 5 -

-

₹ 400/-

-

- Status: In Transit -

-

- Product ID: A12P90182 -

-
- Approve ✔ - Decline ✘ -
-
-
- -
- -
-
-
Customer Details
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
-
- -
- -
-
- - -
-
- - -
-
-
-
- - -
-

Completed Orders

-
- -
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
- -
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
- -
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
-
-

- White Digital Watch -

-

₹ 400/-

-

- Status: Delivered -

-

- Product ID: A12P90182 -

-
-
-
-
- -
- - - - - - - - - \ No newline at end of file diff --git a/SplitArrConsecuSubseq.cpp b/SplitArrConsecuSubseq.cpp deleted file mode 100644 index 1691f14..0000000 --- a/SplitArrConsecuSubseq.cpp +++ /dev/null @@ -1,99 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool isPossible(vector& nums) { - map m, m1; - for(int i = 0; i < nums.size(); i++) { - m[nums[i]]++; - } - - for(auto i : nums) { - if(m[i] == 0) continue; - m[i]--; - if(m1[i-1] > 0) { - m1[i-1]--; - m1[i]++; - } - else if(m[i+1] != 0 and m[i+2] !=0){ - m[i+1]--; - m[i+2]--; - m1[i+2]++; - } - else{ - return false; - } - } - - return true; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - string multiply(string num1, string num2) { - int len1 = num1.size(); - int len2 = num2.size(); - - if(num1 == "0" or num2 == "0") return "0"; - - vector v(len1+len2, 0); - - for(int i = len1-1; i >= 0; i--) { - for(int j = len2-1; j >= 0; j--) { - v[i+j+1] += (num1[i]-'0') * (num2[j] - '0'); - v[i+j] += v[i+j+1] /10; - v[i+j+1] %= 10; - } - } - - int i = 0; - - while(i < v.size() and v[i] == 0) i++; - - string res = ""; - while(i < v.size()) { - res += v[i] + '0'; - i++; - } - - return res; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - string num1, num2; - getline(cin, num1); - getline(cin, num2); - - Solution ans; - - cout << ans.multiply(num1, num2) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - -class Solution { -public: - int myAtoi(string s) { - if(s.length()==0) return 0; - - int i = 0; - while(i < s.size() and s[i] == ' ') - i++; - s = s.substr(i); - - int sign = +1; - long ans = 0; - if(s[0] == '-') sign = -1; - - int MAX = INT_MAX, MIN = INT_MIN; - i = (s[0] == '+' or s[0] == '-') ? 1:0; - - while(i < s.length()) { - if(s[0] == ' ' or not isdigit(s[i])) break; - - ans = ans*10+s[i]-'0'; - if(sign == -1 and -1*ans < MIN) return MIN; - if(sign == +1 and ans > MAX) return MAX; - i++; - } - return int(sign*ans); - } - -}; - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - // 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) {} - }; - -class Solution { -public: - - bool isBST(TreeNode* root, long minVal, long maxVal) { - if(not root) return true; - - long val = (long)root->val; - - return (val > minVal and val < maxVal and isBST(root->left, minVal, val) and isBST(root->right, val, maxVal)); - } - - bool isValidBST(TreeNode* root) { - return isBST(root, LONG_MIN, LONG_MAX); - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - bool able(string s,string t){ - if(s.length()!=t.length()) - return false; - int c=0; - for(int i=0;i> &g,vector parent[],int n,int sr,int ds){ - vector dist(n,1005); - queue q; - q.push(sr); - parent[sr]={-1}; - dist[sr]=0; - while(!q.empty()){ - int x=q.front(); - q.pop(); - for(int u:g[x]){ - if(dist[u]>dist[x]+1){ - dist[u]=dist[x]+1; - q.push(u); - parent[u].clear(); - parent[u].push_back(x); - } - else if(dist[u]==dist[x]+1) - parent[u].push_back(x); - } - } - } - void shortestPaths(vector> &Paths, vector &path, vector parent[],int node){ - if(node==-1){ - Paths.push_back(path); - return ; - } - for(auto u:parent[node]){ - path.push_back(u); - shortestPaths(Paths,path,parent,u); - path.pop_back(); - } - } - vector> findLadders(string beginWord, string endWord, vector& wordList) { - int n=wordList.size(),sr=-1,ds=-1; - vector> ANS; - for(int i=0;i> g(n,vector()),Paths; - vector parent[n],path; - for(int i=0;i now; - for(int i=0;i -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - veector Freq(string s) { - vector freq(26, 0); - - for (int i = 0; i < s.size(); i++) { - freq[s[i] - 'a']++; - } - - return freq; - } - - vector wordSubsets(vector& words1, vector& words2) { - vector ans; - vectorMax_Freq_w2(26, 0); - - for(auto &x : words2) { - vector freq = Freq(x); - for(int i = 0; i < 26; i++) { - Max_Freq_w2 = max(freq[i], Max_Freq_w2[i]); - } - } - - for(auto &x : words1) { - vector freq = Freq(x); - bool flag = true; - - for(int i = 0; i < 26; i++) { - if(freq[i] < Max_Freq_w2[i]){ - flag = false; - break; - } - } - if(flag) ans.push_back(x); - } - return ans; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector asteroidCollision(vector& a) { - stack s; - int n = a.size(); - for(int i =0; i < n; ++i){ - if(a[i] > 0 || s.empty()) s.push(a[i]); - else{ - while(s.size() && s.top() > 0 && s.top() < abs(a[i])) s.pop(); - if(s.size() && s.top() == abs(a[i])) s.pop(); - else if(s.empty() || s.top() < 0) s.push(a[i]); - } - } - vector ans; - while(s.size()){ - ans.push_back(s.top()); s.pop(); - } - reverse(ans.begin(), ans.end()); - return ans; - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - vector averageOfLevels(TreeNode* root) { - vector avg; - - queue q; - - q.push(root); - - while(not q.empty()) { - int n = q.size(); - - double sum = 0; - - double cnt = n; - - for(int i = 0; i < n; i++) { - TreeNode* temp = q.front(); - q.pop(); - - if(temp -> left != nullptr) q.push(temp -> left); - - if(temp -> right != nullptr) q.push(temp -> right); - - sum += temp -> val; - - } - - avg.push_back(sum/cnt); - } - - return avg; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool backspaceCompare(string s, string t) { - stack s1, s2; - string str1, str2; - - for(int i = 0; i < s.size(); i++) { - if(s[i] == '#' and not s1.empty()) - s1.pop(); - else if(s[i] != '#') - s1.push(s[i]); - } - for(int i = 0; i < t.size(); i++) { - if(t[i] == '#' and not s2.empty()) - s2.pop(); - else if(t[i] != '#') - s2.push(t[i]); - } - while(not s1.empty()) { - str1.push_back(s1.top()); - s1.pop(); - } - while(not s2.empty()){ - str2.push_back(s2.top()); - s2.pop(); - } - - return str1 == str2; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - string s, t; - getline(cin, s); - getline(cin, t); - - Solution ans; - - cout << ans.backspaceCompare(s, t) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int bagOfTokensScore(vector& tokens, int power) { - sort(tokens.begin(), tokens.end()); - int score = 0; - int ans = 0; - - int i = 0, j = tokens.size()-1; - - while(i <= j) { - if(tokens[i] <= power) { - score += 1; - if(ans < score) { - ans = score; - } - - power -= tokens[i]; - i++; - } - else if(score > 0) { - power += tokens[j]; - score -= 1; - j--; - } - - else { - break; - } - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int characterReplacement(string s, int k) { - int maxFreq = 0; - int st = 0; - int maxi= 0; - - unordered_mapmp; - - for(int i = 0; i < s.size(); i++) { - mp[s[i]]++; - maxFreq = max(maxFreq, mp[s[i]]); - - if((i-st+1)-maxFreq > k) { - mp[s[st]]--; - st++; - } - maxi = max(maxi, i-st+1); - } - - return maxi; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool checkInclusion(string s1, string s2) { - int m[26] = {0}; - for(char c : s1) - m[c-'a']++; - int i = 0, j = 0, total_chars = s1.size(); - while(j < s2.size()) { - if(m[s2.at(j++) - 'a']-- > 0) - total_chars--; - if(total_chars == 0) return true; - if(j - i == s1.size() and m[s2.at(i++) - 'a']++ >= 0) - total_chars++; - } - return false; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - - int dp[10010]; - - int fxn(int amount, vector& coins) { - - if(amount == 0) return 0; - - if(dp[amount] != -1) return dp[amount]; - - int ans = INT_MAX; - - for(int coin : coins) { - if(amount - coin >= 0) - ans = min(ans + 0LL, fxn(amount - coin, coins) + 1LL); - } - - return dp[amount] = ans; - } - - int coinChange(vector& coins, int amount) { - memset(dp, -1, sizeof(dp)); - - int ans = fxn(amount, coins); - - return ans == INT_MAX ? -1 : ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - - int dp[310][10010]; - - int fxn(int ind, int amount, vector& coins) { - - if(amount == 0) return 1; - - if(ind < 0) return 0; - - if(dp[ind][amount] != -1) return dp[ind][amount]; - - int ans = 0; - - for(int coin_amount = 0; coin_amount <= amount; coins_amount += coins[ind]) { - if(amount - coin >= 0) - ans += fxn(ind-1, amount - coin_amount, coins);; - } - - return dp[ind][amount] = ans; - } - - int coinChange(vector& coins, int amount) { - memset(dp, -1, sizeof(dp)); - - return fxn(coins.size()-1, amount, coins); - } - -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { - vector> ans; -public: - void solve(int i, vector& candidates, vector& temp, int target) { - if(target == 0) { - ans.push_back(temp); - return; - } - - if(target < 0) return; - - if(i == candidates.size()) return; - - solve(i+1, candidates, temp, target); - - temp.push_back(candidates[i]); - solve(i, candidates, temp, target-candidates[i]); - temp.pop_back(); - - } - - vector> combinationSum(vector& candidates, int target) { - ans.clear(); - - vector temp; - - solve(0, candidates, temp, target); - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - - -class Solution { -public: - - int combinationSum4(vector& nums, int target) { - - vectordp(target+1, 0); - dp[0] = 1; - - for(int i = 1; i <= target; i++) { - for(auto x : nums) { - if(x <= i) - dp[i] += dp[i-x]; - } - } - - return dp[target]; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { - -unordered_map> m; -int MOD = 1e9+7; - -public: - - int helper(int n, int i, char prev, vector> &dp) { - if(i > n) return 0; - - if(i == n) { - switch(prev) { - case 'a' : - return 1; - case 'e' : - return 2; - case 'i' : - return 4; - case 'o' : - return 2; - case 'u' : - return 1; - default : - return 5; - } - } - - int idx = prev - 'a'; - - if(dp[i][idx] != -1) { - return dp[i][idx]; - } - - long long ans = 0; - for(auto next : m[prev]) { - ans += helper(n, i+1, next, dp) %MOD; - } - - return dp[i][idx] = ans%MOD; - - } - - int countVowelPermutation(int n) { - m['c'] = {'a', 'e', 'i', 'o', 'u'}; - m['a'] = {'e'}; - m['e'] = {'a', 'i'}; - m['i'] = {'a', 'e', 'o', 'u'}; - m['o'] = {'i', 'u'}; - m['u'] = {'a'}; - - vector> dp(vector>(n+2, vector(27, -1))); - - return helper(n, 1, 'c', dp); - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - cin >> n; - - Solution result; - - cout << result.countVowelPermutation(n) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -class Solution { -public: - string decodeString(string s) { - stack st; - - for(int i = 0; i < s.size(); i++) { - if(s[i] != ']') - st.push(s[i]); - else { - string str = ""; - while(st.top() != '[') { - str = st.top()+str; - st.pop(); - } - st.pop(); - - string number = ""; - while(not st.empty() and isdigit(st.top())) { - number = st.top()+number; - st.pop(); - } - int freq = stoi(number); - - while(freq--) { - for(int j = 0; j < str.length(); j++) - st.push(str[j]); - } - } - } - - string ans = ""; - while(not st.empty()) { - ans = st.top() + ans; - st.pop(); - } - - return ans; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* deleteDuplicates(ListNode* head) { - - ListNode* dummy = new ListNode(0, head); - - ListNode* prev = dummy; - - while(head != nullptr) { - - if(head -> next != nullptr and head -> val == head -> next -> val) { - while(head -> next != nullptr and head -> val == head -> next -> val) { - head = head -> next; - } - prev -> next = head -> next; - } - else { - prev = prev -> next; - } - - head = head -> next; - } - - return dummy -> next; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - void countSort(vector>& mat, int r, int c) { - int m = mat.size(); - int n = mat[0].size(); - - int i = r; - int j = c; - - vectormap(101); - while(i < m and j < n) { - map[mat[i][j]]++; - i++; - j++; - } - - i = r; - j = c; - - for(int k = 1; k < map.size(); k++) { - while(map[k] > 0) { - mat[i][j] = k; - map[k]--; - i++; - j++; - } - } - - - } - vector> diagonalSort(vector>& mat) { - int m = mat.size(); - int n = mat[0].size(); - - for(int i = 0; i < m; i++) { - countSort(mat, i, 0); - } - for(int j = 0; j < n; j++) { - countSort(mat, 0, j); - } - - return mat; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n, m; - cin >> n >> m; - vector>mat(m, vector(n)); - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - int ans = 0; - int heightBT(TreeNode* root) { - if(root == nullptr) return 0; - int lh = heightBT(root -> left); - int rh = heightBT(root -> right); - - ans = max(ans, lh + rh + 1); - - return max(lh, rh) + 1; - - } - - - int diameterOfBinaryTree(TreeNode* root) { - - int diameter = heightBT(root); - - return ans -1; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -int findDuplicate(vector &arr, int n){ - // Write your code here. - - // Approach 1 - - /*sort(arr.begin(), arr.end()); - - for(int i = 0; i < arr.size(); i++){ - if(arr[i] == arr[i+1]) - return arr[i]; - } - - return -1;*/ - - - // Approach 2 - - /*for(int i = 0; i < arr.size(); i++){ - int idx = abs(arr[i]) - 1; - if(arr[idx] < 0) { - return idx + 1; - } - else { - arr[idx] = -1*arr[idx]; - } - } - - return -1;*/ - - - // Hare and Tortoise method - - int tortoise = arr[0]; - int hare = arr[0]; - - do { - // hare pointer move twice as tortoise - - tortoise = arr[tortoise]; - hare = arr[arr[hare]]; - - - } - // find the intersection pt of two runners. - while(tortoise != hare); - // to find the entrance to the cycle torrtoise begins from start of array - tortoise = arr[0]; - while(tortoise != hare) { - // This time both runner move with same speed - - tortoise = arr[tortoise]; - hare = arr[hare]; - - } - // return the entrance to the cycle - return hare; - -} - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - int n; - cin >> n; - - vector arr(n); - - for(int i = 0; i < n; i++) { - cin >> arr[i]; - } - - cout << findDuplicate(arr, n) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int fib(int n) { - int a = 0, b= 1, c; - if(n <= 1) return n; - - for(int i = 2; i <= n; i++) { - c = a+b; - a = b; - b = c; - } - - return c; - - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - - cin >> n; - - Solution result; - - cout << result.fib(n) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - - vector found_patterns(string pattern) { - if(pattern.size() == 0) return {}; - - vector v; - - int idx = 0; - - unordered_mapmp; - - - for(int i = 0; i < pattern.size(); i++) { - if(mp.find(pattern[i]) == mp.end()) { - mp.insert({pattern[i], idx++}); - v.push_back(mp[pattern[i]]); - } - else{ - v.push_back(mp[pattern[i]]); - } - } - - return v; - } - - vector findAndReplacePattern(vector& words, string pattern) { - vector v = found_patterns(pattern); - - int n = words.size(); - - vector ans; - - for(int i = 0; i < n; i++) { - vector pattern_word = found_patterns(words[i]); - if(v == pattern_word) - ans.push_back(words[i]); - } - - return ans; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "<_U3 z=_k@fG;h&U4;* z=VT`2vwQD9`^kaH^PcbXoaa2}IX~Z@=Uz|i%KW@MLxlq4GX}*v&y`36Gj?w01CR!z z-Z%$;UB&`q7UG2hll%rrz?I=xekLtuya1HamD52M`bh~JiYg0w7+Ww=vdE3#a$$X;1Yk+ z`L%JnhHA;s>6_$m1VvSTYmrX5N=i)qS5@;m&M#LzOt3!{U|qDo{;c2OSGrdF+4Z$QlmVeCdx7xOqy{Du2n$Dh6Bk?vpp;N=T% zeI|Zs-onRrD;<<4$xxv5Y?2)>#}UcM@;{J&u`$mejKYQZ9Sy$H8~e)a{L6diG|k^V zr%5n!{P{H$ao5g}_&#FU@GEl2leO98<2mrq6o%8jgDc_7P$2R<%DA5s+0MipI?@Up!dT5(!z&ZqH^R;J!v_ z@A3sqUpO4~OGY@};%~RyZhwz2W?C^{$O7Q;tOHgJH6gzlja#vxueYVc?5H$7?R6%x z%=Vzw7Yq7B@lcd4Acih8=pZvz8nUoaMr zMttFrwbk5QDfGag>DlA&fHk$I^iX6=ua>DOf0Hafj9DrR1Mg%lZ?zQ)dfM8f!h{-s zwBHiy$k%Nv;SAfY?eGD$flYqD8K)-THq7;rEul!jTo;V@_XdgSS8W5$!hgHz@44OV z_JzWRA8x-LMfVT*OrI4T2q6~{=?;+-?nE0gDLFT%ULR_8Ra28$T~TSQYHeB3WL8zw z*hf_rwMNs14UH>WOm{`Kgg0z}a1EMlzWuKNNA#nAh2n1!{?e$d#_Tko#_K$z2yE3) z+pgI9F_OK5k|5+E?Ip~wM0{Q-gq1|0v6Zp@3qohnY%u7Mr!GbMD7^N}?U;Isj4!dg zwdl*3(({e4vAn(Bkm5$edGer4twR`pZoWJy*KmX7i#sJ>trt}Ms3~!plhj;9$T0`b zODZ8a>cCmGz>^M~=1Ub$Iq;7w5Ol(UpYOoSI%R}>RO-OhxI^E_h3yVp z)fw@2I&d^BJM41cXWOV@>~`R2xOUj&Qu}2)Z zb6$Gcfpe2}Xq!2l@xY7+{v#gved$I2?j1Z?>>Vol`3;8Q-7#Y2r;d6De^h)(s7uwJ z3wS(r`FS9v3k;I)A

NJE>G^mx$AVI6n5O9jAeCeC(hdrvY$$?C z@W#g;u;Vn)jgNiaj?(})K6Zy4r-5yJ%xA}GKpP)hYsYCI8y{=5<1~PckGbtQ4P4`6 z7u#_fu*S#c+Ho4F#>evPI87+yWAA^Y%1Z+l%CF+^&W<(Yon}M$2l3zF^xYYMSBt-; z#ebs3f2_q{)Z+iB#ebm1|3-^Hp~b(h#UIk*!&-cY7T>1D`?YwlGw%LPOXAhryoq0U z2alg>>u4P=+6)hShtEl!LuB~`+?krc4oOb$LiF=E@D3N^kZAVq=WTH z_dHpboR2g=q$AjO7TQL#*#R6St<}_eHXc&R+R+Jn65IB86aBja-l4+F7gFMcC+QwZ zJ__~8-+!1&A%4I+?Ahl{yac_EqD;vn1P^9cOaH*m1d53hdd+Rt2_tBy`@)HZ5T8?HV5-=xGz8T}!n&2Y1$3$BOASmZ4-(9)2NDxA!BI$>BLWw{r8cHcWC`YBA@WI9XS(( zwFF|;pw5C6E@Y8R^dC>GABDE$P(yjb^TCj36#4j&EJ4j6=^Y#?mrZULu%Y#%L!RTp zlykF)TuUOJ4<_41);?PZKm8CDBphi$G_wqF8PcYmK>czdOhj$=A3f|jF51cv^{m6m zPN*78=Ao0qoKJg_rC&M^2+X|-*1d4>*9-EFzB-Y30nEIk3D3#FZ6}S=`*uLXkmn?I zIH5*#q|Z>ga==iR$+?U;#?nJ~-y{;DWy-wC5HCqDJ!I8R()U}+MCcpQ^u10T(l`46 zG#e+14&bkG--uNNB`0o~r0H>z&#LKv5C@t{zcGU3B}h3q0$&^-`yEC$iV4q%S@Hnf zOg&(svj?DM!KbHCApFWeCcHx!@L!0}BIraRA?bRchA3s)uvU?>i(c?1j$)wC-*_n9 zqS9)GzM=J)4t|mE&CAlTg&x%7Nt6WLDXoJWzT&^B@l~5h!v0ZjVm&HlV-g(#)PuOF z(Z5F;Z{i>jv>e!paro`zD!3eSqM@_gNkAtqQUeGzbr`gRJE~kB@Lyngy zve$Nx9Q)r9dBS1Py9CFMaf5t{DJZR1#+_4=-So9N38kQk;5{zIJQ}%0^l_E;i7#>8PtLbpanz zUC4TPTogaU<%a=Ha{2w#LZ!nJJ74|Nm^#_t4qdL5cY)GK54nyTIwNs&T3C&Z&*opLnS(JR@52=)+mNHA5 zVN>HIo61CA7ehmaVEB)L+3itNT@<(0FQ8fp^hVZwICy5INYcq(8_}LiHY=+HzIJpCO%PhMHXJ4=1UWC1pp9XX@e6Pw&;j z+`|y%26?zaTpN;bgSh^JBo5Ql-W27<8l2iBszcWLgHXg%M@AtsU8VdZOce`JnlmOl zSB#@Cc~W`E!8tY#LfWA|SJ~|5nxh0%MKIx6XhRDYc5KhoJgL{9nWM??8_!r~ag7RV zwJvkmb6RL0UXP{HYA%Dw=~l{gXmv*C*a^Lka!t-1jplH&oSOSm&#BUfX?`tAe(!zJ z{4t%4<`chaT3W88{AnJdwo1i%$(#6>p-oZmy5WUs^YfK`=w`^>@wQ*zPZH?xk?(T}x1^1zZ^8B2xY*4}m-cKBn^Gm|=XCj7GSI3_$oXKXf&Gj*MT<50SlEC*yyKNcxjej?>j; z1mD-Cf;(;`%MIiGcX7)b;jsqXn?!gfvRu&fpTAqsKd+?=eTMP5|DG@0z3H3tgcsMg zwTMe~=E!T}GTq#RS6xDKp>qQsqKkHn-B0u{@B&d>yH1e>KLaHT-T@^Gh)<6(ya&1f z^fl1Wg8muwUeND=l7bUNp#ax!g@VIGp#WE2go1w}3I#$A3Wg~T1uqhX0=h^`3f>j8 zz_?e?*~Y7amKqNTy1;l_(9aq|9~6*%2*&Rv&6DX<1(Khd{g}i{B}pw1cA*GV9)x>k z{;Aa29iiT!YnjV%#a(Bkr8GqY!GLSURzU3+$6PDIc#w2SbMf$ZaD8WXeTJOqMe{MpihI+ zz3C&M7U)UP2SLNXN~N9y-48kn`Xf+!vEemP7w85!xfyf-GywWpcd#+ z&@X_V0^JWIH2By$7@p^cd(a(7C@xdeF~+9tG_IJq7v&&@!~SuYp#A z9sz9wEkL8|1FZ$!1=a>3x!y{p#8}ciTlCM% zfYspl^1s4&kTXikR+f}sSNgFn#oLX~Ua;)S>dP(xD$?HyI`Rf=C4d9zweUMYIHl)6 zc~M8d9BoHD59=u@`$B%xIkQ&7AmGG*8ovvt;2!~hF8JcPN|nAPo&F^F1>n0u4aM(C z^XE{xr{FIJ{|fNCo$2#83I$|eEBImX7d!d>wEi&o1K3JuuryTvT7K5v(dnMDIww3ySGx(pP3>E*jG=Bs5t>9CBHvg71e*pY8@G;b;`8THd zyQkojPO3{vkD=KpEX*uN{vA?}3%q$K=aZ20lHAF{bYAzS^D4wxas)Cof7rIJO!F@T z|G6A|7m_rC{}lK;oay1u{4Hr6J&>7$aV}eVsXWiYPU2JBD)c(+Bt09_maw5 z_B@(ubV<{7yUn z4)A{kKHZzK^Y^9GTi~ApUo0_H+v!d79|V6E#`>F`>GRjx`uBt10RB=Zzb~Esb?`q2 z{t_oYkmjETzZ?8q_RT|c>H}Y_WR!jD)9Gu#kAN?p^H==q()wS&((fk2Y(^> ztDNcYN$Woi{te*gnrG%=j=kpRsT3YcOSj+rW;_2H@B`qB_bQbC+NAzwBIY}9Drtz6)Hjw?HkK@0QQ}%rQof?3 zY(+`2IQQ5CJ(bXd>aqjYp7Srg82J}{yTEuXZ#3`40%N4$QaVw{n{yT3=x8sx*@z^=#;+gK|$g4Ee{HFB(Xo#!M6>K372GuYa%#Q-{;`liS~CraD_qy z^*s){9z=nz@l*K2N2w^$y|_k6L0$V8z%?5ROpIg9r+cLozQy*b`=H|57I6Jr3Y^TS zG(|FllNr0YpmcwN0xrFXpzfzGWW@?U#`jN@-EEwnVf&jQ@@{Cle7FxN$_H_g6tDY; z_y$ghdwn9V>^#Nsi2SrufK`2xUxNOe>k{c1<^4+?gqf&*dz0EnMH#AF=vfODk$BDwnwXMa+Fq zRb@qGO@(`r#52=nixr@kl&cDJ2+-Gb)c4{XFur;L#Cctc0b6( zXB(=&Wa7n!YDby)S%zwVnfTd;YUi2w#|+gUGI5L!svaGT0(?!;l@%{B8nV=D0lsk4 zmK86vzuV|g4{y%3$Dd3bSBNW}h&(R9;HSRJ=j0aPuBEHii75H`#?foD;UBlhIVZQk zINwm?TP9v^Wb0oA_(G2wk22*kT6Q`Sd0c=m{WN67)o7YdL&H*`@qQ|e$RirZ^HEv5 z#6|Qpm!9Gvd_==9W?ao1Dh1uc$b&t*{1V||&{!$($$sbsPWsh+BvTp2Rv|yxpSyu) zv;S!!f3D%;`c?TJX8d9ef0OY`G<;0p7a9*}_D`_l}A{u#!-8h#7o ztr||>_aZ%Q8cz3f3GdMG=NaFi;qNhitA>{rNIjhzPR}!u{(y#?jQ42xUojrm@b5C- zr{S+LZfW>Oj1Oq|A~YDX=WY#O$M|*)-@^EP8ornDof>|G@%uHL?rl=OyEOa)ETjm3 zP{SJ;->u;x#`kFWml)rx;Xh#faSeZi@h3IB5DPi7=V=YUlJR{S-p2TT4ZoA|0~-DW zzE{I{F#f29?_>P0HT(_6AJgzzI3XZ=9@lU;<41{IA&_rGEhyaAo+i zV|gblU~&a;vi~JMA+KP372{8{elO#lj5mviB=F27<99K>nC0(f{3keZcF`9lI~ic| zRmf{gNx?Y?d@gac@%d;D`9E^Ln_N;cn`N92hh)>g68I%-gOhX#yv%r+FA!YD%)1yr z$+)VQokD+^v7H@E&&^R7X8Ac+Sq4#t*RH zy1C@}u%Gn*kjLSh8LwviCp=H7{=OPGeTTcDQwpkQhyyJDCJQcRJ$Es#=ew8j{ajzl zSFZu5@lzki?ni$tL%#cXK4taBDC@b0>-S1#OfdexczovOXk3Q!kRIJ{mB7glx3M3T zo(AB`HkBvQpujOMxg;8t#OP-|mvTS4iSdyfdOi++QNAUtN99$;ct6{(+O5g>X7;nH z$DN3)w49|N-(h)u9(*;2e3IqM(eEjUXPrSmfw+qRE!5KZpkWkU4V=pL3fo`7GIue4 z0{)_m7-=qWQ!xnvxtEh0PtJlpr+|AF;n!_JxC1Fi=rnS%*)rXA?5 zYgTq$BpUDUis$6lLw~3juMy>xxW*q1hw&m(P62nNr)hO#yFV7{vvLa6if{DiWY-4= ztY8GMMdg&J_HDU6C$nZ#EZCQmTN|8`?XEJZZnj3Ey&+#Xrxtg0ug~)Ls5(8P9A4ov zyP{{-M{>bw%5_DzOe^2u6mm;tF?t1DSBK1IWED{YY|x=r5{rM`x>bz?^k%Zx_CQ^;0} zEj*y`41L4Ra@N+qDSA+qlnTcEzNy4G(=NO(7z=ji_8({36@%azrTToaVC0Naq-%-- z)W`y01ClccvS~42WYZMtSSsE(Wu~=urs(~6S2A}Y>bMrf41=vXrl?qzHSO-f3NgY5 zf)-jVCJM71^U7vy=nug9dw|VN9LzOzA4qJ#ERVX-ig5Te4=_lC{&8tedvvHPe=? zpSI-EX-Za`nC0Xgd!|Z)=yYodqSLJ=h)%bjAUfTOg6MQ>3Zm1kDu_k>UrWg2!AQ(#2&XAcRi1U%W51~Br)aJc+jY@;%hp7DdD;5i=4!cl7p=9$ zj#ufE33qiQxJ7ZJG1ybjrzH?=yIyR{HI=k9*DcMZ;wWpTN;Dmr^d?*=RWsFQbSs_A zwX}A*JsxNmH5}dA(gqi9?l9Y{VM8$BvwZLzw%$@{zz+$&+gt~K({5zawRQ5#2g*zK zrf0r2VjDBF1zV!6?6tbXzD@CVt`02?3g4TqtnAxAv;O?;*zK%3*iGtqT9 z>I+W8(h1!>Y+_7+%X&i|$7!@1<3}(;d+eE^?v@Sl7~}zk;wIM0_#8${huidE13WCr z`h)Pcrw*Ip(OMgu*`XD|`8Cq>a+kenml5^t=x`HhV!_K@r0`wotTN8MRSO9G6|l zLV4ZAo^s@fik%qIRQe-nn5G~pYBxUHw=@o+abfmI@9CFW!*WMN-KDu}HcOjQz4AY> zHKLv`_DR$rnt2_26sC=@5tT;6f*iojj@3->FJgx zZZQIoKV$O3pmXNpiHkD7eyRzzUVXAhDC~-33}bzAh=zq2uk?w+-t1CyfZR>eAMY34 zLY920=IxeqvKwc!vInG_J`E}!44#;sF=mR&_ z)Tq+!g|4BCN~W!4ClzTbkGLx*kNs20%PCXe_ms1Au4Qr;(C#z5gwyuqMOPNXm{^a? zt|Ko zqXc}^7q*NFnwX6W99C?K@Y#>^r0fy!*_dn0??*n$OgOj1_%5> z+&4iPvHTQT<&7YzLmeY?UvCKNr9uqIMg?v{(Y+ygqw7EUmu|=9;fKd!MNsb>D9X2u znJZ=O2o5gA504bu>FWz5S5cRY+JDva8VabxfiwLEPOqqXjz-DjG1QFEf|xVCde1>o zSB5k_bCwxyLiCS#_eGU|FXyjl4U5lWs@v}ajz{9`@*m^$itc5_WFz@mrRUp}2Hgjx zBr1RPeubjy{UeBoKsub^4n*kP9+h6bhoNXa3oHAToTB%DPwxt;xO!hh(e0d`>?b>w z{R|t!I3S;@^y?@v*B+{(4{SLq)GMm|yc?Hkd2 zLz-_lLqZ0<{`UZOrgw2Vn`#bM_qi4QwwAsD&;3wPRLMy+eV<(6`@nGKuij5lR6U21 zEB*i0(s%OBZbcu$^KH(c@>SULIB@1a;gTFh@i<^c(Eax!xRhSizk2RY(FX1hN{LGy zF#R#8Grf9$Mp61kq%-LGzoDg9@7X9y-#K&!)&3OrE)JaetM_pfU9JR~YUUV!0!}Vg z#Z=FU7O$2GbbqV-6)k{5JgR4>SMT?fb9yBwwWZs?!b_2!+P=zPy$9q{`E$i6H>h;V zuBVWe%B0e(_k}8NkU1We#Qv+&D_V}k&h$nni?&Is`l(W&(y91GNKBZ@zoAod$~k?X zVsL^6rixt3`By4{sY-v9hLf!noYZc+k|q9nIsXBEo`)V!p|MigugZnT#ckU~LjE(t f4^Hi-LCX -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - // int findPeakElement(vector& nums) { //O(N) - // int n = nums.size(); - - // if(n == 1) return 0; - - // else if(n == 2) { - // int x = (nums[0] >= nums[1]) ? 0 : 1; - // return x; - // } - - // else { - // if(nums[0] >= nums[1]) return 0; - - // if(nums[n-1] >= nums[n-2]) return n-2; - - // for(int i = 0; i < n-1; i++) { - // if(arr[i] >= arr[i-1] and arr[i] >= arr[i+1]) return i; - // } - // } - - // } - - int findPeakElement(vector& nums) { - int n = nums.size(); - int low = 0; - int high = n-1; - - if(nums.size() == 1) return 0; - - while(low <= high) { - int mid = low + (high - low) / 2; - - if(mid == 0 or nums[mid] >= nums[mid-1] and (mid == nums.size()-1 or nums[mid] >= nums[mid+1])) { - return mid; - } - - else if(nums[mid] <= nums[mid+1]) { - low = mid + 1; - } - else { - high = mid - 1; - } - } - - return -1; - } - -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - int n; - cin >> n; - - vector nums(n); - - for(int i = 0; i < n; i++) { - cin >> nums[i]; - } - - Solution ans; - - cout << ans.findPeakElement(nums); - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int firstUniqChar(string s) { - - vector count(26, 0); - - for(char c : s) { - count[c - 'a'] += 1; - } - - for(int i = 0; i < s.length(); i++) { - - if(count[s[i] - 'a'] == 1) return i; - - } - - return -1; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - string s; - - getline(cin, s); - - Solution ans; - - cout << ans.firstUniqChar(s); - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - -/** - * 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) {} - * }; - */ - -// Morris Traversal - -class Solution { -public: - void flatten(TreeNode* root) { - - TreeNode* curr = root; - TreeNode* prev = NULL; - - while(curr != nullptr) { - - if(curr->left != nullptr) { - prev = curr->left; - while(prev->right) - prev = prev->right; - prev->right = curr->right; - curr->right = curr->left; - curr->left = nullptr; - } - curr = curr->right; - } - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -int flipBits(int* arr, int n) { - - int count = 0; - int MaxCount = 0; - int x = 0; - - for(int i = 0; i < n-1; i++) { - if(arr[i] == 0) { - count++; - } - - else { - count--; - x++; - } - - if(count > MaxCount) MaxCount = count; - if(count < 0) count = 0; - } - - - return MaxCount + x; - - -} - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - int arr[n]; - - for(int i = 0; i < n; i++) { - cin >> arr[i]; - } - - cout << flipBits(arr, n) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - #include - #include - using namespace __gnu_pbds; - using namespace std; - #define ff first - #define ss second - #define endl "\n" - #define ll long long - #define ld long double - #define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) - #define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) - #define pb push_back - #define mp make_pair - #define pii pair - #define vi vector - #define mii map - #define ump unordered_map - #define pqb priority_queue - #define pqs priority_queue > - #define setbits(x) __builtin_popcountll(x) - #define zrobits(x) __builtin_ctzll(x) - #define mod 1000000007 - #define inf 1e18 - #define ps(x, y) fixed<>x; while(x--) - // mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); - typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - - void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ - } - - - int flipBits(int* arr, int n){ -int count=0, maxcount=0, x=0; - - for(int i=0; imaxcount) - - maxcount=count; - - if(count<0) - - count=0; - - } - - return maxcount+x; - } - - - - - - - - - int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - cin >> n; - - int arr[n]; - for(int i = 0; i < n; i++) { - cin >> arr[i]; - } - - cout << flipBits(arr, n) << endl; - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { - int cnt = 0; -public: - - void inorder(TreeNode* root, int max) { - if(root == nullptr) return; - - if(max < root -> val) { - max = root -> val; - } - - inorder(root -> left, max); - - if(root -> val >= max) { - cnt++; - max = root -> val; - } - - inorder(root -> right, max); - - } - - int goodNodes(TreeNode* root) { - int max = root -> val; - - inorder(root, max); - - return cnt; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int hammingWeight(uint32_t n) { - long long int x = (uint32_t)n; - - int count = 0; - - while(x) { - x = x & x - 1; - count++; - } - - return count; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - vector inorderTraversal(TreeNode* root) { - stack st; - TreeNode* node = root; - - vectorinorder; - - while(true) { - if(node != nullptr) { - st.push(node); - node = node -> left; - } - - else { - if(st.empty() == true) break; - node = st.top(); - st.pop(); - inorder.push_back(node -> val); - node = node -> right; - } - } - - return inorder; - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -#include -using namespace std; - - - -vector split(string s) { - string ans = ""; - vector v; - for(int i = 0; i < s.size(); i++) { - if(s[i] == 32) { - v.push_back(ans); - ans = ""; - } else { - ans += s[i]; - } - } - v.push_back(ans); - return v; -} - -string process(string s) { - string ans = ""; - for(int i = 0; i < s.size(); i++) { - if(s[i] >= 'a' && s[i] <= 'z' or s[i] >= 'A' && s[i] <= 'Z' or s[i] >= '0' && s[i] <= '9' ) { - ans += s[i]; - } - } - return ans; -} - -string StringChallenge(string sen) { - - vector v = split(sen); - - for(int i = 0; i < v.size(); i++) { - v[i] = process(v[i]); - } - sort(v.begin(), v.end(), [&](string a, string b) { - return a.size() > b.size(); - }); - - return v[0]; - -} - - - -int main(void) { - - string temp = "hello wrold &hdjlnv"; - cout << StringChallenge(temp); - return 0; - -} \ No newline at end of file diff --git a/invertTree.cpp b/invertTree.cpp deleted file mode 100644 index 6996a76..0000000 --- a/invertTree.cpp +++ /dev/null @@ -1,101 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - void help(TreeNode* root) { - if(root == nullptr) return; - - help(root -> left); - help(root -> right); - - swap(root -> left, root -> right); - } - - TreeNode* invertTree(TreeNode* root) { - help(root); - - return root; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool isPowerOfTwo(int n) { - if(n <= 0) return false; - - return(n&(n-1)) == 0; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - Solution s; - - cout << s.isPowerOfTwo(n) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - bool isSameTree(TreeNode* p, TreeNode* q) { - if(p == nullptr or q == nullptr) return (p == q); - - return (p -> val == q->val) and isSameTree(p -> left, q -> left) and isSameTree(p -> right, q -> right); - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - bool ans = false; - - bool match(TreeNode* root, TreeNode* subRoot) { - if(root != nullptr and subRoot != nullptr) { - bool a = match(root -> left, subRoot -> left); - bool b = match(root -> right, subRoot -> right); - - if((root -> val == subRoot -> val) and a and b) return true; - - else return false; - } - - else if(root == nullptr and subRoot == nullptr) return true; - - else return false; - } - - void inorder(TreeNode* root, TreeNode* subRoot) { - if(root != nullptr) { - inorder(root -> left, subRoot); - - bool x = match(root, subRoot); - - if(x) { - ans = x; - } - - inorder(root -> right, subRoot); - - } - - } - - bool isSubtree(TreeNode* root, TreeNode* subRoot) { - inorder(root, subRoot); - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - kids - - - - - - - - - - - - - - - -

- - - - - -
-
- MEN -
-
- - - -
-
-
- WOMEN -
-
- - - -
-
-
- TEEN -
-
- - -
-
-
- KIDS -
-
- - - -
-
-
-
- LogIn/SignUp - About Us -
- -
- - - - - - -
-
Home / Casual Shirts For Men
-
- Casual Shirts For Men - 8563 items -
- -
-
-
FILTERS
-
-
-

Brands

- - -
- -
- -
- -
- -
- -
-
- -
-

Price

- -
- - -
- -
- -
- -
-
- - -
-
- -
-
- -
-
-
-
-
- - - - - - - - - - -
- - - - - - - - - - diff --git a/kthSmallest.cpp b/kthSmallest.cpp deleted file mode 100644 index 5d6d3c2..0000000 --- a/kthSmallest.cpp +++ /dev/null @@ -1,88 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int kthSmallest(vector>& matrix, int k) { - priority_queue pq; - for(int i=0; i < matrix.size(); i++) { - for(int j = 0; j < matrix[0].size(); j++) { - pq.push(matrix[i][j]); - if(pq.size() > k) - pq.pop(); - } - } - - return pq.top(); - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - // * 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) {} - }; - -class Solution { -private: - - int res; - -public: - - /*void inorder(TreeNode*root, int& k) { - if(not root) return; - - inorder(root -> left, k); - if(--k == 0) res = root -> val; - inorder(root -> right, k); - - } - - int kthSmallest(TreeNode* root, int k) { - - inorder(root, k); - - return res; - - }*/ - - - int kthSmallest(TreeNode* root, int k) { - stack s = new LinkedList<>(); - - while(true) { - while(not root) { - s.push(root); - root = root -> left; - } - - root = s.pop(); - if(--k == 0) return root -> val; - root = root -> right; - } - } - -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int lastStoneWeight(vector& stones) { - priority_queue pq; - - for(int i=0; i 1) { - int x = pq.top(); - pq.pop(); - int y = pq.top(); - pq.pop(); - - if(x > y) pq.push(x-y); - } - - return pq.empty() ? 0 : pq.top(); - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - int n; - cin >> n; - - vector stones(n); - - for(int i = 0; i < n; i++) { - cin >> stones[i]; - } - - Solution ans; - - cout << ans.lastStoneWeight(stones) << endl; - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int lengthOfLIS(vector& nums) { - - - - /*int ans = 1; - - int n = nums.size(); - - vector dp(n, 1); - - for(int i = 0; i < n; i++) { - for(int j = i - 1; j >= 0; j--) { - if(nums[j] < nums[i]) { - dp[i] = max(dp[i], dp[j] + 1); - ans = max(ans, dp[i]); - } - } - } - - return ans;*/ - - - - vector res; - - for(int i = 0; i < nums.size(); i++) { - auto it = lower_bound(res.begin(), res.end(), nums[i]); - if(it == res.end()) res.push_back(nums[i]); - else *it = nums[i]; - } - - return res.size(); - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int lengthOfLongestSubstring(string s) { - - int count[256] = {0}; - int l = 0; - int r = 0; - int ans = 0; - - while(r < s.length()) { - count[s[r]]++; - while(count[s[r]] > 1) { - count[s[l]]--; - l++; - } - - ans = max(ans, r-l+1); - r++; - } - - return ans; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - void permute(string s, int i, string temp, vector& ans) { - // Base Case - - if(i >= s.length()) { - ans.push_back(temp); - return; - } - - if(s[i] >= '0' and s[i] <= '9') { - temp.push_back(s[i]); - permute(s, i+1, temp, ans); - } - - else { - temp.push_back(tolower(s[i])); - permute(s, i+1, temp, ans); - - // Backtrack - - temp.pop_back(); - - temp.push_back(toupper(s[i])); - permute(s, i+1, temp, ans); - } - - } - - vector letterCasePermutation(string s) { - vector ans; - - permute(s, 0, "", ans); - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - - Document - - -
- - -
-
-
-

Welcome Back!

-

To keep shopping please login with your personal info

- -
-
-

Hello, Customer!

-

Enter your personal details and start shopping.

- -
-
-
-
- - - - diff --git a/longestCommonPrefix.cpp b/longestCommonPrefix.cpp deleted file mode 100644 index 6fddc94..0000000 --- a/longestCommonPrefix.cpp +++ /dev/null @@ -1,95 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - string longestCommonPrefix(vector& strs) { - - string ans = ""; - - int n = strs.size(); - - if(n == 0) return ans; - - sort(begin(strs), end(strs)); - - string a = strs[0]; - string b = strs[n - 1]; - - for(int i = 0; i < a.size(); i++) { - if(a[i] == b[i]) ans += a[i]; - else break; - } - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - bool isValid(int i, int j, int n, int m, vector>& grid) { - if(i >= 0 and i < n and j >= 0 and j < m and grid[i][j] == 1) - return true; - - return false; - } - - void dfs(vector>& grid, int i, int j, int n, int m, int &area) { - - area++; - grid[i][j] = 0; - - if(isValid(i+1, j, n, m, grid)) { - dfs(grid, i+1, j, n, m, area); - } - if(isValid(i-1, j, n, m, grid)) { - dfs(grid, i-1, j, n, m, area); - } - if(isValid(i, j+1, n, m, grid)) { - dfs(grid, i, j+1, n, m, area); - } - if(isValid(i, j-1, n, m, grid)) { - dfs(grid, i, j-1, n, m, area); - } - - } - - int maxAreaOfIsland(vector>& grid) { - - int n = grid.size(); - int m = grid[0].size(); - int ans = 0; - - for(int i = 0; i < n; i++) { - for(int j = 0; j < m; j++) { - if(grid[i][j] == 1) { - int area = 0; - dfs(grid, i, j, n, m, area); - ans = max(ans, area); - } - } - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int maxProduct(vector& nums) { - int maxp = INT_MIN, prod = 1; - - for(int i = 0; i < nums.size(); i++) { - prod *= nums[i]; - maxp = max(maxp, prod); - if(prod == 0) prod = 1; - } - - prod = 1; - - for(int i = nums.size()-1; i >= 0; i--) { - prod *= nums[i]; - maxp = max(maxp, prod); - if(prod == 0) prod = 1; - } - - return maxp; - - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int maxSumSubmatrix(vector>& matrix, int k) { - int res = INT_MIN, rows = matrix.size(), cols = matrix[0].size(); - for(int l = 0; l < cols; l++) { - vector sums(rows); - for(int r = l; r < cols; r++) { - for(int i = 0; i < rows; i++) - sums[i] += matrix[i][r]; - sets = {0}; - int run_sum = 0; - for(int sum : sums) { - run_sum += sum; - auto it = s.lower_bound(run_sum - k); - if(it != end(s)) - res = max(res, run_sum - *it); - s.insert(run_sum); - } - } - } - return res; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -int maxSumRectangle(vector>& arr, int n, int m) { - - int curr=0; - int maxSum=0; - - for(int i=0;i -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - -/************************************************************ - - Following is the linked list node structure. - - template - class Node { - public: - T data; - Node* next; - - Node(T data) { - next = NULL; - this->data = data; - } - - ~Node() { - if (next != NULL) { - delete next; - } - } - }; - -************************************************************/ - - -Node* sortTwoLists(Node* first, Node* second) { - // Write your code here. - - if(first == NULL) return second; - if(second == NULL) return first; - - Node* head; - - if(first->data <= second->data){ - head = first; - head->next = sortTwoLists(first->next, second); - } - else { - head = second; - head->next = sortTwoLists(first, second->next); - } - - return head; -} - - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - TreeNode* merge(TreeNode* t1, TreeNode* t2) { - - if(t1 == nullptr and t2 == nullptr) - return nullptr; - - if(t1 == nullptr and t2 != nullptr) - return t2; - if(t1 != nullptr and t2 == nullptr) - return t1; - - TreeNode* sum = new TreeNode(t1->val+t2->val); - - sum -> left = merge(t1 -> left, t2 -> left); - sum -> right = merge(t1 -> right, t2 -> right); - - return sum; - - } - - TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) { - - return merge(root1, root2); - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - - int minCostClimbingStairs(vector& cost, int idx, vector &memo) { - if(idx == cost.size()-1 or idx == cost.size()-2) - return cost[idx]; - if(memo[idx] != 0) - return memo[idx]; - int x = minCostClimbingStairs(cost, idx+1, memo); - int y = minCostClimbingStairs(cost, idx+2, memo); - - memo[idx] = min(x, y) + cost[idx]; - - return memo[idx]; - } - - int minCostClimbingStairs(vector& cost) { - if(cost.size() == 2) - return min(cost[0], cost[1]); - vector memo(1001); - - int x = minCostClimbingStairs(cost, 0, memo); - int y = minCostClimbingStairs(cost, 1, memo); - - return min(x, y); - } - -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int n; - cin >> n; - - vector cost(n); - - for(int i = 0; i < n; i++){ - cin >> cost[i]; - } - - Solution ans; - - cout << ans.minCostClimbingStairs(cost) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int minRefuelStops(int target, int startFuel, vector>& stations) { - int i = 0; - int res; - - priority_queuepq; - - for(res = 0; startFuel < target; res++) { - while(i < stations.size() and stations[i][0] <= startFuel) - pq.push(stations[i++][1]); - if(pq.empty()) return -1; - startFuel += pq.top(), pq.pop(); - } - - return res; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int minSubArrayLen(int target, vector& nums) { - long long sum = 0; - int len = INT_MAX; - - int left = 0; - - for(int i = 0; i < nums.size(); i++) { - sum += nums[i]; - if(sum >= target) len = min(len, i+1); - while(left < nums.size() and (sum - nums[left]) >= target) { - sum -= nums[left]; - left++; - len = min(len, i-left+1); - } - } - - return (len == INT_MAX) ? 0 : len; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - -class Solution { -public: - string minWindow(string s, string t) { - - int n = s.length(); - int m = t.length(); - - int len = n; - - map mp; - - for(int i = 0; i < m; i++) { - mp[t[i]]++; - } - - int cnt = mp.size(); - - string ans = ""; - - int i = 0; - int j = 0; - - while(j < n) { - if(mp.find(s[j]) != mp.end()) { - mp[s[j]]--; - if(mp[s[j]] == 0) cnt--; - } - if(cnt == 0) { - while(cnt == 0) { - if(mp.find(s[i]) != mp.end() and mp[s[i]] < 0) { - mp[s[i]]++; - i++; - } - - else if(mp.find(s[i]) != mp.end() and mp[s[i]] == 0) - break; - else i++; - } - if(len >= j-i+1) { - ans = s.substr(i, j-i+1); - len = j-i+1; - } - } - j++; - } - - return ans; - - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int mirrorReflection(int p, int q) { - int m = 1; - int n = 1; - - while (m*p != n*q) { - n++; - m = n*q/p; - } - - if(m%2 == 0 and n%2 == 1) return 0; - if(m%2 == 1 and n%2 == 1) return 1; - if(m%2 == 1 and n%2 == 0) return 2; - - return -1; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int p, q; - cin >> p >> q; - - Solution ans; - cout << ans.mirrorReflection(p, q) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -/*int rec(int days, int prevActivity, int n, vector> &points) { - if(days > n) { - return 0; - } - - int ans = 0; - for(int i = 1; i <= 3; i++) { - if(i == prevActivity) continue; - - int smallAns = points[days - 1][i - 1] + rec(days+1, i, n , points); - ans = max(ans, smallAns); - } - - return ans; -} - - -int ninjaTraining(int n, vector> &points) { - - // Activity -> 1, 2, 3 - return rec(1, 0, n, points); - - -}*/ - -// [i][j] -> Merit points on ith day using jth activity - - - -int rec(int days, int prevActivity, int n, vector> &points, vector> &dp) { - if(days > n) { - return 0; - } - - // If ans is available - - if(dp[days][prevActivity] != -1) return dp[days][prevActivity]; - - int ans = 0; - for(int i = 1; i <= 3; i++) { - if(i == prevActivity) continue; - - int smallAns = points[days - 1][i - 1] + rec(days+1, i, n , points, dp); - ans = max(ans, smallAns); - } - - return dp[days][prevActivity] = ans; -} - - -int ninjaTraining(int n, vector> &points) { - - // Activity -> 1, 2, 3 - - vector> dp(n+1, vector(4, -1)); - - - return rec(1, 0, n, points, dp); - - -} - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool sorted(vector& a, vector& b) { - if(a[0] == b[0]) return a[1] > b[1]; - - return a[0] < b[0]; - } - - int numberOfWeakCharacters(vector>& properties) { - sort(properties.begin(), properties.end(), sorted); - int ans = 0, maxDiffVal = INT_MIN; - - int n = properties.size(); - for(int i = n-1; i >= 0; i--) { - if(properties[i][1] < maxDiffVal) { - ans++; - } - if(properties[i][1] > maxDiffVal) { - maxDiffVal = properties[i][1]; - } - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { - vector ans; -public: - - int countDigit(int n) { - int cnt = 0; - while(n > 0) { - cnt++; - n = n / 10; - } - - return cnt; - } - - void findNumber(int num, int n, int k) { - if(countDigit(num) == n) { - ans.push_back(num); - return; - } - - for(int i = 0; i <= 9; i++) { - - int l = num % 10; - - if(abs(l - i) == k) { - int number = num*10+i; - findNumber(number, n, k); - } - } - } - - vector numsSameConsecDiff(int n, int k) { - for(int i = 1; i <= 9; i++) { - findNumber(i, n ,k); - } - - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* oddEvenList(ListNode* head) { - ListNode* oddH = nullptr, *oddT = nullptr, *evenH = nullptr, *evenT = nullptr; - int cnt = 1; - - while(head != nullptr) { - if(cnt%2 == 0) { - if(evenH == nullptr){ - evenH = head; - evenT = head; - head = head -> next; - } - - else { - evenT -> next = head; - evenT = evenT -> next; - head = head -> next; - } - } - - else { - if(oddH == nullptr) { - oddH = oddT = head; - - head = head -> next; - } - - else { - oddT -> next = head; - oddT = oddT -> next; - head = head -> next; - } - } - cnt++; - } - - if(oddH == nullptr) { - return evenH; - } - - if(evenH == nullptr) { - return oddH; - } - - evenT -> next = nullptr; - oddT -> next = evenH; - - return oddH; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - Offers Available - - - - - - -
-
-
- - Seller_Profile_Picture - -

Alexander Hipp

-
- -
- - Your Profile - Product List - Offers - Available - Current Orders - Completed Orders - -
-
- -
-
-

- Offers Available -

-
-
- -
- -
-

Offer 1

-
-
-

Offer 2

-
-
-

Offer 3

-
-
-

Offer 4

-
-
-

Offer 5

-
-
-

Offer 6

-
- -
-
-
- - - - - \ No newline at end of file diff --git a/orangesRotting.cpp b/orangesRotting.cpp deleted file mode 100644 index 4ac0dea..0000000 --- a/orangesRotting.cpp +++ /dev/null @@ -1,117 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int orangesRotting(vector>& grid) { - if(grid.empty()) return 0; - - int m = grid.size(), n = grid[0].size(), days = 0, tot = 0, cnt = 0; - - queue> rotten; - - for(int i = 0; i < m; i++) { - for(int j = 0; j < n; j++) { - if(grid[i][j] != 0) tot++; - if(grid[i][j] == 2) rotten.push({i, j}); - } - } - - int dx[4] = {0, 0, 1, -1}; - int dy[4] = {1, -1, 0, 0}; - - while(not rotten.empty()) { - int k = rotten.size(); - - cnt += k; - - while(k--) { - int x = rotten.front().first; - int y = rotten.front().second; - rotten.pop(); - - for(int i = 0; i < 4; i++) { - int nx = x + dx[i]; - int ny = y + dy[i]; - if(nx < 0 or ny < 0 or nx >= m or ny >= n or grid[nx][ny] != 1) continue; - grid[nx][ny] = 2; - rotten.push({nx, ny}); - } - - } - - if(not rotten.empty()) days++; - } - - return tot == cnt ? days : -1; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - vector> pacificAtlantic(vector>& matrix) { - - vector>ans; - if(matrix.size()<1)return ans; - vector>pacific(matrix.size(),vector(matrix[0].size(),0)); - vector>atlantic(matrix.size(),vector(matrix[0].size(),0)); - - for(int col=0;colv(2); - v[0]=i; - v[1]=j; - ans.push_back(v); - } - } - } - - - - return ans; - } - - void fnc(vector>& matrix,int i, int j,int prev,vector>& ocean) - { - if(i<0 || j<0 || i>=matrix.size() || j>=matrix[0].size()) - return; - if(ocean[i][j]==1) - return; - if(matrix[i][j] -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - vector> generate(int numRows) { - vector>rows(numRows); - for(int i = 0; i < numRows; i++) { - for(int j = 0; j <= i; j++) { - rows[i].push_back(j > 0 and j < i ? rows[i-1][j] + rows[i-1][j-1] : 1); - } - } - - return rows; - } -}; - - -int main(int argc, char const *argv[]) -{ - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector> permute(vector& nums) { - - if(nums.size() <= 1) { - return {nums}; - } - - vector> res; - - for(int i = 0; i < nums.size(); i++) { - vector v(nums.begin(), nums.end()); - v.erase(v.begin()+i); - - auto ans = permute(v); - - for(int j = 0; j < ans.size(); j++) { - vector _v = ans[j]; - _v.insert(_v.begin(), nums[i]); - res.push_back(_v); - } - } - - return res; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/* -// Definition for a Node. -class Node { -public: - int val; - Node* left; - Node* right; - Node* next; - - Node() : val(0), left(NULL), right(NULL), next(NULL) {} - - Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {} - - Node(int _val, Node* _left, Node* _right, Node* _next) - : val(_val), left(_left), right(_right), next(_next) {} -}; -*/ - -class Solution { -public: - Node* connect(Node* root) { - if(root == NULL) return NULL; - queueq; - q.push(root); - - while(not q.empty()) { - int n = q.size(); - - Node* prev = NULL; - for(int i = 0; i < n; i++) { - auto top = q.front(); - - q.pop(); - - top -> next = prev; - - prev = top; - - if(top -> right) { - q.push(top -> right); - } - - if(top -> left) { - q.push(top -> left); - } - } - } - - return root; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - Products by category - - - - - - - - - - - - - - - - - - - - - - - - - -
-
- MEN -
-
- - - -
-
-
- WOMEN -
-
- - - -
-
-
- TEEN -
-
- - -
-
-
- KIDS -
-
- - - -
-
-
-
- LogIn/SignUp - About Us -
- -
- -
- -
-
-
- fila -
-
-
- -
- -
-
-
- fila -
-
-
- fila -
-
- fila -
-
- fila -
-
- fila -
-
- fila -
-
-
-
-

Product Details

-

+

-
-
-
-

Color

-

Grey

-
-
-

Outer material

-

PU

-
-
-

Model name

-

IZUNA

-
-
-

Ideal for

-

Men

-
-
-

Occasion

-

Sports

-
-
-

Sole material

-

IM EVA

-
-
-

Pack of

-

1

-
- -
-
-
-
-
-

Customer Reviews

-

Add Review

-

+

-
-
-
-
-

4*

-

Very lightweight and beautiful color loved it

-
-
-

Tulika Agarwal | 24 Mar 2022

-
-
- 7 -
-
- 2 -
-
-
-
-
-
-

4*

-

This is very faboulour shoes I like it

-
-
-

Priyanka Sharma | 22 Mar 2022

-
-
- 11 -
-
- 4 -
-
-
-
-
-
-

3*

-

Superrr 😍😍😍

-
-
-

Jamini Nagesh | 21 Mar 2022

-
-
- 3 -
-
- 1 -
-
-
-
-
-
-

4*

-

Superrr and Loved it 😍😍

-
-
-

Meghana Sheety | 20 Mar 2022

-
-
- 4 -
-
- 3 -
-
-
-
-
- View - More Reviews -
-
-
-
- -
-

PUMA

-

ZOD Runner NM Running Shoes For Men (Blue)

-
₹2,399
-
-

⭐⭐⭐⭐⭐

-

96

- reviews -
-
- -

- Choose Color

-
-
- fila -
-
- fila -
-
- gosto -
-
- -
-
-

- Choose your size -

- - -
-
-

XS

-

S

-

M

-

L

-

XL

-

XXL

-
-
-

Size Chart

- -
-
-
-
- deliver location -
-

Deliver to

-
-
- - -
-

-

-
- -
- -
-
-
-
ADD TO BAG
-
-
- - - -
-
-
-
-
-
- - -
-

Similar Products

-
- -
-
- adidas -
-
-

ADIDAS

-

Glarus M Running Sports Shoes For Men (Blue)

-
-
₹1,374
-

₹2,499

- 45% off -
-
-
- - - -
-
- adidas -
-
-

Ciffra

-

STUMPER Rnning Shoes For Men (Blue)

-
-
₹299
-

₹999

- 70% off -
-
-
- - - -
-
- adidas -
-
-

FILA

-

KARTO Sports Running Shoes For Men (Red)

-
-
₹1,047
-

₹2,499

- 58% off -
-
-
- - - -
-
- adidas -
-
-

PUMA

-

Softride Enzo NXT Running Shoes For Men (Black)

-
-
₹3,189
-

₹5,499

- 42% off -
-
-
- - - -
-
- adidas -
-
-

WROGN ACTIVE

-

Running Sports Shoes For Men (Maroon)

-
-
₹1,047
-

₹2,499

- 58% off -
-
-
- - - -
-
- adidas -
-
-

SKETCHERS

-

EQUALIZER 4.0 - GENERATION Casuals For Men (Navy)

-
-
₹3,299
-

₹5,499

- 40% off -
-
-
- - - -
-
- puma tree -
-
-

PUMA

-

Supertec Zero Running Shoes For Men (Green)

-
-
₹3,599
-

₹5,999

- 40% off -
-
-
- - - -
-
- puma Two -
-
-

PUMA

-

Zod Runner NM Running Shoes For Men (Blue)

-
-
₹2,399
-

₹3,999

- 40% off -
-
-
- -
-
- - -
-

Recently Viewed

-
-
-
- adidas -
-
-

PUMA

-

Zod Runner NM Running Shoes For Men (Grey)

-
-
₹2,399
-

₹3,999

- 40% off -
-
-
-
-
- - -
-
-

Add Review and Ratings

-
- -
- -
-
-

Rating

-
-

1

-

2

-

3

-

4

-

5

-
-
- -
- -
-
-
- - -
-
-
- - -
-
-
Size ChartClose
-
-
-
-

UK/India

-

Length (in cm)

-

Brand Size

-

Euro

-
-
-

3

-

23.5

-

3

-

36

-
-
-

5

-

25.4

-

5

-

38

-
-
-

4

-

24.4

-

4

-

37

-
-
-

7

-

27

-

7

-

40

-
-
-

6

-

26

-

6

-

39

-
-
-

9

-

28.5

-

9

-

42

-
-
-

8

-

27.9

-

8

-

41

-
-
-
-
-

Not sure about your shoe size? Follow these simple steps to - figure it out: -

-

1. Place your foot on a blank sheet of paper

-

2. Make one marking at your longest toe and one marking at the - backside of your heel -

-

3. Measure (in centimetres) the length of your foot between these - two markings -

-
-
- foot -
-
-
-
-
- - -
- - - - - - - - - - - \ No newline at end of file diff --git a/pruneTree.cpp b/pruneTree.cpp deleted file mode 100644 index 731ae30..0000000 --- a/pruneTree.cpp +++ /dev/null @@ -1,105 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - int helper(TreeNode* root) { - if(root == nullptr) return 0; - - if(root -> left == nullptr and root -> right == nullptr) { - if(root -> val == 0) return 0; - else return 1; - } - - int leftSubTreeOrder = helper(root -> left); - int rightSubTreeOrder = helper(root -> right); - - if(leftSubTreeOrder == 0) root -> left = nullptr; - - if(rightSubTreeOrder == 0) root -> right = nullptr; - - return leftSubTreeOrder + rightSubTreeOrder + (root -> val == 1 ? 1 : 0); - } - - TreeNode* pruneTree(TreeNode* root) { - if(helper(root) == 0) return nullptr; - - return root; - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - void dfs(TreeNode *root, vectorfreq, int& cnt) { - if(root == NULL) return; - - freq[root->val]++; - - dfs(root -> left, freq, cnt); - - if(root -> left == NULL and root -> right == NULL) { - int oddCnt = 0; - for(auto x: freq) { - if(x%2 == 1) { - oddCnt++; - } - - } - - if(oddCnt <= 1) { - cnt++; - } - } - - dfs(root -> right, freq, cnt); - } - - int pseudoPalindromicPaths (TreeNode* root) { - vectorfreq(10, 0); - int cnt = 0; - dfs(root, freq, cnt); - - return cnt; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - TMN - - - - - - - -
- - Submit -

-

Didn't get it?

- -
- - - - \ No newline at end of file diff --git a/removeNthFromEnd.cpp b/removeNthFromEnd.cpp deleted file mode 100644 index c0a700f..0000000 --- a/removeNthFromEnd.cpp +++ /dev/null @@ -1,103 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - ListNode* removeNthFromEnd(ListNode* head, int n) { - ListNode* start = new ListNode(); - start->next = head; - ListNode* fast = start; - ListNode* slow = start; - - for(int i = 0; i < n; i++) { - fast = fast->next; - } - - while(fast->next != NULL) { - fast = fast -> next; - slow = slow -> next; - } - - slow -> next = slow -> next -> next; - - return start -> next; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class UnionFind { - unordered_mapparent; - unordered_maprank; - -public: - - int cnt; - - UnionFind(vector> &stones) { - for(vector &stone: stones) { - int row = -(stone[0] + 1); - int col = stone[1] + 1; - parent[row] = row; - parent[col] = col; - } - cnt = parent.size(); - } - - int find(int x) { - if(parent[x] != x) { - parent[x] = find(parent[x]); - } - - return parent[x]; - } - - void union_(int x, int y) { - int xset = find(x); - int yset = find(y); - - if(xset == yset) return; - cnt--; - - if(rank[xset] < rank[yset]) parent[xset] = yset; - else if(rank[xset] > rank[yset]) parent[yset] = xset; - else { - parent[yset] = xset; - rank[xset] = rank[yset] + 1; - } - } - -}; - - -class Solution { -public: - int removeStones(vector>& stones) { - UnionFind uf(stones); - for(vector& stone: stones) { - int row = -(stone[0] + 1); - int col = stone[1] + 1; - uf.union_(row, col); - } - - return stones.size() - uf.cnt; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool reorderedPowerOf2(int n) { - int x = pow(10, 9); - map> mp; - - for(int i = 1; i <= x; i = i*2) { - int k = i; - vectorv(10, 0); - while(k) { - int r = k%10; - v[r]++; - k /= 10; - } - mp[i] = v; - } - - vector countOfDigitInN(10, 0); - - while(n) { - int r = n%10; - countOfDigitInN[r]++; - n = n/10; - } - - for(int i = 1; i <= x; i = i*2) { - vector tmp = mp[i]; - bool flag = 0; - for(int j = 0; j <= 9; j++) { - if(tmp[j] != countOfDigitInN[j]) - flag = 1; - } - if(flag == 0) - return 1; - } - return 0; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - uint32_t reverseBits(uint32_t n) { - uint32_t ans =0; - - for(int i=0;i<32;i++) - { - uint32_t lsb = n&1; - lsb = lsb<<(31-i); - ans = ans | lsb; - n = n >>1; - } - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int romanToInt(string s) { - long long res = 0; - - for(int i = s.length()-1; i >= 0; i--){ - if(s[i] == 'V') res += 5; - else if(s[i] == 'L') res += 50; - else if(s[i] == 'D') res += 500; - else if(s[i] == 'M') res += 1000; - - if(s[i] == 'I'){ - if(s[i+1] == 'V' or s[i+1] == 'X') res -= 1; - else res += 1; - } - - if(s[i] == 'X'){ - if(s[i+1] == 'L' or s[i+1] == 'C') res -= 10; - else res += 10; - } - - if(s[i] == 'C'){ - if(s[i+1] == 'D' or s[i+1] == 'M') res -= 100; - else res += 100; - } - } - - return res; - - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - - - - Recover - - -
-
-
Email verification
Enter the code we just send on your Email-id:
ecommerce.techmihirnaik@gmail.com -
-
Don't receive the code?Resend
-
-
- - - - diff --git a/search2DMatrix.cpp b/search2DMatrix.cpp deleted file mode 100644 index 7775b28..0000000 --- a/search2DMatrix.cpp +++ /dev/null @@ -1,101 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - bool searchMatrix(vector>& matrix, int target) { - - if(!matrix.size()){ - return false; - } - - int n=matrix.size(); //rows - int m=matrix[0].size(); //cols - - int lo=0; - int h= (n*m)-1; - - while(lo<=h){ - - - int mid= (lo +(h-lo)/2); - if(matrix[mid/m][mid%m]==target){ - return true; - } - - else if(matrix[mid/m][mid%m] < target){ - lo=mid+1; - }else{ - h=mid-1; - } - } - return false; - } - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< - - - - - - - Document - - - - - - - - - - -
- - -
-
-
-
-
- -
-
-
- -
- - -
- -
- - -
-
- -
- Not registered yet? Register here -
-
-
-
- -
-

- The best offer
- for your business -

-

- Sell with us. Earn profit with everything at ease. Maintain and track orders, receive payments - and manage your business -

-
- - -
-
-
- - - - diff --git a/seller-signup.html b/seller-signup.html deleted file mode 100644 index 266389c..0000000 --- a/seller-signup.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - - - - - Document - - - - - - - - - - -
- - -
-
-
-

- The best offer
- for your business -

-

- Sell with us. Earn profit with everything at ease. Maintain and track orders, receive payments - and manage your business -

-
- -
-
-
- -
-
-
- -
- - -
- -
- - -
- -
- - -
- -
- - -
- -
- -
- - Have an account? Sign In -
-
-
-
-
-
-
- - - - diff --git a/shortestPathBinaryMatrix.cpp b/shortestPathBinaryMatrix.cpp deleted file mode 100644 index e69de29..0000000 diff --git a/singleNumber.cpp b/singleNumber.cpp deleted file mode 100644 index 62a3139..0000000 --- a/singleNumber.cpp +++ /dev/null @@ -1,78 +0,0 @@ -#include -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int singleNumber(vector& nums) { - int ans=0; - for(auto x:nums) - ans^=x; - return ans; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * Definition for singly-linked list. - * struct ListNode { - * int val; - * ListNode *next; - * ListNode() : val(0), next(nullptr) {} - * ListNode(int x) : val(x), next(nullptr) {} - * ListNode(int x, ListNode *next) : val(x), next(next) {} - * }; - */ -class Solution { -public: - - - ListNode* sortList(ListNode* head) { - if(head == NULL || head ->next == NULL) - return head; - - - ListNode *temp = NULL; - ListNode *slow = head; - ListNode *fast = head; - - //middle of linked list - while(fast != NULL && fast -> next != NULL){ - temp = slow; - slow = slow->next; - fast = fast ->next ->next; - - } - temp -> next = NULL; - - ListNode* l1 = sortList(head); //2 - ListNode* l2 = sortList(slow); //1 - - return mergeTwoLists(l1, l2); - - } - - ListNode* mergeTwoLists(ListNode* head1, ListNode* head2) { - ListNode* fh = nullptr; - ListNode* ft = nullptr; - - while(head1 != nullptr and head2 != nullptr) { - - if(fh == nullptr and ft == nullptr) { - - if(head1 -> val > head2 -> val) { - fh = head2; - ft = head2; - head2 = head2 -> next; - } - - else { - fh = head1; - ft = head1; - head1 = head1 -> next; - } - - } - - if(head1 and head2) { - - if(head1 -> val < head2 -> val) { - ft -> next = head1; - ft = ft -> next; - head1 = head1 -> next; - } - - else { - ft -> next = head2; - ft = ft -> next; - head2 = head2 -> next; - } - } - - } - - if(head1 != nullptr) ft -> next = head1; - if(head2 != nullptr) ft -> next = head2; - - return fh; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - TreeNode* sortedArrayToBST(vector& nums) { - - if(nums.size() == 0) return nullptr; - - return bst(nums, 0, nums.size()-1); - } - - TreeNode* bst(vector& nums, int left, int right) { - if(left > right) return nullptr; - - int mid = left + (right - left)/2; - - TreeNode* node = new TreeNode(nums[mid]); - - node -> left = bst(nums, left, mid - 1); - node -> right = bst(nums, mid + 1, right); - - return node; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector spiralOrder(vector>& matrix) { - - int top = 0; - int bottom = matrix.size()-1; - int left = 0; - int right = matrix[0].size()-1; - vector ans; - - while(top <= bottom and left <= right) { - for(int i = left; i <= right; i++) { - ans.push_back(matrix[top][i]); - } - top++; - for(int i = top; i <= bottom; i++) { - ans.push_back(matrix[i][right]); - } - right--; - if(top <= bottom) { - for(int i = right; i >= left; i--) { - ans.push_back(matrix[bottom][i]); - } - bottom--; - } - if(left <= right) { - for(int i = bottom; i >= top; i--) { - ans.push_back(matrix[i][left]); - } - left++; - } - } - - return ans; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - vector> matrix = { - {1,2,3},{4,5,6},{7,8,9} - }; - - Solution s; - vector ans; - - ans = s.spiralOrder(matrix); - - for(int i = 0; i < ans.size(); i++) { - cout << ans[i] << " "; - } - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -using namespace std; - -class QueueStack{ -private: - queue q1; - queue q2; -public: - void push(int); - int pop(); -}; - - -int main() -{ - int T; - cin>>T; - while(T--) - { - QueueStack *qs = new QueueStack(); - - int Q; - cin>>Q; - while(Q--){ - int QueryType=0; - cin>>QueryType; - if(QueryType==1) - { - int a; - cin>>a; - qs->push(a); - }else if(QueryType==2){ - cout<pop()<<" "; - - } - } - cout< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - int subarraySum(vector& nums, int k) { - int count = 0; - int sum = 0; - mapmp; - - for(int i = 0; i > n; - vector nums(n); - int k; - - for(int i = 0; i < n; i++){ - cin >> nums[i]; - } - - cin >> k; - - Solution s; - - int result = s.subarraySum(nums, k); - - cout << result << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - - bool isSymmetric(TreeNode* root) { - return root == nullptr or isSymmetricHelp(root -> left, root -> right); - } - - bool isSymmetricHelp(TreeNode* left, TreeNode* right) { - if(left == nullptr or right == nullptr) - return left == right; - - if(left -> val != right -> val) - return false; - - return isSymmetricHelp(left -> left, right -> right) and isSymmetricHelp(left -> right, right -> left); - } -}; - - - - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - -class Solution { -public: - int leastInterval(vector& tasks, int n) { - unordered_map< char, int> freq; - - for(char c : tasks) { - freq[c]++; - } - - priority_queue pq; - - for(auto c : freq) { - pq.push(c.second); - } - - int result = 0; - - while(not pq.empty()) { - int time = 0; - - vector temp; - - for(int i = 0; i < n + 1; i++) { - if(not pq.empty()){ - temp.push_back(pq.top() - 1); - pq.pop(); - time++; - } - } - - for(auto t : temp){ - if(t) pq.push(t); - } - - result += pq.empty() ? time : n+1; - } - - return result; - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector> threeSum(vector& nums) { - - sort(nums.begin(), nums.end()); - - vector> res; - - for(int i = 0; i < nums.size(); i++) { - if(i == 0 or (i > 0 and nums[i] != nums[i - 1])) { - int lo = i+1; - int hi = nums.size()-1; - int sum = 0 - nums[i]; - - while(lo < hi) { - if(nums[lo] + nums[hi] == sum) { - vector temp; - temp.push_back(nums[i]); - temp.push_back(nums[lo]); - temp.push_back(nums[hi]); - res.push_back(temp); - - while(lo < hi and nums[lo] == nums[lo+1]) lo++; - while(lo < hi and nums[hi] == nums[hi-1]) hi--; - - lo++; hi--; - - } - - else if(nums[lo] + nums[hi] < sum) lo++; - else hi--; - } - } - } - - return res; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int threeSumClosest(vector& nums, int target) { - - sort(nums.begin(), nums.end()); - int diff = INT_MAX; - int ans = 0; - - for(int i = 0; i < nums.size(); i++) { - int first = nums[i]; - - int start = i+1; - int end = nums.size() -1; - - while(start < end) { - - if(first + nums[start] + nums[end] == target) return target; - - else if(abs(first + nums[start] + nums[end] - target) < diff) { - diff = abs(first + nums[start] + nums[end] - target); - ans = first + nums[start] + nums[end]; - } - - if(first + nums[start] + nums[end] > target) end--; - else start++; - } - } - - return ans; - - } -}; - - - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - -class Solution { -public: - vector topKFrequent(vector& nums, int k) { - unordered_map counts; - priority_queue, vector>, greater>> min_heap; - - for(auto i : nums) { - counts[i]++; - } - - for(auto & i : counts) { - min_heap.push({i.second, i.first}); - if(min_heap.size() > k) - min_heap.pop(); - } - - vector res; - while(k--) { - res.push_back(min_heap.top().second); - min_heap.pop(); - } - - return res; - - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector topKFrequent(vector& words, int k) { - unordered_map m; - - for(auto &w : words) { - m[w]++; - } - - struct Comp { - bool operator()(pair &a, pair &b) { - return (a.second > b.second) or (a.second == b.second and a < b); - } - }; - - using Node = pair; //Word, Freq - priority_queue, Comp> pq; - - for(auto &p : m) { - pq.push(p); - if(pq.size() > k){ - pq.pop(); - } - } - - vector ans; - - while(not pq.empty()) { - ans.push_back(pq.top().first); - pq.pop(); - } - - reverse(ans.begin(), ans.end()); - - return ans; - } -}; - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int minimumTotal(vector>& triangle) { - int n = triangle.size(); - - vector minlen(triangle.back()); - - for(int i = n-2; i >= 0; i--) { - for(int j = 0; j <= i; j++) { - minlen[j] = min(minlen[j],minlen[j+1]) + triangle[i][j]; - } - } - - return minlen[0]; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - vector twoSum(vector& nums, int target) { - vector arr(2,-1); - for (int i = 0; i < nums.size(); i++){ - for(int j = i+1; j < nums.size(); j++){ - if(nums[i]+nums[j] == target){ - arr[0] = i; - arr[1] = j; - } - } - } - - return arr; - } -}; - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - - - - - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - int uniqueMorseRepresentations(vector& words) { - - string table[] = { - ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.." - }; - - set differentTranformations; - - // convert each word into a transformation - - for(int i = 0; i < words.size(); i++) { - string transformedString = ""; - - for(char &curChar : words[i]) { - transformedString += table[(int)curChar - (int)97]; - } - - differentTranformations.insert(transformedString); - } - - // get only the difference transformation - - - // return the total number of different transformation - return differentTranformations.size(); - } -}; - - - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - -class Solution { -public: - - int f(int i, int j, vector> &dp) { - if(i == 0 and j == 0) return 1; - if(i < 0 or j < 0) return 0; - - if(dp[i][j] != -1) return dp[i][j]; - - int up = f(i-1, j, dp); - int left = f(i, j-1, dp); - - return dp[i][j] = up+left; - } - - int uniquePaths(int m, int n) { - vector> dp(m, vector(n, -1)); - return f(m-1, n-1, dp); - } -}; - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - int m, n; - cin >> m >> n; - - Solution result; - cout << result.uniquePaths(m, n) << endl; - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -class Solution { -public: - bool validUtf8(vector& data) { - int nextRbytes = 0; - - for(auto x : data) { - if(nextRbytes == 0) { - if((x >> 5) == 0b110) // number of byte 2 - nextRbytes = 1; - else if((x >> 4) == 0b1110) //number of byte 3 - nextRbytes = 2; - else if((x >> 3) == 0b11110) // number of byte 4 - nextRbytes = 3; - else if((x >> 7) != 0b0) // number of byte 1 - return false; - } - - else { - if((x >> 6) != 0b10) return false; - nextRbytes--; - } - } - - if(nextRbytes == 0) { - return true; - } - - return false; - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< -#include -#include -using namespace __gnu_pbds; -using namespace std; -#define ff first -#define ss second -#define endl "\n" -#define ll long long -#define ld long double -#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) -#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) -#define pb push_back -#define mp make_pair -#define pii pair -#define vi vector -#define mii map -#define ump unordered_map -#define pqb priority_queue -#define pqs priority_queue > -#define setbits(x) __builtin_popcountll(x) -#define zrobits(x) __builtin_ctzll(x) -#define mod 1000000007 -#define inf 1e18 -#define ps(x, y) fixed<>x; while(x--) -// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); -typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; - - -void file_i_o(){ - ios_base::sync_with_stdio(0); - cin.tie(0); - cout.tie(0); - /* #ifndef ONLINE_JUDGE - freopen("input.txt", "r", stdin); - freopen("output.txt", "w", stdout); - #endif */ -} - - - - -/** - * 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) {} - * }; - */ -class Solution { -public: - vector> verticalTraversal(TreeNode* root) { - map>> nodes; - - queue>> todo; - - todo.push({root, {0, 0}}); - - while(not todo.empty()) { - auto p = todo.front(); - - todo.pop(); - - TreeNode* node = p.first; - int x = p.second.first, y = p.second.second; - - nodes[x][y].insert(node -> val); - - if(node -> left) { - todo.push({node -> left, {x - 1, y + 1}}); - } - - if(node -> right) { - todo.push({node -> right, {x + 1, y + 1}}); - } - - } - - vector> ans; - - for(auto p : nodes) { - vector col; - for(auto q: p.second) { - col.insert(col.end(), q.second.begin(), q.second.end()); - } - ans.push_back(col); - } - - return ans; - - } -}; - - - - -int main(int argc, char const *argv[]) { - - file_i_o(); - - clock_t start, end; - start = clock(); - - w(t){ - - /* Write Code Here */ - - } - - end = clock(); - - double time_taken=double(end-start)/double(CLOCKS_PER_SEC); - cerr<<"\nTime : "< Date: Sat, 8 Oct 2022 21:35:37 +0530 Subject: [PATCH 007/290] BINARY SEARCH IN 2D ARRAYS (C++) --- binarySearch.cpp | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 binarySearch.cpp diff --git a/binarySearch.cpp b/binarySearch.cpp new file mode 100644 index 0000000..cf39dec --- /dev/null +++ b/binarySearch.cpp @@ -0,0 +1,35 @@ +class Solution +{ +public: + bool searchMatrix(vector> &matrix, int target) + { + // nrows---> Number of rows, mcols---> Number of columns + int nrows = matrix.size(); + int mcols = matrix[0].size(); // Because, No. of columns = length of any particular row + + int start = 0; + int end = nrows * mcols - 1; + int mid = (start + end) / 2; // Finding mid index + + while (start <= end) + { + mid = (start + end) / 2; + + int element = matrix[mid / mcols][mid % mcols]; // Finding the element at mid index + + if (element == target) + { + return true; + } + else if (element < target) + { + start = mid + 1; + } + else //(element > target) + { + end = mid - 1; + } + } + return 0; + } +}; \ No newline at end of file From 43c9cb9178ab4809a50c1e8b2b65584f5818cfa6 Mon Sep 17 00:00:00 2001 From: Dhananjoy Dey <84634405+sceary-expert@users.noreply.github.com> Date: Sat, 8 Oct 2022 21:38:17 +0530 Subject: [PATCH 008/290] Added Solution of the Problem 16. 3Sum Closest Added: Brutefoce O(N^3) Solution Optimized O(N^2) Solution (Accepted) --- 16. 3Sum Closest | 58 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 16. 3Sum Closest diff --git a/16. 3Sum Closest b/16. 3Sum Closest new file mode 100644 index 0000000..5cae7a0 --- /dev/null +++ b/16. 3Sum Closest @@ -0,0 +1,58 @@ +//Brutefoce O(N^3) Solution (Time Limit Exceeded): + +class Solution { +public: + int threeSumClosest(vector& nums, int target) { + int minDiff = INT_MAX; + int sum, n = nums.size(); + for(int i = 0; i < n; i++) + { + for(int j = i + 1; j < n; j++) + { + for(int k = j + 1; k < n; k++) + { + int currSum = nums[i] + nums[j] + nums[k]; + int newDiff = abs(target - currSum); + if(newDiff < minDiff) minDiff = newDiff, sum = currSum; + } + } + } + + + return sum; + } +}; +//Optimized O(N^2) Solution (Accepted): + +class Solution { +public: + int threeSumClosest(vector& nums, int target) { + int minDiff = INT_MAX; + int sum, n = nums.size(); + sort(nums.begin(), nums.end()); + + + for(int i = 0; i < n - 2; i++) + { + int s = i + 1, e = n - 1; + while(s < e) + { + + int currSum = nums[i] + nums[s] + nums[e]; + + int diff = currSum - target; + if(currSum > target)e--; + else if(currSum < target)s++; + else return target; + if(abs(currSum - target) < minDiff) + { + minDiff = abs(currSum - target); + sum = currSum; + } + } + } + + + return sum; + } +}; From 46bbde472784180998929b7b4eb8a64d3adc2893 Mon Sep 17 00:00:00 2001 From: JeevanSainik789 <115283993+JeevanSainik789@users.noreply.github.com> Date: Sun, 9 Oct 2022 15:08:52 +0530 Subject: [PATCH 009/290] Create ClimbingStairs.cpp --- ClimbingStairs.cpp | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 ClimbingStairs.cpp diff --git a/ClimbingStairs.cpp b/ClimbingStairs.cpp new file mode 100644 index 0000000..2e200a5 --- /dev/null +++ b/ClimbingStairs.cpp @@ -0,0 +1,11 @@ +class Solution { +public: + int climbStairs(int n) { + vectordp(n + 1); + dp[0] = 1; + dp[1] = 1; + for(int i = 2; i < n + 1; i++) + dp[i] = dp[i - 1] + dp[i - 2]; + return dp[n]; + } +}; From 61e507788342c38989140c65748997f51edb211c Mon Sep 17 00:00:00 2001 From: shravan Date: Sun, 9 Oct 2022 15:20:34 +0530 Subject: [PATCH 010/290] Bubble sort --- bubblesort.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 bubblesort.cpp diff --git a/bubblesort.cpp b/bubblesort.cpp new file mode 100644 index 0000000..5d93521 --- /dev/null +++ b/bubblesort.cpp @@ -0,0 +1,32 @@ +/* Here we just comapre the next element with the previous element and then do the same..... +n-i-1 becoz for each i the element will be sorted*/ + +#include +using namespace std; +int main() +{ + int n; + cin >> n; + int a[n]; + for (int i = 0; i < n; ++i) + cin >> a[i]; + + for (int i = 0; i < n; i++) + { + bool swapped = false; + for (int j = 0; j < n - i - 1; j++) + { + if (a[j + 1] < a[j]) + { + swapped = true; + swap(a[j + 1], a[j]); + } + } + if (!swapped) + { + break; + } + } + for (int i = 0; i < n; i++) + cout << a[i] << " "; +} \ No newline at end of file From 94e77d3fc16a2988a70245350458fc534cb278fd Mon Sep 17 00:00:00 2001 From: Rajkumar Bhatt Date: Sun, 9 Oct 2022 15:20:54 +0530 Subject: [PATCH 011/290] Create prime-or-not.cpp --- prime-or-not.cpp | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 prime-or-not.cpp diff --git a/prime-or-not.cpp b/prime-or-not.cpp new file mode 100644 index 0000000..86f7617 --- /dev/null +++ b/prime-or-not.cpp @@ -0,0 +1,41 @@ +#include + +using namespace std; + +int main() + +{ + + int n, i, m=0, flag=0; + + cout << "Enter the Number to check Prime: "; + + cin >> n; + + m=n/2; + + for(i = 2; i <= m; i++) + + { + + if(n % i == 0) + + { + + cout<<"Number is not Prime."< Date: Sun, 9 Oct 2022 15:30:11 +0530 Subject: [PATCH 012/290] Flood fill --- floodfill.cpp | 44 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 floodfill.cpp diff --git a/floodfill.cpp b/floodfill.cpp new file mode 100644 index 0000000..7bee74b --- /dev/null +++ b/floodfill.cpp @@ -0,0 +1,44 @@ +#include +#include +using namespace std; + +void printfloodfill(int[][] maze, int row, int col, string psf, bool visited[][]) +{ + //base case + if ((row < 0) || (col < 0) || row >= n || col >= m || maze[row][col] == 1 || visited[row][col] == true) + { + return; + } + if (row == size() && col ==) + { + cout << psf << endl; + return; + } + + visited[row][col] = true; + printfloodfill(maze, row - 1, col, psf + "T", visited); + printfloodfill(maze, row, col - 1, psf + "L", visited); + printfloodfill(maze, row + 1, col, psf + "D", visited); + printfloodfill(maze, row, col + 1, psf + "R", visited); + visited[row][col] = false; +} + +int main() +{ + int n, m; + cin >> n >> m; + int arr[n][m]; + vector> arr(n, vector(m)); + + for (int i = 0; i < n; i++) + { + for (int j = 0; j < m; j++) + + { + cin >> arr[i][j]; + } + } + + bool visited[n][m]; + printfloodfill(arr, 0, 0, "", visited); +} From 647ea5996b3d943056f351f3ea7e0d65243584a9 Mon Sep 17 00:00:00 2001 From: Vikas-hub-cyber <70075655+Vikas-hub-cyber@users.noreply.github.com> Date: Sun, 9 Oct 2022 15:43:24 +0530 Subject: [PATCH 013/290] Create Best Time to Buy and Sell Stock.cpp --- Best Time to Buy and Sell Stock.cpp | 55 +++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 Best Time to Buy and Sell Stock.cpp diff --git a/Best Time to Buy and Sell Stock.cpp b/Best Time to Buy and Sell Stock.cpp new file mode 100644 index 0000000..dd2054c --- /dev/null +++ b/Best Time to Buy and Sell Stock.cpp @@ -0,0 +1,55 @@ +/* + +121. Best Time to Buy and Sell Stock +Easy + +20587 + +660 + +Add to List + +Share +You are given an array prices where prices[i] is the price of a given stock on the ith day. + +You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. + +Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. + + + +Example 1: + +Input: prices = [7,1,5,3,6,4] +Output: 5 +Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. +Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. +Example 2: + +Input: prices = [7,6,4,3,1] +Output: 0 +Explanation: In this case, no transactions are done and the max profit = 0. + + +Constraints: + +1 <= prices.length <= 105 +0 <= prices[i] <= 104 + + +*/ + + +class Solution { +public: + int maxProfit(vector& prices) { + int ans = 0; + int n = prices.size(); + int mini = prices[0]; + for(int i = 1 ;i Date: Sun, 9 Oct 2022 15:50:46 +0530 Subject: [PATCH 014/290] Create Container With Most Water.cpp --- Container With Most Water.cpp | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Container With Most Water.cpp diff --git a/Container With Most Water.cpp b/Container With Most Water.cpp new file mode 100644 index 0000000..edbb7a1 --- /dev/null +++ b/Container With Most Water.cpp @@ -0,0 +1,19 @@ +/* + +https://leetcode.com/problems/container-with-most-water/ + +*/ + + + +int maxArea(vector& height) { + int water = 0; + int i = 0, j = height.size() - 1; + while (i < j) { + int h = min(height[i], height[j]); + water = max(water, (j - i) * h); + while (height[i] <= h && i < j) i++; + while (height[j] <= h && i < j) j--; + } + return water; +} From 01e3535f7d9bf96103f499682ed5ed0fec7bd374 Mon Sep 17 00:00:00 2001 From: Vikas Pandey <86828496+iamprofessor1@users.noreply.github.com> Date: Sun, 9 Oct 2022 15:53:20 +0530 Subject: [PATCH 015/290] Create Counting Bits.cpp --- Counting Bits.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Counting Bits.cpp diff --git a/Counting Bits.cpp b/Counting Bits.cpp new file mode 100644 index 0000000..335ef2c --- /dev/null +++ b/Counting Bits.cpp @@ -0,0 +1,18 @@ +/* + +Counting Bits + + +Share +Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i. + +*/ + +vector countBits(int n) { + vector answer; + for(int i = 0; i <=n; i++){ + int m = __builtin_popcount(i); + answer.push_back(m); + } + return answer; + } From 9cd362bf8519c8d2ac3f140aa8d724959b8e9ca6 Mon Sep 17 00:00:00 2001 From: Devesh Singh <76179606+Devesh1602@users.noreply.github.com> Date: Sun, 9 Oct 2022 16:09:38 +0530 Subject: [PATCH 016/290] Payroll Management System Project --- Payroll Management System | 1501 +++++++++++++++++++++++++++++++++++++ 1 file changed, 1501 insertions(+) create mode 100644 Payroll Management System diff --git a/Payroll Management System b/Payroll Management System new file mode 100644 index 0000000..06e030a --- /dev/null +++ b/Payroll Management System @@ -0,0 +1,1501 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include + +using namespace std; + +void gotoxy(int x, int y) +{ + COORD c = { x, y }; + SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), c); +} + + +class LINES +{ +public: + void LINE_HOR(int, int, int, char); + void LINE_VER(int, int, int, char); + void BOX(int, int, int, int, char); + void CLEARUP(void); + void CLEARDOWN(void); +}; + + + +class MENU +{ +public: + void MAIN_MENU(void); +private: + void EDIT_MENU(void); + void INTRODUCTION(void); +}; + + + +class EMPLOYEE +{ +public: + void NEW_EMPLOYEE(void); + void MODIFICATION(void); + void DELETION(void); + void DISPLAY(void); + void LIST(void); + void SALARY_SLIP(void); +private: + void ADD_RECORD(int, char[], char[], char[], int, int, int, char[], char, char, char, float, float); + void MODIFY_RECORD(int, char[], char[], char[], char[], char, char, char, float, float); + void DELETE_RECORD(int); + int LASTCODE(void); + int CODEFOUND(int); + int RECORDNO(int); + int FOUND_CODE(int); + void DISPLAY_RECORD(int); + int VALID_DATE(int, int, int); + + int code, dd, mm, yy; + char name[26], address[31], phone[10], desig[16]; + char grade, house, convense; + float loan, basic; +}; + + + +void MENU::MAIN_MENU(void) +{ + char ch; + LINES L; + L.CLEARUP(); + while (1) + { + system("cls"); + gotoxy(14, 3); + cout << " C++ Project for Payroll Management System"; + L.BOX(25, 7, 57, 9, 218); + L.BOX(10, 5, 71, 21, 218); + L.BOX(11, 6, 70, 20, 219); + gotoxy(29, 8); + cout << "PAYROLL MANAGEMENT SYSTEM"; + gotoxy(30, 11); + cout << "1: NEW EMPLOYEE"; + gotoxy(30, 12); + cout << "2: DISPLAY EMPLOYEE"; + gotoxy(30, 13); + cout << "3: LIST OF EMPLOYEES"; + gotoxy(30, 14); + cout << "4: SALARY SLIP"; + gotoxy(30, 15); + cout << "5: EDIT"; + gotoxy(30, 16); + cout << "0: QUIT"; + gotoxy(30, 18); + cout << "ENTER YOUR CHOICE :"; + gotoxy(5, 23); + + ch = _getch(); + if (ch == 27 || ch == '0') + break; + else if (ch == '1') + { + EMPLOYEE E; + E.NEW_EMPLOYEE(); + } + else if (ch == '2') + { + EMPLOYEE E; + E.DISPLAY(); + } + else if (ch == '3') + { + EMPLOYEE E; + E.LIST(); + } + else if (ch == '4') + { + EMPLOYEE E; + E.SALARY_SLIP(); + } + else if (ch == '5') + EDIT_MENU(); + } + L.CLEARUP(); +} + + + +void MENU::EDIT_MENU(void) +{ + char ch; + LINES L; + L.CLEARDOWN(); + while (1) + { + system("cls"); + L.BOX(28, 8, 49, 10, 218); + L.BOX(10, 5, 71, 21, 218); + L.BOX(11, 6, 70, 20, 219); + gotoxy(31, 9); + cout << "E D I T M E N U"; + gotoxy(30, 13); + cout << "1: DELETE RECORD"; + gotoxy(30, 14); + cout << "2: MODIFY RECORD"; + gotoxy(30, 15); + cout << "0: EXIT"; + gotoxy(30, 17); + cout << "ENTER YOUR CHOICE :"; + ch = _getch(); + if (ch == 27 || ch == '0') + break; + else if (ch == '1') + { + EMPLOYEE E; + E.DELETION(); + } + else if (ch == '2') + { + EMPLOYEE E; + E.MODIFICATION(); + } + } + L.CLEARDOWN(); +} + + +void LINES::LINE_HOR(int column1, int column2, int row, char c) +{ + for (column1; column1 <= column2; column1++) + { + gotoxy(column1, row); + cout << c; + } +} + + + +void LINES::LINE_VER(int row1, int row2, int column, char c) +{ + for (row1; row1 <= row2; row1++) + { + gotoxy(column, row1); + cout << c; + } +} + + + +void LINES::BOX(int column1, int row1, int column2, int row2, char c) +{ + char ch = 218; + char c1, c2, c3, c4; + char l1 = 196, l2 = 179; + if (c == ch) + { + c1 = 218; + c2 = 191; + c3 = 192; + c4 = 217; + l1 = 196; + l2 = 179; + } + else + { + c1 = c; + c2 = c; + c3 = c; + c4 = c; + l1 = c; + l2 = c; + } + gotoxy(column1, row1); + cout << c1; + gotoxy(column2, row1); + cout << c2; + gotoxy(column1, row2); + cout << c3; + gotoxy(column2, row2); + cout << c4; + column1++; + column2--; + LINE_HOR(column1, column2, row1, l1); + LINE_HOR(column1, column2, row2, l1); + column1--; + column2++; + row1++; + row2--; + LINE_VER(row1, row2, column1, l2); + LINE_VER(row1, row2, column2, l2); +} + + +//********************************************************** +// THIS FUNCTION CLEAR THE SCREEN LINE BY LINE UPWARD +//********************************************************** + +void LINES::CLEARUP(void) +{ + for (int i = 25; i >= 1; i--) + { + sleep(20); + gotoxy(1, i); + clreol(); + } +} + + + +void LINES::CLEARDOWN(void) +{ + for (int i = 1; i <= 25; i++) + { + delay(20); + gotoxy(1, i); + clreol(); + } +} + + +//********************************************************** +// THIS FUNCTION ADDS THE GIVEN DATA IN THE EMPLOYEE'S FILE +//********************************************************** + +void EMPLOYEE::ADD_RECORD(int ecode, char ename[26], char eaddress[31], char ephone[10], int d, int m, int y, char edesig[16], char egrade, char ehouse, char econv, float eloan, float ebasic) +{ + fstream file; + file.open("EMPLOYEE.DAT"); + code = ecode; + strcpy(name, ename); + strcpy(address, eaddress); + strcpy(phone, ephone); + dd = d; + mm = m; + yy = y; + strcpy(desig, edesig); + grade = egrade; + house = ehouse; + convense = econv; + loan = eloan; + basic = ebasic; + file.write((char *) this, sizeof(EMPLOYEE)); + file.close(); +} + + +//********************************************************** +// THIS FUNCTION MODIFY THE GIVEN DATA IN THE +// EMPLOYEE'S FILE +//********************************************************** + +void EMPLOYEE::MODIFY_RECORD(int ecode, char ename[26], char eaddress[31], char ephone[10], char edesig[16], char egrade, char ehouse, char econv, float eloan, float ebasic) +{ + int recno; + recno = RECORDNO(ecode); + fstream file; + file.open("EMPLOYEE.DAT", ios::out | ios::ate); + strcpy(name, ename); + strcpy(address, eaddress); + strcpy(phone, ephone); + strcpy(desig, edesig); + grade = egrade; + house = ehouse; + convense = econv; + loan = eloan; + basic = ebasic; + int location; + location = (recno - 1) * sizeof(EMPLOYEE); + file.seekp(location); + file.write((char *) this, sizeof(EMPLOYEE)); + file.close(); +} + + +//********************************************************** +// THIS FUNCTION DELETE THE RECORD IN THE EMPLOYEE FILE +// FOR THE GIVEN EMPLOYEE CODE +//********************************************************** + +void EMPLOYEE::DELETE_RECORD(int ecode) +{ + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + fstream temp; + temp.open("temp.dat", ios::out); + file.seekg(0, ios::beg); + while (!file.eof()) + { + file.read((char *) this, sizeof(EMPLOYEE)); + if (file.eof()) + break; + if (code != ecode) + temp.write((char *) this, sizeof(EMPLOYEE)); + } + file.close(); + temp.close(); + file.open("EMPLOYEE.DAT", ios::out); + temp.open("temp.dat", ios::in); + temp.seekg(0, ios::beg); + while (!temp.eof()) + { + temp.read((char *) this, sizeof(EMPLOYEE)); + if (temp.eof()) + break; + file.write((char *) this, sizeof(EMPLOYEE)); + } + file.close(); + temp.close(); +} + + +//********************************************************** +// THIS FUNCTION RETURNS THE LAST EMPLOYEE'S CODE +//********************************************************** + +int EMPLOYEE::LASTCODE(void) +{ + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + int count = 0; + while (file.read((char *) this, sizeof(EMPLOYEE))) + count = code; + file.close(); + return count; +} + + +//********************************************************** +// THIS FUNCTION RETURNS 0 IF THE GIVEN CODE NOT FOUND +//********************************************************** + +int EMPLOYEE::FOUND_CODE(int ecode) +{ + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + int found = 0; + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + if (code == ecode) + { + found = 1; + break; + } + } + file.close(); + return found; +} + + +//********************************************************** +// THIS FUNCTION RETURNS RECORD NO. OF THE GIVEN CODE +//********************************************************** + +int EMPLOYEE::RECORDNO(int ecode) +{ + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + int recno = 0; + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + recno++; + if (code == ecode) + break; + } + file.close(); + return recno; +} + + +//********************************************************** +// THIS FUNCTION DISPLAYS THE LIST OF THE EMPLOYEES +//********************************************************** + +void EMPLOYEE::LIST(void) +{ + system("cls"); + int row = 6, found = 0, flag = 0; + char ch; + gotoxy(31, 2); + cout << "LIST OF EMPLOYEES"; + gotoxy(30, 3); + cout << "~~~~~~~~~~~~~~~~~~~"; + gotoxy(1, 4); + cout << "CODE NAME PHONE DOJ DESIGNATION GRADE SALARY"; + gotoxy(1, 5); + cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"; + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + flag = 0; + delay(20); + found = 1; + gotoxy(2, row); + cout << code; + gotoxy(6, row); + cout << name; + gotoxy(31, row); + cout << phone; + gotoxy(40, row); + cout << dd << "/" << mm << "/" << yy; + gotoxy(52, row); + cout << desig; + gotoxy(69, row); + cout << grade; + if (grade != 'E') + { + gotoxy(74, row); + cout << basic; + } + else + { + gotoxy(76, row); + cout << "-"; + } + if (row == 23) + { + flag = 1; + row = 6; + gotoxy(1, 25); + cout << "Press any key to continue or Press to exit"; + ch = getch(); + if (ch == 27) + break; + system("cls"); + gotoxy(31, 2); + cout << "LIST OF EMPLOYEES"; + gotoxy(30, 3); + cout << "~~~~~~~~~~~~~~~~~~~"; + gotoxy(1, 4); + cout << "CODE NAME PHONE DOJ DESIGNATION GRADE SALARY"; + gotoxy(1, 5); + cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"; + } + else + row++; + } + if (!found) + { + gotoxy(5, 10); + cout << "\7Records not found"; + } + if (!flag) + { + gotoxy(1, 25); + cout << "Press any key to continue..."; + getche(); + } + file.close(); +} + + +//********************************************************** +// THIS FUNCTION DISPLAYS THE RECORD OF THE EMPLOYEES +//********************************************************** + +void EMPLOYEE::DISPLAY_RECORD(int ecode) +{ + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + if (code == ecode) + { + gotoxy(5, 5); + cout << "Employee Code # " << code; + gotoxy(5, 6); + cout << "~~~~~~~~~~~~~"; + gotoxy(5, 7); + cout << "Name : " << name; + gotoxy(5, 8); + cout << "Address : " << address; + gotoxy(5, 9); + cout << "Phone no. : " << phone; + gotoxy(5, 11); + cout << "JOINING DATE"; + gotoxy(5, 12); + cout << "~~~~~~~~~~~~"; + gotoxy(5, 13); + cout << "Day : " << dd; + gotoxy(5, 14); + cout << "Month : " << mm; + gotoxy(5, 15); + cout << "Year : " << yy; + gotoxy(5, 17); + cout << "Designation : " << desig; + gotoxy(5, 18); + cout << "Grade : " << grade; + if (grade != 'E') + { + gotoxy(5, 19); + cout << "House (y/n) : " << house; + gotoxy(5, 20); + cout << "Convense (y/n) : " << convense; + gotoxy(5, 22); + cout << "Basic Salary : " << basic; + } + gotoxy(5, 21); + cout << "Loan : " << loan; + } + } + file.close(); +} + + +//********************************************************** +// THIS FUNCTION GIVE DATA TO ADD IN THE FILE +//********************************************************** + +void EMPLOYEE::NEW_EMPLOYEE(void) +{ + system("cls"); + char ch, egrade, ehouse = 'N', econv = 'N'; + char ename[26], eaddress[31], ephone[10], edesig[16], t1[10]; + float t2 = 0.0, eloan = 0.0, ebasic = 0.0; + int d, m, y, ecode, valid; + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(28, 3); + cout << "ADDITION OF NEW EMPLOYEE"; + gotoxy(5, 5); + cout << "Employee Code # "; + gotoxy(5, 6); + cout << "~~~~~~~~~~~~~"; + gotoxy(5, 7); + cout << "Name : "; + gotoxy(5, 8); + cout << "Address : "; + gotoxy(5, 9); + cout << "Phone no. : "; + gotoxy(5, 11); + cout << "JOINING DATE"; + gotoxy(5, 12); + cout << "~~~~~~~~~~~~"; + gotoxy(5, 13); + cout << "Day : "; + gotoxy(5, 14); + cout << "Month : "; + gotoxy(5, 15); + cout << "Year : "; + gotoxy(5, 17); + cout << "Designation : "; + gotoxy(5, 18); + cout << "Grade : "; + gotoxy(5, 21); + cout << "Loan : "; + + ecode = LASTCODE() + 1; + if (ecode == 1) + { + ADD_RECORD(ecode, "null", "null", "null", 0, 0, 0, "null", 'n', 'n', 'n', 0.0, 0.0); + DELETE_RECORD(ecode); + } + gotoxy(21, 5); + cout << ecode; + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter the name of the Employee"; + gotoxy(20, 7); + clreol(); + gets(ename); + strupr(ename); + if (ename[0] == '0') + return; + if (strlen(ename) < 1 || strlen(ename) > 25) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..25)"; + getch(); + } + } while (!valid); + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Address of the Employee"; + gotoxy(20, 8); + clreol(); + gets(eaddress); + strupr(eaddress); + if (eaddress[0] == '0') + return; + if (strlen(eaddress) < 1 || strlen(eaddress) > 30) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..30)"; + getch(); + } + } while (!valid); + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Phone no. of the Employee or Press for none"; + gotoxy(20, 9); + clreol(); + gets(ephone); + if (ephone[0] == '0') + return; + if ((strlen(ephone) < 7 && strlen(ephone) > 0) || (strlen(ephone) > 9)) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly"; + getch(); + } + } while (!valid); + if (strlen(ephone) == 0) + strcpy(ephone, "-"); + char tday[3], tmonth[3], tyear[5]; + int td; + do + { + valid = 1; + do + { + gotoxy(5, 25); + clreol(); + cout << "ENTER DAY OF JOINING"; + gotoxy(13, 13); + clreol(); + gets(tday); + td = atoi(tday); + d = td; + if (tday[0] == '0') + return; + } while (d == 0); + do + { + gotoxy(5, 25); + clreol(); + cout << "ENTER MONTH OF JOINING"; + gotoxy(13, 14); + clreol(); + gets(tmonth); + td = atoi(tmonth); + m = td; + if (tmonth[0] == '0') + return; + } while (m == 0); + do + { + gotoxy(5, 25); + clreol(); + cout << "ENTER YEAR OF JOINING"; + gotoxy(13, 15); + clreol(); + gets(tyear); + td = atoi(tyear); + y = td; + if (tyear[0] == '0') + return; + } while (y == 0); + if (d>31 || d<1) + valid = 0; + else if (((y % 4) != 0 && m == 2 && d>28) || ((y % 4) == 0 && m == 2 && d>29)) + valid = 0; + else if ((m == 4 || m == 6 || m == 9 || m == 11) && d>30) + valid = 0; + else if (y<1990 || y>2020) + valid = 0; + if (!valid) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly"; + getch(); + gotoxy(13, 14); + clreol(); + gotoxy(13, 15); + clreol(); + } + } while (!valid); + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Designation of the Employee"; + gotoxy(20, 17); + clreol(); + gets(edesig); + strupr(edesig); + if (edesig[0] == '0') + return; + if (strlen(edesig) < 1 || strlen(edesig) > 15) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..15)"; + getch(); + } + } while (!valid); + do + { + gotoxy(5, 25); + clreol(); + cout << "Enter Grade of the Employee (A,B,C,D,E)"; + gotoxy(20, 18); + clreol(); + egrade = getche(); + egrade = toupper(egrade); + if (egrade == '0') + return; + } while (egrade < 'A' || egrade > 'E'); + if (egrade != 'E') + { + gotoxy(5, 19); + cout << "House (y/n) : "; + gotoxy(5, 20); + cout << "Convense (y/n) : "; + gotoxy(5, 22); + cout << "Basic Salary : "; + do + { + gotoxy(5, 25); + clreol(); + cout << "ENTER IF HOUSE ALLOWANCE IS ALLOTED TO EMPLOYEE OR NOT"; + gotoxy(22, 19); + clreol(); + ehouse = getche(); + ehouse = toupper(ehouse); + if (ehouse == '0') + return; + } while (ehouse != 'Y' && ehouse != 'N'); + do + { + gotoxy(5, 25); + clreol(); + cout << "ENTER IF CONVENCE ALLOWANCE IS ALLOTED TO EMPLOYEE OR NOT"; + gotoxy(22, 20); + clreol(); + econv = getche(); + econv = toupper(econv); + if (econv == '0') + return; + } while (econv != 'Y' && econv != 'N'); + } + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "ENTER LOAN AMOUNT IF ISSUED"; + gotoxy(22, 21); + clreol(); + gets(t1); + t2 = atof(t1); + eloan = t2; + if (eloan > 50000) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7SHOULD NOT GREATER THAN 50000"; + getch(); + } + } while (!valid); + if (egrade != 'E') + { + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "ENTER BASIC SALARY OF THE EMPLOYEE"; + gotoxy(22, 22); + clreol(); + gets(t1); + t2 = atof(t1); + ebasic = t2; + if (t1[0] == '0') + return; + if (ebasic > 50000) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7SHOULD NOT GREATER THAN 50000"; + getch(); + } + } while (!valid); + } + gotoxy(5, 25); + clreol(); + do + { + gotoxy(5, 24); + clreol(); + cout << "Do you want to save (y/n) "; + ch = getche(); + ch = toupper(ch); + if (ch == '0') + return; + } while (ch != 'Y' && ch != 'N'); + if (ch == 'N') + return; + ADD_RECORD(ecode, ename, eaddress, ephone, d, m, y, edesig, egrade, ehouse, econv, eloan, ebasic); +} + + +//********************************************************** +// THIS FUNCTION GIVE CODE FOR THE DISPLAY OF THE RECORD +//********************************************************** + +void EMPLOYEE::DISPLAY(void) +{ + system("cls"); + char t1[10]; + int t2, ecode; + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(5, 5); + cout << "Enter code of the Employee "; + gets(t1); + t2 = atoi(t1); + ecode = t2; + if (ecode == 0) + return; + system("cls"); + if (!FOUND_CODE(ecode)) + { + gotoxy(5, 5); + cout << "\7Record not found"; + getch(); + return; + } + DISPLAY_RECORD(ecode); + gotoxy(5, 25); + cout << "Press any key to continue..."; + getch(); +} + + +//********************************************************** +// THIS FUNCTION GIVE DATA FOR THE MODIFICATION OF THE +// EMPLOYEE RECORD +//********************************************************** + +void EMPLOYEE::MODIFICATION(void) +{ + system("cls"); + char ch, egrade, ehouse = 'N', econv = 'N'; + char ename[26], eaddress[31], ephone[10], edesig[16], t1[10]; + float t2 = 0.0, eloan = 0.0, ebasic = 0.0; + int ecode, valid; + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(5, 5); + cout << "Enter code of the Employee "; + gets(t1); + t2 = atoi(t1); + ecode = t2; + if (ecode == 0) + return; + system("cls"); + if (!FOUND_CODE(ecode)) + { + gotoxy(5, 5); + cout << "\7Record not found"; + getch(); + return; + } + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(22, 3); + cout << "MODIFICATION OF THE EMPLOYEE RECORD"; + DISPLAY_RECORD(ecode); + do + { + gotoxy(5, 24); + clreol(); + cout << "Do you want to modify this record (y/n) "; + ch = getche(); + ch = toupper(ch); + if (ch == '0') + return; + } while (ch != 'Y' && ch != 'N'); + if (ch == 'N') + return; + system("cls"); + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + if (code == ecode) + break; + } + file.close(); + gotoxy(5, 5); + cout << "Employee Code # " << ecode; + gotoxy(5, 6); + cout << "~~~~~~~~~~~~~"; + gotoxy(40, 5); + cout << "JOINING DATE : "; + gotoxy(40, 6); + cout << "~~~~~~~~~~~~~~"; + gotoxy(55, 5); + cout << dd << "/" << mm << "/" << yy; + gotoxy(5, 7); + cout << "Name : "; + gotoxy(5, 8); + cout << "Address : "; + gotoxy(5, 9); + cout << "Phone no. : "; + gotoxy(5, 10); + cout << "Designation : "; + gotoxy(5, 11); + cout << "Grade : "; + gotoxy(5, 14); + cout << "Loan : "; + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter the name of the Employee or FOR NO CHANGE"; + gotoxy(20, 7); + clreol(); + gets(ename); + strupr(ename); + if (ename[0] == '0') + return; + if (strlen(ename) > 25) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..25)"; + getch(); + } + } while (!valid); + if (strlen(ename) == 0) + { + strcpy(ename, name); + gotoxy(20, 7); + cout << ename; + } + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Address of the Employee or FOR NO CHANGE"; + gotoxy(20, 8); + clreol(); + gets(eaddress); + strupr(eaddress); + if (eaddress[0] == '0') + return; + if (strlen(eaddress) > 30) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..30)"; + getch(); + } + } while (!valid); + if (strlen(eaddress) == 0) + { + strcpy(eaddress, address); + gotoxy(20, 8); + cout << eaddress; + } + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Phone no. of the Employee or or FOR NO CHANGE"; + gotoxy(20, 9); + clreol(); + gets(ephone); + if (ephone[0] == '0') + return; + if ((strlen(ephone) < 7 && strlen(ephone) > 0) || (strlen(ephone) > 9)) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly"; + getch(); + } + } while (!valid); + if (strlen(ephone) == 0) + { + strcpy(ephone, phone); + gotoxy(20, 9); + cout << ephone; + } + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "Enter Designation of the Employee or FOR NO CHANGE"; + gotoxy(20, 10); + clreol(); + gets(edesig); + strupr(edesig); + if (edesig[0] == '0') + return; + if (strlen(edesig) > 15) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7Enter correctly (Range: 1..15)"; + getch(); + } + } while (!valid); + if (strlen(edesig) == 0) + { + strcpy(edesig, desig); + gotoxy(20, 10); + cout << edesig; + } + do + { + gotoxy(5, 25); + clreol(); + cout << "Enter Grade of the Employee (A,B,C,D,E) or FOR NO CHANGE"; + gotoxy(20, 11); + clreol(); + egrade = getche(); + egrade = toupper(egrade); + if (egrade == '0') + return; + if (egrade == 13) + { + egrade = grade; + gotoxy(20, 11); + cout << grade; + } + } while (egrade < 'A' || egrade > 'E'); + if (egrade != 'E') + { + gotoxy(5, 12); + cout << "House (y/n) : "; + gotoxy(5, 13); + cout << "Convense (y/n) : "; + gotoxy(5, 15); + cout << "Basic Salary : "; + do + { + gotoxy(5, 25); + clreol(); + cout << "ALLOTED HOUSE ALLOWANCE ? or FOR NO CHANGE"; + gotoxy(22, 12); + clreol(); + ehouse = getche(); + ehouse = toupper(ehouse); + if (ehouse == '0') + return; + if (ehouse == 13) + { + ehouse = house; + gotoxy(22, 12); + cout << ehouse; + } + } while (ehouse != 'Y' && ehouse != 'N'); + do + { + gotoxy(5, 25); + clreol(); + cout << "ALLOTED CONVENCE ALLOWANCE or FOR NO CHANGE"; + gotoxy(22, 13); + clreol(); + econv = getche(); + econv = toupper(econv); + if (econv == '0') + return; + if (econv == 13) + { + econv = convense; + gotoxy(22, 13); + cout << econv; + } + } while (econv != 'Y' && econv != 'N'); + } + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "ENTER LOAN AMOUNT or FOR NO CHANGE"; + gotoxy(22, 14); + clreol(); + gets(t1); + t2 = atof(t1); + eloan = t2; + if (eloan > 50000) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7SHOULD NOT GREATER THAN 50000"; + getch(); + } + } while (!valid); + if (strlen(t1) == 0) + { + eloan = loan; + gotoxy(22, 14); + cout << eloan; + } + if (egrade != 'E') + { + do + { + valid = 1; + gotoxy(5, 25); + clreol(); + cout << "ENTER BASIC SALARY or FOR NO CHANGE"; + gotoxy(22, 15); + clreol(); + gets(t1); + t2 = atof(t1); + ebasic = t2; + if (t1[0] == '0') + return; + if (ebasic > 50000) + { + valid = 0; + gotoxy(5, 25); + clreol(); + cout << "\7SHOULD NOT GREATER THAN 50000"; + getch(); + } + } while (!valid); + if (strlen(t1) == 0) + { + ebasic = basic; + gotoxy(22, 15); + cout << ebasic; + } + } + gotoxy(5, 25); + clreol(); + do + { + gotoxy(5, 18); + clreol(); + cout << "Do you want to save (y/n) "; + ch = getche(); + ch = toupper(ch); + if (ch == '0') + return; + } while (ch != 'Y' && ch != 'N'); + if (ch == 'N') + return; + MODIFY_RECORD(ecode, ename, eaddress, ephone, edesig, egrade, ehouse, econv, eloan, ebasic); + gotoxy(5, 23); + cout << "\7Record Modified"; + gotoxy(5, 25); + cout << "Press any key to continue..."; + getch(); +} + + +//********************************************************** +// THIS FUNCTION GIVE CODE NO. FOR THE DELETION OF THE +// EMPLOYEE RECORD +//********************************************************** + +void EMPLOYEE::DELETION(void) +{ + system("cls"); + char t1[10], ch; + int t2, ecode; + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(5, 5); + cout << "Enter code of the Employee "; + gets(t1); + t2 = atoi(t1); + ecode = t2; + if (ecode == 0) + return; + system("cls"); + if (!FOUND_CODE(ecode)) + { + gotoxy(5, 5); + cout << "\7Record not found"; + getch(); + return; + } + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(24, 3); + cout << "DELETION OF THE EMPLOYEE RECORD"; + DISPLAY_RECORD(ecode); + do + { + gotoxy(5, 24); + clreol(); + cout << "Do you want to delete this record (y/n) "; + ch = getche(); + ch = toupper(ch); + if (ch == '0') + return; + } while (ch != 'Y' && ch != 'N'); + if (ch == 'N') + return; + DELETE_RECORD(ecode); + LINES L; + L.CLEARDOWN(); + gotoxy(5, 23); + cout << "\7Record Deleted"; + gotoxy(5, 25); + cout << "Press any key to continue..."; + getch(); +} + + +//********************************************************** +// THIS FUNCTION RETURN 0 IF THE GIVEN DATE IS INVALID +//********************************************************** + +int EMPLOYEE::VALID_DATE(int d1, int m1, int y1) +{ + int valid = 1; + if (d1>31 || d1<1) + valid = 0; + else if (((y1 % 4) != 0 && m1 == 2 && d1>28) || ((y1 % 4) == 0 && m1 == 2 && d1>29)) + valid = 0; + else if ((m1 == 4 || m1 == 6 || m1 == 9 || m1 == 11) && d1>30) + valid = 0; + return valid; +} + + +//********************************************************** +// THIS FUNCTION PRINTS THE SALARY SLIP FOR THE EMPLOYEE +//********************************************************** + +void EMPLOYEE::SALARY_SLIP(void) +{ + system("cls"); + char t1[10]; + int t2, ecode, valid; + gotoxy(72, 2); + cout << "<0>=EXIT"; + gotoxy(5, 5); + cout << "Enter code of the Employee "; + gets(t1); + t2 = atoi(t1); + ecode = t2; + if (ecode == 0) + return; + system("cls"); + if (!FOUND_CODE(ecode)) + { + gotoxy(5, 5); + cout << "\7Record not found"; + getch(); + return; + } + fstream file; + file.open("EMPLOYEE.DAT", ios::in); + file.seekg(0, ios::beg); + while (file.read((char *) this, sizeof(EMPLOYEE))) + { + if (code == ecode) + break; + } + file.close(); + int d1, m1, y1; + struct date d; + getdate(&d); + d1 = d.da_day; + m1 = d.da_mon; + y1 = d.da_year; + char *mon[12] = { "January", "February", "March", "April", "May", "June", "July", "August", "September", "November", "December" }; + LINES L; + L.BOX(2, 1, 79, 25, 219); + gotoxy(31, 2); + cout << "NADEEM AKHTAR, PGDBA - 200754667"; + L.LINE_HOR(3, 78, 3, 196); + gotoxy(34, 4); + cout << "SALARY SLIP"; + gotoxy(60, 4); + cout << "Date: " << d1 << "/" << m1 << "/" << y1; + gotoxy(34, 5); + cout << mon[m1 - 1] << ", " << y1; + L.LINE_HOR(3, 78, 6, 196); + gotoxy(6, 7); + cout << "Employee Name : " << name; + gotoxy(6, 8); + cout << "Designation : " << desig; + gotoxy(67, 8); + cout << "Grade : " << grade; + L.BOX(6, 9, 75, 22, 218); + L.LINE_HOR(10, 71, 20, 196); + int days, hours; + if (grade == 'E') + { + do + { + valid = 1; + gotoxy(10, 21); + cout << "ENTER NO. OF DAYS WORKED IN THE MONTH "; + gotoxy(10, 11); + cout << "No. of Days : "; + gets(t1); + t2 = atof(t1); + days = t2; + if (!VALID_DATE(days, m1, y1)) + { + valid = 0; + gotoxy(10, 21); + cout << "\7ENTER CORRECTLY "; + getch(); + gotoxy(10, 11); + cout << " "; + } + } while (!valid); + do + { + valid = 1; + gotoxy(10, 21); + cout << "ENTER NO. OF HOURS WORKED OVER TIME "; + gotoxy(10, 13); + cout << "No. of hours : "; + gets(t1); + t2 = atof(t1); + hours = t2; + if (hours > 8 || hours < 0) + { + valid = 0; + gotoxy(10, 21); + cout << "\7ENTER CORRECTLY "; + getch(); + gotoxy(10, 13); + cout << " "; + } + } while (!valid); + gotoxy(10, 21); + cout << " "; + gotoxy(10, 11); + cout << " "; + gotoxy(10, 13); + cout << " "; + } + gotoxy(10, 10); + cout << "Basic Salary : Rs."; + gotoxy(10, 12); + cout << "ALLOWANCE"; + if (grade != 'E') + { + gotoxy(12, 13); + cout << "HRA : Rs."; + gotoxy(12, 14); + cout << "CA : Rs."; + gotoxy(12, 15); + cout << "DA : Rs."; + } + else + { + gotoxy(12, 13); + cout << "OT : Rs."; + } + gotoxy(10, 17); + cout << "DEDUCTIONS"; + gotoxy(12, 18); + cout << "LD : Rs."; + if (grade != 'E') + { + gotoxy(12, 19); + cout << "PF : Rs."; + } + gotoxy(10, 21); + cout << "NET SALARY : Rs."; + gotoxy(6, 24); + cout << "CASHIER"; + gotoxy(68, 24); + cout << "EMPLOYEE"; + float HRA = 0.0, CA = 0.0, DA = 0.0, PF = 0.0, LD = 0.0, OT = 0.0, allowance, deduction, netsalary; + if (grade != 'E') + { + if (house == 'Y') + HRA = (5 * basic) / 100; + if (convense == 'Y') + CA = (2 * basic) / 100; + DA = (5 * basic) / 100; + PF = (2 * basic) / 100; + LD = (15 * loan) / 100; + allowance = HRA + CA + DA; + deduction = PF + LD; + } + else + { + basic = days * 30; + LD = (15 * loan) / 100; + OT = hours * 10; + allowance = OT; + deduction = LD; + } + netsalary = (basic + allowance) - deduction; + gotoxy(36, 10); + cout << basic; + if (grade != 'E') + { + gotoxy(22, 13); + cout << HRA; + gotoxy(22, 14); + cout << CA; + gotoxy(22, 15); + cout << DA; + gotoxy(22, 19); + cout << PF; + } + else + { + gotoxy(22, 13); + cout << OT; + } + gotoxy(22, 18); + cout << LD; + gotoxy(33, 15); + cout << "Rs." << allowance; + gotoxy(33, 19); + cout << "Rs." << deduction; + gotoxy(36, 21); + cout << netsalary; + gotoxy(2, 1); + getch(); +} + +void main(void) +{ + MENU menu; + menu.MAIN_MENU(); +} From e10d6763da30a578444d863f61e1d263ca180175 Mon Sep 17 00:00:00 2001 From: shravan Date: Sun, 9 Oct 2022 16:15:04 +0530 Subject: [PATCH 017/290] Get_maze --- get maze.cpp | 56 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 get maze.cpp diff --git a/get maze.cpp b/get maze.cpp new file mode 100644 index 0000000..a2c7bd7 --- /dev/null +++ b/get maze.cpp @@ -0,0 +1,56 @@ + +//use eulers tree to understand +// sc=starting col +// sr=starting row +// dc =destination col +// dr =destination row +// v & h= vertical and horizontal + +#include +#include +using namespace std; + +vector getpath(int sr, int sc, int dr, int dc) +{ + if (sr == dr && sc == dc) //base case + { + vector base; + base.push_back(""); + return base; + } + vector ans; + if (sc + 1 <= dc) // condition to not go outside the maze + { + vector hpath = getpath(sr, sc + 1, dr, dc); //moving in horizontsl means rigth side + for (string s : hpath) + { + ans.push_back("h" + s); + } + } + if (sr + 1 <= dr) // condition to not go outside the maze + { + vector vpath = getpath(sr + 1, sc, dr, dc); //moving in vertical direction means downwards + for (string s : vpath) + { + ans.push_back("v" + s); + } + } + return ans; +} +void display(vector &a) //display the output +{ + + for (int i = 0; i < a.size(); i++) + { + cout << a[i]; + cout << " "; + } +} + +int main() +{ + int n, m; + cin >> n >> m; + vector answer = getpath(0, 0, n - 1, m - 1); + display(answer); +} \ No newline at end of file From 6fab86e0be368042268bc3c38c31043d07032aa2 Mon Sep 17 00:00:00 2001 From: Amar <96937608+Amarnath-Rao@users.noreply.github.com> Date: Sun, 9 Oct 2022 16:15:11 +0530 Subject: [PATCH 018/290] Create Bubble Sorting an Array using pointers.cpp --- Bubble Sorting an Array using pointers.cpp | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 Bubble Sorting an Array using pointers.cpp diff --git a/Bubble Sorting an Array using pointers.cpp b/Bubble Sorting an Array using pointers.cpp new file mode 100644 index 0000000..ff9db3e --- /dev/null +++ b/Bubble Sorting an Array using pointers.cpp @@ -0,0 +1,22 @@ +#include +void main(){ + int *a,i,j,t,n; + printf("Size of Array : "); + scanf("%d",&n); + printf("Give Array Elements: "); + for(i=0;i *(a+j)){ + t = *(a+i);*(a+i) = *(a+j); + *(a+j) = t; + } + } + } + printf("Sorted array is: "); + for(i=0;i Date: Sun, 9 Oct 2022 16:16:15 +0530 Subject: [PATCH 019/290] Added Solution Of reverse Linked list This solution is written in c++ and solves this problem:- https://leetcode.com/problems/reverse-linked-list --- ReverseLinkedList.cpp | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 ReverseLinkedList.cpp diff --git a/ReverseLinkedList.cpp b/ReverseLinkedList.cpp new file mode 100644 index 0000000..ddeaba0 --- /dev/null +++ b/ReverseLinkedList.cpp @@ -0,0 +1,16 @@ +class Solution { +public: + ListNode* reverseList(ListNode* head) { + ListNode* current = head; + ListNode *prev = NULL, *next = NULL; + + while (current != NULL) { + next = current->next; + current->next = prev; + prev = current; + current = next; + } + head = prev; + return head; + } +}; From 39918dfe4f6342e086811d7c999a991e464c1d98 Mon Sep 17 00:00:00 2001 From: Samik Pandit Date: Sun, 9 Oct 2022 16:16:45 +0530 Subject: [PATCH 020/290] Create Valid Parentheses.cpp --- Valid Parentheses.cpp | 47 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 Valid Parentheses.cpp diff --git a/Valid Parentheses.cpp b/Valid Parentheses.cpp new file mode 100644 index 0000000..66764da --- /dev/null +++ b/Valid Parentheses.cpp @@ -0,0 +1,47 @@ +class Solution { + vector my_stack; +public: + bool isValid(string s) { + if (s.size() % 2 != 0) + return false; + if (s.size() == 0) + return true; + for (int i = 0; i < s.size(); i++) + { + my_stack.push_back(s[i]); + if (my_stack[my_stack.size() - 1] == '}') + { + if (my_stack.size() > 1){ + if(my_stack[my_stack.size() - 2] == '{') + { + my_stack.pop_back(); + my_stack.pop_back(); + } + } + } + else if (my_stack[my_stack.size() - 1] == ')') + { + if (my_stack.size() > 1){ + if(my_stack[my_stack.size() - 2] == '(') + { + my_stack.pop_back(); + my_stack.pop_back(); + } + } + } + else if (my_stack[my_stack.size() - 1] == ']') + { + if (my_stack.size() > 1){ + if(my_stack[my_stack.size() - 2] == '[') + { + my_stack.pop_back(); + my_stack.pop_back(); + } + } + } + } + if (!my_stack.empty()) + return false; + return true; + } +}; From f174ae4adef9718f95c0c7c4d6361653876bd1ad Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:18:10 +0530 Subject: [PATCH 021/290] kruskal algo added --- Kruskal.cpp | 84 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 84 insertions(+) create mode 100644 Kruskal.cpp diff --git a/Kruskal.cpp b/Kruskal.cpp new file mode 100644 index 0000000..e4d4092 --- /dev/null +++ b/Kruskal.cpp @@ -0,0 +1,84 @@ +#include +#include +#include +using namespace std; + +#define edge pair + +class Graph { + private: + vector > G; // graph + vector > T; // mst + int *parent; + int V; // number of vertices/nodes in graph + public: + Graph(int V); + void AddWeightedEdge(int u, int v, int w); + int find_set(int i); + void union_set(int u, int v); + void kruskal(); + void print(); +}; +Graph::Graph(int V) { + parent = new int[V]; + for (int i = 0; i < V; i++) + parent[i] = i; + + G.clear(); + T.clear(); +} +void Graph::AddWeightedEdge(int u, int v, int w) { + G.push_back(make_pair(w, edge(u, v))); +} +int Graph::find_set(int i) { + if (i == parent[i]) + return i; + else + return find_set(parent[i]); +} + +void Graph::union_set(int u, int v) { + parent[u] = parent[v]; +} +void Graph::kruskal() { + int i, uRep, vRep; + sort(G.begin(), G.end()); // increasing weight + for (i = 0; i < G.size(); i++) { + uRep = find_set(G[i].second.first); + vRep = find_set(G[i].second.second); + if (uRep != vRep) { + T.push_back(G[i]); // add to tree + union_set(uRep, vRep); + } + } +} +void Graph::print() { + cout << "Edge :" + << " Weight" << endl; + for (int i = 0; i < T.size(); i++) { + cout << T[i].second.first << " - " << T[i].second.second << " : " + << T[i].first; + cout << endl; + } +} +int main() { + Graph g(6); + g.AddWeightedEdge(0, 1, 4); + g.AddWeightedEdge(0, 2, 4); + g.AddWeightedEdge(1, 2, 2); + g.AddWeightedEdge(1, 0, 4); + g.AddWeightedEdge(2, 0, 4); + g.AddWeightedEdge(2, 1, 2); + g.AddWeightedEdge(2, 3, 3); + g.AddWeightedEdge(2, 5, 2); + g.AddWeightedEdge(2, 4, 4); + g.AddWeightedEdge(3, 2, 3); + g.AddWeightedEdge(3, 4, 3); + g.AddWeightedEdge(4, 2, 4); + g.AddWeightedEdge(4, 3, 3); + g.AddWeightedEdge(5, 2, 2); + g.AddWeightedEdge(5, 4, 3); + g.kruskal(); + g.print(); + return 0; +} \ No newline at end of file From ecbc799164debc55a1a4b28764993352050418df Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:22:06 +0530 Subject: [PATCH 022/290] code to change matrix to spiral matrix --- matrix_to_spiral_matrix.cpp | 131 ++++++++++++++++++++++++++++++++++++ 1 file changed, 131 insertions(+) create mode 100644 matrix_to_spiral_matrix.cpp diff --git a/matrix_to_spiral_matrix.cpp b/matrix_to_spiral_matrix.cpp new file mode 100644 index 0000000..c14ea59 --- /dev/null +++ b/matrix_to_spiral_matrix.cpp @@ -0,0 +1,131 @@ +// C++ program to Convert given Matrix +// into sorted Spiral Matrix +#include +using namespace std; + +const int MAX = 1000; + +// Function to convert the array to Spiral +void ToSpiral(int m, int n, + int Sorted[], int a[MAX][MAX]) +{ + // For Array pointer + int index = 0; + + // k - starting row index + // m - ending row index + // l - starting column index + // n - ending column index + int k = 0, l = 0; + + while (k < m && l < n) + { + + // Print the first row + // from the remaining rows + for (int i = l; i < n; ++i) + { + a[k][i] = Sorted[index]; + index++; + } + + k++; + + // Print the last column + // from the remaining columns + for (int i = k; i < m; ++i) + { + a[i][n - 1] = Sorted[index]; + index++; + } + n--; + + // Print the last row + // from the remaining rows + if (k < m) + { + for (int i = n - 1; i >= l; --i) + { + a[m - 1][i] = Sorted[index]; + index++; + } + m--; + } + + // Print the first column + // from the remaining columns + if (l < n) + { + for (int i = m - 1; i >= k; --i) + { + a[i][l] = Sorted[index]; + index++; + } + l++; + } + } +} + +// Function to convert 2D array to 1D array +void convert2Dto1D(int y[MAX][MAX], + int m, int n,int x[]) +{ + + int index = 0; + + // Store value 2D Matrix To 1D array + for (int i = 0; i < m; i++) + { + for (int j = 0; j < n; j++) + { + x[index] = y[i][j]; + index++; + } + } +} + +// Function to print the Matrix +void PrintMatrix(int a[MAX][MAX], + int m, int n) +{ + + // Print Spiral Matrix + for (int i = 0; i < m; i++) + { + for (int j = 0; j < n; j++) + { + cout << a[i][j] << " "; + } + cout << endl; + } +} + + +// Function to Convert given Matrix +// into sorted Spiral Matrix +void convertMatrixToSortedSpiral( + int y[MAX][MAX], int m, int n) +{ + int a[MAX][MAX] = {0}; + int x[m * n]; + + convert2Dto1D(y, m, n,x); + sort(x, x + n * m); + ToSpiral(m, n, x, a); + PrintMatrix(a, m, n); +} + +// Driver code +int main() +{ + int m = 4, n = 3; + int y[MAX][MAX] = { + { 2, 5, 12 }, + { 22, 45, 55 }, + { 1, 6, 8 }, + { 13, 56, 10 }}; + + convertMatrixToSortedSpiral(y, m, n); + + return 0; +} \ No newline at end of file From fda4299b48be948fb9bbe181e15658e5a1c23948 Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:24:26 +0530 Subject: [PATCH 023/290] added radix sort --- Radixsort.cpp | 128 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 128 insertions(+) create mode 100644 Radixsort.cpp diff --git a/Radixsort.cpp b/Radixsort.cpp new file mode 100644 index 0000000..62099d3 --- /dev/null +++ b/Radixsort.cpp @@ -0,0 +1,128 @@ +// implementation of radix sort using bin/bucket sort +#include +using namespace std; + +// structure for a single linked list to help further in the +// sorting +struct node { + int data; + node* next; +}; + +// function for creating a new node in the linked list +struct node* create(int x) +{ + node* temp = new node(); + temp->data = x; + temp->next = NULL; + + return temp; +} + +// utility function to append node in the linked list +// here head is passed by reference, to know more about this +// search pass by reference +void insert(node*& head, int n) +{ + if (head == NULL) { + head = create(n); + return; + } + + node* t = head; + while (t->next != NULL) + t = t->next; + t->next = create(n); +} + +// utility function to pop an element from front in the list +// for the sake of stability in sorting +int del(node*& head) +{ + if (head == NULL) + return 0; + node* temp = head; + // storing the value of head before updating + int val = head->data; + + // updation of head to next node + head = head->next; + + delete temp; + return val; +} + +// utility function to get the number of digits in the +// max_element +int digits(int n) +{ + int i = 1; + if (n < 10) + return 1; + + while (n > (int)pow(10, i)) + i++; + return i; +} + +void radix_sort(vector& arr) +{ + // size of the array to be sorted + int sz = arr.size(); + + // getting the maximum element in the array + int max_val = *max_element(arr.begin(), arr.end()); + + // getting digits in the maximum element + int d = digits(max_val); + + // creating buckets to store the pointers + node** bins; + + // array of pointers to linked list of size 10 as + // integers are decimal numbers so they can hold numbers + // from 0-9 only, that's why size of 10 + + bins = new node*[10]; + + // initializing the hash array with null to all + for (int i = 0; i < 10; i++) + bins[i] = NULL; + + // first loop working for a constant time only and inner + // loop is iterating through the array to store elements + // of array in the linked list by their digits value + for (int i = 0; i < d; i++) { + for (int j = 0; j < sz; j++) // bins updation + insert(bins[(arr[j] / (int)pow(10, i)) % 10], + arr[j]); + + int x = 0, y = 0; + // write back to the array after each pass + + while (x < 10) { + while (bins[x] != NULL) + arr[y++] = del(bins[x]); + x++; + } + } +} + +// a utility function to print the sorted array +void print(vector arr) +{ + for (int i = 0; i < arr.size(); i++) + cout << arr[i] << " "; + cout << endl; +} + +int main() +{ + vector arr = { 573, 25, 415, 12, 161, 6 }; + + // function call + radix_sort(arr); + print(arr); + + return 0; +} \ No newline at end of file From a8c40952d591bc9e590efa145695575e6aac8dd4 Mon Sep 17 00:00:00 2001 From: Kunal Chauhan <87843911+Kunal-Chauhan7@users.noreply.github.com> Date: Sun, 9 Oct 2022 16:25:45 +0530 Subject: [PATCH 024/290] Added a solution of Richest Customer Wealth This code written in java and solves this question : https://leetcode.com/problems/richest-customer-wealth/ --- RichestCustomerWealth.java | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 RichestCustomerWealth.java diff --git a/RichestCustomerWealth.java b/RichestCustomerWealth.java new file mode 100644 index 0000000..aefeb35 --- /dev/null +++ b/RichestCustomerWealth.java @@ -0,0 +1,22 @@ +class Solution { + public int maximumWealth(int[][] accounts) { + int m = accounts.length; + int n = accounts[0].length; + int arr[] = new int[m]; + int sum = 0; + for(int i = 0 ; i < m ; i++) { + for(int j = 0 ; j < n ; j++) { + sum+=accounts[i][j]; + } + arr[i] = sum; + sum=0; + } + int max = arr[0]; + for(int i = 0 ; i < m ; i++) { + if(arr[i]>max) { + max = arr[i]; + } + } + return max; + } +} From 2dfcdfa30ef7db1d81766a51bdcadbc20c9bcd2c Mon Sep 17 00:00:00 2001 From: shravan Date: Sun, 9 Oct 2022 16:26:35 +0530 Subject: [PATCH 025/290] Maxfreq --- maxfreqofelement.cpp | 58 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 maxfreqofelement.cpp diff --git a/maxfreqofelement.cpp b/maxfreqofelement.cpp new file mode 100644 index 0000000..3545e1d --- /dev/null +++ b/maxfreqofelement.cpp @@ -0,0 +1,58 @@ +#include //in this we have created a map to store the freq..and created a minheap and output the elemnts having more freq +using namespace std; + +typedef pair pi; + +void PrintTopKfrequentNums(vector &arr, int k) +{ + + //created a map becoz numbers r repeating ... map stores the the freq of a particular number + + /* input: (10->no. of ele + 2 2 2 1 1 1 3 3 4 + 2->key) + Map will store the input like this ...with which it will be easier to store freq + + no. freq + 1 -> 3 + 2 -> 3 + 3 -> 2 + 4 -> 1 + + */ + + unordered_map mp; + for (auto e : arr) + { + mp[e]++; + } + + priority_queue, greater> minh; + for (auto e : mp) //iterating the map from 1st to last + { + minh.push(make_pair(e.second, e.first)); // pair becoz we r pushing both freq and no. + + if (minh.size() > k) + minh.pop(); + } + + while (!minh.empty()) + { + cout << minh.top().second << " "; //printing the no. with highest freq + minh.pop(); + } + cout << endl; +} + +int main() +{ + int n, k; + cin >> n >> k; + vector arr(n); + + for (int i = 0; i < n; ++i) + cin >> arr[i]; + + PrintTopKfrequentNums(arr, k); + return 0; +} \ No newline at end of file From bde291ff7e6ebc8fd0fe145d613840418048bf0d Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:26:58 +0530 Subject: [PATCH 026/290] code to merge two linked list --- merge_two_ll.cpp | 137 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 137 insertions(+) create mode 100644 merge_two_ll.cpp diff --git a/merge_two_ll.cpp b/merge_two_ll.cpp new file mode 100644 index 0000000..d26e045 --- /dev/null +++ b/merge_two_ll.cpp @@ -0,0 +1,137 @@ +/* C program to merge two sorted linked lists */ +#include +#include +#include + +/* Link list node */ +struct Node +{ + int data; + struct Node* next; +}; + +/* pull off the front node of the source and put it in dest */ +void MoveNode(struct Node** destRef, struct Node** sourceRef); + +/* Takes two lists sorted in increasing order, and splices +their nodes together to make one big sorted list which +is returned. */ +struct Node* SortedMerge(struct Node* a, struct Node* b) +{ + /* a dummy first node to hang the result on */ + struct Node dummy; + + /* tail points to the last result node */ + struct Node* tail = &dummy; + + /* so tail->next is the place to add new nodes + to the result. */ + dummy.next = NULL; + while (1) + { + if (a == NULL) + { + /* if either list runs out, use the + other list */ + tail->next = b; + break; + } + else if (b == NULL) + { + tail->next = a; + break; + } + if (a->data <= b->data) + MoveNode(&(tail->next), &a); + else + MoveNode(&(tail->next), &b); + + tail = tail->next; + } + return(dummy.next); +} + +/* UTILITY FUNCTIONS */ +/* MoveNode() function takes the node from the front of the +source, and move it to the front of the dest. +It is an error to call this with the source list empty. + +Before calling MoveNode(): +source == {1, 2, 3} +dest == {1, 2, 3} + +After calling MoveNode(): +source == {2, 3} +dest == {1, 1, 2, 3} */ +void MoveNode(struct Node** destRef, struct Node** sourceRef) +{ + /* the front source node */ + struct Node* newNode = *sourceRef; + assert(newNode != NULL); + + /* Advance the source pointer */ + *sourceRef = newNode->next; + + /* Link the old dest off the new node */ + newNode->next = *destRef; + + /* Move dest to point to the new node */ + *destRef = newNode; +} + + +/* Function to insert a node at the beginning of the +linked list */ +void push(struct Node** head_ref, int new_data) +{ + /* allocate node */ + struct Node* new_node = + (struct Node*) malloc(sizeof(struct Node)); + + /* put in the data */ + new_node->data = new_data; + + /* link the old list off the new node */ + new_node->next = (*head_ref); + + /* move the head to point to the new node */ + (*head_ref) = new_node; +} + +/* Function to print nodes in a given linked list */ +void printList(struct Node *node) +{ + while (node!=NULL) + { + printf("%d ", node->data); + node = node->next; + } +} + +/* Drier program to test above functions*/ +int main() +{ + /* Start with the empty list */ + struct Node* res = NULL; + struct Node* a = NULL; + struct Node* b = NULL; + + /* Let us create two sorted linked lists to test + the functions + Created lists, a: 5->10->15, b: 2->3->20 */ + push(&a, 15); + push(&a, 10); + push(&a, 5); + + push(&b, 20); + push(&b, 3); + push(&b, 2); + + /* Remove duplicates from linked list */ + res = SortedMerge(a, b); + + printf("Merged Linked List is: \n"); + printList(res); + + return 0; +} From 34919b63dec73381fc39b2bc9fbd27acbcd49aad Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:29:45 +0530 Subject: [PATCH 027/290] Binary_and_Modular_Exponentiation.cpp --- Binary_and_Modular_Exponentiation.cpp | 110 ++++++++++++++++++++++++++ 1 file changed, 110 insertions(+) create mode 100644 Binary_and_Modular_Exponentiation.cpp diff --git a/Binary_and_Modular_Exponentiation.cpp b/Binary_and_Modular_Exponentiation.cpp new file mode 100644 index 0000000..99bc545 --- /dev/null +++ b/Binary_and_Modular_Exponentiation.cpp @@ -0,0 +1,110 @@ +/** + * @file + * @brief C++ Program to find Binary Exponent and Binary Modular Exponent Iteratively and Recursively. + * + * Calculate \f$a^b\f$ in \f$O(\log(b))\f$ by converting \f$b\f$ to a + * binary number. Binary exponentiation is also known as exponentiation by + * squaring. Calculating binary exponent modular m is known as modular exponentiation. + * @note This is a far better approach compared to naive method which + * provide \f$O(b)\f$ operations. + * + * Example: + *
10 in base 2 is 1010. + * \f{eqnarray*}{ + * 2^{10_d} &=& 2^{1010_b} = 2^8 * 2^2\\ + * 2^1 &=& 2\\ + * 2^2 &=& (2^1)^2 = 2^2 = 4\\ + * 2^4 &=& (2^2)^2 = 4^2 = 16\\ + * 2^8 &=& (2^4)^2 = 16^2 = 256\\ + * \f} + * Hence to calculate 2^10 we only need to multiply \f$2^8\f$ and \f$2^2\f$ + * skipping \f$2^1\f$ and \f$2^4\f$. + * + * Bitwise Operations Used: + * a>>1 => is same as a/2. + * a>>=1 => is same as a = a/2. + * a&1 => is same as a%2. Checks wether number a is odd or not. Results to 1 i.e. True if a is odd and 0 or False otherwise. + * + * Modular Properties + * ( a * a ) % m = ( a%m * a%m ) % m + * Using this property of modular aithmetic we can efficiently calculate (a^b)%m. + */ + +#include + +/// Recursive function to calculate exponent in \f$O(\log(n))\f$ using binary +/// exponent. +long long int binExpo(long long int a, long long int b) { + if (b == 0) { + return 1; + } + long long int res = binExpo(a, b>>1); + if (b&1) { // Same as b%2==1. Result to true if b is odd. + return res * res * a; + } else { + return res * res; + } +} + +/// Recursive function to calculate exponent modular m (a^b %m) in \f$O(\log(n))\f$ using +/// binary exponentiation. +long long int binModExpo(long long int a, long long int b, long long int m) { + if (b == 0) { + return 1; + } + long long int res = binExpo(a, b>>1, m) % m; + if (b&1) { + return (res * res * a%m ) % m; + } else { + return (res * res) % m; + } +} + +/// Iterative function to calculate exponent in \f$O(\log(n))\f$ using binary +/// exponent. +long long int binExpo_alt(long long int a, long long int b) { + long long int res = 1; + while (b > 0) { + if (b&2) { + res = res * a; + } + a = a * a; + b >>= 1; + } + return res; +} + + +/// Iterative function to calculate exponent modular m (a^b %m) in \f$O(\log(n))\f$ using +/// binary exponentiation. +long long int binModExpo_alt(long long int a, long long int b, long long int m) { + long long int res = 1; + a %= m ; + while (b > 0) { + if (b&1) { + res = (res * a) % m ; + } + a = (a * a) % m; + b >>= 1 ; + } + return res; +} + +/// Main function +int main() { + long long int a, b, m; + /// Give three numbers a, b, m. + std::cin >> a >> b >> m; + if (a == 0 && b == 0) { + std::cout << "Math error" << std::endl; + } else if (b < 0) { + std::cout << "Exponent must be positive !!" << std::endl; + } else if ( m == 0 ) { + std::cout << "m cannot be zero." << std::endl; + } else { + std::cout << "Result of a^b Recursive : " << binExpo(a,b) << std::endl; + std::cout << "Result of a^b%m Recursive : " << binModExpo(a,b,m) << std::endl; + std::cout << "Result of a^b Iterative : " << binExpo_alt(a,b) << std::endl; + std::cout << "Result of a^b%m Iterative : " << binModExpo_alt(a,b,m) << std::endl; + } +} \ No newline at end of file From 5a453fb2da91d1b3f9f6ffa735ccb226b9462992 Mon Sep 17 00:00:00 2001 From: RaghavKaushal03 Date: Sun, 9 Oct 2022 16:31:48 +0530 Subject: [PATCH 028/290] armstrong number --- Armstrong number.cpp | 43 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 Armstrong number.cpp diff --git a/Armstrong number.cpp b/Armstrong number.cpp new file mode 100644 index 0000000..fe1d8c3 --- /dev/null +++ b/Armstrong number.cpp @@ -0,0 +1,43 @@ +#include + +using namespace std; + +int main() { + + int num, originalNum, remainder, result = 0; + + cout << "Enter a three-digit integer: "; + + cin >> num; + + originalNum = num; + + while (originalNum != 0) { + + + + remainder = originalNum % 10; + + + + result += remainder * remainder * remainder; + + + + + + originalNum /= 10; + + } + + if (result == num) + + cout << num << " is an Armstrong number."; + + else + + cout << num << " is not an Armstrong number."; + + return 0; + +} \ No newline at end of file From ff7783a6b0a5b8f8b55d30ff06deaae99807f20c Mon Sep 17 00:00:00 2001 From: sarthak2807 <77231223+sarthak2807@users.noreply.github.com> Date: Sun, 9 Oct 2022 16:57:58 +0530 Subject: [PATCH 029/290] Create Longest Increasing Subsequence please consider it for hactoberfest --- Longest Increasing Subsequence | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Longest Increasing Subsequence diff --git a/Longest Increasing Subsequence b/Longest Increasing Subsequence new file mode 100644 index 0000000..890736c --- /dev/null +++ b/Longest Increasing Subsequence @@ -0,0 +1,26 @@ +class Solution { +public: + int solve(vector& nums) + { + int n=nums.size(); + vector> dp(nums.size()+1,vector (nums.size()+1,0)); + for(int curr=n-1;curr>=-0;curr--) + { + for(int prev=curr-1;prev>=-1;prev--) + { + int include=0; + if(prev==-1 || nums[prev]& nums) { + + return solve(nums); + } +}; From b71e992cf9ad5a82b730e578abeaf496ee251c66 Mon Sep 17 00:00:00 2001 From: sarthak2807 <77231223+sarthak2807@users.noreply.github.com> Date: Sun, 9 Oct 2022 17:01:30 +0530 Subject: [PATCH 030/290] Create Integet to Roman please consider it for hactoberfest --- Integet to Roman | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Integet to Roman diff --git a/Integet to Roman b/Integet to Roman new file mode 100644 index 0000000..08c64fb --- /dev/null +++ b/Integet to Roman @@ -0,0 +1,17 @@ +class Solution { +public: + string intToRoman(int num) { + int numm[]={1000,900,500,400,100,90,50,40,10,9,5,4,1}; + string ans[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; + string s; + for(int i=0;i<13;i++) + { + while(num>=numm[i]) + { + s=s+ans[i]; + num=num-numm[i]; + } + } + return s; + } +}; From b777aff6d2da34a0582c3e62d889d82c8659f977 Mon Sep 17 00:00:00 2001 From: sarthak2807 <77231223+sarthak2807@users.noreply.github.com> Date: Sun, 9 Oct 2022 17:04:41 +0530 Subject: [PATCH 031/290] Create n queens problem please consider it for hactoberfest --- n queens problem | 69 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 69 insertions(+) create mode 100644 n queens problem diff --git a/n queens problem b/n queens problem new file mode 100644 index 0000000..943747c --- /dev/null +++ b/n queens problem @@ -0,0 +1,69 @@ +class Solution { +public: + bool issafe(int row,int col, vector>& board,int n) + { + int x=row; + int y=col; + while(y>=0) + { + if(board[x][y]=="Q") + return false; + y--; + } + x=row; + y=col; + while(x>=0 && y>=0) + { + if(board[x][y]=="Q") + return false; + y--; + x--; + } + x=row; + y=col; + while(x=0) + { + if(board[x][y]=="Q") + return false; + y--; + x++; + } + return true; + } + void addsolution(vector>& board,vector>& ans,int n) + { + vector v; + for(int i=0;i>& board,vector>& ans,int n) + { + if(col== n) + { + addsolution(board,ans,n); + return; + } + for(int row=0;row> solveNQueens(int n) { + vector> board(n,vector>(n,'.')); + vector> ans; + solve(0,board,ans,n); + return ans; + } +}; From c4f8fe0786c96525a23d5621759d465a2b5e4efe Mon Sep 17 00:00:00 2001 From: SUMER <105717568+Sumercode@users.noreply.github.com> Date: Sun, 9 Oct 2022 17:06:31 +0530 Subject: [PATCH 032/290] Create using_robot_to_print_lexicographically_smallest_string.cpp --- ...rint_lexicographically_smallest_string.cpp | 52 +++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 using_robot_to_print_lexicographically_smallest_string.cpp diff --git a/using_robot_to_print_lexicographically_smallest_string.cpp b/using_robot_to_print_lexicographically_smallest_string.cpp new file mode 100644 index 0000000..a9cc7fe --- /dev/null +++ b/using_robot_to_print_lexicographically_smallest_string.cpp @@ -0,0 +1,52 @@ +// this question is third in leetcode weekly contest #314 + +class Solution { +public: + + char getMinChar(vector &freq) + { + for(int i=0;i freq(26); + for(auto ch:s) + { + freq[ch-'a']++; + } + + stack st; + string ans = ""; + + for(auto ch:s) + { + st.push(ch); + freq[ch-'a']--; + //bhai terse chota koi nahi h ans me add hoja -> st ka top , min in freq se bhi minimum hai + while(!st.empty() && st.top()<=getMinChar(freq)) + { + ans.push_back(st.top()); + st.pop(); + } + + } + + + while(!st.empty()) + { + ans.push_back(st.top()); + st.pop(); + } + + + return ans; + } +}; From 0c462c3089a8374d4873f490b2eee2004996cd7a Mon Sep 17 00:00:00 2001 From: sarthak2807 <77231223+sarthak2807@users.noreply.github.com> Date: Sun, 9 Oct 2022 17:12:34 +0530 Subject: [PATCH 033/290] Create Longest Valid Parenthesis please consider it for hactoberfest 2022 --- Longest Valid Parenthesis | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 Longest Valid Parenthesis diff --git a/Longest Valid Parenthesis b/Longest Valid Parenthesis new file mode 100644 index 0000000..6fbb30f --- /dev/null +++ b/Longest Valid Parenthesis @@ -0,0 +1,28 @@ +class Solution { +public: + int longestValidParentheses(string s) { + int n = s.length(), longest = 0; + stack st; + for (int i = 0; i < n; i++) { + if (s[i] == '(') st.push(i); + else { + if (!st.empty()) { + if (s[st.top()] == '(') st.pop(); + else st.push(i); + } + else st.push(i); + } + } + if (st.empty()) longest = n; + else { + int a = n, b = 0; + while (!st.empty()) { + b = st.top(); st.pop(); + longest = max(longest, a-b-1); + a = b; + } + longest = max(longest, a); + } + return longest; + } +}; From 34f0f652c29a4258378e065ba9ed31261093ec82 Mon Sep 17 00:00:00 2001 From: Sambhav Goel <85975084+Sambhavgoel@users.noreply.github.com> Date: Sun, 9 Oct 2022 18:35:08 +0530 Subject: [PATCH 034/290] Create square_pattern.c --- square_pattern.c | 48 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 square_pattern.c diff --git a/square_pattern.c b/square_pattern.c new file mode 100644 index 0000000..551ddad --- /dev/null +++ b/square_pattern.c @@ -0,0 +1,48 @@ +#include +int main() +{ + int i,j,k,l,m,n,o=2,a,b,c,d,g,h; + printf("enter the last digit of square"); + scanf("%d",&n); + b=n-1; + for(i=n;i>=1;i--) + { + m=n; + for(l=1;l<=n-i;l++) + { + printf("%d ",m); + m--; + } + for(j=1;j<=2*i-1;j++) + { + printf("%d ",i); + } + o=i+1; + for(k=1;k<=n-i;k++) + { + printf("%d ",o); + o++; + } + printf("\n"); + } + for(a=1;a<=b;a++) + { + d=n; + for(c=1;c<=b-a;c++) + { + printf("%d ",d); + d--; + } + for(g=1;g<=2*a+1;g++) + { + printf("%d ",a+1); + } + for(h=1;h<=b-a;h++) + { + printf("%d ",a+h+1); + } + + printf("\n"); + } +return 0; +} From 75e3d701015c5c35cd948a01d42cf35e75bf3b05 Mon Sep 17 00:00:00 2001 From: Sambhav Goel <85975084+Sambhavgoel@users.noreply.github.com> Date: Sun, 9 Oct 2022 18:35:31 +0530 Subject: [PATCH 035/290] Create double_triangle_pattern.c --- double_triangle_pattern.c | 44 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 double_triangle_pattern.c diff --git a/double_triangle_pattern.c b/double_triangle_pattern.c new file mode 100644 index 0000000..fa70c5c --- /dev/null +++ b/double_triangle_pattern.c @@ -0,0 +1,44 @@ +#include +void main() +{ + int i,j,n,s,a,b,l,p,t,num=0; + printf("enter the odd number of rows:"); + scanf("%d",&n); + if(n%2==0) + { + printf("invalid input"); + } + else + { + a=(n+1)/2; + b=a+1; + for(i=a;i>=1;i--) + { + for(s=(a-i);s>=1;s--) + { + printf(" "); + } + for(j=(2*i-1);j>=1;j--) + { + printf("*"); + } + printf("\n"); + } + for(l=b;l<=n;l++) + { + for(p=(n-l);p>=1;p--) + { + printf(" "); + } + for(t=l;t>=(l-2*num-2);t--) + { + printf("*"); + + } + num++; + printf("\n"); + } + + } + +} From a2b458b5c249da901a969bb8b1750b585a6fbbed Mon Sep 17 00:00:00 2001 From: Ridhika Sahni <65117258+ridhika123269@users.noreply.github.com> Date: Sun, 9 Oct 2022 18:50:58 +0530 Subject: [PATCH 036/290] Create Fractional Knapsack --- Fractional Knapsack | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 Fractional Knapsack diff --git a/Fractional Knapsack b/Fractional Knapsack new file mode 100644 index 0000000..6fe43b3 --- /dev/null +++ b/Fractional Knapsack @@ -0,0 +1,38 @@ +/* +struct Item{ + int value; + int weight; +}; +*/ + +bool comp(Item a,Item b){ + double r1=(double)a.value/(double)a.weight; + double r2=(double)b.value/(double)b.weight; + return r1>r2; +} + +class Solution +{ + public: + //Function to get the maximum total value in the knapsack. + double fractionalKnapsack(int W, Item arr[], int n) + { + // Your code here + sort(arr,arr+n,comp); + int currWeight=0; + double finalValue=0.0; + for(int i=0;i Date: Sun, 9 Oct 2022 19:00:30 +0530 Subject: [PATCH 037/290] Create Postevent_feedback_with_parallaxeffect.html --- Postevent_feedback_with_parallaxeffect.html | 90 +++++++++++++++++++++ 1 file changed, 90 insertions(+) create mode 100644 Postevent_feedback_with_parallaxeffect.html diff --git a/Postevent_feedback_with_parallaxeffect.html b/Postevent_feedback_with_parallaxeffect.html new file mode 100644 index 0000000..bd4514e --- /dev/null +++ b/Postevent_feedback_with_parallaxeffect.html @@ -0,0 +1,90 @@ + + + + + + + + + + +
+ +Survey + + + +
+
+ + + +
+

Post Event Feedback Survey

+ +
+
+ + +Enter your name: + +

+Enter your department: + +

+Tell us a little bit about yourself:
+

+Do you like this event?
+Yes
+No +

+How did you know about this event? +

+Social Media +University +Friends +Google +

+What do you like the most about this event? + + + +

+Feedback form:
+

+
+ +
+

+
+ + +
+
+ + From fe792af7e77fa4a3e4308ec7bb7c4bca9b277541 Mon Sep 17 00:00:00 2001 From: Prem Prakash Pandey Date: Sun, 9 Oct 2022 19:05:55 +0530 Subject: [PATCH 038/290] Add a new program check number is even or odd --- even or odd.cpp | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 even or odd.cpp diff --git a/even or odd.cpp b/even or odd.cpp new file mode 100644 index 0000000..e69de29 From 6b0f2b38008eb08a4b9539729fc01e24cd0cd472 Mon Sep 17 00:00:00 2001 From: Subrata Bhuin Date: Sun, 9 Oct 2022 19:31:30 +0530 Subject: [PATCH 039/290] Create sudoko.cpp --- sudoko.cpp | 71 ++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 sudoko.cpp diff --git a/sudoko.cpp b/sudoko.cpp new file mode 100644 index 0000000..79c945e --- /dev/null +++ b/sudoko.cpp @@ -0,0 +1,71 @@ +#include +using namespace std; +class Solution { +public: + bool isRow(vector>& board,int row,char num,int COLS){ + for(int i =0; i < COLS;i++){ + if(board[row][i] == num) return false; + } + return true; + } + bool isCol(vector>& board,int col,char num,int ROWS){ + for(int i =0;i < ROWS;i++){ + if(board[i][col] == num) return false; + } + return true; + } + bool isGrid(vector>& board,int row,int col,char num,int ROWS,int COLS){ + //starting row and starting column of that specific 3 x 3 grid + int rowfactor = row - (row%3); + int colfactor = col - (col%3); + for(int i =0 ; i < 3;i++){ + for(int j =0; j < 3;j++){ + int newrow = rowfactor + i; + int newcol = colfactor + j; + if(board[newrow][newcol] == num) return false; + } + } + return true; + } + bool check(vector>& board,int row,int col,char num,int ROWS,int COLS){ + //1.check in row Each of the digits 1-9 must occur exactly once in each row. + //2.check in col Each of the digits 1-9 must occur exactly once in each column. + //3.check in grid Each of the digits 1-9 must occur exactly once in each of the 9 3x3 sub-boxes of the grid. + if(isRow(board,row,num,COLS) && isCol(board,col,num,ROWS) && isGrid(board,row,col,num,ROWS,COLS)){ + return true; + } + return false; + } + bool isEmpty(vector>& board,int ROWS,int COLS,int &row,int &col){ + for(int i =0 ; i < ROWS;i++){ + for(int j =0; j < COLS;j++) { + if(board[i][j] == '.') { + row = i; + col = j; + return true; + } + } + } + return false; + } + + bool solve(vector>& board,int ROWS,int COLS){ + //base case when there is no empty space in board + int row ,col; + if(!isEmpty(board,ROWS,COLS,row,col)) return true; + for(int i =1; i <= 9;i++){ + bool isPlacable = check(board,row,col,(i+48),ROWS,COLS); + if(isPlacable){ + board[row][col] = (char)(i+48); + if(solve(board,ROWS,COLS)) return true; + board[row][col] = '.'; + } + } + return false; + } + void solveSudoku(vector>& board) { + int ROWS = board.size(); + int COLS = board[0].size(); + solve(board,ROWS,COLS); + } +}; \ No newline at end of file From 4fe2dcb6c3b5b7337398663af4d8cbf0363a1fbf Mon Sep 17 00:00:00 2001 From: raviakshay <85856129+raviakshay@users.noreply.github.com> Date: Sun, 9 Oct 2022 19:41:13 +0530 Subject: [PATCH 040/290] Create quiz.cpp Hacktoberfest --- quiz.cpp | 950 +++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 950 insertions(+) create mode 100644 quiz.cpp diff --git a/quiz.cpp b/quiz.cpp new file mode 100644 index 0000000..d13c53d --- /dev/null +++ b/quiz.cpp @@ -0,0 +1,950 @@ +#include +#include +#include +#include +using namespace std; + +int total_score=0; +int correct_answer = 0; +int hints_used = 0; +string Name[5]; +string level; + +//the main menu view and some additionl functionalities +int main_menu_view() +{ + system("color 3F"); + cout << "\t\t *************************************************************************************" << endl; + cout << "\t\t ***** *****" << endl; + cout << "\t\t ***** H E L L O ! W E L C O M E T O T H E 'Q U I Z L E T' *****" << endl; + cout << "\t\t ***** = = = = = = = = = = = = = = = = = = = = = = = = *****" << endl; + cout << "\t\t ***** = = = = = = = = = = = = *****" << endl; + cout << "\t\t ***** B Y *****" << endl; + cout << "\t\t ***** R U S T A M Z O K I R O V *****" << endl; + cout << "\t\t ***** *****" << endl; + cout << "\t\t *************************************************************************************" << endl; + cout << endl; + + cout << "\t\t\t\t\t\tH O W T O P L A Y\n\n"; + cout << "\t\t1. IN THIS QUIZ GAME YOU WILL BE GIVEN 10 'C++ PROGRAMMING LANGUAGE' RELATED QUESTIONS.\n\n"; + cout << "\t\t2. IF YOU PRESS INCORRECT KEY, THE PROGRAM WILL AGAIN ASK YOU TO INPUT CORRECT VALUE.\n\n"; + cout << "\t\t3. ADDITIONALLY YOU WILL HAVE SOME HINTS WHICH YOU CAN USE FROM the 8TH QUESTION.\n\n"; + cout << "\t\t4. YOU WILL LOSE '5' POINTS FROM YOUR OVERALL SCORE IF YOU WILL USE HINTS.\n\n\n\n"; + cout << "\t\t\t\t\tPRESS THE 'ENTER' KEY TO START A QUIZ... "; + if (cin.get() == '\n') { + system("cls"); + cout << "\t\t\t\t\tI N F O R M A T I O N T A B L E\n\n"; + cout << "What is your name? "; + getline(cin, Name[0]); + cout << "What is your level of C++?"<> level; + cin.clear(); + } while (level != "1"&&level!="2"&&level!="3"); + string Respond; + cout << endl; + cout << "Are you ready to take the Quiz " << Name[0] << " ? Yes = 'Yes'/No = 'Any key'. " << endl; + cout << "Your choice: "; + cin >> Respond; + if (Respond == "yes" || Respond == "Yes") + { + cout << endl; + cout << "OK, Good Like!!! " << endl; + system("cls"); + return 1; + } + else + { + cout << "OK. Goodbye." << endl; + system("exit"); + return 0; + } + } + else + cout << "I meant ONLY the ENTER key... Oh well.\n"; + return 0; +} +//the view for the hints in the corner +void hints() +{ + cout << " ***********************************" << endl; + cout << " ** A: Audience help **" << endl; + cout << " ** B: 50:50 **" << endl; + cout << " ** C: Room for mistake **" << endl; + cout << " ** D: Change the question **" << endl; + cout << " ***********************************" << endl; +} +//questions +void question1() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 1"<< endl; + cout << "What is the correct value to return to the operating system upon the successful completion of a program?" << endl; + cout << "[1] -1"<> answer; + //limiting the answers of the user + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "3") + { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "2" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question1(); + } +} +void question2() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 2" << endl; + cout << "What is the only function all C++ programs must contain?" << endl; + cout << "[1] start()" << endl; + cout << "[2] system()" << endl; + cout << "[3] program()" << endl; + cout << "[4] main()" << endl; + string answer; + cout<> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "4") + { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question2(); + } + +} +void question3() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 3" << endl; + cout << "Which of the following is a correct comment?" << endl; + cout << "[1] / Comment /" << endl; + cout << "[2] ** Comment **" << endl; + cout << "[3] { Comment }" << endl; + cout << "[4] //comment" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "4") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question3(); + } +} +void question4() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 4" << endl; + cout << "Which of the following is the correct operator to compare two variables?" << endl; + cout << "[1] = =" << endl; + cout << "[2] :=" << endl; + cout << "[3] =" << endl; + cout << "[4] ==" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "4") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question4(); + } +} +void question5() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 5" << endl; + cout << "Which of the following is a complete function?" << endl; + cout << "[1] int funct();" << endl; + cout << "[2] int funct(int x) {return x=x+1;}" << endl; + cout << "[3] void funct(int) {cout<<'Hello'}" << endl; + cout << "[4] void funct(x) {cout<<'Hello'}" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "2") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "3" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question5(); + } + +} +void question6() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 6" << endl; + cout << "Which is not a proper prototype?" << endl; + cout << "[1] int funct(char x, char y);" << endl; + cout << "[2] double funct(char x)" << endl; + cout << "[3] void funct();" << endl; + cout << "[4] char x();" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "2") + { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + + } + else if (answer == "1" || answer == "3" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question6(); + } +} +void question7() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + cout << "\t\t\t\t\t Q U E S T I O N No. 7" << endl; + cout << "Which of the following is a two-dimensional array?" << endl; + cout << "[1] array anarray[20][20];" << endl; + cout << "[2] int anarray[20][20];" << endl; + cout << "[3] int array[20, 20];" << endl; + cout << "[4] char array[20];" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "2") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "3" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question7(); + } +} +void question8() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + hints(); + cout << "\t\t\t\t\t Q U E S T I O N No. 8" << endl; + cout << "Evaluate !(1 && !(0 || 1))." << endl; + cout << "[1] True" << endl; + cout << "[2] False" << endl; + cout << "[3] Unevaluatable" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + //limiting the answers of the user + if (answer == "1" || answer == "2" || answer == "3" ) + { + if (answer == "1") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + + } + else if (answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + //if cases for the hints + else if (answer == "A" || answer == "a") + { + hints_used++; + cout << endl; + cout << "Audience prediction is... " << endl; + cout << "[1] 42%" << endl; + cout << "[2] 38%" << endl; + cout << "[3] 20%" << endl; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 5." << endl; + + } + else if (answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + + } + + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "B" || answer == "b") + { + hints_used++; + system("cls"); + cout << "Now you have chance to choose two answers. If one of them will correct you will take 5 points." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 8" << endl; + cout << "Evaluate !(1 && !(0 || 1))." << endl; + cout << "[1] True" << endl; + cout << "[2] False" << endl; + cout << "[3] Unevaluatable" << endl; + string answer1, answer2; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR FIRST CHOICE: "; + cin >> answer1; + cout << "\t\t\t\t\tENTER YOUR SECOND CHOICE: "; + cin >> answer2; + if (answer1 == "1" || answer2 == "1") + { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + } + else + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "C" || answer == "c") + { + hints_used++; + system("cls"); + cout << "Now you have chance to answer incorrectly. You will take 5 points for this question." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 8" << endl; + cout << "Evaluate !(1 && !(0 || 1))." << endl; + cout << "[1] True" << endl; + cout << "[2] False" << endl; + cout << "[3] Unevaluatable" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + total_score += 5; + correct_answer += 1; + if(answer=="1") + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "D" || answer == "d") + { + hints_used++; + system("cls"); + cout << "\t T H I S I S A N E W Q U E S T I O N. Y O U W I L L G E T 5 P O I N T S. " << endl; + cout << endl; + cout << "When did INHA UNivercity in TAshkent established?." << endl; + cout << "[1] 2014" << endl; + cout << "[2] 1968" << endl; + cout << "[3] 2015" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + + } + else if (answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question8(); + } +} +void question9() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + hints(); + cout << "\t\t\t\t\t Q U E S T I O N No. 9" << endl; + cout << "What is the result of the program below?" << endl; + cout << " int x = 10; " << endl; + cout << " int y = 70; " << endl; + cout << " x = x + y; " << endl; + cout << " y = x - y; " << endl; + cout << " x = x - y; " << endl; + cout << endl; + cout << "[1] x=70, y=10" << endl; + cout << "[2] x=10, y=70" << endl; + cout << "[3] x=60, y=20" << endl; + cout << "[4] x=20, y=60" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "1") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + + } + else if (answer == "2" || answer == "3" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "A" || answer == "a") + { + hints_used++; + cout << endl; + cout << "Audience prediction is... " << endl; + cout << "[1] 30%" << endl; + cout << "[2] 25%" << endl; + cout << "[3] 20%" << endl; + cout << "[4] 25%" << endl; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + + } + else if (answer == "2" || answer == "3" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "B" || answer == "b") + { + hints_used++; + system("cls"); + cout << "Now you have chance to choose two answers. If one of them will correct you will take 5 points." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 9" << endl; + cout << "What is the result of the program below?" << endl; + cout << " int x = 10; " << endl; + cout << " int y = 70; " << endl; + cout << " x = x + y; " << endl; + cout << " y = x - y; " << endl; + cout << " x = x - y; " << endl; + cout << endl; + cout << "[1] x=70, y=10" << endl; + cout << "[2] x=10, y=70" << endl; + cout << "[3] x=60, y=20" << endl; + cout << "[4] x=20, y=60" << endl; + string answer1, answer2; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR FIRST CHOICE: "; + cin >> answer1; + cout << "\t\t\t\t\tENTER YOUR SECOND CHOICE: "; + cin >> answer2; + if (answer1 == "1" || answer2 == "1") + { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + } + else + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + } + cout << endl; + system("pause"); + system("cls"); + + } + else if (answer == "C" || answer == "c") + { + hints_used++; + system("cls"); + cout << "Now you have chance to answer incorrectly. You will take 5 points for this question." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 9" << endl; + cout << "What is the result of the program below?" << endl; + cout << " int x = 10; " << endl; + cout << " int y = 70; " << endl; + cout << " x = x + y; " << endl; + cout << " y = x - y; " << endl; + cout << " x = x - y; " << endl; + cout << endl; + cout << "[1] x=70, y=10" << endl; + cout << "[2] x=10, y=70" << endl; + cout << "[3] x=60, y=20" << endl; + cout << "[4] x=20, y=60" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + total_score += 5; + correct_answer += 1; + if (answer == "1") + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + cout << endl; + system("pause"); + system("cls"); + + } + else if (answer == "D" || answer == "d") { + hints_used++; + system("cls"); + cout << "\t T H I S I S A N E W Q U E S T I O N. Y O U W I L L G E T 5 P O I N T S. " << endl; + cout << endl; + cout << "When did INHA UNivercity in TAshkent established?." << endl; + cout << "[1] 2014" << endl; + cout << "[2] 1968" << endl; + cout << "[3] 2015" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + + } + else if (answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question9(); + } +} +void question10() { + cout << " ***********************************" << endl; + cout << " ***** TOTAL SCORE:" << total_score << " *****" << endl; + cout << " ***********************************" << endl; + hints(); + cout << "\t\t\t\t\t Q U E S T I O N No. 10" << endl; + cout << "What will i and j equal after the code below is executed?" << endl; + cout << "int i = 5;" << endl; + cout << "int j = i++;" << endl; + cout << "[1] i=5, j=5 " << endl; + cout << "[2] i=5, j=4" << endl; + cout << "[3] i=5, j=6" << endl; + cout << "[4] ERROR" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1" || answer == "2" || answer == "3" || answer == "4") + { + if (answer == "3") { + total_score += 10; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 10 points out of 10." << endl; + } + else if (answer == "1" || answer == "2" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 10." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "A" || answer == "a") + { + hints_used++; + cout << endl; + cout << "Audience prediction is... " << endl; + cout << "[1] 30%" << endl; + cout << "[2] 25%" << endl; + cout << "[3] 20%" << endl; + cout << "[4] 25%" << endl; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "3") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + } + else if (answer == "1" || answer == "2" || answer == "4") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "B" || answer == "b") + { + hints_used++; + system("cls"); + cout << "Now you have chance to choose two answers. If one of them will correct you will take 5 points." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 10" << endl; + cout << "What will i and j equal after the code below is executed?" << endl; + cout << "int i = 5;" << endl; + cout << "int j = i++;" << endl; + cout << "[1] i=5, j=5 " << endl; + cout << "[2] i=5, j=4" << endl; + cout << "[3] i=5, j=6" << endl; + cout << "[4] ERROR" << endl; + string answer1, answer2; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR FIRST CHOICE: "; + cin >> answer1; + cout << "\t\t\t\t\tENTER YOUR SECOND CHOICE: "; + cin >> answer2; + if (answer1 == "3" || answer2 == "3") + { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + } + else + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + } + cout << endl; + system("pause"); + system("cls"); + } + else if (answer == "C" || answer == "c") + { + hints_used++; + system("cls"); + cout << "Now you have chance to answer incorrectly. You will take 5 points for this question." << endl; + cout << "\t\t\t\t\tQ U E S T I O N No. 10" << endl; + cout << "What will i and j equal after the code below is executed?" << endl; + cout << "int i = 5;" << endl; + cout << "int j = i++;" << endl; + cout << "[1] i=5, j=5 " << endl; + cout << "[2] i=5, j=4" << endl; + cout << "[3] i=5, j=6" << endl; + cout << "[4] ERROR" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + total_score += 5; + correct_answer += 1; + if (answer == "3") + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + cout << endl; + system("pause"); + system("cls"); + + } + else if (answer == "D" || answer == "d") { + hints_used++; + system("cls"); + cout << "\t T H I S I S A N E W Q U E S T I O N. Y O U W I L L G E T '5' P O I N T S. " << endl; + cout << endl; + cout << "When did INHA UNivercity in TAshkent established?." << endl; + cout << "[1] 2014" << endl; + cout << "[2] 1968" << endl; + cout << "[3] 2015" << endl; + string answer; + cout << endl; + cout << "\t\t\t\t\tENTER YOUR CHOICE: "; + cin >> answer; + if (answer == "1") { + total_score += 5; + correct_answer += 1; + cout << "C O R R E C T A N S W E R !!!" << endl; + cout << "You got 5 points out of 5." << endl; + + } + else if (answer == "2" || answer == "3") + { + cout << "W R O N G A N S W E R !!!" << endl; + cout << "You got 0 points out of 5." << endl; + + } + cout << endl; + system("pause"); + system("cls"); + } + else + { + system("cls"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t**** P L E A S E I N P U T C O R R E C T V A L U E ! ****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + question10(); + } +} +//function for the view after game +void after_game() { + system("cls"); + system("color 0A"); + cout << "\t\t*************************************************************************************" << endl; + cout << "\t\t***** *****" << endl; + cout << "\t\t***** C O N G R A T U L A T I O N S ! ! ! *****" << endl; + cout << "\t\t***** = = = = = = = = = = = = = = = = = = = = = = = = *****" << endl; + cout << "\t\t***** = = = = = = = = = = = *****" << endl; + cout << "\t\t***** *****" << endl; + cout << "\t\t***** *****" << endl; + cout << "\t\t***** *****" << endl; + cout << "\t\t*************************************************************************************" << endl; + cout << endl; + cout << "\tTOTAL SCORE: " << total_score << endl; + cout << "\tYOU HAVE ANSWERED FOR '" << correct_answer << "' QUESTIONS OUT OF 10." << endl; + cout << "\tYOU HAVE USED "<> play_again; + if (play_again == "Yes" || play_again == "yes") + { + total_score = 0; + main(); + } + else + cout << "OK, Goodbye! "; +} From 7b56a60e4c1fe4efbe3e64bac0a01ebb0f58a913 Mon Sep 17 00:00:00 2001 From: Yash Tariyal <77398467+YashTariyal@users.noreply.github.com> Date: Sun, 9 Oct 2022 20:08:45 +0530 Subject: [PATCH 041/290] Two Sum IV - Input is a BST --- Two Sum IV - Input is a BST.cpp | 109 ++++++++++++++++++++++++++++++++ 1 file changed, 109 insertions(+) create mode 100644 Two Sum IV - Input is a BST.cpp diff --git a/Two Sum IV - Input is a BST.cpp b/Two Sum IV - Input is a BST.cpp new file mode 100644 index 0000000..426fd07 --- /dev/null +++ b/Two Sum IV - Input is a BST.cpp @@ -0,0 +1,109 @@ +/** + * 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) {} + * }; + */ +#define VALID_MIN -10000 +#define VALID_MAX 10000 +class Solution { +public: + bool FindTargetTwo(struct TreeNode* pstLeft, struct TreeNode* pstRight, int nK) +{ + if(pstLeft->val + pstRight->val == nK) return true; + + if(pstLeft->val + pstRight->val > nK) + { + if(pstLeft->left && FindTargetTwo(pstLeft->left, pstRight, nK)) return true; + + if(pstRight->left && FindTargetTwo(pstLeft, pstRight->left, nK)) return true; + } + else + { + if(pstLeft->right && FindTargetTwo(pstLeft->right, pstRight, nK)) return true; + + if(pstRight->right && FindTargetTwo(pstLeft, pstRight->right, nK)) return true; + } + + return false; +} + +bool FindTargetOne(struct TreeNode* pstRoot, int nK) +{ + if(pstRoot->val == nK) return true; + + if(pstRoot->val > nK) + { + if(pstRoot->left && FindTargetOne(pstRoot->left, nK)) return true; + } + else + { + if(pstRoot->right && FindTargetOne(pstRoot->right, nK)) return true; + } + + return false; +} + +bool FindTargetInner(struct TreeNode* pstRoot, int nK, short sMin, short sMax) +{ + if(pstRoot->left == NULL && pstRoot->right == NULL) return false; + + // find minimum of input BST + if(sMin < VALID_MIN) + { + struct TreeNode* pstTmp = pstRoot; + while(pstTmp->left) pstTmp = pstTmp->left; + sMin = pstTmp->val; + if(nK <= sMin * 2) return false; + } + + // check relation of pstRoot->val & sMin + if(nK == pstRoot->val + sMin) return true; + if(nK < pstRoot->val + sMin) return pstRoot->left && FindTargetInner(pstRoot->left, nK, sMin, SHRT_MAX); + + // find maximum of input BST + if(sMax > VALID_MAX) + { + struct TreeNode* pstTmp = pstRoot; + while(pstTmp->right) pstTmp = pstTmp->right; + sMax = pstTmp->val; + if(nK >= sMax * 2) return false; + } + + // check relation of pstRoot->val & sMax + if(nK == pstRoot->val + sMax) return true; + if(nK > pstRoot->val + sMax) return pstRoot->right && FindTargetInner(pstRoot->right, nK, SHRT_MIN, sMax); + + // if one value is current root, check the other one + if(nK < pstRoot->val * 2) + { + if(pstRoot->left) + { + if(FindTargetOne(pstRoot->left, nK-pstRoot->val)) return true; + + if(FindTargetInner(pstRoot->left, nK, sMin, SHRT_MAX)) return true; + } + } + else if(nK > pstRoot->val * 2) + { + if(pstRoot->right) + { + if(FindTargetOne(pstRoot->right, nK-pstRoot->val)) return true; + + if(FindTargetInner(pstRoot->right, nK, SHRT_MIN, sMax)) return true; + } + } + + // check both left & right leaf + return pstRoot->left && pstRoot->right && FindTargetTwo(pstRoot->left, pstRoot->right, nK); +} + +bool findTarget(struct TreeNode* root, int k){ + return FindTargetInner(root, k, SHRT_MIN, SHRT_MAX); +} +}; From 42f7e856cae0c534ce0e78a69cc0a2fd0cc6cc89 Mon Sep 17 00:00:00 2001 From: Arunim Malviya <85449742+Arunim313@users.noreply.github.com> Date: Sun, 9 Oct 2022 23:21:01 +0530 Subject: [PATCH 042/290] 240, 2919 Added --- Concatenation_Array.cpp | 13 +++++++++++++ Search_2DMatrix_II.cpp | 28 ++++++++++++++++++++++++++++ 2 files changed, 41 insertions(+) create mode 100644 Concatenation_Array.cpp create mode 100644 Search_2DMatrix_II.cpp diff --git a/Concatenation_Array.cpp b/Concatenation_Array.cpp new file mode 100644 index 0000000..0e79d4b --- /dev/null +++ b/Concatenation_Array.cpp @@ -0,0 +1,13 @@ +class Solution { +public: + vector getConcatenation(vector& nums) { + vector ans = nums; + + for(int i=0; i>& matrix, int target) { + + int row = matrix.size(); + int col = matrix[0].size(); + + int rowIndex = 0; + int colIndex = col-1; + + while(rowIndex=0){ + + int element = matrix[rowIndex][colIndex]; + + if(element == target){ + return 1; + } + + if(element < target){ + rowIndex++; + } + else{ + colIndex--; + } + } + return 0; + } +}; \ No newline at end of file From 87c88e7958813913be6969f1b4512e345f1b6a2e Mon Sep 17 00:00:00 2001 From: Suryansh Prajapati Date: Sun, 9 Oct 2022 23:37:55 +0530 Subject: [PATCH 043/290] Kids_With_the_Greatest_Number_of_Candies Program JAVA --- Kids_With_the_Greatest_Number_of_Candies.java | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Kids_With_the_Greatest_Number_of_Candies.java diff --git a/Kids_With_the_Greatest_Number_of_Candies.java b/Kids_With_the_Greatest_Number_of_Candies.java new file mode 100644 index 0000000..ade12da --- /dev/null +++ b/Kids_With_the_Greatest_Number_of_Candies.java @@ -0,0 +1,26 @@ +// Leetcode - 1431. Kids With the Greatest Number of Candies +// https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/ + + + +class Solution { + public List kidsWithCandies(int[] candies, int extraCandies) { + ArrayList list = new ArrayList(); + int max = Integer.MIN_VALUE; + for(int i=0;i= max){ + list.add(true); + }else{ + list.add(false); + } + } + + return list; + } +} \ No newline at end of file From 69ecb77e6adb81bec55cdbf6899a720898ccb148 Mon Sep 17 00:00:00 2001 From: Madhur Yadav <89018068+madhurydv@users.noreply.github.com> Date: Sun, 9 Oct 2022 23:46:59 +0530 Subject: [PATCH 044/290] Added solution to Eventual Safe States --- Eventual_safe_states | 79 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 79 insertions(+) create mode 100644 Eventual_safe_states diff --git a/Eventual_safe_states b/Eventual_safe_states new file mode 100644 index 0000000..3677944 --- /dev/null +++ b/Eventual_safe_states @@ -0,0 +1,79 @@ +#include +using namespace std; +class Solution { +public: + bool detect(int node,vectoradj[],int vis[],int pathVis[],int check[]) + { + vis[node]=1; + pathVis[node]=1; + check[node]=0; + //traversing all adjacent nodes + for(auto adjacentNode:adj[node]) + { + //when the node is not visited + if(!vis[adjacentNode]) + { + if(detect(adjacentNode,adj,vis,pathVis,check)) + { + check[node]=0; + return true; + } + } + //if the node has been previously visited + //but it has to be visited on the same path + else if(pathVis[adjacentNode]) + { + check[node]=0; + return true; + } + } + check[node]=1; + pathVis[node]=0; + return false; + } + vector eventualSafeNodes(int V, vector adj[]) + { + int vis[V]={0}; + int check[V]={0}; + int pathVis[V]={0}; + vectorans; + for(int i = 0 ; i < V ; i++) + { + if(!vis[i]) + { + detect(i,adj,vis,pathVis,check); + } + } + for(int i = 0 ; i >t; + while(t--) + { + int Vertices,Edges; + cin>>Vertices>>Edges; + vectoradj[Vertices]; + + for(int i = 0 ; i < Edges ; i++) + { + int u,v;cin>>u>>v; + adj[u].push_back(v); + } + + Solution obj; + vectorsafeNodes=obj.eventualSafeNodes(V,adj); + for(auto i:safeNodes){ + cout< Date: Mon, 10 Oct 2022 09:35:28 +0530 Subject: [PATCH 045/290] Added a code for longest substring without repeating character --- ...substring_without_repeating_characters.cpp | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 longest_substring_without_repeating_characters.cpp diff --git a/longest_substring_without_repeating_characters.cpp b/longest_substring_without_repeating_characters.cpp new file mode 100644 index 0000000..d1e1547 --- /dev/null +++ b/longest_substring_without_repeating_characters.cpp @@ -0,0 +1,43 @@ +#include +using namespace std; + +// This function returns true if all characters in str[i..j] +// are distinct, otherwise returns false +bool areDistinct(string str, int i, int j) +{ + + // Note : Default values in visited are false + vector visited(26); + + for (int k = i; k <= j; k++) { + if (visited[str[k] - 'a'] == true) + return false; + visited[str[k] - 'a'] = true; + } + return true; +} + +// Returns length of the longest substring +// with all distinct characters. +int longestUniqueSubsttr(string str) +{ + int n = str.size(); + int res = 0; // result + for (int i = 0; i < n; i++) + for (int j = i; j < n; j++) + if (areDistinct(str, i, j)) + res = max(res, j - i + 1); + return res; +} + +// Driver code +int main() +{ + string str = "geeksforgeeks"; + cout << "The input string is " << str << endl; + int len = longestUniqueSubsttr(str); + cout << "The length of the longest non-repeating " + "character substring is " + << len; + return 0; +} \ No newline at end of file From 6ff9bf8e39239ba11f26770359c9a51d302594b1 Mon Sep 17 00:00:00 2001 From: Sambhav Goel <85975084+Sambhavgoel@users.noreply.github.com> Date: Mon, 10 Oct 2022 14:50:52 +0530 Subject: [PATCH 046/290] Create guessing_the_number.c --- guessing_the_number.c | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 guessing_the_number.c diff --git a/guessing_the_number.c b/guessing_the_number.c new file mode 100644 index 0000000..bba9515 --- /dev/null +++ b/guessing_the_number.c @@ -0,0 +1,30 @@ +#include +#include +#include +int main() +{ + int guess,nguess=1,num; + srand(time(0)); + num=rand()%100+1; + do + { + printf("Guess the right number between 1 to 100 : \n"); + scanf("%d",&guess); + if(guess>num) + { + printf("LOWER NUMBER PLEASE : \n"); + } + else if(num>guess) + { + printf("GREATER NUMBER PLEASE : \n"); + } + else + { + printf("*CONGRATULATION !!! YOU GUESS THE RIGHT NUMBER. \n"); + printf("*YOU GUESS THE RIGHT NUMBER IN %d ATTEMPTS \n",nguess); + } + nguess++; + } + while(guess!=num); + +} From a1203cd0f8de863135de64fb8548bf083aa4601d Mon Sep 17 00:00:00 2001 From: Shivam Gupta <87704010+shivam7366@users.noreply.github.com> Date: Mon, 10 Oct 2022 18:35:50 +0530 Subject: [PATCH 047/290] codeforces problem 405-A Gravity Flip Solution --- gravityflipProblem.cpp | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 gravityflipProblem.cpp diff --git a/gravityflipProblem.cpp b/gravityflipProblem.cpp new file mode 100644 index 0000000..ac1f6b1 --- /dev/null +++ b/gravityflipProblem.cpp @@ -0,0 +1,17 @@ +//codeforces problem 405-A Gravity Flip Solution +#include +using namespace std; + +int main (){ + int n; + cin>>n; + int a[n]; + for (int i=0;i>a[i]; + sort(a,a+n); + for (int i=0;i Date: Mon, 10 Oct 2022 16:30:26 +0300 Subject: [PATCH 048/290] The given solution and it's detailed explaination is done --- EditDistance.cpp | 41 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 EditDistance.cpp diff --git a/EditDistance.cpp b/EditDistance.cpp new file mode 100644 index 0000000..1dab8aa --- /dev/null +++ b/EditDistance.cpp @@ -0,0 +1,41 @@ +/*Name -:Jai Sinha + Date-:03-10-2022 */ + +//Question +//to convert one string to another by deleting,updating,replacing the characters of the first string in minimum moves + + +#include +using namespace std; +int editDistance(string str1, string str2) +{ + //doing space optimization + int n=str1.length(); + int m=str2.length(); + vector pre(m+1,0); //creating a pre vector + for(int i=0;i<=m;i++) + pre[i]=i; //initializing the pre vector by i + for(int i=1;i<=n;i++) + { + vector temp(m+1,0); //making a temperorary vector + temp[0]=i; + for(int j=1;j<=m;j++) + { + if(str1[i-1]==str2[j-1]) //if the previous elements are equal + temp[j]= pre[j-1]; store the value + else + temp[j]=1+min(pre[j],min(temp[j-1],pre[j-1])); //else store the minimum of the elements + } + pre=temp; //now==>previous vector becomes temp vector + } + return pre[m]; +} +//main function +int main() +{ + string s; + cin>>s; + string s2; + cin>>s2; + return editDistance(s,s2); //calling function +} From fc012bda14990b5699e2735822ea7da85e54a1f3 Mon Sep 17 00:00:00 2001 From: XplosivePotato <75004866+XplosivePotato@users.noreply.github.com> Date: Mon, 10 Oct 2022 22:37:14 +0530 Subject: [PATCH 049/290] Hacktoberfest submission Please accept --- Autobot Youtube clipper.py | 174 +++++++++++++++++++++++++++++++++++++ 1 file changed, 174 insertions(+) create mode 100644 Autobot Youtube clipper.py diff --git a/Autobot Youtube clipper.py b/Autobot Youtube clipper.py new file mode 100644 index 0000000..aad07dc --- /dev/null +++ b/Autobot Youtube clipper.py @@ -0,0 +1,174 @@ +# Input Twitch vod URL +# Input timestamps of the clip +# Retrieve the clip from the twitch live stream +# Show the clip for preview +# Open Video trimmer for editting the clip +# Input Title, Description, Tags +# Input credits +# Upload to YT +# Show YT link + + +import os +import os.path +import re +import sys +from datetime import datetime +import pytz +import videotrim_util +import ytupload_util +import webbrowser +import time + + +default_description = "" +default_categoryId = "20" + +try: + f=open("constdesc.txt") + default_description=f.read() + f.close() +except Exception as e: + default_description="" + + + +def credits(): + print("[~] Written by Archit Shukla") + print("[~] Thanks to streamlink CLI (https://streamlink.github.io)") + print() + + +def checks(): + # check if client_secret.json and credentials.txt files are present + if not os.path.isfile("client_secrets.json"): + print("[!] Client Secret file is missing. Make sure you download it from your GCP dashboard and place it in the current directory") + sys.exit(0) + + if not os.path.isfile("credentials.txt"): + # Trigger flask server to enable use to authenticate with their account + print("[!] credentials.txt is missing!") + print("[!] You need to initially authenticate with your Google Account so that the video can be uploaded to your channel. Don't worry, you only need to do this once.") + print("[-] Run config.py to authenticate with your google account and create credentials.txt") + +def validateInput(inp, pattern): + if re.search(pattern, inp): + return True + return False + + +def getOffsetAndDuration(start_time, end_time): + start_do = datetime.strptime(start_time, "%H:%M:%S") + end_do = datetime.strptime(end_time, "%H:%M:%S") + offset = start_time + duration = str(end_do-start_do).split(".")[0] + return [offset,duration] + + +def getTwitchClip(creator_name, twitch_url, offset, duration): + print("[*] Getting clip from Twitch Live Stream with streamlink..") + # Use Streamlink to get the clip + filename = os.path.join("clips",creator_name+(datetime.now(pytz.timezone('Asia/Kolkata'))).strftime("%m%d%Y-%H_%M_%S")+".ts") + + cmd = "streamlink %s best --hls-start-offset %s --hls-duration %s -o %s"%(twitch_url,offset,duration,filename) + print("[*] %s"%cmd) + os.system(cmd) + return filename + + +def main(): + credits() + creator_name = input("[+] Twitch Creator name: ").replace(" ","") + twitch_url = input("[+] Twitch VOD URL: ") + if not validateInput(twitch_url,r"^https://www.twitch.tv/videos/.*$"): + print("[!] Bad Input. Make sure you input twitch VOD URL and not the live stream URL.") + sys.exit() + start_time = input("[+] Clip Start time (HH:MM:SS): ") + if not validateInput(start_time,r"^[0-9][0-9]:[0-6][0-9]:[0-6][0-9]$"): + print("[!] Bad Input. Make sure you follow the input format correctly.") + sys.exit() + end_time = input("[+] Clip End time (HH:MM:SS): ") + if not validateInput(end_time,r"^[0-9][0-9]:[0-6][0-9]:[0-6][0-9]$"): + print("[!] Bad Input. Make sure you follow the input format correctly.") + sys.exit() + + + offset, duration = getOffsetAndDuration(start_time, end_time) + + + if not os.path.isdir("clips"): + os.mkdir("clips") + + + filename = getTwitchClip(creator_name, twitch_url, offset, duration) + + # Check if the download is successful + if os.path.isfile(filename): + print("[*] Downloaded clip succesfully! - %s"%filename) + else: + print("[!] Download failed!") + sys.exit(0) + + + print("[*] Opening clip in video player..") + os.startfile(filename) + + op = input("[+] Do you want to trim the video? (Y/n): ") + if(op in ["Y","y",""]): + # Open video trimming util + if (videotrim_util.trimVideo(filename)): + print("[*] Video trimmed successfully!") + filename = filename.split(".ts")[0]+"_trimmed.ts" + else: + print("[!] Video trim failed!") + op = input("Do you want to (E)xit or (C)ontinue?") + if op in ["E","e",""]: + sys.exit() + + elif op in ["N","n"]: + # Do not open video trimming util + pass + + + op = input("[+] Upload to YouTube? (Y/n): ") + + if op in ["Y","y",""]: + # Upload created clip to YT + + yt_title = input("[+] Video Title: ") + yt_description = input("[+] Video Description (leave empty for default description): ") + yt_tags = input("[+] Video Tags (seperated by comas): ") + yt_categoryId = input("[+] Category ID (Leave empty for Gaming): ") + yt_privacyStatus = input("[+] Privacy Status (public/private/unlisted): ") + yt_credits = input("[+] Credits for Original Creator: ") + + if yt_title=="": + print("[!] Title can't be empty") + + if yt_privacyStatus.lower() not in ["public","private","unlisted"]: + print("[!] Invalid privacy status") + + if yt_description=="": + yt_description = default_description + + if yt_categoryId=="": + yt_categoryId = default_categoryId + + + yt_description+="\n"+"Credits: \n"+yt_credits + + print("[*] Uploading video to YouTube. This might take a while..be patient, do not close the script.") + videoId = ytupload_util.upload(filename, yt_title, yt_description, yt_tags, yt_categoryId, yt_privacyStatus) + + if videoId is not None: + print("[*] Succesfully uploaded video. ") + print("[*] https://www.youtube.com/watch?v=%s"%videoId) + + else: + print("[!] Video upload failed.") + + + +if __name__ == "__main__": + checks() + main() From ab3765df4cd647b226ffc97c87d722490123b08f Mon Sep 17 00:00:00 2001 From: Venukanthan BS <114436303+itsvenu22@users.noreply.github.com> Date: Tue, 11 Oct 2022 00:04:56 +0530 Subject: [PATCH 050/290] Create Postevent_update_2.html --- Postevent_update_2.html | 91 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 91 insertions(+) create mode 100644 Postevent_update_2.html diff --git a/Postevent_update_2.html b/Postevent_update_2.html new file mode 100644 index 0000000..d0f23a3 --- /dev/null +++ b/Postevent_update_2.html @@ -0,0 +1,91 @@ + + + + + + + +Cool Grey Outer Glow Pointer + + +
+ +Survey + + + +
+
+ + + +
+

Post Event Feedback Survey

+ +
+
+ + +Enter your name: + +

+Enter your department: + +

+Tell us a little bit about yourself:
+

+Do you like this event?
+Yes
+No +

+How did you know about this event? +

+Social Media +University +Friends +Google +

+What do you like the most about this event? + + + +

+Feedback form:
+

+
+ +
+

+
+ + +
+
+ + From 131beb0ca7865320724366c4433c00cba35367a2 Mon Sep 17 00:00:00 2001 From: Atmagyan Singh <55326048+Black-D3vil007@users.noreply.github.com> Date: Tue, 11 Oct 2022 01:03:09 +0530 Subject: [PATCH 051/290] Create FUNDING.yml --- .github/FUNDING.yml | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 .github/FUNDING.yml diff --git a/.github/FUNDING.yml b/.github/FUNDING.yml new file mode 100644 index 0000000..68539a2 --- /dev/null +++ b/.github/FUNDING.yml @@ -0,0 +1,4 @@ +# These are supported funding model platforms + +github: # [@kasakvaish] +patreon: # @kasakvaish From 562b8d1f306e70bb88603c741ab17be00dfc5779 Mon Sep 17 00:00:00 2001 From: Atmagyan Singh <55326048+Black-D3vil007@users.noreply.github.com> Date: Tue, 11 Oct 2022 01:47:27 +0530 Subject: [PATCH 052/290] Create README.md Co-authored-by: Kasak Vaish kasakvaish02@gmail.com Co-authored-by: Tushar Vaish smartytushar855@gmail.com --- README.md | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..8400436 --- /dev/null +++ b/README.md @@ -0,0 +1,3 @@ +# Leetcode75 +Leetcode 75 days +Contribute here From 6bdb14699687bbff7a56e1a8c5be0f40b083456e Mon Sep 17 00:00:00 2001 From: Atmagyan Singh <55326048+Black-D3vil007@users.noreply.github.com> Date: Tue, 11 Oct 2022 06:43:28 +0530 Subject: [PATCH 053/290] Codes Are added Hello Co-Authored-By: Kasak Vaish <99035589+kasakvaish@users.noreply.github.com> --- AllocateBooks.cpp | 119 ++++++++++++++++++ MergeInterval.cpp | 158 ++++++++++++++++++++++++ NQueens.cpp | 155 ++++++++++++++++++++++++ OverlappingABBA.cpp | 113 +++++++++++++++++ Russian_Doll.cpp | 208 ++++++++++++++++++++++++++++++++ SearchRowColumnSortedMatrix.cpp | 87 +++++++++++++ SquareRoot.cpp | 91 ++++++++++++++ SumofTwoArray.cpp | 110 +++++++++++++++++ Time2BurnTree.cpp | 158 ++++++++++++++++++++++++ Trie.cpp | 101 ++++++++++++++++ Trie.exe | Bin 0 -> 50788 bytes ValidPair.cpp | 141 ++++++++++++++++++++++ countSmallerNumber.cpp | 163 +++++++++++++++++++++++++ cutRod.cpp | 101 ++++++++++++++++ findPermutations.cpp | 97 +++++++++++++++ findTriplets.cpp | 133 ++++++++++++++++++++ fixedPoint.cpp | 92 ++++++++++++++ longestMountain.cpp | 99 +++++++++++++++ maxMinWindow.cpp | 79 ++++++++++++ maxSubarraySum.cpp | 97 +++++++++++++++ maxXorQueries.cpp | 152 +++++++++++++++++++++++ maximumMeetings.cpp | 131 ++++++++++++++++++++ rootToLeafSum.cpp | 119 ++++++++++++++++++ searchRotatedSortedArr.cpp | 136 +++++++++++++++++++++ shortestPathUnweightedGraph.cpp | 126 +++++++++++++++++++ sortStack.cpp | 99 +++++++++++++++ 26 files changed, 3065 insertions(+) create mode 100644 AllocateBooks.cpp create mode 100644 MergeInterval.cpp create mode 100644 NQueens.cpp create mode 100644 OverlappingABBA.cpp create mode 100644 Russian_Doll.cpp create mode 100644 SearchRowColumnSortedMatrix.cpp create mode 100644 SquareRoot.cpp create mode 100644 SumofTwoArray.cpp create mode 100644 Time2BurnTree.cpp create mode 100644 Trie.cpp create mode 100644 Trie.exe create mode 100644 ValidPair.cpp create mode 100644 countSmallerNumber.cpp create mode 100644 cutRod.cpp create mode 100644 findPermutations.cpp create mode 100644 findTriplets.cpp create mode 100644 fixedPoint.cpp create mode 100644 longestMountain.cpp create mode 100644 maxMinWindow.cpp create mode 100644 maxSubarraySum.cpp create mode 100644 maxXorQueries.cpp create mode 100644 maximumMeetings.cpp create mode 100644 rootToLeafSum.cpp create mode 100644 searchRotatedSortedArr.cpp create mode 100644 shortestPathUnweightedGraph.cpp create mode 100644 sortStack.cpp diff --git a/AllocateBooks.cpp b/AllocateBooks.cpp new file mode 100644 index 0000000..d4a0b8f --- /dev/null +++ b/AllocateBooks.cpp @@ -0,0 +1,119 @@ +#include +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +bool isPossible(long long t, int n, int m, vector& time) { + int days = 1; + + long long daysSum = 0; + + for(int i = 0; i < m; i++) { + if(daysSum + time[i] <= t) { + daysSum += time[i]; + } + else { + days += 1; + daysSum = time[i]; + } + } + + return days <= n; +} + + + +long long ayushGivesNinjatest(int n, int m, vector time) { + // Write your code here. + + int minTime = 0; + long long maxTime = 0; + + for(int i = 0; i < m; i++) { + maxTime += time[i]; + minTime = max(minTime, time[i]); + } + + long long l = minTime, r = maxTime, ans; + while(l <= r) { + + long long mid = (l+r)/2; + + if(isPossible(mid, n, m, time)) { + ans = mid; + r = mid - 1; + } + else { + l = mid + 1; + } + } + + return ans; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +/* + + intervals[i][0] = start point of i'th interval + intervals[i][1] = finish point of i'th interval + +*/ + +/* +bool isOverlap(int &minS, int &maxE, vector &intervals) { + if(minS > intervals[1] or maxE < intervals[0]) { + return false; + } + return true; +} + + + +vector> mergeIntervals(vector> &intervals) { + // Write your code here. + + int n = intervals.size(); + + vector> res; + vector vis(n, false); + + for(int i = 0; i < n; i++) { + if(vis[i]) { + continue; + } + + vis[i] = true; + + int minS = intervals[i][0]; + int maxE = intervals[i][1]; + + while(true) { + int cnt = 0; + + for(int j = 0; j < n; j++) { + if(not vis[j] and isOverlap(minS, maxE, intervals[j])) { + vis[j] = true; + minS = min(minS, intervals[j][0]); + maxE = max(maxE, intervals[j][1]); + cnt++; + } + + } + + if(cnt == 0) break; + + + } + + vector interval = {minS, maxE}; + res.push_back(interval); + + } + + sort(res.begin(), res.end()); + + return res; + +}*/ + + +// Optimized Approach + + +vector > mergeIntervals(vector> &intervals) { + int n = intervals.size(); + + sort(intervals.begin(),intervals.end()); + + vector > res; + + for(int i = 0; i < n; i++) { + int curS = intervals[i][0]; + int curE = intervals[i][1]; + + if(res.size() == 0 or curS > res[res.size()-1][1]) + res.push_back(intervals[i]); + else + res[res.size() - 1][1] = max(res[res.size() - 1][1], curE); + } + + return res; +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +bool notPresentCol(int col, int row, vector& board, int n) { + + for(int i = 0; i < row; i++) { + int idx = i * n + col; + if(board[idx] == 1) + return false; + } + + return true; + +} + + + +bool notPresentDiag(int col, int row, vector& board, int n) { + + int i = row - 1; + int j = col - 1; + + while(i >= 0 and j >= 0) { + int idx = i * n + j; + if(board[idx] == 1) + return false; + + i -= 1; + j -= 1; + } + + i = row - 1; + j = col + 1; + + + while(i >= 0 and j < n) { + int idx = i * n + j; + if(board[idx] == 1) + return false; + + i -= 1; + j += 1; + } + + return true; + + +} + + + + +void rec(int row, int n, vector& board, vector>& config) { + + if(row == n) { + config.push_back(board); + return; + } + + for(int col = 0; col < n; ++col) { + if(notPresentCol(col, row, board, n) and notPresentDiag(col, row, board, n)) { + int idx = row*n + col; + board[idx] = 1; + rec(row+1, n, board, config); + board[idx] = 0; + } + } + +} + + + +vector> solveNQueens(int n) { + // Write your code here. + + vector board(n*n, 0); + + vector> config; + + rec(0, n, board, config); + + return config; + +} + + + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +bool findOverlap(string &s){ + // Write your code here. + + string a ="", b = ""; + + for(int i = 0; i < s.length()-1; i++) { + if(a.length() == 0) { + if(s[i] == 'A' and s[i+1] == 'B'){ + a = a+'A'+'B'; + i++; + } + } + else{ + if(s[i] == 'B' and s[i+1] == 'A') + return true; + } + } + + for(int i = 0; i < s.length(); i++) { + if(b.length() == 0) { + if(s[i] == 'B' and s[i+1] == 'A'){ + b = b + 'B'+'A'; + i++; + } + } + else { + if(s[i] == 'A' and s[i+1] == 'B') + return true; + } + } + + return false; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + string s; + getline(cin, s); + + bool ans = findOverlap(s); + + if(ans) cout << "true" << endl; + else cout << "false" << endl; + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + +// Bruteforce Approach + +/*int helper(vector &height, vector &width, int n, int &maxHeight, int &maxWidth) { + int maxEnvelopes = 0; + + // Recursively try to find all way to russian doll envelope inside it + for(int i = 0; i < n; i++) { + if(height[i] < maxHeight and width[i] < maxWidth) { + maxEnvelopes = max(maxEnvelopes, 1 + helper(height, width, n, height[i], width[i])); + } + + } + + return maxEnvelopes; +} + + +int findMaxEnvelopes(vector &height, vector &width, int n) { + // Write your code here. + + // Maximum height and width of envelopes that can be placed + int maxHeight = INT_MAX; + int maxWidth = INT_MAX; + + // recursively find maximum number of envelopes that can russian doll + + return helper(height, width, n, maxHeight, maxWidth); + +}*/ + + + +// DP Approach + + +/*int findMaxEnvelopes(vector&height, vector&width, int n){ + + vector> envelopes(n, bector(2)); + + for(int i = 0; i < n; i++){ + + envelopes[i][0] = height[i]; + envelopes[i][1] = width[i]; + + } + + sort(envelopes.begin(),envelopes.end(), [](vector &v1, vector &v2) -> bool { + if(v1[0] < v2[0] or (v1[0] == v2[0] and v1[1] > v2[1])) { + return true; + } + return false; + }); + + vector maxEnvelopes(n); + + int res = 0; + + for(int i = 1; i < n; i++){ + maxEnvelopes[i] = 1; + for(int j = i-1; j >= 0; j--){ + + if(envelopes[i][1] > envelopes[j][1]){ + + maxEnvelopes[i] = max(maxEnvelopes[i], maxEnvelopes[j]+1); + + } + + result = max(result, maxEnvelopes[i]); + + } + } + + return result; + +}*/ + + + +// Approach 3 Dynamic Programming and Binary Search + +/* + Time Complexity : O(N * log(N)) + Space Complexity : O(N) + + Where 'N' is the number of envelopes. +*/ + + +int longestIncreasingSubsequence(vector &arr, int n) { + + // Here tail[i] will be last element of incresing sequence of length 'i'. + vector tail(n); + + tail[0] = arr[0]; + int length = 1; + + for(int i = 1; i < n; i++) { + + // Binary search to find position in 'tail' array. + int j = lower_bound(tail.begin(), tail.begin() + length, arr[i]) - tail.begin(); + + if(j == length) { + tail[length++] = arr[i]; + } + else { + tail[j] = arr[i]; + } + } + + return length; +} + +int findMaxEnvelopes(vector &height, vector &width, int n) { + + // Store height and width of each envelop in matrix 'envelopes'. + vector> envelopes(n, vector(2)); + for(int i = 0; i < n; i++) { + envelopes[i][0] = height[i]; + envelopes[i][1] = width[i]; + } + + // Sort matrix 'envelopes' in increasing order of their height and if height are equal then arrange in decreasing order of width. + sort(envelopes.begin(), envelopes.end(), [](vector &v1, vector &v2)->bool{ + if(v1[0] < v2[0] or (v1[0] == v2[0] and v1[1] > v2[1])) { + return true; + } + return false; + }); + + // Copy second column of matrix 'envelopes' after sorting. + vector arr(n); + for(int i = 0; i < n; i++) { + arr[i] = envelopes[i][1]; + } + + return longestIncreasingSubsequence(arr, n); +} + + + + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +pair search(vector> matrix, int x) { + // Write your code here. + int rows = matrix.size(); + + int cols = matrix[0].size(); + int row = 0, col = cols-1; + + while(row < rows and col > -1) { + int cur = matrix[row][col]; + if(cur == x) return {row, col}; + if(x > cur) row++; + else col--; + } + + return {-1, -1}; + +} + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +unsigned long long int sqrtN(unsigned long long int s, unsigned long long int e, unsigned long long int n) { + unsigned long long int m = (unsigned long long int)(s+e)/2; + if((unsigned long long int)m*m == n) return m; + if((unsigned long long int)m*m < n and (unsigned long long int)(m+1)*(m+1) > n) return m; + if((unsigned long long int)m*m < n) return sqrtN(m+1, e, n); + + return sqrtN(s, m-1, n); +} + + + +int sqrtN(long long int N) { + // Write your code here. + if(N == 0) return 0; + + return sqrtN(1, N, N); +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + long long int N; + cin >> N; + + cout << sqrtN(N) << endl; + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +vector findArraySum(vector&a, int n, vector&b, int m) { + // Write your code here. + + reverse(a.begin(), a.end()); + reverse(b.begin(), b.end()); + + int carry = 0; + vectorans; + + for(int i = 0; i < max(n, m); i++) { + int sum = carry; + + if(i < n) { + sum += a[i]; + } + if(i < m) { + sum += b[i]; + } + + ans.push_back(sum%10); + + if(sum >= 10) { + carry = 1; + } + else{ + carry = 0; + } + } + + if(carry > 0) { + ans.push_back(carry); + } + + reverse(ans.begin(), ans.end()); + + return ans; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +/************************************************************ + + Following is the Binary Tree node structure + + class BinaryTreeNode + { + public : + T data; + BinaryTreeNode *left; + BinaryTreeNode *right; + + BinaryTreeNode(T data) + { + this -> data = data; + left = NULL; + right = NULL; + } + }; + +************************************************************/ + +class customPair { + public : + bool foundStart; + int maxPath; + + customPair(int foundStart, int maxPath) { + this->foundStart = foundStart; + this->maxPath = maxPath; + } +}; + +int ans = -1; + +customPair helper(BinaryTreeNode* root, int start) { + customPair result = customPair(false, -1); + + if(root == NULL) { + result.foundStart = false; + result.maxPath = 0; + + return result; + } + + customPair leftCall = helper(root -> left, start); + customPair rightCall = helper(root -> right, start); + + if(root -> data == start) { + ans = max(leftCall.maxPath, rightCall.maxPath); + result.foundStart = true; + result.maxPath = 1; + return result; + } + + if(leftCall.foundStart or rightCall.foundStart) { + ans = max(ans, leftCall.maxPath+rightCall.maxPath); + + if(leftCall.foundStart){ + result.foundStart = true; + result.maxPath = leftCall.maxPath + 1; + return result; + } + + result.foundStart = true; + + result.maxPath = rightCall.maxPath + 1; + + return result; + } + + result.foundStart = false; + result.maxPath = max(leftCall.maxPath, rightCall.maxPath) + 1; + + return result; +} + + +int timeToBurnTree(BinaryTreeNode* root, int start) { + // Write your code here + + ans = -1; + + helper(root, start); + + return ans; + +} + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +// #include +#include +// using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +// typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +/* + Your Trie object will be instantiated and called as such: + Trie* obj = new Trie(); + obj->insert(word); + bool check2 = obj->search(word); + bool check3 = obj->startsWith(prefix); + */ + + +class Trie { + +public: + + /** Initialize your data structure here. */ + Trie() { + + } + + /** Inserts a word into the trie. */ + void insert(string word) { + + } + + /** Returns if the word is in the trie. */ + bool search(string word) { + + } + + /** Returns if there is any word in the trie that starts with the given prefix. */ + bool startsWith(string prefix) { + + } +}; + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + + + + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "<b?>Y8VifujpJS{z?NUNoRU;>tEL~2pgqEek0+ES|+E_J^Dv)10TXJ;qK z+wc6o?>q17hMm3le?9AYp7pF}J?paf>|J)pHfCXrS+PeVjP1dZHYfjk@jo3%PP*oo zNo?2n-%j6SD*f&B>a~qNM_YUAns!gKqt4UP(keS@y^eN&i=(l{QBdJ_G`H4!(SRvm zTqW;t0)W-n6S3cnJ!S(xXL_yAM-b`A+USpQ>ma#}LN2#q2WTc>FVxd={qn1-3FWrh zh7&3W=^3+eI=P9H0I{LGd2{D2;ujGzU=Q}M zU|)(oW^=OSyt!GK9GOdXb^<%`g%P;!ZDNaDfB;30il0_9wyr2Pldy5;MbqJK^BkM6*!)a}mOon)nH zC)?PAnOz;9_$Uj3J$?(X<-jYqxBUymD632Hk;QK$WbK9h0EC}EU`)6ZiT{u z6DFJ|f^;Uy2!98>0ta$>x52-Whm0PX^2rt$<9WS3MLHBv)BjbU9+}~I$jQ3bsrHY| zNXGTH=!W`OiV8_4TUUa86A3P0d8<4EQ+)17SZQ}{EqWoTlwtaO6%22M@g z&K2w7+_*vm+o@boD1iiS7RnszRp}v%)CzwK6``E}V%tLy-V6ZdQnAMgTOqJ*hkCn9 z)2#5I$h{ZH?Qaj9$_PI>4s3o1mBV+VJqKN%glqZnbjWr3M%O1n*U96qlW)gmqj|h@ z_U%<+a7G|w;m4s;u$Qcoh$NtolBf@mg!8S7VW@p!n-KiAEByAfG+a}751g_ESEgC1 zRJ=aHU)m!65Ec4oGBeq;vwZz9+Sy$4XFU|)FK43wvU zrR)n^_nokYS0H}PI?(Sr$*}dij?w`QGr8Y2K&Qd|LDym4XlJkj82Dgv&~-4gN9ivD zeJ1^Ogez0=Q6uC;fK$4PMCt7q+< zZ$LHEtAYKdzP!lFMKAe34Qx7!EQdhwjLF`$4@dA1z7+5uy_Te8_CP0qjKulBL1C5} z?*Ak<1ERlCneF#~y2y3d{?J~KhiV48j@Y|?MyIZ~c2GbHxlZh$xEAsr==Oec=UoyS z6YsA&&aZ^YxbmCro%{I7o&FWVnhtx{Pe^)C_lC$XNDp~l_X9VZf&*H-3G|ryoG8q& z|I^Mx{*>-Y)7Gh(J%hhPl-fr62KRU8nflC|hyEz!fmaSHiH0XUUDf}b|I?7`XjhMa z!S*o1U?3aa_luB7e&fV3n3xtU>j^JFJEb1|c|f7Ep1|4h_D)i6))!A!)wr)ZND(Bo>2NS7Eu0AM!DGR5N@EBdG;!}Av?4#R zAlOlubo{>Hz@QC!1b;u6ONUnn=YR;Hj}EU69wr^1d~$hkKZc|ZR{5PLmwzX708z=o z?45%sn>(||{ylQ&~5c6mI(X<$yTIrOT zr-u${ z?REQXC#}PobA9|cr6yxo*z_3M51z9q$78)`qiuM|+<|7zu2!rxqb()Pl zvKS?ep%V>V84pryP7N$x3n6CYNs}k^$MFkD3=Es)Nf@Zhw+0TRat3$a1vz_Dw>jCC zKhxj9=avWG&paLq&;`^nW8BzlUG$FsPr4jnJd*+i6@!LXxON1g*iQfq?a=9y*`w73 zm6z)WD;7h+@YfxPDpxykN<*aM@|=ckAqz1YhXg?AOR{i=3QEMN#}>-B2D8#41ED)@ zUB~^uQ@Q;08cqxi@4TybsXOxwjfV@s6#0^Y22TT5=O3gtO>xzJF$bBudV;-jE)_yy z8MNRcEtqc&{|U+46$OJ_QjD~_C8|pgzw`tJrE+h!ItXUR(WvM&Z z8+;vO7>q*Fh%HEH?9J)#2Pq;2g~?|CgI#uD81W@AZ1rCod;pAP4F51tKZ0C=1Er#G zkIn}`pV8d}PXb#fv299AB);6C;Mr-MeKMMLb__GL>}laGU0f!&0Xy zsN0VO4meO_z0vukP<%4N_D>LAsMZ%!EB>D9kM`%jO$-~*-;CSx5@v;wSs$BTCAPuR zv}wOElSAR&JLdIB;r><8=3VPk($nOVlsI6ej#P%s$2I)L7p3R{nPgp-R zYaf8+D-ebo@K5wNmp|d)VqlKN@EITno>^kKCO5ofLazWtSt@5qNaqdn~(V+5( z|M$TG1oOaI(}N&iB~K5Wn{NN+e*5ktrdNk{QUBVp!Nj`T%<^Ty(?h#aAHO7{^GumX zf&;yoM}~f->z`2UmC&sZeMZQc*uC7;ZT${%@ChBe0>^#9Lfak-kgh}WwOz-9Z}t~b zHL(XLi}?AGsS8tQ_#P%@ACq~g7t-P}`ahjK#GihOX*u@2Q>oR%F&u&OtAcOaJ3Z8F z&d;%TF2_j--W5Ff*#N3wCXb%8XiPeLXkzfsH_B<#&>gO|?|la?`*>j6GyW$i3I$F$h9;4H1O2AXBlb>=D#7jYj&rN*owq`>Q$7Ecn^r2RO(0155_@<5cO7;B$%g z-GwHw8rq5S(0r5x_`eIT-GwI3mZXCngm1I&j)(MgNS{Kcg7m>nXc$p{7yOF2ecmB{ zu+wjdRgqvtTJ3;%`(umommB5fp=&gMLeXb;&(7}plRRh9`QYE}olC$S2HF(ypG0kj z6E8zyUQ`YA`4kxF#jZd3UmIy4duI+ZLd_&$q>lz)=jD$r?;k~ZhhCx9-*pDGCV4zszr8b^9N|UOPNWk~{4lOQ16y(vd)I!drqndvRbGd3QHR|Z zo`y4&ZQ86p^i`b!q8XTVEO219Qs4I7HKt&1$GIE)$)dgXqW&i1TK+V%r}K#XyU+t^ zsfg8RCqs#%yd4ilnEb2Y+2F^)V_~eeV1nxps~qinmqn;R=cycbZwFJwzdFvQ+dHYFw(s2+2&ePn zLKl12v%m&v)wz3>nM6RBp7W%Od_(Z

Ia}r@b|%z>8*De|V8{?B%S+eRgbcn9g>) z%y7p$VWCub=TO47Krft9o?+i@0e)G|X8)g2~5Cj3v65u$qJ>!{y$CkFFv-5X7&S54=F_hWRwwcol87P8SzG1wAqD07ENc)pXv6%kjaF!>=KMhG|P6P6TCM|43PZl%dxZ`-}CgU~k}5 zQ?O>B;{$83?0~&%DFS}b`wZpporK=C(iG@PR+h8=$1u9}0~k6c!WE;7fd@cFrF(Qd zj;^D@K3Y={OJ3n8uw;Na29}Gu{$z%`ZW;)l4xS6Y3r5sE{vQ1asDtM^UhV*kP}zat z>2N)%?>ZbRJB%S#*KTB^I?9#3;6isZ$GeiCd7d+#6p8f(8P3X zQLjDF5Kp;m9cSlmE!$!5tiWZ**_HmZK^M-H^4oV8V+jEy_Rf38@pOACBa2@1 zziZ#^j09^AZguTICGUWETh2;*S33woH3#jx{W~!G?ZbM9eYZJhuKn>|q&~jS_8b34 zC?U^AO1YlKau`b8?>dZfz&tO6*p?4j2TnI(3CiA?0_{olS0<8c1pDosdtj50>uE}q zdC`!CC>Eqp{+^HvD|NIofF&h!(DkeqA8Adc*v{GXfiY(T8S=QmgSKSg(CB1VDfAhIe3a&c*jMLsF!(&6M_E6vd zV^GduPO|QvA)*kdIn}yWIpPooC4y9}hi-@j#I!_-3HrGSn^lpM9q1$uxbgqo$#O zhHYCRt`Abj1^Uf{HZ=O2*;tqcL2#IsmQhR$NsCP#=QrECt^v@o!OZ-V2D^~N`O$b+ zzAw1XzI%naJJ$?4`BcaG`{j)t=QsIl0)IC7e}(L5#-^co($~J5iWk_2USMlp#E;t~ z6qG~$0fZfD79R&*HibVtht;iNQ_w$v$O4@@Zk=uKd=9}L5ozdhbj@8}pj>`m)FdHq z&tM8@VEVyAieAG*UDWzNp!(i~maWxy(cciXYmOp{K7dwncIa}g{X#S72jy}jaxz7g z&HhvN-FXBKy-$tXm&Dt|C-%;7W1`eub1WQ0c!gqv1JF8naPV{JaK<%|Z0~v#_6n{# z*yq}@vfuSIEXD?XX!FFyk9!iKnmw3$B!p^gA=jSp4sZ!=dZAmwjm`_C@+7DnDzZ`t zngm9HO^2~W5?uAdU={ID?;nTCY!sk-z&zyLIk*XF5N;Iu;~-j8*^aG=;|85j5HjGNY>kyq_ElafTdB41eCIpiBBA=)%FS zqLS6vXt>AATVo4fjdfqt5|w);iE|wsd>;n0@1Ba&t*dqn{tj0in~pMj=Mk7RXLj&o zd)F~k-QaBeL9nntWusOI-z8oPpc#sc*`wLMbEX?kw_8<5#Sw0y= z3A`t1bn{0HS2RogrkOJv=lur?ud0y zqd6pd@QP5OE$|mp$U0SNKx?TGk%<38B%n1o1c$-f0n`0yEJ7ofBKvdk!A&O{g0A=0UDFU4 z#@KHfY=Sea6HMY~o6R?4z=%`(bFTLqs7<~Lv8X}Zt$lguD_Xp62%K9PJSb1HKUZn) zE;eJGOkN0VuKxr3b1A`t{4^1RH2ZVObS{5F8RS0`T@vNNK$++AzqH7I(*964q;Qd3 zt9KE1g;u}ES;&9#7xZ*o@N`2k2`n>@Gz61X+h8%3%!yQ`XY z8>%@eYNU@c0Hp{T?nj2f{m2^fzBPCy+O<}`?!wO(xlY;xv^ax-;^)CWUW_m=#(P*( zI@=JeMCmT)a0nu*G!H5r>B0 z?VroF4T0>Hw1~BgTj(?h{C^0!j%A){2xfA<;e?{&4kto&EZf0LWow^xoX)KrNF%o@ z#t|i>h=5xmjgk=M!Bip=&dT7PW_Y_>9c*9n})y75jL z#zWpQ8nOFrL!pL6%aDWm3^>E!Bob0&#UmN^=ZdW4ef<7w$aNAz2h(A8d)NO(f1fLR zuOV=Dt~>#MVa;!=*rH-^3-YT~;gG2Sk)=Ah3o z`A>uj(vs7b2Zoc^rS|9BaQBvNIY8|BT_%ig^KCKL;W#o$Z@7iz4O@a1IWzn*2CrMP z6Ocu|Jp4yo1hUQY^Woz->t|TKVM9L-zsxUE>0*0$AHP6bq+5ogm*+ZB9>lXgS^CF{ zvwn(Rb;W;;Wejg8orfpMN5a=fHH#^;k}PGr7KIs6CQLtPVvITmq-QS3O{`u#hy*mA+E$?+;lLtTB-_e0K**Sso zy~D!PQD(oqfv(Os1XJVb z4uiG(A+E!b=>s#k3LpJDY2Y8XFPt3cMW@U51&&*0o$n4zBb5+wevL|_IZZ1 zQ-Py5%A66e3rU*qPDYR}mK*m%Wa>KTL zA0<=kp@$s!cwD)r0T#aw2OuExOh4oPvp+23*v}vG9r}5AjgrQ_?gto0WS$9M1#IYF zqT^dE_1Quz(~_}ndn0ZOLo^mcP^N#T(+5*R0n!tb>3XP-X|_3twKvJjs5G6FSiSQhEyU%k96D1rR(L!g+)_ z@e>NvLTgpXu7vSi7dKPV!0h>*vkMOs{WhVv^MEUDN23z3oy1e#hmN8e1A# zf!2FR!#RVy=VUGvd2d@MRVlgin>;?B*Qe=6enuMt93P%gh{H^ko?T!L>`v?**mVRW zE=Q%mNFEE)NDcE0 zBOv$mc1K>5r|zCP1@qT6HX##j&aXRru5z-n#+Ehf9r%%(O!*r;jZOY`@68jK!?Con zUG{sLZufiJH}VAVYiMnE%&2$NZj`+~hevjJ>g(IRKA&So8?kgaYFh4TX>@@HO7&RcX`Nnx@uT)O5z2 zW>S0pJd#S&Y{mxgfJjk({>_e=MddZK91GLur)Lm8HinWHElY20U*iDH9G+oLW;Ey6 z`7V|JmvkfRg6e}dYC~HeV(dOl8XY*_hV#di^G9)hHs<^`+%qSd(Ke9r&2(QCGd*B4 zU6p9HZUu9i=uX3a;wO>F_eofOlEYjzA<4QVfv05yl7AYBe2621T4g_ z8hi17Mj~|g82Oy{Cs}zLr)JXz9O`g>)b2a5KQID&9N1Q1d=7+jqI(8=XACx$-ZMc* zdaniTyEsO5b3JScSk3z<^yc>EzKB8=ByhT7kj(yBB*I&OT8_Jk0Kea){Mbg?hWOL| zn!H5hyDm0g?WN^={P;hX@9>+E$X&7W%*(mJ zFS6$a1DxBN`(i%4h5Vrn`#ks^Zpdr8lnb7ez72aC(ns?(O5cf{^3!>= zEW&hS`eF`9iGDfqeU~~r)rSiou{>-I#98K;xXbr*r!Pvd9E!cpO&F_A(iFZ={X7zh zr}n=p$rdo1ixcA#yDVm6W;08@N!GFQ6Ha=y?T$od*1x0c}2x6sKwsriv3*LmFcgr*g0#LwW#5 zlJ~GVHz_e-0cHJ!q{PBr2<}U=<|nMxU5U7}0a<207m1K*X&Xxql0$kVgLXBJdO4*@ z(@K&Yl}Xd6p!{!sQX)#r1=Fvf7?n2*c@er}^SY88rO+y0AuUPpB~2?v2{{iJQdA}| z8!zWm$o>HM{Hwx;+qM$61q*9Qf>30QP(eYLB;3KT8O6>M*xy3_Z&Q9~>wztE6B;?e zDxBvL3*ckffowo~Hdb$LBOW??Ggc2M2m4y2pH|Yls6HM+eI!3@%}q)T#1$p2UY=B) zpR~GhLQ*P9n2h>K%Cobq8aqulJ&Z!(qeZemRRw}p?^@S2d>nk?_Noc-N0NKcgw}H<=@F~H0jQ%VIXT2pRcII>XQ=l(B7>T^E@aE$lCDxh?W5`h` zCurzKTjHTegqDV4%B1+9qhf>$7ALIN`{Y>uNNtFGD;c~$q2Q$IuIloi6MFOeaz)tB zO|Vp&^}3D4*QxN`b2t*gQ$l}2M z2_0Y2_dCh=YW)uR4lNd!f+i2=B!|b(r99-_u2G^-Kym?S+dxaPdju^;%1UqM6(e1XhV%-7WyDe~7V_F<8!4*az5X z+f%^zU?0H#4)%|*U%;LiVC+ilv$5x3uf$%9{Xy*C!u|v72e2Q(eiA!vpWyhpaz3FG z`LW-C{buaN*zdqzkG%!^eb^ty{uuUu!TvP%A7lR|_WjroV}Bj{JJ>(Kej58Z?Blx7 z*05iR{W|O!*l)&OfV~|19oT7Gi({v9{v?hsU_Xfc6n5Lg82@3f#=aVR6ZQ?*cVVaP zOPd&N@(L^PHhE=letVop7OYT>gxTdL*M>&9vc0tqYbtEEsj#u7 zKEJ8e=VclEys)v|Cl@w0d2`VuI8u%m@d#kGsj%JaEp4oA_q1}jbl zZEQh?&j~5@_+(dmduuymDP~-kwbuKayu~0AJP9N5xnfxdo@6d*f$p9rtip^`H{DX| z^{g|%EYnij>VZ_Q2{e_hZm(R^vX)D!cWtQiwviQ}Hf+GYX{~PZLF`gbli$mJWmQ(4 zpoI);G4^W};p!#XQ=3O#%eI@O#@1T2ZXA7eBL7d#Qfmum@JqAQCcwX%Nr;g6 zHLIt#wOwZURuA5#L~?Gk!a=ZFh8Ah9!|@(=kF^0ciWl@)8`i^taJIwRtkC?(+Fa|C zTi4fNh4LrXW^Z#{8}7^;u(o>z!EdY(MQd+OUiMq7uW?O_2ZOCQtuPq3*SmDq=6oTn6*l&InoH`cC6{}FRJjC|%RW}~ zj;6*anX9F0Sj@dpBEFK_E5ilr8fgU;%sT#S_9d>Wa#!j6d3+TdEK|Xk_GaI@x^`Kh zGjaX@)gG%y4)maXl(m0W3H(xbG`9VmlR|0XI9 z)&HB=)6?gQ|GxIRxp+cA+}xcjh75D-T3Z?#*UW94pS^Hy-NrTR8(Y%dZ0_3DX7Aj4 zyclxMrCj{}GS6Gl#-vBDeg}@<}}Ox7VqLU-WD$=GPv}#*R5ULxFCC>W6m1&f5kk<9CdHt z+Th;z98nm@oQ9UxIX;@Ws;uq_fxjr8*KF&(QCg>)$ z=Enq?Z=+9w|FkpnO9a@6awGDPbV@@~6P}1+=J#8GPLNuCcm#u)&kb`SaDRSzK6=^g zxf?!YzMuh(Ed>0XfCNd*nawT}2{T*c=>ZKs>7CGud3{Sgv*d8SaE1TOvRJ($6)m@@ zS12j7ggo+nycVo? zneqWAXe>4f78-{KIfn!_!)Bf#eyzv1cAck5l3CmhRIvE9vZq!el*P^64VL4qFW~RQ z$MNSk*puiFz*ljw3u5oRENyv4Tqh(ENo8)O)!>pvK?dmYPvy_%rzWhOHxI&wz^#f)~Y4^5C zm?JhcZjdr1dQgX%W3eoOSz@tlfmu_US|Lcu700jGxD^@#$cQUj z3Z9d~!U=R6kBWz0HcK31!#Kh9pKuswEkylU{*KcG6s^sR=e2l|d~95vi3k;VorXWc zaay7fMaK!2N!Dy+iSfPnfqfjU>BJxS8;rr?NOt^-WD;v!ODk5Y*0iwrKB@~Fv)lw~ zjSonDEGxce5ApDeN0lVPhorBw#~abMpoz#|M<7lLI2lhbKX?l>K{l_rNu%iaageR=Edu)1M;)@vve^K*MQ1o@#pB`D9EtR7Jr^Dj>R?9t;NL!x_B$D z!FMlK3FH4xS0^Sb>wNLdG>Gz^q-$D@RIbC5eFy$OI)SHJ zMXDdmlxV-P=?OgDCemZIOymiPrc|_}dP(-&<86_2buf_=Br61XoBwD;c20!fN?3l2 z#%&{OQS0I@-pVXL!Z`=Y!8mAUmS3wNd8*POS&rg-oOLspBs6ZwUZ|9AvdM&pp2k@z zKnR>7jFOmYB6tcXr*R;>w!RUuMTGhIdrWs=0+X^F%&Ke3U6MP$*i}%2QAP|_nOjv| zl3OZOxr(F$SEZ}Gz*U~V0=LMo=a!Z- zt42{)v2;0$i@A1{RaC8z%1Yd2xz+i_lE^SlBPgtaPWfe(Qf_&HlvkBo4kA3t8Gmt# zg;~sYaSC?@Dd}e8N08-~*2IWn6SU+iSFYP#kuQ~$W0|#r?1ZwpN?C%Dq_9#)k*HDR z=I7Ux)s*H|yQGSm>Y|F0@**j>3VKY`Xez5JN-K(LTvCmjl3_9zOVW~El_iE`yOvD$ zDs|-|PqGG9*0_tMGHz>@qQS(!6jhE?Hc5jEDr)jnc(Mko)D@L1RYO%`pi?xoGPgi- z7gtnOONBM%`PC&Ap}MM<Nf9_^OtKW|do7QdI7u zvM)tc;54vdg`|3so26;=WDa+3aUq+b$MQ?73)ppfEU%hfuSbeYxVZ{Tpu|jlk~=18 zmOiPlu*&7CWH)H2Yk9SloiRWACMmz7908%c+Rbj%l9#&jt1GHX?r=%M_1J7Jtq2~0 zX2}DSRmkS*$trX6m%zSCEtHhI z%cGPTddlh*m9A2k+l^`fKR3(NCzCE2Qr-%wa(P7+o2Mm`J61ty1YD{`H^mkhfz7`N zNnuq*87Imbl?aAi>Z)?1S-RN*jY33qox35F31U>jLXDCC5LWSU6TS=UjwP zU(<_ql$rCgqcwYrmZHSJWhK?c)b81>T2gN5vfLGJsSuqOy0}~rz^R#2Bd94ys4t~v zS?Vfhxmtp|xTLT;ljUj19WH9L%d63AOF~w80n69Y(Wc8PU=O7cQm|nKT5@5oyIQdo zb7^o)Sd^Akl~lV}p_a%)Mp>q`v?N!8M;2)*h`zie zCQ;Gxb{-AbZN`-15;3M&q9rK>BJ;6Q4Hm9iTA_51ZdRtHk#jE3FD}Ys<$4e$%3u{5 zM&%G5N0EzFYAM3S6mLZLK*_g{OfJkVg(M86cwo*eD`8a{i85A!e-@PR4iHsCk<6`; z2s?1kVAUF|R^{!AF>17=+=AO`P?5rK*itQ_0%N|CLf%x-p}EW1GA*qXb&rQ0Y&T-o zdN)Rid=$D&8DjFWWP{fu`O8EFVQVcU`eR0Gv^PDLOziHsCbE_~Cqs~ZwT}g&l z#*_*PhqCjqv_Jz*4lbvbA_k89I?ufrG`mh=9Rv!28$`03;n*HXx*9Q-;pB~S2l zV|0h{u9k9HN?Dnr=;f*|(QH#=6pDgZC|X5dkG}F~7Wx4Jp z5?7OF`icPf`88Zee(FfUAd=Wh`EVvTdWh-FvIP~)r)ce{Qtnfg%u#!2svw)jwL?u}O z%rO9_fYl{6W$<2&s5Ey8rU~WM@MR5D2m!#g4R99L{WP$=0&bWKhu5Hd40q;XLZ%_* zuHxKM41&kUU~bItR^(Nc6co8I?b2wAbKT2a7{n#SV0jhgcnGDGCB|Uxl2VLmxb72U z;3egyXdfCo_mUMxE(-i9G02jIm?>!l=#|h1vB@#e zl59+mVkpWA3UkXcGthoCFs}frW@1V-0-A^E&d1EKGM|plZ(R%8}4KOmsA= zJ7~a{iCK;Y(ZcA}G2H-*zhb<7Dx8!rGEk6Z@mIzmJh--#oAP@|Qf;fhrJf!jjGsQ9 zFZc6&jV*PpbVJNQbS)>cQ7}CX?^Rph37jV&=JJq>2k_AHW{f8S+{;n!2l2)2_?p{G zcoP`!r>JhZ;wq5X#ElW--4V0Z+JFTt+{mz5pif(qcY{L(tm@68}W5eeYBruzi) zSB}It`0?->-He)WLj)A#tZ}#jc)9H_I8VVD-ItMQzJn<-;hq$);XMS9V-g;_A!Il){q7rI;p}EVip`Gi;Nw_=f0c!dU_#$#6?^8cRsH z1($HI>sZNTEXYp=c|yX?313Sv;S%3svDoOMWO6nhXCG$=J(0y<7RAxOm`o*;iF*8W zh?tNSO}h1poGVZz3J_N^SpbRCA!;tzO`Kx7{tA&bDUOS`Uk47!R<1+IWL1llnP52$ z876V<;#7RHq8&JscBwI!DD0FNHgTlhWtW2uX>|D%c0CSLvse+yh%+Mw{O`9lqex~} zg1;uy`J{>XYr?%I+#Y16i{Al{c?5v5=raJ6m&KXsDFVy)Or~qEU9lu%&Egd+GUncL z?X_kT*t&Z>B?)!(ueVOt9hZd-WPEYY?0vzO_*w$h{p+hzh3|BQVqLGwG?j0JU zJglD)Mbs}GQ${osW-%>9TI{oBjHzE4CK~c$iwT{~h%KEzT_Qf*`#Ih%w8n&JL*W6B z56QK7*GNlxozz-;H)W&ToDb&_;(saJaMkhmDeM%+HRQ**a;iF$nxkw7fMuXHin6Qa z61hm{uOJ^r6)~Io)nV%eiKDiuUw$S81p!T+ zmKbyP0nXEqRnXuC;3Ky5yX)|qmRS3!mZ#r;3(HrxH+s|S+VHeQ?Dkh&kjHS&JYgbo z9Gj!oJ9^!iP1Sx*l*WNUZ45!oDg7dJYWl_btc}uu56?@l8$216j+=)un<{;Klt#@( zUyeB)%|$~D0LrH3Iv%A_bA1M6=NIIfitK_$&6Nej5zR&KO3?g6l~os|QFCo$5RG#g zPRU&~WHnCdF*gm7aZ0YIA&=lx)*(LxLNQ3AIf&B-bjT2p4jnQPX6@7=^MP#DA#Na# z>X3Cnw&{?^fjq85eg@1XVa#)9ifeh%7De-s)Lxu_;4%q?Zf)05Z2sJ59 z!*f9BeS8`+9giE>bVxCf)u?HuXQbcHfz5X`M3UsX1}Wnq)DY1SFMJ;hxgOUcj{w;p zMbutKaE1n^2O-tL^QwQ;UIwC+UPevPj%qLC00idX12!WzwFg;C>9m`u=JZ=SA9>;- zsAx1MsYYHO0L@0o5PZI>XQEs^jgrzUQ;CDcl#Ra{A2r$>1Wol9(3}FzqhCOigz$gh z3uxwp=E4`yEC&rm?ThIg0!`Bw&^!y8r@w%PTFF~c8ftq~bK0i*#tH5%Wb5?CdXMZ$ zyD1y~ipHrS3!VTU9g@|FlIoC!yKpHGC*3|s&&U7?W(AxNep@NyDr}IIWsvo_K~{%B z)`m-vb=n{+!ys#$LDmBXSxr${s>O_)XB#*_YT&%Vz_>(iv8nA#(4bCD^e!rV^Jm0%6nuIRwRvB85k7*3_|V(~1&GJYzHq9}vypx=o#{g+JyGc-<62x*CaM~$`m}KxlJ!1lFhq*kR9P9oge=lbzoq9_ zRi`a4pob%Q?$KN3GTqON^RFZyNqFT&}+`?iGoEf(OI1j+7g}11j zwl1^ldV{P=gRHd|lclWfT!CC-g`oitAsdR%{tcF=jar_? z^h5kLw)r0^G<2|-$g_>x9)$+Z02-Qwk~OtWwewE3?4}#EMCD9v?<7IAcLPauU8@O6 zqTY=(gd9-xK}du?4*VsK`t3D^1}+U68ZGN-)K!`vMQy0946B^fa=jHTmzts-|0~Ny z^+mNL>T5Zg{^<2ZHl*TNOjqeELQ#wCvz(8}Q zfyQZ|NjA{r7-+^BXlT~2x8XV1TZb&58MF>rc-ladVW9cIKr`Dw^NxXLrh(>l15KKN z=I}_Gh5JV$3#J)z{n9`))j;#(ku(dRHX#2p5?PRF;Pco>nuQOKL>5pR)Z6(!0}ZWs z=xOQ=G{Xj(I}9`wfAoBAHqg*p6ZJGVjHFq3(CjhL zJZhkMY9vk827|8}axHkvz~^&=eU2GusK?g%YSsaRte9NNsQY)|W4NR0ZK=mw4fxiH z{`3WmOVH?ekIvXX1EEnEil!h>0mrq+DNAg+FG*Z@07e>xTv$h&?J!#05gXINL3Nptj*hh^d zc&b5pVd3i8v7<^WCSF^0$mKv(t3m*_g+SCkS0F_|!n#~5fT*JaLDL9?Ho6kX1|Y|D zxgG&hsrVQ)6t6R64js+6K%@3wg3nKYB;%AyDv-TE*6MP-1VoMMg60H}Cv-FsAZqU^ zXfDHQhq}TbkoiE=m3D#T15snRK<)rS8?EgKq!EbPp9;pcA8A9ARL7$l#6cf=(!A~-ybnOf`7g+&jv<9U z7l6=4cSZz~N=uxWnQ6!zzUb+QL5hG-1l4HjIE`2_6MXyzx9nrK-B(JAnicJYP?$Z$AGA#cR}-SKxos-{w$DF zN~9GuuP8K{^fw5B-Wu{(AZqjzxe~BWa6w;RK-zTnxgLl*8Wg#11#$w)XjTmZ*`v$# zufzxBnz#H42-M;0y^792R_bW}0Aw|?h+KH)oxd{mM09RWR`?5O26VE_SitDe@tF=p zFDnyBag+w{RBdX)1a*@>Csv2&p_1iGa`Wc%3576`T);U zI-Tu6Xq`=~!8BazBV-hsYghV|`5^q)FaZK}GiP&P(qWV2RZsQ)Mw(bXj4C^!u z0V&mK_%A@PM99cm!eT!JvO$+?H;~g&1n(!|FWeo7>MWwVhtyF#Qy}$RJ1s)?f{!y@ z#0DYjRUoz~XUcyZ2yMcn@IwRqUcan*EfB5jL!gm$$Y(&(bch8%t9o2l(mWuvY5LG_ z>u6-9alQ-41G-$Bbh)TC(Yu?c>UzDegQgOElom(zMX&Y6rg8oOXtc89y)8}X_gF@> z?D#bYf3eSVHyq@mWn4gwK(IUNekYeb{d`CT9)aq5uQfT%Mv z!RK8d$vQg^0U=-2d|uyw(F?NcDI%eDYc!uC*G{dZ%FCp~(URi6Bd?2OoyF|<@r5?_ zgHU!g5GtZpiaCT})2zCh5S`8&h>wnQ0El>^L#@FVIG^MgKEDH^kG&sq8fOg6CqQT> zp-HD-Nt}i0QCOueCIhL|={y|>ZCb8MAgZ;5A+S>9?R;0*F(m z^Y?(Lb0R_W3n1$KFM;#{p-uC;<3RM|mOlX*hKd@^c_o*o;pHgY6FQn3l;wDhCJ)H+ zXelVx(JR)EMOzB#Q3aaLC=DSG1ECd8vXRjFTR_zLvOt~%BAx?*ohcK01xOZ-TAh9f zWSh=DXMpHq!W6jGGdh|%gy_mu2&6}ctOQb^)7dz>XaABYp2snv;6 z>;*!#ta(YNJ~fgIFX^#YJ>I-QLp{3{XqGNPrJiK}$)TJe=omR|3z z^{+w4<7rug-^?qQ{M(^wQf+O!cb%Hjgl{US=lnaPn3*ZR`oYiZ8)g112D&jHMml&Z z1D&v2_TY1xZA@C$*itqEGQ3;Ap@n98x8+BFB8V&e$S3++Vnu5O9hp70Tzq9E?Y{f& z14F#mzBF@DTcfwmyS@=Wo##K~Y4_tR3w)s~jR-s~{5|s}cw2vAvrKQw^tmOGcl0DJ zYis+MSw~OOveva4vI?1_C1}}NtN07^rO~tc=CA_tizlxAbun4Z#;+N_+Y$%IZUYA~4!A^oiXBE_C3$h>%8(eB}!52sVBJ?qg3Sb;l&rr^|f7`+k&WE#05O`ei4ofmHH6xOK6lYR>_Kz z{7n!lOY{ZxUKu`&k%Q#M*aq)RZsc!^knz4s5z(^gmYmcmwXUO%APb!YSm1+Kd?dub z9mPKZF5v@EV1`jKh8*~Qjg-+y-B1x;qJ!7FNeJgs3G&Bqi;mAOGBnZCj4{wq$9bI3 zsACEp#aLqp9nn~0gczbr?fql2j5-3)m(kd1qi5$!CKwOawfQCWHA>w6urOYhB+-Y{ z@wV%F`U$ok62FZhs*NoY9%bdZoOq22Ah`+sGUcHQX+6E=2ESchFR#T|qrP6c$Geep zG^VzD`Rj&b33yJay3|ceH`Jh!tIbQl8JCo=&trItVFHb0)S>mI4Zuf?+LiHm1AVCr zAN(Taglw{b{)*p`il)~$w)1z2M}gKhblZ)*@PY$YdFpilZoVKM>q+oNbv=>nZEDid z_`KeG6rivwx6CEc8{lZX$cOyO1uT!ZwqrQO%Omj@`}5&kI$9T>N{F8|r7v8tVEzK- ziMpsM+k9R>s-0UDj2oNr^)vdMoc0MhXEu}cA6s)~E+ieQYVZmnC{^ip)fCVhvP$uW zROMAA3McL3XQMC`!lK_ggJa>*ItmHxG8HoBGj+}^k{A2d6NUe1dhsHtUsXdk6iBT2 zDS7Y>x#;KZoEc1VkNwd(E|>FD1o3an37;2YM$EL(CK_6yYfCc(W0sVK*TBfJW{rM_ zkE}}V1}}qB3oPtWt$pQ=i^p@W;J#WIc&K$W}l)jsu7{U{vjA7TAcKPRWQFwMb4Afee+lkBU< zCp#pJ!|I~7FT4w#cC=9RZ9yS4IwjP;eMbe-eZ-Ob!WiC5F4x*rPtK+}-CC@gOX8tx zmcHKWxhEa|J0kXw_Y>?YmPEYDa}|}8^BPu~%g7}NwZZUYWzC-#VvG+0s#aD%peRXr zWG2>0#tuqq>{P$asQKzzucs}>heaVJpH#no9zJqFO+eT1lw0&DXUvx(6~$m?e34T9 zE+%i}a0q+>unv>gkslM}>k9f$0AA!PepH1cc?+v5{yoa~6QLt-S@fcPC9Dchj()W< zHdb+Of|S_rfl`E2oL|34LE(pgI#H9MZ<$zGz_%oMpNbg))`?;pJXc(KzlOp;`k~6G zJS~2rhPd;ok&x@;!IukQJrP~hh|5372oA~zHc`pqTdLxP^37hnlncSAH0Hyj)DmLM z!8IG%_mtp;ifZYixDs&APwUS8n5829bJEdqJfYb*6e3+AW9K14OKJ&^O ztlCWYw>gy#Q`JlNT~prO=F^~q=Zk%d7$PKIk569&g(#?|ea%!fCY2xE5Y%;?q}M<4 zElbrw>Y^s3B4do<-4Hd1(YN>~JGHEu|El(Q-v zEpt=p`(-{);a?a~9Y!>P(Y|A=)r)d_OTt@5g}2g5Y)lj(B}a*jqF)@XeJBS1F9;n% zef6WSl0^O-wP;KqN)?0pSF2^zPGgi|SoC|h(T-u%I6r#VFxn@MxlyAZ&gCuQAM-qQ zID#r^LvN*xMnqhcH7md<&4?&@2q-ANHcX+ROM@RPV=>KAm=kuR+cs*MZ(Ao-DMRsm zdWEdlH+p&bop!u@mL?p$JuA1UNergMLW~$T8d<7&^j|SXE~VzQzIH_D&MbsYnJd4%RNbVETajQZ(e@tA@#KSS)| zck*de5*rMny){Oz_xR*{@WxdLR2$_z-u4!66JEsc0T>%4V*FltL{ja$G-oh$VbL#d zbB~3Q(bX9X#Z49cXtLS~{4b3U;T##lIn*AGW@?52u8X6ij%;;~KvQ{TSXn({-obSq za~g5+NI2#gVr0LoG^CjRaqNy%9lxQrwK~-5I(AipKlPz39Z5Rk2#<~Fv VmY(@j4bsS(8Z$z18!1m-{oiDrLsS3& literal 0 HcmV?d00001 diff --git a/ValidPair.cpp b/ValidPair.cpp new file mode 100644 index 0000000..1ed4c0a --- /dev/null +++ b/ValidPair.cpp @@ -0,0 +1,141 @@ +#include +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + +/* +bool isValidPair(vector &arr, int n, int k, int m) { + // Write your code here. + + if(n%2 == 1) return false; + + for(int i = 0; i < n; i++) { + + if(arr[i] == -1) continue; + + for(int j = i+1; j < n; j++) { + + if(arr[j] == -1) continue; + + if((arr[i] + arr[j]) % k == m) { + arr[i] = -1; + arr[j] = -1; + break; + } + } + } + + for(int i = 0; i < n; i++) { + if(arr[i] != -1) return false; + } + + return true; +}*/ + + +bool isValidPair(vector &arr, int n, int k, int m) { + + unordered_map freq; + + if(n%2 == 1) return false; + + + for(int i = 0; i < n; i++) { + freq[arr[i]%k]++; + } + + for(auto it = freq.begin(); it != freq.end(); it++) { + int A = it->first; + + int x = (m - A+k)%k; + + if(freq[x] != freq[A]) return false; + } + + return true; + +} + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + int n; + cin >> n; + + vector arr(n); + + for(int i = 0; i < n; i++) { + cin >> arr[i]; + } + + int k, m; + cin >> k >> m; + + if(isValidPair(arr, n, k, m)){ + cout << 'true' << endl; + } + else { + cout << 'false' << endl; + } + + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + +// Brute Force Approach + +/*vectorcountNumber(int n, vector &arr) { + // Write your code here. + + vector count(n, 0); + + for(int i = 0; i < n; i++) { + for(int j = i+1; j < n; j++) { + if(arr[j] < arr[i]) + count[i]++; + } + } + + return count; + +}*/ + + +// Optimize Approach +// Merge Sort + + + +void merge(vector> &arr1, int si, int ei, int si1, int ei1, vector &ans) { + int temp = 0; + int i = si; + int j = si1; + + int ctr = 0; + + vector>temp1(ei1-si + 5); + + while(i <= ei and j <= ei1) { + if(arr1[i][0] > arr1[j][0]) { + temp1[ctr++] = arr1[j]; + j++; + temp++; + } + else { + ans[arr1[i][1]] += temp; + + temp1[ctr++] = arr1[i]; + i++; + } + } + + while(i <= ei) { + ans[arr1[i][1]] += temp; + temp1[ctr++] = arr1[i++]; + } + + while(j <= ei1) { + temp1[ctr++] = arr1[j++]; + } + + for(int i = 0l; i < ctr; i++) { + arr1[i + si] = temp1[i]; + } +} + + + +void merge_s(vector> &arr1, int l, int r, vector &ans) { + if(l >= r) { + return; + } + + int mid = l + (r-l)/2; + + merge_s(arr1, l, mid, ans); + merge_s(arr1, mid+1, r, ans); + merge(arr1, l, mid, mid + 1, r, ans); +} + + + + +vectorcountNumber(int n, vector &arr) { + // Write your code here. + + vector>arr1(n); + + for(int i = 0; i < n; i++) { + arr1[i] = {arr[i], i}; + } + + vector ans(n); + + merge_s(arr1, 0, n-1, ans); + + return ans; + +} + + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +int cutRod(vector &price, int n) { + // Write your code here. + + vector> v; + for(int i = 0; i < n; i++) { + double d = (price[i]*1.0)/(i+1); + v.push_back({d, i+1}); + } + + sort(v.begin(), v.end()); + + int i = n-1; + int ans = 0; + int size = n; + + while(size > 0) { + if(v[i].second <= size) { + ans += price[v[i].second-1]; + size = size-v[i].second; + } + + else { + i--; + } + } + + return ans; + + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + +void findPermutationsHelper(string &s, int i, int j, vector &ans) { + if(i >= j) { + string permutation = ""; + for(int k = 0; k < s.length(); k++) { + permutation += (s[k]); + } + + ans.push_back(permutation); + + return; + } + + for(int k = i; k <= j; k++) { + swap(s[i], s[k]); + findPermutationsHelper(s, i + 1, j, ans); + + swap(s[i], s[k]); + } +} + + +vector findPermutations(string &s) { + // Write your code here. + + vector ans; + + findPermutationsHelper(s, 0, s.length()-1, ans); + + return ans; + + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +vector> findTriplets(vectorarr, int n, int K) { + // Write your code here. + + // Brute Force Approach + + /*vector> ans; + + sort(arr.begin(), arr.end()); + + for(int i = 0; i < n-3; i++) { + for(int j = i+1; j < n-2; j++) { + for(int k = j+1; k < n-1; k++) { + if(arr[j] == arr[j+1]) continue; + if(arr[i] + arr[j] + arr[k] == k) { + vectortemp; + temp.push_back(arr[i]); + temp.push_back(arr[j]); + temp.push_back(arr[k]); + ans.push_back(temp); + } + } + } + } + + return ans;*/ + + + sort(arr.begin(), arr.end()); + + vector> res; + + for(int i = 0; i < arr.size(); i++) { + if(i == 0 or (i > 0 and arr[i] != arr[i - 1])) { + int lo = i+1; + int hi = arr.size()-1; + int sum = K - arr[i]; + + while(lo < hi) { + if(arr[lo] + arr[hi] == sum) { + vector temp; + temp.push_back(arr[i]); + temp.push_back(arr[lo]); + temp.push_back(arr[hi]); + res.push_back(temp); + + while(lo < hi and arr[lo] == arr[lo+1]) lo++; + while(lo < hi and arr[hi] == arr[hi-1]) hi--; + + lo++; + hi--; + + } + + else if(arr[lo] + arr[hi] < sum) lo++; + else hi--; + } + } + } + + return res; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +int binarySearch(vector &arr, int s, int e) { + if(s > e) return INT_MAX; + int m = (s+e)/2; + + if(arr[m] == m) return min(m, binarySearch(arr, s, m-1)); + + if(arr[m] > m) return binarySearch(arr, s, m-1); + + return binarySearch(arr, m+1, e); +} + + +int equalIndex(vector &arr, int n) { + // Write your code here. + int ans = binarySearch(arr, 0, n-1); + + if(ans == INT_MAX) return -1; + + return ans; +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +int longestMountain(int *arr, int n) { + // Write your code here. + + if(n < 3) return 0; + + vector inc(n, 1); + vector dec(n, 1); + + for(int i = 1; i < n; i++) { + if(arr[i] > arr[i - 1]) + inc[i] += inc[i - 1]; + } + + for(int i = n-2; i >= 0; i--) { + if(arr[i] > arr[i+1]) + dec[i] += dec[i + 1]; + } + + int ans = 0; + + for(int i = 1; i < n-1; i++) { + if(inc[i] > 1 and dec[i] > 1) + ans = max(ans, inc[i] + dec[i] - 1); + } + + return ans; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +vector maxMinWindow(vector a, int n) { + // Write your code here. + + + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + + +long long maxSubarraySum(int arr[], int n) +{ + /* + Don't write main(). + Don't read input, it is passed as function argument. + No need to print anything. + Taking input and printing output is handled automatically. + */ + + long long ans = 0; + long long sum = 0; + + for(int i = 0; i < n; i++) { + sum += arr[i]; + ans = max(ans, sum); + + if(sum < 0) sum = 0; + } + + return ans; + +} + + + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + +// Brute Force Approach + + +/*vector maxXorQueries(vector &arr, vector> &queries){ + + + int n = arr.size(); + int m = queries.size(); + + vector result(m, -1); + + for(int i=0; i < m; i++) { + + for(int j=0; j < n; j++) { + if(arr[j] <= queries[i][1]) { + result[i] = max(result[i], arr[j]^queries[i][0]); + } + } + + } + + return result; + +}*/ + + + +// Optimized Solution + +vector maxXorQueries(vector &arr, vector> &queries) { + +// Number of Queries + int m = queries.size(); + + vector result(m, -1); + + // Sort Arr in Non-decreasing order + + sort(arr.begin(), arr.end()); + + // Finding answer of each queries + + for(int i = 0; i < m; i++) { + + // If answer to rhis query is -1 + if(queries[i][1] < arr[0]) { + continue; + } + + int left = 0; + int right = upper_bound(arr.begin(), arr.end(), queries[i][1]) - arr.begin(); + int ans = 0; + int cur = 0; + + for(int j = 30; j >= 0; j--) { + // if jth bit is set in queries[i][0] (i.e 'Xi') + if(queries[i][0] & (1 << j)) { + if(not arr[left] & (1 << j)) { + ans = ans | (1 << j); + right = lower_bound(arr.begin() + left, arr.end() + right, cur + (1 << j)) - arr.begin(); + } + else { + cur = cur | (1 << j); + } + } + + else { + // if jth bit is not set in queries[i][0] (i.e 'Xi') + + if(arr[right - 1] & (1 << j)) { + ans = ans | (1 << j); + cur = cur | (1 << j); + left = lower_bound(arr.begin() + left, arr.end() + right, cur) - arr.begin(); + } + } + } + + result[i] = ans; + } + + return result; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +struct meet { + int meetID; + int startTime; + int endTime; +}; + + + +bool comapre(struct meet a, struct meet b) { + if(a.endTime == b.endTime) { + return a.meetID < b.meetID; + } + else { + return a.endTime < b.endTime; + } +} + + + +vector maximumMeetings(vector &start, vector &end) { + // Write your code here. + + int n = start.size(); + + struct meet meeting[n]; + + + // create meeting array of size n + for(int i = 0; i < n; i++) { + meeting[i].meetID = i + 1; + meeting[i].startTime = start[i]; + meeting[i].endTime = end[i]; + } + + // Sorting the meeting array in increasing order of end time using customized comparator. + + sort(meeting, meeting + n, comapre); + + vector result; + + result.push_back(meeting[0].meetID); + int currentTime = meeting[0].endTime; + + + + // Taking the first meeting of sorted array as our first meeting + for(int i = 1; i < n; i++) { + // If startTime of current meeting is greater than our currentTime + // Then we will perform this meeting and update currentTime with endTime of the meeting + + if(meeting[i].startTime > currentTime) { + result.push_back(meeting[i].meetID); + currentTime = meeting[i].endTime; + } + + } + + return result; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + + +/****************************************************/ + + // Binary tree node class for reference: + class BinaryTreeNode { + public : + T data; + BinaryTreeNode *left; + BinaryTreeNode *right; + + BinaryTreeNode(T data) { + this -> data = data; + left = NULL; + right = NULL; + } + }; + +/****************************************************/ + +void calcSum(long long &sum, BinaryTreeNode* root, long long CurNum) { + if(not root) return; + + long long num = (((CurNum%mod)*10)%mod + root->data)%mod; + + if(root->left == NULL and root->right == NULL) { + sum = (sum%mod + num%mod)%mod; + return; + } + + calcSum(sum, root->left, num); + calcSum(sum, root->right, num); + + return; +} + +int rootToLeafSum( BinaryTreeNode* root) { + + + if(not root) return 0; + + long long sum = 0; + + calcSum(sum, root, 0); + + return sum%mod; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + +int search(int* arr, int n, int key) { + // Write your code here. + + int pivot = -1; + + int start = 0; + int end = n-1; + + while(start <= end) { + int mid = (start + end)/2; + + if(arr[mid] > arr[mid+1]) { + pivot = mid; + break; + } + else if(arr[mid] >= arr[start]){ + start = mid + 1; + } + else { + end = mid - 1; + } + } + + if(pivot == -1) { + start = 0; + end = n-1; + } + else if(arr[0] > key) { + start = pivot+1; + end = n-1; + } + else { + start = 0; + end = pivot; + } + + while(start <= end) { + int mid = (start + end)/2; + + if(arr[mid] == key){ + return mid; + } + else if(arr[mid] > key) { + end = mid - 1; + } + else{ + start = mid + 1; + } + } + + return -1; + +} + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + int n; + cin >> n; + + int arr[n]; + + for(int i = 0; i < n; i++) { + cin >> arr[i]; + } + + int key; + + cin >> key; + + cout << search(arr, n, key) << endl; + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + + +vector shortestPath( vector> edges , int n , int m, int s , int t){ + + // Write your code here + + vector ADJ[n+1]; + + for(int i = 0; i < m; i++){ + int x, y; + x = edges[i].first; + y = edges[i].second; + ADJ[x].push_back(y); + ADJ[y].push_back(x); + } + + + vector visited(n+1, -1); + vector parent(n+1, -1); + + visited[s] = 1; + + queue Q; + + Q.push(s); + + while(Q.size() > 0) { + int curNode = Q.front(); + Q.pop(); + + for(int nextNode : ADJ[curNode]) { + if(visited[nextNode] == -1) { + visited[nextNode] = 1; + Q.push(nextNode); + parent[nextNode] = curNode; + } + } + } + + vector path; + int currentNode = t; + + path.push_back(t); + + while(currentNode != s) { + currentNode = parent[currentNode]; + path.push_back(currentNode); + } + + // path.push_back(s); + + reverse(path.begin(), path.end()); + + return path; + +} + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< +#include +#include +using namespace __gnu_pbds; +using namespace std; +#define ff first +#define ss second +#define endl "\n" +#define ll long long +#define ld long double +#define loop(a, b, c) for(ll (a) = (b); (a)<=(c); (a)++) +#define looprev(a, b, c) for(ll (a) = (b); (a)>=(c); (a)--) +#define pb push_back +#define mp make_pair +#define pii pair +#define vi vector +#define mii map +#define ump unordered_map +#define pqb priority_queue +#define pqs priority_queue > +#define setbits(x) __builtin_popcountll(x) +#define zrobits(x) __builtin_ctzll(x) +#define mod 1000000007 +#define inf 1e18 +#define ps(x, y) fixed<>x; while(x--) +// mt19937 rng(chrono::steady_clock::now,time_since_epoch(),count()); +typedef tree, null_type, less>, rb_tree_tag, tree_order_statistics_node_update> pbds; + + +void file_i_o(){ + ios_base::sync_with_stdio(0); + cin.tie(0); + cout.tie(0); + /* #ifndef ONLINE_JUDGE + freopen("input.txt", "r", stdin); + freopen("output.txt", "w", stdout); + #endif */ +} + + + + +void sortedInsert(stack& stack, int current) { + if(stack.empty() or current > stack.top()) { + stack.push(current); + return; + } + + int top = stack.top(); + stack.pop(); + + sortedInsert(stack, current); + stack.push(top); + +} + +void sortStack(stack &stack) { + // Write your code here + + if(stack.empty()) return; + + int top = stack.top(); + stack.pop(); + + sortStack(stack); + + sortedInsert(stack, top); + +} + + + + + + + +int main(int argc, char const *argv[]) { + + file_i_o(); + + clock_t start, end; + start = clock(); + + w(t){ + + /* Write Code Here */ + + } + + end = clock(); + + double time_taken=double(end-start)/double(CLOCKS_PER_SEC); + cerr<<"\nTime : "< Date: Tue, 11 Oct 2022 06:50:00 +0530 Subject: [PATCH 054/290] Create .gitignore Co-Authored-By: Kasak Vaish <99035589+kasakvaish@users.noreply.github.com> --- .gitignore | 1050 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 1050 insertions(+) create mode 100644 .gitignore diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..ef13838 --- /dev/null +++ b/.gitignore @@ -0,0 +1,1050 @@ +##### Windows +# Windows thumbnail cache files +Thumbs.db +Thumbs.db:encryptable +ehthumbs.db +ehthumbs_vista.db + +# Dump file +*.stackdump + +# Folder config file +[Dd]esktop.ini + +# Recycle Bin used on file shares +$RECYCLE.BIN/ + +# Windows Installer files +*.cab +*.msi +*.msix +*.msm +*.msp + +# Windows shortcuts +*.lnk + +##### Linux +*~ + +# temporary files which can be created if a process still has a handle open of a deleted file +.fuse_hidden* + +# KDE directory preferences +.directory + +# Linux trash folder which might appear on any partition or disk +.Trash-* + +# .nfs files are created when an open file is removed but is still being accessed +.nfs* + +##### MacOS +# General +.DS_Store +.AppleDouble +.LSOverride + +# Thumbnails +._* + +# Files that might appear in the root of a volume +.DocumentRevisions-V100 +.fseventsd +.Spotlight-V100 +.TemporaryItems +.Trashes +.VolumeIcon.icns +.com.apple.timemachine.donotpresent + +# Directories potentially created on remote AFP share +.AppleDB +.AppleDesktop +Network Trash Folder +Temporary Items +.apdisk + +##### Android +# Built application files +*.apk +*.ap_ +*.aab + +# Files for the ART/Dalvik VM +*.dex + +# Java class files +*.class + +# Generated files +bin/ +gen/ +out/ +# Uncomment the following line in case you need and you don't have the release build type files in your app +# release/ + +# Gradle files +.gradle/ +build/ + +# Local configuration file (sdk path, etc) +local.properties + +# Proguard folder generated by Eclipse +proguard/ + +# Log Files +*.log + +# Android Studio Navigation editor temp files +.navigation/ + +# Android Studio captures folder +captures/ + +# IntelliJ +*.iml +.idea/workspace.xml +.idea/tasks.xml +.idea/gradle.xml +.idea/assetWizardSettings.xml +.idea/dictionaries +.idea/libraries +# Android Studio 3 in .gitignore file. +.idea/caches +.idea/modules.xml +# Comment next line if keeping position of elements in Navigation Editor is relevant for you +.idea/navEditor.xml + +# Keystore files +# Uncomment the following lines if you do not want to check your keystore files in. +#*.jks +#*.keystore + +# External native build folder generated in Android Studio 2.2 and later +.externalNativeBuild + +# Google Services (e.g. APIs or Firebase) +# google-services.json + +# Freeline +freeline.py +freeline/ +freeline_project_description.json + +# fastlane +fastlane/report.xml +fastlane/Preview.html +fastlane/screenshots +fastlane/test_output +fastlane/readme.md + +# Version control +vcs.xml + +# lint +lint/intermediates/ +lint/generated/ +lint/outputs/ +lint/tmp/ +# lint/reports/ + +##### Backup +*.bak +*.gho +*.ori +*.orig +*.tmp + +##### GPG +secring.* + +##### Dropbox +# Dropbox settings and caches +.dropbox +.dropbox.attr +.dropbox.cache + +##### SynopsysVCS +# Waveform formats +*.vcd +*.vpd +*.evcd +*.fsdb + +# Default name of the simulation executable. A different name can be +# specified with this switch (the associated daidir database name is +# also taken from here): -o / +simv + +# Generated for Verilog and VHDL top configs +simv.daidir/ +simv.db.dir/ + +# Infrastructure necessary to co-simulate SystemC models with +# Verilog/VHDL models. An alternate directory may be specified with this +# switch: -Mdir= +csrc/ + +# Log file - the following switch allows to specify the file that will be +# used to write all messages from simulation: -l +*.log + +# Coverage results (generated with urg) and database location. The +# following switch can also be used: urg -dir .vdb +simv.vdb/ +urgReport/ + +# DVE and UCLI related files. +DVEfiles/ +ucli.key + +# When the design is elaborated for DirectC, the following file is created +# with declarations for C/C++ functions. +vc_hdrs.h + +##### SVN +.svn/ + +##### Mercurial +.hg/ +.hgignore +.hgsigs +.hgsub +.hgsubstate +.hgtags + +##### Bazaar +.bzr/ +.bzrignore + +##### CVS +/CVS/* +**/CVS/* +.cvsignore +*/.cvsignore + +##### TortoiseGit +# Project-level settings +/.tgitconfig + +##### PuTTY +# Private key +*.ppk + +##### Vim +# Swap +[._]*.s[a-v][a-z] +!*.svg # comment out if you don't need vector files +[._]*.sw[a-p] +[._]s[a-rt-v][a-z] +[._]ss[a-gi-z] +[._]sw[a-p] + +# Session +Session.vim +Sessionx.vim + +# Temporary +.netrwhist +*~ +# Auto-generated tag files +tags +# Persistent undo +[._]*.un~ + +##### Emacs +# -*- mode: gitignore; -*- +*~ +\#*\# +/.emacs.desktop +/.emacs.desktop.lock +*.elc +auto-save-list +tramp +.\#* + +# Org-mode +.org-id-locations +*_archive + +# flymake-mode +*_flymake.* + +# eshell files +/eshell/history +/eshell/lastdir + +# elpa packages +/elpa/ + +# reftex files +*.rel + +# AUCTeX auto folder +/auto/ + +# cask packages +.cask/ +dist/ + +# Flycheck +flycheck_*.el + +# server auth directory +/server/ + +# projectiles files +.projectile + +# directory configuration +.dir-locals.el + +# network security +/network-security.data + +##### SublimeText +# Cache files for Sublime Text +*.tmlanguage.cache +*.tmPreferences.cache +*.stTheme.cache + +# Workspace files are user-specific +*.sublime-workspace + +# Project files should be checked into the repository, unless a significant +# proportion of contributors will probably not be using Sublime Text +# *.sublime-project + +# SFTP configuration file +sftp-config.json +sftp-config-alt*.json + +# Package control specific files +Package Control.last-run +Package Control.ca-list +Package Control.ca-bundle +Package Control.system-ca-bundle +Package Control.cache/ +Package Control.ca-certs/ +Package Control.merged-ca-bundle +Package Control.user-ca-bundle +oscrypto-ca-bundle.crt +bh_unicode_properties.cache + +# Sublime-github package stores a github token in this file +# https://packagecontrol.io/packages/sublime-github +GitHub.sublime-settings + +##### Notepad++ +# Notepad++ backups # +*.bak + +##### TextMate +*.tmproj +*.tmproject +tmtags + +##### VisualStudioCode +.vscode/* +!.vscode/settings.json +!.vscode/tasks.json +!.vscode/launch.json +!.vscode/extensions.json +*.code-workspace + +# Local History for Visual Studio Code +.history/ + +##### NetBeans +**/nbproject/private/ +**/nbproject/Makefile-*.mk +**/nbproject/Package-*.bash +build/ +nbbuild/ +dist/ +nbdist/ +.nb-gradle/ + +##### JetBrains +# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio, WebStorm and Rider +# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 + +# User-specific stuff +.idea/**/workspace.xml +.idea/**/tasks.xml +.idea/**/usage.statistics.xml +.idea/**/dictionaries +.idea/**/shelf + +# Generated files +.idea/**/contentModel.xml + +# Sensitive or high-churn files +.idea/**/dataSources/ +.idea/**/dataSources.ids +.idea/**/dataSources.local.xml +.idea/**/sqlDataSources.xml +.idea/**/dynamic.xml +.idea/**/uiDesigner.xml +.idea/**/dbnavigator.xml + +# Gradle +.idea/**/gradle.xml +.idea/**/libraries + +# Gradle and Maven with auto-import +# When using Gradle or Maven with auto-import, you should exclude module files, +# since they will be recreated, and may cause churn. Uncomment if using +# auto-import. +# .idea/artifacts +# .idea/compiler.xml +# .idea/jarRepositories.xml +# .idea/modules.xml +# .idea/*.iml +# .idea/modules +# *.iml +# *.ipr + +# CMake +cmake-build-*/ + +# Mongo Explorer plugin +.idea/**/mongoSettings.xml + +# File-based project format +*.iws + +# IntelliJ +out/ + +# mpeltonen/sbt-idea plugin +.idea_modules/ + +# JIRA plugin +atlassian-ide-plugin.xml + +# Cursive Clojure plugin +.idea/replstate.xml + +# Crashlytics plugin (for Android Studio and IntelliJ) +com_crashlytics_export_strings.xml +crashlytics.properties +crashlytics-build.properties +fabric.properties + +# Editor-based Rest Client +.idea/httpRequests + +# Android studio 3.1+ serialized cache file +.idea/caches/build_file_checksums.ser + +##### Eclipse +.metadata +bin/ +tmp/ +*.tmp +*.bak +*.swp +*~.nib +local.properties +.settings/ +.loadpath +.recommenders + +# External tool builders +.externalToolBuilders/ + +# Locally stored "Eclipse launch configurations" +*.launch + +# PyDev specific (Python IDE for Eclipse) +*.pydevproject + +# CDT-specific (C/C++ Development Tooling) +.cproject + +# CDT- autotools +.autotools + +# Java annotation processor (APT) +.factorypath + +# PDT-specific (PHP Development Tools) +.buildpath + +# sbteclipse plugin +.target + +# Tern plugin +.tern-project + +# TeXlipse plugin +.texlipse + +# STS (Spring Tool Suite) +.springBeans + +# Code Recommenders +.recommenders/ + +# Annotation Processing +.apt_generated/ +.apt_generated_test/ + +# Scala IDE specific (Scala & Java development for Eclipse) +.cache-main +.scala_dependencies +.worksheet + +# Uncomment this line if you wish to ignore the project description file. +# Typically, this file would be tracked if it contains build/dependency configurations: +#.project + +##### Qt +# C++ objects and libs +*.slo +*.lo +*.o +*.a +*.la +*.lai +*.so +*.so.* +*.dll +*.dylib + +# Qt-es +object_script.*.Release +object_script.*.Debug +*_plugin_import.cpp +/.qmake.cache +/.qmake.stash +*.pro.user +*.pro.user.* +*.qbs.user +*.qbs.user.* +*.moc +moc_*.cpp +moc_*.h +qrc_*.cpp +ui_*.h +*.qmlc +*.jsc +Makefile* +*build-* +*.qm +*.prl + +# Qt unit tests +target_wrapper.* + +# QtCreator +*.autosave + +# QtCreator Qml +*.qmlproject.user +*.qmlproject.user.* + +# QtCreator CMake +CMakeLists.txt.user* + +# QtCreator 4.8< compilation database +compile_commands.json + +# QtCreator local machine specific files for imported projects +*creator.user* + +##### VisualStudio +##### VisualStudio +## Ignore Visual Studio temporary files, build results, and +## files generated by popular Visual Studio add-ons. +## +## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore + +# User-specific files +*.rsuser +*.suo +*.user +*.userosscache +*.sln.docstates + +# User-specific files (MonoDevelop/Xamarin Studio) +*.userprefs + +# Mono auto generated files +mono_crash.* + +# Build results +[Dd]ebug/ +[Dd]ebugPublic/ +[Rr]elease/ +[Rr]eleases/ +x64/ +x86/ +[Ww][Ii][Nn]32/ +[Aa][Rr][Mm]/ +[Aa][Rr][Mm]64/ +bld/ +[Bb]in/ +[Oo]bj/ +[Ll]og/ +[Ll]ogs/ + +# Visual Studio 2015/2017 cache/options directory +.vs/ +# Uncomment if you have tasks that create the project's static files in wwwroot +#wwwroot/ + +# Visual Studio 2017 auto generated files +Generated\ Files/ + +# MSTest test Results +[Tt]est[Rr]esult*/ +[Bb]uild[Ll]og.* + +# NUnit +*.VisualState.xml +TestResult.xml +nunit-*.xml + +# Build Results of an ATL Project +[Dd]ebugPS/ +[Rr]eleasePS/ +dlldata.c + +# Benchmark Results +BenchmarkDotNet.Artifacts/ + +# .NET Core +project.lock.json +project.fragment.lock.json +artifacts/ + +# ASP.NET Scaffolding +ScaffoldingReadMe.txt + +# StyleCop +StyleCopReport.xml + +# Files built by Visual Studio +*_i.c +*_p.c +*_h.h +*.ilk +*.meta +*.obj +*.iobj +*.pch +*.pdb +*.ipdb +*.pgc +*.pgd +*.rsp +*.sbr +*.tlb +*.tli +*.tlh +*.tmp +*.tmp_proj +*_wpftmp.csproj +*.log +*.vspscc +*.vssscc +.builds +*.pidb +*.svclog +*.scc + +# Chutzpah Test files +_Chutzpah* + +# Visual C++ cache files +ipch/ +*.aps +*.ncb +*.opendb +*.opensdf +*.sdf +*.cachefile +*.VC.db +*.VC.VC.opendb + +# Visual Studio profiler +*.psess +*.vsp +*.vspx +*.sap + +# Visual Studio Trace Files +*.e2e + +# TFS 2012 Local Workspace +$tf/ + +# Guidance Automation Toolkit +*.gpState + +# ReSharper is a .NET coding add-in +_ReSharper*/ +*.[Rr]e[Ss]harper +*.DotSettings.user + +# TeamCity is a build add-in +_TeamCity* + +# DotCover is a Code Coverage Tool +*.dotCover + +# AxoCover is a Code Coverage Tool +.axoCover/* +!.axoCover/settings.json + +# Coverlet is a free, cross platform Code Coverage Tool +coverage*[.json, .xml, .info] + +# Visual Studio code coverage results +*.coverage +*.coveragexml + +# NCrunch +_NCrunch_* +.*crunch*.local.xml +nCrunchTemp_* + +# MightyMoose +*.mm.* +AutoTest.Net/ + +# Web workbench (sass) +.sass-cache/ + +# Installshield output folder +[Ee]xpress/ + +# DocProject is a documentation generator add-in +DocProject/buildhelp/ +DocProject/Help/*.HxT +DocProject/Help/*.HxC +DocProject/Help/*.hhc +DocProject/Help/*.hhk +DocProject/Help/*.hhp +DocProject/Help/Html2 +DocProject/Help/html + +# Click-Once directory +publish/ + +# Publish Web Output +*.[Pp]ublish.xml +*.azurePubxml +# Note: Comment the next line if you want to checkin your web deploy settings, +# but database connection strings (with potential passwords) will be unencrypted +*.pubxml +*.publishproj + +# Microsoft Azure Web App publish settings. Comment the next line if you want to +# checkin your Azure Web App publish settings, but sensitive information contained +# in these scripts will be unencrypted +PublishScripts/ + +# NuGet Packages +*.nupkg +# NuGet Symbol Packages +*.snupkg +# The packages folder can be ignored because of Package Restore +**/[Pp]ackages/* +# except build/, which is used as an MSBuild target. +!**/[Pp]ackages/build/ +# Uncomment if necessary however generally it will be regenerated when needed +#!**/[Pp]ackages/repositories.config +# NuGet v3's project.json files produces more ignorable files +*.nuget.props +*.nuget.targets + +# Microsoft Azure Build Output +csx/ +*.build.csdef + +# Microsoft Azure Emulator +ecf/ +rcf/ + +# Windows Store app package directories and files +AppPackages/ +BundleArtifacts/ +Package.StoreAssociation.xml +_pkginfo.txt +*.appx +*.appxbundle +*.appxupload + +# Visual Studio cache files +# files ending in .cache can be ignored +*.[Cc]ache +# but keep track of directories ending in .cache +!?*.[Cc]ache/ + +# Others +ClientBin/ +~$* +*~ +*.dbmdl +*.dbproj.schemaview +*.jfm +*.pfx +*.publishsettings +orleans.codegen.cs + +# Including strong name files can present a security risk +# (https://github.com/github/gitignore/pull/2483#issue-259490424) +#*.snk + +# Since there are multiple workflows, uncomment next line to ignore bower_components +# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) +#bower_components/ + +# RIA/Silverlight projects +Generated_Code/ + +# Backup & report files from converting an old project file +# to a newer Visual Studio version. Backup files are not needed, +# because we have git ;-) +_UpgradeReport_Files/ +Backup*/ +UpgradeLog*.XML +UpgradeLog*.htm +ServiceFabricBackup/ +*.rptproj.bak + +# SQL Server files +*.mdf +*.ldf +*.ndf + +# Business Intelligence projects +*.rdl.data +*.bim.layout +*.bim_*.settings +*.rptproj.rsuser +*- [Bb]ackup.rdl +*- [Bb]ackup ([0-9]).rdl +*- [Bb]ackup ([0-9][0-9]).rdl + +# Microsoft Fakes +FakesAssemblies/ + +# GhostDoc plugin setting file +*.GhostDoc.xml + +# Node.js Tools for Visual Studio +.ntvs_analysis.dat +node_modules/ + +# Visual Studio 6 build log +*.plg + +# Visual Studio 6 workspace options file +*.opt + +# Visual Studio 6 auto-generated workspace file (contains which files were open etc.) +*.vbw + +# Visual Studio LightSwitch build output +**/*.HTMLClient/GeneratedArtifacts +**/*.DesktopClient/GeneratedArtifacts +**/*.DesktopClient/ModelManifest.xml +**/*.Server/GeneratedArtifacts +**/*.Server/ModelManifest.xml +_Pvt_Extensions + +# Paket dependency manager +.paket/paket.exe +paket-files/ + +# FAKE - F# Make +.fake/ + +# CodeRush personal settings +.cr/personal + +# Python Tools for Visual Studio (PTVS) +__pycache__/ +*.pyc + +# Cake - Uncomment if you are using it +# tools/** +# !tools/packages.config + +# Tabs Studio +*.tss + +# Telerik's JustMock configuration file +*.jmconfig + +# BizTalk build output +*.btp.cs +*.btm.cs +*.odx.cs +*.xsd.cs + +# OpenCover UI analysis results +OpenCover/ + +# Azure Stream Analytics local run output +ASALocalRun/ + +# MSBuild Binary and Structured Log +*.binlog + +# NVidia Nsight GPU debugger configuration file +*.nvuser + +# MFractors (Xamarin productivity tool) working folder +.mfractor/ + +# Local History for Visual Studio +.localhistory/ + +# BeatPulse healthcheck temp database +healthchecksdb + +# Backup folder for Package Reference Convert tool in Visual Studio 2017 +MigrationBackup/ + +# Ionide (cross platform F# VS Code tools) working folder +.ionide/ + +# Fody - auto-generated XML schema +FodyWeavers.xsd + +##### Gradle +.gradle +**/build/ +!src/**/build/ + +# Ignore Gradle GUI config +gradle-app.setting + +# Avoid ignoring Gradle wrapper jar file (.jar files are usually ignored) +!gradle-wrapper.jar + +# Cache of project +.gradletasknamecache + +# # Work around https://youtrack.jetbrains.com/issue/IDEA-116898 +# gradle/wrapper/gradle-wrapper.properties + +##### CMake +CMakeLists.txt.user +CMakeCache.txt +CMakeFiles +CMakeScripts +Testing +Makefile +cmake_install.cmake +install_manifest.txt +compile_commands.json +CTestTestfile.cmake +_deps + +##### C++ +# Prerequisites +*.d + +# Compiled Object files +*.slo +*.lo +*.o +*.obj + +# Precompiled Headers +*.gch +*.pch + +# Compiled Dynamic libraries +*.so +*.dylib +*.dll + +# Fortran module files +*.mod +*.smod + +# Compiled Static libraries +*.lai +*.la +*.a +*.lib + +# Executables +*.exe +*.out +*.app + +# C/C++ binary extension file +*.bin + +##### C +# Prerequisites +*.d + +# Object files +*.o +*.ko +*.obj +*.elf + +# Linker output +*.ilk +*.map +*.exp + +# Precompiled Headers +*.gch +*.pch + +# Libraries +*.lib +*.a +*.la +*.lo + +# Shared objects (inc. Windows DLLs) +*.dll +*.so +*.so.* +*.dylib + +# Executables +*.exe +*.out +*.app +*.i*86 +*.x86_64 +*.hex + +# Debug files +*.dSYM/ +*.su +*.idb +*.pdb + +# Kernel Module Compile Results +*.mod* +*.cmd +.tmp_versions/ +modules.order +Module.symvers +Mkfile.old +dkms.conf + +# Raspberry Pi Pico Object file +*.uf2 +# Raspberry Pi Pico disassembler file +*.dis + +*:tests +*.out + +Dockerfile \ No newline at end of file From 72b579c2705d5f3942e014930eee0c9306cde8fd Mon Sep 17 00:00:00 2001 From: Apurwa lohia <74809495+apurwa-lohia@users.noreply.github.com> Date: Tue, 11 Oct 2022 11:31:40 +0530 Subject: [PATCH 055/290] Create Flower Planting With No Adjacent.cpp --- Flower Planting With No Adjacent.cpp | 40 ++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 Flower Planting With No Adjacent.cpp diff --git a/Flower Planting With No Adjacent.cpp b/Flower Planting With No Adjacent.cpp new file mode 100644 index 0000000..1d2d415 --- /dev/null +++ b/Flower Planting With No Adjacent.cpp @@ -0,0 +1,40 @@ +class Solution { + bool apply(vector>& adj, vector& colors, int u, int n, int par) { + for (int c = 1; c <= 4; c++) { + if (c != par) { + colors[u] = c; + bool safe = true; + for (int v : adj[u]) { + if (colors[v] == c) { + safe = false; + break; + } + if (colors[v] == -1 && !apply(adj, colors, v, n, c)) { + safe = false; + break; + } + } + if (safe) + break; + colors[u] = -1; + } + } + return colors[u] != -1; + } + +public: + vector gardenNoAdj(int N, vector>& paths) { + vector> adj(N); + for (auto e : paths) { + adj[e[0]-1].push_back(e[1]-1); + adj[e[1]-1].push_back(e[0]-1); + } + + vector colors(N, -1); + for (int i = 0; i < N; i++) { + if (colors[i] == -1) + apply(adj, colors, i, N, -1); + } + return colors; + } +}; From 3724faf9745aec6a8d3d480e7d3734a7c85741ff Mon Sep 17 00:00:00 2001 From: Ankush Singh Date: Tue, 11 Oct 2022 11:32:49 +0530 Subject: [PATCH 056/290] temp convert --- TemperatureConversion.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 TemperatureConversion.cpp diff --git a/TemperatureConversion.cpp b/TemperatureConversion.cpp new file mode 100644 index 0000000..d3057e1 --- /dev/null +++ b/TemperatureConversion.cpp @@ -0,0 +1,33 @@ +#include +using namespace std; +int main() { + float kelvin; + int celcuis; + int c; + + cout << "Please enter if you want to enter the value of temp in 1(for Kelvin " + "to celsuis) and 2(for celcuis to kelvin)"; + cin >> c; + + switch (c) { + case 1: + cout << "Please Enter The Tempratue in Kelvin : "; + cin >> kelvin; + + cout << "The Tempratue in Celsius is : " << kelvin - 274.15 << 'C' << endl; + cout << "The approx value in int is : " << int(kelvin - 274.15) << 'C'; + break; + + case 2: + cout << "Please Enter The Tempratue in Celsius : "; + cin >> celcuis; + + cout << "The Tempratue in Kelvin is : " << celcuis + 274.15 << 'k' << endl; + cout << "The approx value in Celcuis is : " << int(celcuis + 274.15) << 'k'; + break; + default: + cout << "Please Enter A valid value : "; + break; + } + return 0; +} From 056925356f45791dad23ce7be0bc3ac0c5f94e21 Mon Sep 17 00:00:00 2001 From: lakshya bhasin Date: Tue, 11 Oct 2022 11:35:27 +0530 Subject: [PATCH 057/290] Added leetcode 162 PeakElement --- PeakElement.java | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 PeakElement.java diff --git a/PeakElement.java b/PeakElement.java new file mode 100644 index 0000000..af784ef --- /dev/null +++ b/PeakElement.java @@ -0,0 +1,21 @@ + +// leetcode -162 +class Solution { + public int findPeakElement(int[] arr) { + int start=0; + int end=arr.length-1; + int mid; +// using binary search + while (start Date: Tue, 11 Oct 2022 11:52:20 +0530 Subject: [PATCH 058/290] Create help_classmates.cpp --- help_classmates.cpp | 177 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 177 insertions(+) create mode 100644 help_classmates.cpp diff --git a/help_classmates.cpp b/help_classmates.cpp new file mode 100644 index 0000000..69b705a --- /dev/null +++ b/help_classmates.cpp @@ -0,0 +1,177 @@ +// GeeksForGeeks QUESTION : + +/* +Professor X wants his students to help each other in the chemistry lab. +He suggests that every student should help out a classmate who scored less marks than him in chemistry +and whose roll number appears after him. +But the students are lazy and they don't want to search too far. +They each pick the first roll number after them that fits the criteria. +Find the marks of the classmate that each student picks. + +Note: one student may be selected by multiple classmates. + +Example 1: +Input: N = 5, arr[] = {3, 8, 5, 2, 25} +Output: 2 5 2 -1 -1 +Explanation: + 1. Roll number 1 has 3 marks. The first person + who has less marks than him is roll number 4, + who has 2 marks. + 2. Roll number 2 has 8 marks, he helps student + with 5 marks. + 3. Roll number 3 has 5 marks, he helps student + with 2 marks. + 4. Roll number 4 and 5 can not pick anyone as + no student with higher roll number has lesser + marks than them. This is denoted by -1. +Output shows the marks of the weaker student that +each roll number helps in order. ie- 2,5,2,-1,-1 + +*/ + +// { Driver Code Starts +//Initial Template for C++ + +#include +#include +#include +using namespace std; + + + // } Driver Code Ends +//User function Template for C++ + +class Solution{ + + public: + /* + // Brute Force Approach + // Time complexity = O(N^2) + // Steps: + // 1) Initialise a vector helper to store the next greater number of arr[i] at each index i + // 2) Travel arr and for every element at index i + // Initialise a bool variable to false + // Run a loop from i+1 to n check if the current element is greater than current element, set bool var to true + // Then break the loop and store that element in vector helper + // If after running through the loop bool variable is false, store -1 in vector helper + // 3) Return the helper vector + + vector help_classmate(vector arr, int n) + { + // Your code goes here + + vector helper; + bool put = false; + for(int i=0 ; i help_classmate(vector arr, int n) + { + // Your code here + vector v; + stack s; + bool pushed; + for(int i=n-1 ; i>=0 ; i--) + { + if(s.empty() == true) + { + v.push_back(-1); + s.push(arr[i]); + } + else + { + pushed = false; + int x; + while(s.empty()==false ) + { + x = s.top(); + if(x < arr[i]) + { + v.push_back(x); + s.push(arr[i]); + pushed = true; + break; + } + else + { + if(s.empty() == false) + { + s.pop(); + } + } + } + if(s.empty()==true && pushed == false) + { + v.push_back(-1); + s.push(arr[i]); + } + + + } + } + + reverse(v.begin(),v.end()); + return v; + } +}; + +// { Driver Code Starts. + +int main() +{ + int t; + cin>>t; + while(t--) + { + int n; + cin>>n; + vector array(n); + for (int i = 0; i < n; ++i) + { + cin>>array[i]; + } + Solution obj; + vector result = obj.help_classmate(array,n); + for (int i = 0; i < n; ++i) + { + cout< Date: Tue, 11 Oct 2022 17:53:28 +0530 Subject: [PATCH 059/290] Create GCD in single line --- GCD in single line | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 GCD in single line diff --git a/GCD in single line b/GCD in single line new file mode 100644 index 0000000..fb6edd7 --- /dev/null +++ b/GCD in single line @@ -0,0 +1,26 @@ +// C++ program to find GCD of two numbers + +#include +using namespace std; + +// Recursive function to return gcd of a and b in single line + +int gcd(int a, int b) +{ + + return b == 0 ? a : gcd(b, a % b); +} + + +// Driver program to test above function + +int main() +{ + + int a , b ; + cin>>a>>b; + + cout<<"GCD of "< Date: Tue, 11 Oct 2022 18:14:19 +0530 Subject: [PATCH 060/290] Super egg drop Dynamic Programming hard question. https://leetcode.com/problems/super-egg-drop/ Java Solution of leetcode problem. --- 887.Super_Egg_Drop.java | 43 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 887.Super_Egg_Drop.java diff --git a/887.Super_Egg_Drop.java b/887.Super_Egg_Drop.java new file mode 100644 index 0000000..04a1458 --- /dev/null +++ b/887.Super_Egg_Drop.java @@ -0,0 +1,43 @@ +// Problem Link +// https://leetcode.com/problems/super-egg-drop/ + +class Solution { + Integer dp[][]=new Integer[101][10001]; + //Declared wrapper class because no need to initialise values, will be null defaultly + + public int superEggDrop(int K, int N) { + + if(K==1)//when there is only one egg + return N; + + if(N==0 || N==1)//when no. of floors are 0 or 1 + return N; + + if(dp[K][N]!=null)//checking if it is filled + return dp[K][N]; + + int i,l=1,h=N; + int ans=Integer.MAX_VALUE; + + while(l<=h) + { + int mid=(l+h)/2; + + int down_temp=superEggDrop(K-1,mid-1);//If egg breaks go down + + int up_temp=superEggDrop(K,N-mid);//if egg doesn't break go up + + int temp=1+Math.max(down_temp,up_temp); + //adding one because we have used 1 attempt and max of up and down because + //we need worst case attempts from both + + if(down_temp Date: Tue, 11 Oct 2022 18:25:48 +0530 Subject: [PATCH 061/290] Create Number of Islands.cpp --- Number of Islands.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Number of Islands.cpp diff --git a/Number of Islands.cpp b/Number of Islands.cpp new file mode 100644 index 0000000..d4cff3f --- /dev/null +++ b/Number of Islands.cpp @@ -0,0 +1,24 @@ +class Solution { +public: + int numIslands(vector>& grid) { + int ans=0; + for(int i=0;i>& grid,int i, int j){ + if(i<0||j<0||i==grid.size()||j==grid[0].size()||grid[i][j]=='0') + return; + grid[i][j]='0'; + help(grid,i+1,j); + help(grid,i,j+1); + help(grid,i-1,j); + help(grid,i,j-1); + } +}; From 5a9b512eb5410041ddc1ac32283b5e662529e0b9 Mon Sep 17 00:00:00 2001 From: Tania Banerjee <110692684+taniaban2712@users.noreply.github.com> Date: Tue, 11 Oct 2022 18:26:26 +0530 Subject: [PATCH 062/290] new commit uploading happy number of leetcode --- happynumber_taniaban2712.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 happynumber_taniaban2712.cpp diff --git a/happynumber_taniaban2712.cpp b/happynumber_taniaban2712.cpp new file mode 100644 index 0000000..085579b --- /dev/null +++ b/happynumber_taniaban2712.cpp @@ -0,0 +1,23 @@ +class Solution { +public: + bool isHappy(int n) { + int tmp = 0; + set visited; + + while(true){ + tmp = 0; + while(n > 0){ + tmp += pow((n%10), 2); + n/=10; + } + n = tmp; + if(n == 1){ + break; + }else if(visited.find(n)!=visited.end()){ + return false; + } + visited.insert(n); + } + return true; + } +}; From 697033edc8e479d121a2be34d835d66b196d3134 Mon Sep 17 00:00:00 2001 From: Manus-MG <91424400+Manus-MG@users.noreply.github.com> Date: Tue, 11 Oct 2022 18:29:42 +0530 Subject: [PATCH 063/290] Edit Distance DP question One of the famous problem of Dynamic Programming hard question on leetcode , easy solution and explained with comments, Please add the label of hactoberfest so that it gets accepted. https://leetcode.com/problems/edit-distance/ --- 72._Edit_Distance.java | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 72._Edit_Distance.java diff --git a/72._Edit_Distance.java b/72._Edit_Distance.java new file mode 100644 index 0000000..29ec95b --- /dev/null +++ b/72._Edit_Distance.java @@ -0,0 +1,37 @@ +// Problem Link +// https://leetcode.com/problems/edit-distance/ + + +public class Solution { + int[][] dp; + + public int minDistance(String word1, String word2) { + dp = new int[word1.length()][word2.length()]; + + return minDistanceHelper(word1, word2, 0, 0); + } + + private int minDistanceHelper(String word1, String word2, int index1, int index2) { + if (index1 == word1.length()) return word2.length() - index2; + if (index2 == word2.length()) return word1.length() - index1; + + if (dp[index1][index2] > 0) return dp[index1][index2]; + + int result; + if (word1.charAt(index1) == word2.charAt(index2)) { + result = minDistanceHelper(word1, word2, index1+1, index2+1); + } else { + // replace char + result = 1 + minDistanceHelper(word1, word2, index1+1, index2+1); + + // delete char from word1 + result = Math.min(result, 1 + minDistanceHelper(word1, word2, index1+1, index2)); + + // delete char from word2 + result = Math.min(result, 1 + minDistanceHelper(word1, word2, index1, index2+1)); + } + + dp[index1][index2] = result; + return result; + } +} From 173d48610d9221509d56a867e1ffbd2d71e42af9 Mon Sep 17 00:00:00 2001 From: Manus-MG <91424400+Manus-MG@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:00:35 +0530 Subject: [PATCH 064/290] 152. Maximum Product Subarray Java DP Medium Maximum Product Subarray famous question from the striver sheet medium level. hacktoberfest link https://leetcode.com/problems/maximum-product-subarray/ --- 152._Maximum_Product_Subarray.java | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 152._Maximum_Product_Subarray.java diff --git a/152._Maximum_Product_Subarray.java b/152._Maximum_Product_Subarray.java new file mode 100644 index 0000000..36d4309 --- /dev/null +++ b/152._Maximum_Product_Subarray.java @@ -0,0 +1,27 @@ +// Problem link +// https://leetcode.com/problems/maximum-product-subarray/ + + + +// Basically to undertand this solution, one should have idea on Kadanes Algorithm which is a DP approach to solve Maximum Subarray Sum. +// This question just replaced sum with product and we know that we got headache with the negative values if you have understood the question properly. +// So I swapped min and max values at current iteration of negative value. + + +class Solution { + public int maxProduct(int[] nums) { + int max=nums[0], min=nums[0],prod=max; + for(int i=1;i Date: Tue, 11 Oct 2022 19:15:01 +0530 Subject: [PATCH 065/290] Create Find_whether_an_array_is_a_subset_of_another_array.cpp This repository help me alot --- ..._an_array_is_a_subset_of_another_array.cpp | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 Find_whether_an_array_is_a_subset_of_another_array.cpp diff --git a/Find_whether_an_array_is_a_subset_of_another_array.cpp b/Find_whether_an_array_is_a_subset_of_another_array.cpp new file mode 100644 index 0000000..8334169 --- /dev/null +++ b/Find_whether_an_array_is_a_subset_of_another_array.cpp @@ -0,0 +1,32 @@ + +#include +bool isSubset(int arr1[], int arr2[], int m, int n) +{ + int i = 0; + int j = 0; + for (i = 0; i < n; i++) { + for (j = 0; j < m; j++) { + if (arr2[i] == arr1[j]) + break; + } + if (j == m) + return 0; + } + return 1; +} +int main() +{ + int arr1[] = { 11, 1, 13, 21, 3, 7 }; + int arr2[] = { 11, 3, 7, 1 }; + + int m = sizeof(arr1) / sizeof(arr1[0]); + int n = sizeof(arr2) / sizeof(arr2[0]); + + if (isSubset(arr1, arr2, m, n)) + printf("arr2[] is subset of arr1[] "); + else + printf("arr2[] is not a subset of arr1[]"); + + getchar(); + return 0; +} From ececc96d39774d867644e76b096fe9e3a31a0a68 Mon Sep 17 00:00:00 2001 From: Saikat Nayek <88332980+Saikat2407@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:20:05 +0530 Subject: [PATCH 066/290] Added three important question from leetcode --- CombinationSum.java | 67 +++++++++++++++++++++++++++++++++++++++++++++ KthSymbol.java | 13 +++++++++ TargetSum.java | 25 +++++++++++++++++ 3 files changed, 105 insertions(+) create mode 100644 CombinationSum.java create mode 100644 KthSymbol.java create mode 100644 TargetSum.java diff --git a/CombinationSum.java b/CombinationSum.java new file mode 100644 index 0000000..2fb1bc2 --- /dev/null +++ b/CombinationSum.java @@ -0,0 +1,67 @@ +<<<<<<< HEAD +// https://leetcode.com/problems/combination-sum/ +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; + +public class CombinationSum { + public static void main(String[] args) { + int[] candidates = {2,3,6,7}; + List> sum = combinationSum(candidates, 7); + System.out.println(sum); + } + public static List> combinationSum(int[] candidates, int target) { + List> ans = new ArrayList<>(); + findCombination(0, candidates, target, ans, new ArrayList<>()); + return ans; + } + public static void findCombination(int index, int[] arr, int target, List> ans, List ds){ + if(index == arr.length){ + if(target == 0){ + ans.add(new ArrayList<>(ds)); + } + return; + } + + if(arr[index] <= target){ + ds.add(arr[index]); + findCombination(index, arr, target - arr[index], ans, ds); + ds.remove(ds.size()-1); + } + findCombination(index+1, arr, target, ans, ds); + } +} +======= +// https://leetcode.com/problems/combination-sum/ +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; + +public class CombinationSum { + public static void main(String[] args) { + int[] candidates = {2,3,6,7}; + List> sum = combinationSum(candidates, 7); + System.out.println(sum); + } + public static List> combinationSum(int[] candidates, int target) { + List> ans = new ArrayList<>(); + findCombination(0, candidates, target, ans, new ArrayList<>()); + return ans; + } + public static void findCombination(int index, int[] arr, int target, List> ans, List ds){ + if(index == arr.length){ + if(target == 0){ + ans.add(new ArrayList<>(ds)); + } + return; + } + + if(arr[index] <= target){ + ds.add(arr[index]); + findCombination(index, arr, target - arr[index], ans, ds); + ds.remove(ds.size()-1); + } + findCombination(index+1, arr, target, ans, ds); + } +} +>>>>>>> 67aafb10a70e470ee512334062930bef20542fa0 diff --git a/KthSymbol.java b/KthSymbol.java new file mode 100644 index 0000000..6519bdc --- /dev/null +++ b/KthSymbol.java @@ -0,0 +1,13 @@ +// https://leetcode.com/problems/k-th-symbol-in-grammar/ +class Solution { + public int kthGrammar(int n, int k) { + if(n==1 || k==1){ + return 0; + } + if(k%2==0){ + return 1 - kthGrammar(n-1, (k+1)/2); + }else{ + return kthGrammar(n-1, (k+1)/2); + } + } +} \ No newline at end of file diff --git a/TargetSum.java b/TargetSum.java new file mode 100644 index 0000000..d882f67 --- /dev/null +++ b/TargetSum.java @@ -0,0 +1,25 @@ +// https://leetcode.com/problems/target-sum/ +public class TargetSum { + static int count; + public static void main(String[] args) { + int[] nums = {1, 1, 1, 1, 1}; + System.out.println(findTargetSumWays(nums, 3)); + } + public static int findTargetSumWays(int[] nums, int target){ + count = 0; + TargetSum(nums, target, 0, 0); + + return count; + } + public static void TargetSum(int[] nums, int target, int index, int val){ + if(index == nums.length){ + if(target == val){ + count++; + } + return; + } + + TargetSum(nums, target, index+1, val+nums[index]); + TargetSum(nums, target, index+1, val-nums[index]); + } +} \ No newline at end of file From fe0d0b58ff9ee96d83565ef659998098dc8a6b24 Mon Sep 17 00:00:00 2001 From: Manus-MG <91424400+Manus-MG@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:27:57 +0530 Subject: [PATCH 067/290] 1547. Minimum Cost to Cut a Stick (DP Hard) JAVA Whole working Solution with easy explaination. Hard level question . hacktoberfest 2022 https://leetcode.com/problems/minimum-cost-to-cut-a-stick/ --- 1547._Minimum_Cost_to_Cut_a_Stick.java | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 1547._Minimum_Cost_to_Cut_a_Stick.java diff --git a/1547._Minimum_Cost_to_Cut_a_Stick.java b/1547._Minimum_Cost_to_Cut_a_Stick.java new file mode 100644 index 0000000..cf9c399 --- /dev/null +++ b/1547._Minimum_Cost_to_Cut_a_Stick.java @@ -0,0 +1,21 @@ +// Problem link +// https://leetcode.com/problems/minimum-cost-to-cut-a-stick/ + +// Bottom-Up DP +// After you figure out top-down DP, it's easy to convert it to bottom-up solution. The only trick here is to move i backward. This ensures that smaller cuts are processed before calculating min cost for the larger ones. It happens this way naturally in the recursive solution. + +public int minCost(int n, int[] cuts) { + var c = new ArrayList(); + for (int cut : cuts) + c.add(cut); + c.addAll(Arrays.asList(0, n)); + Collections.sort(c); + int[][] dp = new int[c.size()][c.size()]; + for (int i = c.size() - 1; i >= 0; --i) + for (int j = i + 1; j < c.size(); ++j) { + for (int k = i + 1; k < j; ++k) + dp[i][j] = Math.min(dp[i][j] == 0 ? Integer.MAX_VALUE : dp[i][j], + c.get(j) - c.get(i) + dp[i][k] + dp[k][j]); + } + return dp[0][c.size() - 1]; +} From 65b910a95b10229cbdef809d792884b271917a2c Mon Sep 17 00:00:00 2001 From: Shivam Garg <70859035+Shivam311201@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:33:37 +0530 Subject: [PATCH 068/290] Create 2421. Number of Good Paths --- 2421. Number of Good Paths | 66 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 66 insertions(+) create mode 100644 2421. Number of Good Paths diff --git a/2421. Number of Good Paths b/2421. Number of Good Paths new file mode 100644 index 0000000..017879b --- /dev/null +++ b/2421. Number of Good Paths @@ -0,0 +1,66 @@ +class Solution { +public: + vector parent, rank; + int find(int p) { + if (parent[p] == -1) return p; + return parent[p] = find(parent[p]); + } + bool UNION(int p, int q) { + int i = find(p); + int j = find(q); + if (i==j) return false; + if (rank[i] < rank[j]){ + parent[i] = j; + rank[j]+=rank[i]; + } + else { + parent[j] = i; + rank[i]+=rank[j]; + } + return true; + } + int numberOfGoodPaths(vector& vals, vector>& edges) { + int n=vals.size(),goodPaths=0; + parent.resize(n,-1); + rank.resize(n,1); + + vector> adj(n); + map> sameValues;//Map is req bcz we have to start with smaller values else grp will contain larger values as well + + for (int i = 0; i < n; i++) { + sameValues[vals[i]].push_back(i); + } + + for (auto &e : edges) { + int u = e[0], v = e[1]; + + if (vals[u] >= vals[v]) { + adj[u].push_back(v); + } else if (vals[v] >= vals[u]) { + adj[v].push_back(u); + } + } + + for(auto &[value, allNodes] : sameValues){ + for(auto it:allNodes){ + for(auto itr:adj[it]) + UNION(it,itr); + } + + unordered_map group; + + for (int u : allNodes) { + group[find(u)]++; + } + + goodPaths += allNodes.size(); + + for(auto it:group){ + goodPaths+=(it.second*(it.second-1))/2; + } + + } + + return goodPaths; + } +}; From 0e64e041de7c1369c3ee4a136eb5c35be6c1c638 Mon Sep 17 00:00:00 2001 From: Sumit Baroniya <75536160+sumitbaroniya@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:52:49 +0530 Subject: [PATCH 069/290] Create H-index.cpp --- H-index.cpp | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 H-index.cpp diff --git a/H-index.cpp b/H-index.cpp new file mode 100644 index 0000000..6ff90d3 --- /dev/null +++ b/H-index.cpp @@ -0,0 +1,28 @@ +class Solution { +public: + int hIndex(vector& citations) { + const auto n = citations.size(); + vector count(n + 1, 0); + for (const auto& x : citations) { + // Put all x >= n in the same bucket. + if (x >= n) { + ++count[n]; + } else { + ++count[x]; + } + } + + int h = 0; + for (int i = n; i >= 0; --i) { + h += count[i]; + if (h >= i) { + return i; + } + } + return h; + } +}; + + +// Time complexity: O(n) +// Space complexity: O(n) From d3aac6c01b96322af4cabead39973f2f9714f060 Mon Sep 17 00:00:00 2001 From: Parthkumar507 <95721092+Parthkumar507@users.noreply.github.com> Date: Tue, 11 Oct 2022 19:59:49 +0530 Subject: [PATCH 070/290] Increasing Triplet Subsequence This is leetcode daily question soluton(11 Oct 2022) . The solution is based on an iterative approach and the code is written in c++. Question link :- https://leetcode.com/problems/increasing-triplet-subsequence/ --- increasing_triplet_subsequence.cpp | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 increasing_triplet_subsequence.cpp diff --git a/increasing_triplet_subsequence.cpp b/increasing_triplet_subsequence.cpp new file mode 100644 index 0000000..36b482d --- /dev/null +++ b/increasing_triplet_subsequence.cpp @@ -0,0 +1,29 @@ +#include +#include +#include + +using namespace std; + +class Solution { +public: + bool increasingTriplet(vector& nums) { + int l=nums.size(); + if(l<3) return false; + int min1=INT_MAX,min2=INT_MAX; + + for(int i=0;i Date: Tue, 11 Oct 2022 20:05:58 +0530 Subject: [PATCH 071/290] Uploaded Make A and B equal --- Make A and B equal.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Make A and B equal.cpp diff --git a/Make A and B equal.cpp b/Make A and B equal.cpp new file mode 100644 index 0000000..dca9afc --- /dev/null +++ b/Make A and B equal.cpp @@ -0,0 +1,26 @@ +#include +#include +using namespace std; +typedef long long int ll; + +int main() { + // your code goes here + ll p; + cin>>p; + while(p--){ + ll m,a=0,b=0; + cin>>m; + vector x(m,0),y(m,0); + for(ll i=0;i>x[i]; + for(ll i=0;i>y[i]; + a+=(x[i]-y[i]); + b= b+abs(x[i]-y[i]); + } + + if(a!=0)cout<<-1< Date: Tue, 11 Oct 2022 20:23:46 +0530 Subject: [PATCH 072/290] Vending Machine Please mark my code under hacktober fest label. --- Vending Machine | 42 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 Vending Machine diff --git a/Vending Machine b/Vending Machine new file mode 100644 index 0000000..5dc86d1 --- /dev/null +++ b/Vending Machine @@ -0,0 +1,42 @@ +#include +void main() +{ + int a; + printf(" Code \t Products \n 106 - Haldiram Ratmali Sev \n 206 - Haldiram instant bhel \n 306 - Fuse chocolate \n 406 - Mixed Fruit Juice \n 506 - Lassi"); + printf("\n Enter the code = "); + scanf("%d",&a); + + switch(a) + { + case 106: + + printf("\n Haldiram Ratmali Sev"); + + break; + + case 206: + + printf("\n Haldiram instant bhel"); + + break; + case 306: + + printf("\n Fuse chocolate"); + + + break; + case 406: + + printf("\n Mixed Fruit Juice"); + break; + case 506: + + printf("\n Lassi"); + break; + default:printf("\n The coin is lost"); + break; + + } + + +} From c5ba3d1daff82af6b0a7a7ba109988a3ae8e569a Mon Sep 17 00:00:00 2001 From: AkifSaeed20 <72187307+AkifSaeed20@users.noreply.github.com> Date: Tue, 11 Oct 2022 20:31:57 +0530 Subject: [PATCH 073/290] Calculator Application --- Calculator application | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Calculator application diff --git a/Calculator application b/Calculator application new file mode 100644 index 0000000..0100892 --- /dev/null +++ b/Calculator application @@ -0,0 +1,29 @@ +#include +void main() +{ char ch; + float p,q; + + printf("enter the type of operation you want to perform="); + scanf("%c",&ch); + printf(" enter the two numbers "); + scanf("%f %f",&p,&q); + + if(ch=='+') + { + printf("p +q=%f",p+q); + } + else if(ch=='-') + { + printf("p -q=%f",p-q); + } + else if(ch=='*') + { + printf("p*q=%f",p*q); + } + else if(ch=='/') + { + printf(" p/q=%f",p/q); + } + + +} From a1dc08bcb30902be1afa7ef599c2f3f5a829a373 Mon Sep 17 00:00:00 2001 From: AkifSaeed20 <72187307+AkifSaeed20@users.noreply.github.com> Date: Tue, 11 Oct 2022 20:35:01 +0530 Subject: [PATCH 074/290] Fibonacci Series without recursion --- Fibonacci Series without recursion | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Fibonacci Series without recursion diff --git a/Fibonacci Series without recursion b/Fibonacci Series without recursion new file mode 100644 index 0000000..64e6399 --- /dev/null +++ b/Fibonacci Series without recursion @@ -0,0 +1,17 @@ +#include +int main() +{ int t1=0,t2=1,t3,term,n; + printf("Enter the no of term = "); + scanf("%d",&n); + printf("%d\t%d\t",t1,t2); + for(term=3;term<=n;term++) + { + t3=t1+t2; + printf("%d\t",t3); + t1=t2; + t2=t3; + + } + + return 0; +} From dbad18766df41ac31f50072b9df27a9dcee37057 Mon Sep 17 00:00:00 2001 From: Kulrajsinh9904 <101088552+Kulrajsinh9904@users.noreply.github.com> Date: Tue, 11 Oct 2022 21:24:11 +0530 Subject: [PATCH 075/290] Create 2427. Number of Common Factors.cpp language used c++. --- 2427. Number of Common Factors.cpp | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 2427. Number of Common Factors.cpp diff --git a/2427. Number of Common Factors.cpp b/2427. Number of Common Factors.cpp new file mode 100644 index 0000000..e346a2c --- /dev/null +++ b/2427. Number of Common Factors.cpp @@ -0,0 +1,12 @@ +class Solution { +public: + int commonFactors(int a, int b) { + int mini = min(a,b); + int ans = 0; + for(int i = 1; i <= mini; i++){ + if(a % i ==0 && b % i == 0) + ans++; + } + return ans; + } +}; From 4ecf5b2fa734a30d18fb9104a9740b8066c50b29 Mon Sep 17 00:00:00 2001 From: Kulrajsinh9904 <101088552+Kulrajsinh9904@users.noreply.github.com> Date: Tue, 11 Oct 2022 21:25:42 +0530 Subject: [PATCH 076/290] Create 2427. N509. Fibonacci Numberumber of Common Factors.cpp language used c++. --- ... Fibonacci Numberumber of Common Factors.cpp | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2427. N509. Fibonacci Numberumber of Common Factors.cpp diff --git a/2427. N509. Fibonacci Numberumber of Common Factors.cpp b/2427. N509. Fibonacci Numberumber of Common Factors.cpp new file mode 100644 index 0000000..c40461c --- /dev/null +++ b/2427. N509. Fibonacci Numberumber of Common Factors.cpp @@ -0,0 +1,17 @@ +class Solution { +public: + int fib(int n) { + if(n == 1) + return 1; + + int first = 0; + int second = 1; + int ans = 0; + for(int i = 1; i < n; i++){ + ans = first + second; + first = second; + second = ans; + } + return ans; + } +}; From 2daf32a8b6169d1418bd94e1d686e81a8e40990e Mon Sep 17 00:00:00 2001 From: Kulrajsinh9904 <101088552+Kulrajsinh9904@users.noreply.github.com> Date: Tue, 11 Oct 2022 21:31:31 +0530 Subject: [PATCH 077/290] Create 1512. Number of Good Pairs.cpp language used c++. --- 1512. Number of Good Pairs.cpp | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 1512. Number of Good Pairs.cpp diff --git a/1512. Number of Good Pairs.cpp b/1512. Number of Good Pairs.cpp new file mode 100644 index 0000000..0714678 --- /dev/null +++ b/1512. Number of Good Pairs.cpp @@ -0,0 +1,14 @@ +class Solution { +public: + int numIdenticalPairs(vector& nums) { + int ans = 0; + for(int i = 0; i < nums.size(); i++){ + for(int j = i+1; j < nums.size(); j++){ + if(nums[i] == nums[j]){ + ans++; + } + } + } + return ans; + } +}; From a6c4ada37fff62f13328cfa97e7430add04993c8 Mon Sep 17 00:00:00 2001 From: Kulrajsinh9904 <101088552+Kulrajsinh9904@users.noreply.github.com> Date: Tue, 11 Oct 2022 21:32:54 +0530 Subject: [PATCH 078/290] Create 412. Fizz Buzz.cpp language used c++. --- 412. Fizz Buzz.cpp | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 412. Fizz Buzz.cpp diff --git a/412. Fizz Buzz.cpp b/412. Fizz Buzz.cpp new file mode 100644 index 0000000..e608de4 --- /dev/null +++ b/412. Fizz Buzz.cpp @@ -0,0 +1,17 @@ +class Solution { +public: + vector fizzBuzz(int n) { + vector ans; + for(int i = 1; i <= n; i++){ + if(i % 3 == 0 && i % 5 == 0) + ans.push_back("FizzBuzz"); + else if(i % 3 == 0) + ans.push_back("Fizz"); + else if(i % 5 == 0) + ans.push_back("Buzz"); + else + ans.push_back(to_string(i)); + } + return ans; + } +}; From c52abbf1f5cae0c34c8ccb07eeab7ca5b33c90a4 Mon Sep 17 00:00:00 2001 From: Jyoti Mathpal Date: Tue, 11 Oct 2022 21:36:37 +0530 Subject: [PATCH 079/290] added a new leetcode problem --- IntegerToRoman.py | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 IntegerToRoman.py diff --git a/IntegerToRoman.py b/IntegerToRoman.py new file mode 100644 index 0000000..673dd18 --- /dev/null +++ b/IntegerToRoman.py @@ -0,0 +1,19 @@ +class Solution: + def intToRoman(self, num: int) -> str: + valueSymbols = [(1000, 'M'), (900, 'CM'), + (500, 'D'), (400, 'CD'), + (100, 'C'), (90, 'XC'), + (50, 'L'), (40, 'XL'), + (10, 'X'), (9, 'IX'), + (5, 'V'), (4, 'IV'), + (1, 'I')] + ans = [] + + for value, symbol in valueSymbols: + if num == 0: + break + count, num = divmod(num, value) + ans.append(symbol * count) + + return ''.join(ans) + From 4826f386e4777b56d85db55471a7007bf94b28fe Mon Sep 17 00:00:00 2001 From: pushpendrasahu11 <103773259+pushpendrasahu11@users.noreply.github.com> Date: Tue, 11 Oct 2022 21:38:52 +0530 Subject: [PATCH 080/290] Create 2365 Task Scheduler || Added Solution for leetcode problem 2365 Task Scheduler II. --- 2365-Task-scheduler-ii.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 2365-Task-scheduler-ii.cpp diff --git a/2365-Task-scheduler-ii.cpp b/2365-Task-scheduler-ii.cpp new file mode 100644 index 0000000..ab8f05a --- /dev/null +++ b/2365-Task-scheduler-ii.cpp @@ -0,0 +1,32 @@ +class Solution { +public: + long long taskSchedulerII(vector& tasks, int space) { + unordered_mapmapp; + long long res=tasks.size(); + + vectorarr(tasks.size()); + long long c=0; + + for(int i=0;i Date: Tue, 11 Oct 2022 21:46:16 +0530 Subject: [PATCH 081/290] 309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown added leet code question number 309 Best_Time_to_Buy_and_Sell_Stock_with_Cooldown problem which is of medium level problem. --- ...me_to_Buy_and_Sell_Stock_with_Cooldown.cpp | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown.cpp diff --git a/309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown.cpp b/309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown.cpp new file mode 100644 index 0000000..c9eab25 --- /dev/null +++ b/309_Best_Time_to_Buy_and_Sell_Stock_with_Cooldown.cpp @@ -0,0 +1,21 @@ +class Solution { +public: + int find(int ind,int buy,vector&prices,vector>&dp) + { + if(ind>=prices.size())return 0; + int profit=0; + if(dp[ind][buy]!=-1)return dp[ind][buy]; + if(buy) + { + profit=max(-prices[ind]+find(ind+1,0,prices,dp),find(ind+1,1,prices,dp)); + } + else + profit=max(prices[ind]+find(ind+2,1,prices,dp),find(ind+1,0,prices,dp)); + return dp[ind][buy]=profit; + } + int maxProfit(vector& prices) { + vector>dp(prices.size(),vector(2,-1)); + int a=find(0,1,prices,dp); + return a; + } +}; From a65116219dcc8e9278ddfba60e354e31a4f77aab Mon Sep 17 00:00:00 2001 From: pushpendrasahu11 <103773259+pushpendrasahu11@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:20:14 +0530 Subject: [PATCH 082/290] Added Solution Added solution for the Leetcode problem 264 Ugly Number II. --- Ugly Number II.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Ugly Number II.cpp diff --git a/Ugly Number II.cpp b/Ugly Number II.cpp new file mode 100644 index 0000000..25a35c1 --- /dev/null +++ b/Ugly Number II.cpp @@ -0,0 +1,23 @@ +int nthUglyNumber(int n) { + if (n==1) return 1; + + vector a(n); + int p2=0,p3=0,p5=0; + a[0]=1; + + for(int i=1;i Date: Tue, 11 Oct 2022 23:24:28 +0530 Subject: [PATCH 083/290] Update ClimbingStairs.cpp Easy solution with explaination --- ClimbingStairs.cpp | 17 +++++++++++------ 1 file changed, 11 insertions(+), 6 deletions(-) diff --git a/ClimbingStairs.cpp b/ClimbingStairs.cpp index 2e200a5..1ff93e9 100644 --- a/ClimbingStairs.cpp +++ b/ClimbingStairs.cpp @@ -1,11 +1,16 @@ class Solution { public: int climbStairs(int n) { - vectordp(n + 1); - dp[0] = 1; - dp[1] = 1; - for(int i = 2; i < n + 1; i++) - dp[i] = dp[i - 1] + dp[i - 2]; - return dp[n]; + int arr[46]; // array for 1 <= n <= 45 + arr[1] = 1; // only one way + arr[2] = 2; // two ways 1->1 or directly 2 + + + // from n = 3 ==> calculate from last two steps + for(int i = 3; i <= n; i++){ + arr[i] = arr[i-1]+arr[i-2]; + } + return arr[n]; + } }; From 2d0ce94f66c653abfbbad17cc695e043ce8e76ba Mon Sep 17 00:00:00 2001 From: Vaibhav Agrawal <89623810+vaibhav23agrawal@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:25:58 +0530 Subject: [PATCH 084/290] 623. Add One Row to Tree Cpp problem of leetcode : https://leetcode.com/problems/add-one-row-to-tree/ --- addOneRowtoTree.cpp | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 addOneRowtoTree.cpp diff --git a/addOneRowtoTree.cpp b/addOneRowtoTree.cpp new file mode 100644 index 0000000..4f38699 --- /dev/null +++ b/addOneRowtoTree.cpp @@ -0,0 +1,37 @@ +class Solution { + public: + TreeNode* addOneRow(TreeNode* root, int v, int d) { + if (d == 1) { + TreeNode* newRoot = new TreeNode(v); + newRoot->left = root; + return newRoot; + } + + int depth = 0; + queue q{{root}}; + + while (!q.empty()) { + ++depth; + for (int sz = q.size(); sz > 0; --sz) { + TreeNode* node = q.front(); + q.pop(); + if (node->left) + q.push(node->left); + if (node->right) + q.push(node->right); + if (depth == d - 1) { + TreeNode* cachedLeft = node->left; + TreeNode* cachedRight = node->right; + node->left = new TreeNode(v); + node->right = new TreeNode(v); + node->left->left = cachedLeft; + node->right->right = cachedRight; + } + } + if (depth == d - 1) + break; + } + + return root; + } +}; From 97bd691f264402ad106ebc0b4fecf35e9fc6485b Mon Sep 17 00:00:00 2001 From: KumkumMittal <72305495+KumkumMittal@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:27:01 +0530 Subject: [PATCH 085/290] Update n queens problem Solution with explaination and time complexity --- n queens problem | 99 ++++++++++++++++++------------------------------ 1 file changed, 37 insertions(+), 62 deletions(-) diff --git a/n queens problem b/n queens problem index 943747c..be040a0 100644 --- a/n queens problem +++ b/n queens problem @@ -1,69 +1,44 @@ class Solution { public: - bool issafe(int row,int col, vector>& board,int n) - { - int x=row; - int y=col; - while(y>=0) - { - if(board[x][y]=="Q") - return false; - y--; - } - x=row; - y=col; - while(x>=0 && y>=0) - { - if(board[x][y]=="Q") - return false; - y--; - x--; - } - x=row; - y=col; - while(x=0) - { - if(board[x][y]=="Q") - return false; - y--; - x++; - } - return true; + vector > sols; // 2D vector of strings to store the solutions + vector> solveNQueens(int n) { + vector board(n, string(n, '.')); // creating an empty board + solve(board, 0); // calling the recursive function + return sols; } - void addsolution(vector>& board,vector>& ans,int n) - { - vector v; - for(int i=0;i& board, int row, int col) { + int n = size(board); + for(int i = 0; i < n; i++) { + // checking if there is a queen in the same column + if(board[i][col] == 'Q') return false; + // checking if there is a queen in the same diagonal (left to right) + if(row - i >= 0 && col - i >= 0 && board[row - i][col - i] == 'Q') return false; + if(row - i >= 0 && col + i < n && board[row - i][col + i] == 'Q') return false; + // No need to traverse more since the lower rows below current row attribute will always be safe. + /* if(row + i < n && col - i >= 0 && board[row + i][col - i] == 'Q') return false; + if(row + i < n && col + i < n && board[row + i][col + i] == 'Q') return false; */ + } + return true; } - void solve(int col,vector>& board,vector>& ans,int n) - { - if(col== n) - { - addsolution(board,ans,n); - return; - } - for(int row=0;row& board, int row) { + // Base condition. + // We reached the last row, so we have a solution so we add it to the solution vector + if(row == size(board)) { + sols.push_back(board); + return; + } + // Try placing a queen on each column for a given row. + // Explore next row by placing Q at each valid column for the current row + for(int col = 0; col < size(board); col++){ + if(isSafe(board, row, col)) { + board[row][col] = 'Q'; // Queen placed on a valid cell + solve(board, row + 1); // Exploring next row + board[row][col] = '.'; // Backtracking to get all possible solutions + } } } - vector> solveNQueens(int n) { - vector> board(n,vector>(n,'.')); - vector> ans; - solve(0,board,ans,n); - return ans; - } }; + +// Time Complexity : O(N!), Since we have N choices in the first row, then N-1 choices in the second row and so on so the overall complexity become O(N!) +// Space Complexity: O(N*N), Just the board and recursive stack space From b8e40a58a2891715e3b3d051c8a6d767b60eb11b Mon Sep 17 00:00:00 2001 From: Harsh8084 <111571087+Harsh8084@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:31:05 +0530 Subject: [PATCH 086/290] QuizGame.py --- QuizGame.py | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 QuizGame.py diff --git a/QuizGame.py b/QuizGame.py new file mode 100644 index 0000000..6dc3fe4 --- /dev/null +++ b/QuizGame.py @@ -0,0 +1,25 @@ +def check_guess(guess, answer): + global score + still_guessing = True + attempt = 0 + while still_guessing and attempt < 3: + if guess.lower() == answer.lower(): + print("Correct Answer") + score = score + 1 + still_guessing = False + else: + if attempt < 2: + guess = input("Sorry Wrong Answer, try again") + attempt = attempt + 1 + if attempt == 3: + print("The Correct answer is ",answer ) + +score = 0 +print("Guess the Animal") +guess1 = input("Which bear lives at the North Pole? ") +check_guess(guess1, "polar bear") +guess2 = input("Which is the fastest land animal? ") +check_guess(guess2, "Cheetah") +guess3 = input("Which is the larget animal? ") +check_guess(guess3, "Blue Whale") +print("Your Score is "+ str(score)) From cdd55bd1d5ac8d60bce70502546dc67032c96a0f Mon Sep 17 00:00:00 2001 From: mohit parmar <100152343+mohitparmar1@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:34:23 +0530 Subject: [PATCH 087/290] Create missingnumber.cpp languange used = c++ --- missingnumber.cpp | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 missingnumber.cpp diff --git a/missingnumber.cpp b/missingnumber.cpp new file mode 100644 index 0000000..a96738d --- /dev/null +++ b/missingnumber.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + int missingNumber(vector& nums) { + int ans = nums.size(); + int mask = 0; + + for(auto i : nums){ + ans = ans ^ i; + ans = ans ^ mask; + mask++; + } + + return ans; + } +}; From 37481deda5ccb59a8fe5d5d1bb78db7782269cc5 Mon Sep 17 00:00:00 2001 From: mohit parmar <100152343+mohitparmar1@users.noreply.github.com> Date: Tue, 11 Oct 2022 23:45:06 +0530 Subject: [PATCH 088/290] Create SearchInsertPosition.cpp using c++ --- SearchInsertPosition.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 SearchInsertPosition.cpp diff --git a/SearchInsertPosition.cpp b/SearchInsertPosition.cpp new file mode 100644 index 0000000..bdbfb08 --- /dev/null +++ b/SearchInsertPosition.cpp @@ -0,0 +1,18 @@ +class Solution { +public: + int searchInsert(vector& nums, int target) { + int start = 0; + int end = nums.size() - 1; + + while(start <=end){ + int mid = start + (end - start)/2; + + if(nums[mid] < target) + start = mid + 1; + else + end = mid - 1; + + } + return start; + } +}; From 63ad88cb9bdcd5da5d7551f0b8209046fc94c911 Mon Sep 17 00:00:00 2001 From: sarthak2807 <77231223+sarthak2807@users.noreply.github.com> Date: Wed, 12 Oct 2022 11:47:03 +0530 Subject: [PATCH 089/290] Create Merge Intervals please consider it for hactoberfest --- Merge Intervals | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 Merge Intervals diff --git a/Merge Intervals b/Merge Intervals new file mode 100644 index 0000000..f83a0f5 --- /dev/null +++ b/Merge Intervals @@ -0,0 +1,27 @@ +class Solution { +public: + vector> merge(vector>& interval) { + vector> res; + if(interval.size()==0) + { + return res; + } + int n=interval.size(); + sort(interval.begin(),interval.end()); + res.push_back(interval[0]); + int j=0; + for(int i=1;i=interval[i][0]) + { + res[j][1]=max(res[j][1],interval[i][1]); + } + else + { + j++; + res.push_back(interval[i]); + } + } + return res; + } +}; From 8d7dbae59abeaedf6d74a02593a870ad5373b430 Mon Sep 17 00:00:00 2001 From: mohit parmar <100152343+mohitparmar1@users.noreply.github.com> Date: Wed, 12 Oct 2022 11:51:02 +0530 Subject: [PATCH 090/290] Create RemoveDuplicatesfromSortedArray.cpp --- RemoveDuplicatesfromSortedArray.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 RemoveDuplicatesfromSortedArray.cpp diff --git a/RemoveDuplicatesfromSortedArray.cpp b/RemoveDuplicatesfromSortedArray.cpp new file mode 100644 index 0000000..89d91d3 --- /dev/null +++ b/RemoveDuplicatesfromSortedArray.cpp @@ -0,0 +1,13 @@ +class Solution { +public: + int removeDuplicates(vector& nums) { + if(nums.size() == 0) return 0; + int left = 0; + for(int right =1; right< nums.size(); right++){ + if(nums[left] != nums[right]) + left++; + nums[left] = nums[right]; + } + return left+1; + } +}; From 8ad2f2b78da35d44911e328255747ec507fd8992 Mon Sep 17 00:00:00 2001 From: Henin-6024 <100369373+Henin-6024@users.noreply.github.com> Date: Wed, 12 Oct 2022 11:56:26 +0530 Subject: [PATCH 091/290] Create Factorial --- Factorial | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 Factorial diff --git a/Factorial b/Factorial new file mode 100644 index 0000000..f789bbb --- /dev/null +++ b/Factorial @@ -0,0 +1,27 @@ +#include +#include +int fact(int); +int main() +{ + int ans, n; + printf("enter n:"); + scanf("%d",&n); + ans = fact(n); + printf("Factorial of %d is %d", n,ans); + return 0; +} +int fact(int n) +{ + for(int i=0; i<=n; i++) + { + if(n==0 || n==1) + { + return 1; + } + else if(n>1) + { + return(fact(n-1)*n); + } + } +} + From 83a937c57b4200014832a9dba5da7965ebde61e6 Mon Sep 17 00:00:00 2001 From: rahul-gargcoder <96135903+rahul-gargcoder@users.noreply.github.com> Date: Wed, 12 Oct 2022 12:38:42 +0530 Subject: [PATCH 092/290] leetcode questions Leetcode question --- Add two nos.cpp | 53 ++++++++++++++++++++++++++++++++++++ Unique Paths III.cpp | 55 ++++++++++++++++++++++++++++++++++++++ longest cycle in graph.cpp | 48 +++++++++++++++++++++++++++++++++ reverse integers.cpp | 28 +++++++++++++++++++ two sum.cpp | 12 +++++++++ 5 files changed, 196 insertions(+) create mode 100644 Add two nos.cpp create mode 100644 Unique Paths III.cpp create mode 100644 longest cycle in graph.cpp create mode 100644 reverse integers.cpp create mode 100644 two sum.cpp diff --git a/Add two nos.cpp b/Add two nos.cpp new file mode 100644 index 0000000..753d8d3 --- /dev/null +++ b/Add two nos.cpp @@ -0,0 +1,53 @@ +https://leetcode.com/problems/add-two-numbers/ + +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { + ListNode *p=l1; + ListNode *q=l2; + ListNode *newna=new ListNode(); + ListNode *temp=newna; + int c=0; + while(l1!=NULL||l2!=NULL||c!=0){ + int sum=0,dig=0; + if(l1!=NULL){ + sum+=l1->val; + l1=l1->next;} + + if(l2!=NULL){ + sum+=l2->val; + l2=l2->next; + } + if(c!=0) sum+=c; + c=sum/10; + dig=sum%10; + ListNode *newn=new ListNode(dig); + temp->next=newn; + temp=temp->next; + + + } +// if(l1!=NULL){ +// p=l1; + +// } +// if(l2!=NULL){ +// if(c!=0){ +// l2->val=l2->val+1; + +// } +// temp->next=l2; +// } + return newna->next; + } +}; diff --git a/Unique Paths III.cpp b/Unique Paths III.cpp new file mode 100644 index 0000000..96f2bff --- /dev/null +++ b/Unique Paths III.cpp @@ -0,0 +1,55 @@ +#define sz(x) int(x.size()) +vector>grid2; +vector>visited; +int n , m; +int startsi,startsj; +int empty_cnt_l = 0,empty_cnt_g = 0; +bool is_valid(int i , int j) +{ + return i >= 0 && i < n && j >=0 && j < m && grid2[i][j] != -1 && (!visited[i][j]); +} + +int rec2(int r ,int c) +{ + if(!is_valid(r , c)) + return 0; + + + if(grid2[r][c] == 2) + return empty_cnt_l == empty_cnt_g; + + visited[r][c] = 1; + empty_cnt_l++; + int ans = rec2(r , c + 1) + rec2(r , c - 1) + rec2(r + 1 , c) + rec2(r - 1 ,c); + empty_cnt_l-- ,visited[r][c] = 0; + return ans; +} +class Solution { + public: + int uniquePathsIII(vector>& grid){ + n = sz(grid),m=sz(grid[0]); + empty_cnt_l = 0,empty_cnt_g = 0; + grid2.assign(n,vector(m,0)); + + grid2 = grid; + + visited.assign(n,vector(m,0)); + + grid2=grid; + + for(int i = 0 ; i < n;i++) + { + for(int j = 0 ; j < m ;j++) + { + if(grid[i][j] == 1) + startsi =i,startsj = j; + + else if(grid[i][j] == 0) + empty_cnt_g++; + } + } + empty_cnt_g++; + //cout_2d(grid2); + return rec2(startsi, startsj); + } +}; \ No newline at end of file diff --git a/longest cycle in graph.cpp b/longest cycle in graph.cpp new file mode 100644 index 0000000..c493543 --- /dev/null +++ b/longest cycle in graph.cpp @@ -0,0 +1,48 @@ +class Solution { +public: + + int maxLength = -1; + + void getcycle(vector &edges,int si,vector& visit,vector& store){ + if(si == -1)return ; + if(visit[si]){ + int count = -1; + for(int i =0;i& edges) { + + vector visit(edges.size(),0); + + for(int i =0;i store; + getcycle(edges,i,visit,store); + + } + + return maxLength; + + } +}; diff --git a/reverse integers.cpp b/reverse integers.cpp new file mode 100644 index 0000000..e562be4 --- /dev/null +++ b/reverse integers.cpp @@ -0,0 +1,28 @@ +https://leetcode.com/problems/reverse-integer/ +class Solution { +public: + int reverse(int x) { + long long int rev=0; + if(x==0) return 0; + else if(x>0){ + while(x!=0){ + int rem=x%10; + rev=rev*10+rem; + x/=10; + if(rev>INT_MAX||revINT_MAX||rev twoSum(vector& nums, int target) { + map m; + for(int i=0; i Date: Wed, 12 Oct 2022 12:38:42 +0530 Subject: [PATCH 093/290] Create 127. Word_Ladder --- 127. Word_Ladder | 56 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 127. Word_Ladder diff --git a/127. Word_Ladder b/127. Word_Ladder new file mode 100644 index 0000000..0c92228 --- /dev/null +++ b/127. Word_Ladder @@ -0,0 +1,56 @@ +class Solution { +public: + int ladderLength(string beginWord, string endWord, vector& wordList) { + + unordered_map> mp; + unordered_map bank,visited; + vector mywordList; + + mywordList.push_back(beginWord); + bank[beginWord]=true; + for(auto it:wordList){ + bank[it]=true; + mywordList.push_back(it); + } + + for(int i=0;i q; + q.push(beginWord); + visited[beginWord]=true; + int level=2; + + while(!q.empty()) + { + int n=q.size(); + for(int i=0;i Date: Wed, 12 Oct 2022 12:40:33 +0530 Subject: [PATCH 094/290] Create 773. Sliding_Puzzle --- 773. Sliding_Puzzle | 55 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 773. Sliding_Puzzle diff --git a/773. Sliding_Puzzle b/773. Sliding_Puzzle new file mode 100644 index 0000000..c19c3ae --- /dev/null +++ b/773. Sliding_Puzzle @@ -0,0 +1,55 @@ +class Solution { +public: + void swap(char&a,char&b) + { + char c=a; + a=b; + b=c; + } + int slidingPuzzle(vector>& board) { + string expected="123450"; + string cur=""; + vector> swaps={{1,3},{0,2,4},{1,5},{0,4},{1,3,5},{2,4}}; + int z; + + for(int i=0;i<2;i++) + for(int j=0;j<3;j++){ + cur+=board[i][j]+'0'; + if(board[i][j]==0) + z=(i*3)+j; + } + + queue> q; + unordered_map visited; + visited[cur]=true; + q.push({cur,z}); + int level=0; + + while(!q.empty()) + { + int n=q.size(); + for(int i=0;i Date: Wed, 12 Oct 2022 12:41:44 +0530 Subject: [PATCH 095/290] graph graph --- BFS.cpp | 45 +++++++++++++++++++++++ DFS.cpp | 32 +++++++++++++++++ Disjisktra.cpp | 56 +++++++++++++++++++++++++++++ Flood_fill_algo.cpp | 85 ++++++++++++++++++++++++++++++++++++++++++++ check_star_graph.cpp | 53 +++++++++++++++++++++++++++ 5 files changed, 271 insertions(+) create mode 100644 BFS.cpp create mode 100644 DFS.cpp create mode 100644 Disjisktra.cpp create mode 100644 Flood_fill_algo.cpp create mode 100644 check_star_graph.cpp diff --git a/BFS.cpp b/BFS.cpp new file mode 100644 index 0000000..44e22d6 --- /dev/null +++ b/BFS.cpp @@ -0,0 +1,45 @@ +#include +using namespace std; + +void bfs(vector> &graph, int source, vector &vis) +{ + queue q; + q.push(source); + vis[source] = true; + while (!q.empty()) + { + int curr = q.front(); + q.pop(); + cout << curr << " "; + for (int neigh : graph[curr]) + if (!vis[neigh]) + { + q.push(neigh); + vis[neigh] = true; + } + } +} + +int main() +{ + int n, e; + cout << "Enter the Number of Nodes : " << endl; + cin >> n; + cout << "Enter the number of Edges : " << endl; + cin >> e; + vector> graph(n); + vector vis(n, false); + for (int i = 0; i < e; i++) + { + int u, v; + cin >> u >> v; + graph[u].push_back(v); + graph[v].push_back(u); + } + for (int i = 0; i < n; i++) + { + if (!vis[i]) + bfs(graph, i, vis); + } + return 0; +} \ No newline at end of file diff --git a/DFS.cpp b/DFS.cpp new file mode 100644 index 0000000..5d73fd2 --- /dev/null +++ b/DFS.cpp @@ -0,0 +1,32 @@ +#include +using namespace std; + +void dfs(vector> &graph, int source, vector &vis) +{ + cout << source << " "; + vis[source] = true; + for (int neigh : graph[source]) + if (!vis[neigh]) + dfs(graph, neigh, vis); +} + +int main() +{ + int n, e; + cin >> n >> e; + vector> graph(n); + vector vis(n, false); + for (int i = 0; i < e; i++) + { + int u, v; + cin >> u >> v; + graph[u].push_back(v); + graph[v].push_back(u); + } + for (int i = 0; i < n; i++) + { + if (!vis[i]) + dfs(graph, i, vis); + } + return 0; +} \ No newline at end of file diff --git a/Disjisktra.cpp b/Disjisktra.cpp new file mode 100644 index 0000000..ae52f76 --- /dev/null +++ b/Disjisktra.cpp @@ -0,0 +1,56 @@ +#include +using namespace std; + +void dijisktra(vector>> &adj, int source) +{ + int n = adj.size(); + vector vis(n, false); + vector dis(n, INT_MAX); + set> st; + + st.insert({0, source}); + dis[source] = 0; + + while (st.size() > 0) + { + auto node = *st.begin(); + int v = node.second; + int v_dis = node.first; + st.erase(st.begin()); + if (vis[v]) + continue; + vis[v] = true; + for (auto neigh : adj[v]) + { + int neigh_v = neigh.first; + int neigh_wt = neigh.second; + if (dis[v] + neigh_wt < dis[neigh_v]) + { + dis[neigh_v] = dis[v] + neigh_wt; + st.insert({dis[neigh_v], neigh_v}); + } + } + } + for (int i = 0; i < n; i++) + cout << "distance from " << source << " to " << i << " is : - > " << dis[i] << endl; +} +int main() +{ + int n, m; + cout << "Enter Number of Nodes" << endl; + cin >> n; + cout << "Enter number of edges" << endl; + cin >> m; + vector>> adj(n); + for (int i = 0; i < m; i++) + { + int u, v, w; + cin >> u >> v >> w; + adj[u].push_back({v, w}); + } + int source; + cin >> source; + dijisktra(adj, source); + return 0; +} +// 0 1 4 0 7 8 1 2 8 1 7 1 2 3 7 2 8 2 2 5 4 3 4 9 3 5 1 4 5 1 5 6 2 6 7 1 6 8 6 7 8 7 \ No newline at end of file diff --git a/Flood_fill_algo.cpp b/Flood_fill_algo.cpp new file mode 100644 index 0000000..987beae --- /dev/null +++ b/Flood_fill_algo.cpp @@ -0,0 +1,85 @@ +#include +using namespace std; +bool isValid(int screen[][8], int m, int n, int x, int y, int prevC, int newC) +{ + if(x < 0 || x >= m || y < 0 || y >= n || screen[x][y] != prevC + || screen[x][y]== newC) + return false; + return true; +} +void floodFill(int screen[][8], int m, int n, int x, int y, int prevC, int newC) +{ + vector> queue; + pair p(x,y); + queue.push_back(p); + screen[x][y] = newC; + while(queue.size() > 0) + { + pair currPixel = queue[queue.size() - 1]; + queue.pop_back(); + + int posX = currPixel.first; + int posY = currPixel.second; + if(isValid(screen, m, n, posX + 1, posY, prevC, newC)) + { + screen[posX + 1][posY] = newC; + p.first = posX + 1; + p.second = posY; + queue.push_back(p); + } + + if(isValid(screen, m, n, posX-1, posY, prevC, newC)) + { + screen[posX-1][posY]= newC; + p.first = posX-1; + p.second = posY; + queue.push_back(p); + } + + if(isValid(screen, m, n, posX, posY + 1, prevC, newC)) + { + screen[posX][posY + 1]= newC; + p.first = posX; + p.second = posY + 1; + queue.push_back(p); + } + + if(isValid(screen, m, n, posX, posY-1, prevC, newC)) + { + screen[posX][posY-1]= newC; + p.first = posX; + p.second = posY-1; + queue.push_back(p); + } + } +} + +int main() +{ + int screen[][8] ={ + {1, 1, 1, 1, 1, 1, 1, 1}, + {1, 1, 1, 1, 1, 1, 0, 0}, + {1, 0, 0, 1, 1, 0, 1, 1}, + {1, 2, 2, 2, 2, 0, 1, 0}, + {1, 1, 1, 2, 2, 0, 1, 0}, + {1, 1, 1, 2, 2, 2, 2, 0}, + {1, 1, 1, 1, 1, 2, 1, 1}, + {1, 1, 1, 1, 1, 2, 2, 1}}; + int m = 8; + int n = 8; + int x = 4; + int y = 4; + int prevC = screen[x][y]; + int newC = 3; + floodFill(screen, m, n, x, y, prevC, newC); + for(int i = 0; i < m; i++) + { + for(int j = 0; j < n; j++) + { + cout << screen[i][j] << " "; + } + cout << endl; + } + + return 0; +} diff --git a/check_star_graph.cpp b/check_star_graph.cpp new file mode 100644 index 0000000..ffda50a --- /dev/null +++ b/check_star_graph.cpp @@ -0,0 +1,53 @@ +// CPP to find whether given graph is star or not +#include +using namespace std; + +// define the size of incidence matrix +#define size 4 + +// function to find star graph +bool checkStar(int mat[][size]) +{ + // initialize number of vertex + // with deg 1 and n-1 + int vertexD1 = 0, vertexDn_1 = 0; + + // check for S1 + if (size == 1) + return (mat[0][0] == 0); + + // check for S2 + if (size == 2) + return (mat[0][0] == 0 && mat[0][1] == 1 && + mat[1][0] == 1 && mat[1][1] == 0 ); + + // check for Sn (n>2) + for (int i = 0; i < size; i++) + { + int degreeI = 0; + for (int j = 0; j < size; j++) + if (mat[i][j]) + degreeI++; + + if (degreeI == 1) + vertexD1++; + else if (degreeI == size-1) + vertexDn_1++; + } + + return (vertexD1 == (size-1) && + vertexDn_1 == 1); +} + +// driver code +int main() +{ + int mat[size][size] = { {0, 1, 1, 1}, + {1, 0, 0, 0}, + {1, 0, 0, 0}, + {1, 0, 0, 0}}; + + checkStar(mat) ? cout << "Star Graph" : + cout << "Not a Star Graph"; + return 0; +} From 323b9c90ab3593b96894503c0aa23fd8da8fbd68 Mon Sep 17 00:00:00 2001 From: Shivam Garg <70859035+Shivam311201@users.noreply.github.com> Date: Wed, 12 Oct 2022 12:42:26 +0530 Subject: [PATCH 096/290] Create 778. Swim_in_Rising_Water --- 778. Swim_in_Rising_Water | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 778. Swim_in_Rising_Water diff --git a/778. Swim_in_Rising_Water b/778. Swim_in_Rising_Water new file mode 100644 index 0000000..923259e --- /dev/null +++ b/778. Swim_in_Rising_Water @@ -0,0 +1,35 @@ +class Solution { +public: + int swimInWater(vector>& grid) { + + int n=grid.size(),ans=0; + priority_queue,vector>,greater>> q; + unordered_map visited; + vector d={1,0,-1,0,1}; + + q.push({grid[0][0],0,0}); + visited[0]=true; + + while(!q.empty()) + { + auto p=q.top(); + q.pop(); + // ans=max(ans,p[0]); + for(int i=0;i<4;i++) + { + int X=p[1]+d[i]; + int Y=p[2]+d[i+1]; + if(X>=0&&Y>=0&&X Date: Wed, 12 Oct 2022 13:31:32 +0530 Subject: [PATCH 097/290] Create Max Area of Island.cpp --- Max Area of Island.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Max Area of Island.cpp diff --git a/Max Area of Island.cpp b/Max Area of Island.cpp new file mode 100644 index 0000000..d9e6aaa --- /dev/null +++ b/Max Area of Island.cpp @@ -0,0 +1,18 @@ +class Solution { +public: + int maxAreaOfIsland(vector>& grid) { + int ans = 0; + n = grid.size(), m = grid[0].size(); + for (int i = 0; i < n; i++) + for (int j = 0; j < m; j++) + if (grid[i][j]) ans = max(ans, trav(i, j, grid)); + return ans; + } +private: + int n, m; + int trav(int i, int j, vector>& grid) { + if (i < 0 || j < 0 || i >= n || j >= m || !grid[i][j]) return 0; + grid[i][j] = 0; + return 1 + trav(i-1, j, grid) + trav(i, j-1, grid) + trav(i+1, j, grid) + trav(i, j+1, grid); + } +}; From a02da0b85729f2fa93fc8d492c4f83f631dcb9b1 Mon Sep 17 00:00:00 2001 From: Apurwa lohia <74809495+apurwa-lohia@users.noreply.github.com> Date: Wed, 12 Oct 2022 13:36:53 +0530 Subject: [PATCH 098/290] Create Remove Duplicates from Sorted List.cpp --- Remove Duplicates from Sorted List.cpp | 27 ++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 Remove Duplicates from Sorted List.cpp diff --git a/Remove Duplicates from Sorted List.cpp b/Remove Duplicates from Sorted List.cpp new file mode 100644 index 0000000..ca55a1f --- /dev/null +++ b/Remove Duplicates from Sorted List.cpp @@ -0,0 +1,27 @@ +class Solution { +public: + ListNode* deleteDuplicates(ListNode* head) { + + if(head==NULL || head->next==NULL) + return head; + + ListNode* tmp = head; + ListNode* curr = head->next; + + while(curr!=NULL) { + + if(tmp->val == curr->val) { + + curr=curr->next; + } + + else { + tmp->next = curr; + tmp = curr; + curr = tmp->next; + } + } + tmp->next = NULL; + return head; + } +}; From 7e5406e21a3ac635a7b4c62efb210433c1d51953 Mon Sep 17 00:00:00 2001 From: Animesh Date: Wed, 12 Oct 2022 14:04:23 +0530 Subject: [PATCH 099/290] Added FCFS Cpu Scheduling --- FCFS.java | 47 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 FCFS.java diff --git a/FCFS.java b/FCFS.java new file mode 100644 index 0000000..0e0f774 --- /dev/null +++ b/FCFS.java @@ -0,0 +1,47 @@ +import java.text.ParseException; +class FCFS{ + static void findWaitingTime(int processes[], int n, + int bt[], int wt[]) { + wt[0] = 0; + for (int i = 1; i < n; i++) { + wt[i] = bt[i - 1] + wt[i - 1]; + } + } + + static void findTurnAroundTime(int processes[], int n, + int bt[], int wt[], int tat[]) { + for (int i = 0; i < n; i++) { + tat[i] = bt[i] + wt[i]; + } + } + + static void findavgTime(int processes[], int n, int bt[]) { + int wt[] = new int[n], tat[] = new int[n]; + int total_wt = 0, total_tat = 0; + findWaitingTime(processes, n, bt, wt); + findTurnAroundTime(processes, n, bt, wt, tat); + System.out.printf("Processes Burst time Waiting" + +" time Turn around time\n"); + for (int i = 0; i < n; i++) { + total_wt = total_wt + wt[i]; + total_tat = total_tat + tat[i]; + System.out.printf(" %d ", (i + 1)); + System.out.printf(" %d ", bt[i]); + System.out.printf(" %d", wt[i]); + System.out.printf(" %d\n", tat[i]); + } + float s = (float)total_wt /(float) n; + int t = total_tat / n; + System.out.printf("Average waiting time = %f", s); + System.out.printf("\n"); + System.out.printf("Average turn around time = %d ", t); + } + public static void main(String[] args) throws ParseException { + int processes[] = {1, 2, 3}; + int n = processes.length; + int burst_time[] = {9, 10, 6}; + + findavgTime(processes, n, burst_time); + + } +} From 8ac57dabeba3227ec4dfeb41d3cd90800b2c03c0 Mon Sep 17 00:00:00 2001 From: XplosivePotato <75004866+XplosivePotato@users.noreply.github.com> Date: Wed, 12 Oct 2022 17:04:29 +0530 Subject: [PATCH 100/290] Create Sudoku python.py --- Sudoku python.py | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 Sudoku python.py diff --git a/Sudoku python.py b/Sudoku python.py new file mode 100644 index 0000000..a6c4da7 --- /dev/null +++ b/Sudoku python.py @@ -0,0 +1,36 @@ +class Solution(object): + def isValidSudoku(self, board): + """ + :type board: List[List[str]] + :rtype: bool + """ + for i in range(9): + row = {} + column = {} + block = {} + row_cube = 3 * (i//3) + column_cube = 3 * (i%3) + for j in range(9): + if board[i][j]!='.' and board[i][j] in row: + return False + row[board[i][j]] = 1 + if board[j][i]!='.' and board[j][i] in column: + return False + column[board[j][i]] = 1 + rc= row_cube+j//3 + cc = column_cube + j%3 + if board[rc][cc] in block and board[rc][cc]!='.': + return False + block[board[rc][cc]]=1 + return True +ob1 = Solution() +print(ob1.isValidSudoku([ + ["5","3",".",".","7",".",".",".","."], + ["6",".",".","1","9","5",".",".","."], + [".","9","8",".",".",".",".","6","."], + ["8",".",".",".","6",".",".",".","3"], + ["4",".",".","8",".","3",".",".","1"], + ["7",".",".",".","2",".",".",".","6"], + [".","6",".",".",".",".","2","8","."], + [".",".",".","4","1","9",".",".","5"], + [".",".",".",".","8",".",".","7","9"]])) From 6b7eb1bdf9f92e32871c50ff01e4bc5149f8bcf3 Mon Sep 17 00:00:00 2001 From: XplosivePotato <75004866+XplosivePotato@users.noreply.github.com> Date: Wed, 12 Oct 2022 17:07:20 +0530 Subject: [PATCH 101/290] Create N-Queen.py --- N-Queen.py | 91 ++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 91 insertions(+) create mode 100644 N-Queen.py diff --git a/N-Queen.py b/N-Queen.py new file mode 100644 index 0000000..2f37959 --- /dev/null +++ b/N-Queen.py @@ -0,0 +1,91 @@ +# Python program to solve N Queen +# Problem using backtracking + +global N +N = 4 + +def printSolution(board): + for i in range(N): + for j in range(N): + print (board[i][j],end=' ') + print() + + +# A utility function to check if a queen can +# be placed on board[row][col]. Note that this +# function is called when "col" queens are +# already placed in columns from 0 to col -1. +# So we need to check only left side for +# attacking queens +def isSafe(board, row, col): + + # Check this row on left side + for i in range(col): + if board[row][i] == 1: + return False + + # Check upper diagonal on left side + for i, j in zip(range(row, -1, -1), range(col, -1, -1)): + if board[i][j] == 1: + return False + + # Check lower diagonal on left side + for i, j in zip(range(row, N, 1), range(col, -1, -1)): + if board[i][j] == 1: + return False + + return True + +def solveNQUtil(board, col): + # base case: If all queens are placed + # then return true + if col >= N: + return True + + # Consider this column and try placing + # this queen in all rows one by one + for i in range(N): + + if isSafe(board, i, col): + # Place this queen in board[i][col] + board[i][col] = 1 + + # recur to place rest of the queens + if solveNQUtil(board, col + 1) == True: + return True + + # If placing queen in board[i][col + # doesn't lead to a solution, then + # queen from board[i][col] + board[i][col] = 0 + + # if the queen can not be placed in any row in + # this column col then return false + return False + +# This function solves the N Queen problem using +# Backtracking. It mainly uses solveNQUtil() to +# solve the problem. It returns false if queens +# cannot be placed, otherwise return true and +# placement of queens in the form of 1s. +# note that there may be more than one +# solutions, this function prints one of the +# feasible solutions. +def solveNQ(): + board = [ [0, 0, 0, 0], + [0, 0, 0, 0], + [0, 0, 0, 0], + [0, 0, 0, 0] + ] + + if solveNQUtil(board, 0) == False: + print ("Solution does not exist") + return False + + printSolution(board) + return True + +# driver program to test above function +solveNQ() + +# This code is contributed by Xplosive Potato From c3bcc6c14720a3e7c596c53c918a2ae7fa6b854f Mon Sep 17 00:00:00 2001 From: XplosivePotato <75004866+XplosivePotato@users.noreply.github.com> Date: Wed, 12 Oct 2022 17:11:59 +0530 Subject: [PATCH 102/290] Create DFA.py --- DFA.py | 96 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 96 insertions(+) create mode 100644 DFA.py diff --git a/DFA.py b/DFA.py new file mode 100644 index 0000000..79efead --- /dev/null +++ b/DFA.py @@ -0,0 +1,96 @@ + Python3 program to implement DFS that accepts +# all Stringing which follow the language +# L = {a ^ n b ^ m (n)mod 2 = 0, m>= 1 } + +# This function is for the dfa = starting +# dfa = state (zeroth) of DFA +def start(c): + if (c == 'a'): + dfa = 1 + elif (c == 'b'): + dfa = 3 + + # -1 is used to check for any + # invalid symbol + else: + dfa = -1 + return dfa + +# This function is for the first +# dfa = state of DFA +def state1(c): + if (c == 'a'): + dfa = 2 + elif (c == 'b'): + dfa = 4 + else: + dfa = -1 + return dfa + +# This function is for the second +# dfa = state of DFA +def state2(c): + if (c == 'b'): + dfa = 3 + elif (c == 'a'): + dfa = 1 + else: + dfa = -1 + return dfa + +# This function is for the third +# dfa = state of DFA +def state3(c): + if (c == 'b'): + dfa = 3 + elif (c == 'a'): + dfa = 4 + else: + dfa = -1 + return dfa + +# This function is for the fourth +# dfa = state of DFA +def state4(c): + dfa = -1 + return dfa + +def isAccepted(String): + + # store length of Stringing + l = len(String) + + # dfa tells the number associated + # with the present dfa = state + dfa = 0 + for i in range(l): + if (dfa == 0): + dfa = start(String[i]) + + elif (dfa == 1): + dfa = state1(String[i]) + + elif (dfa == 2) : + dfa = state2(String[i]) + + elif (dfa == 3) : + dfa = state3(String[i]) + + elif (dfa == 4) : + dfa = state4(String[i]) + else: + return 0 + if(dfa == 3) : + return 1 + else: + return 0 + +# Driver code +if __name__ == "__main__" : + String = "aaaaaabbbb" + if (isAccepted(String)) : + print("ACCEPTED") + else: + print("NOT ACCEPTED") + +# This code is contributed by XPLOSIVE POTATO. From ed6bc0cb298e5bc68938bc87305219d7adc9b9dd Mon Sep 17 00:00:00 2001 From: Atmagyan Singh <55326048+Black-D3vil007@users.noreply.github.com> Date: Wed, 12 Oct 2022 17:32:25 +0530 Subject: [PATCH 103/290] Create codeql.yml --- .github/workflows/codeql.yml | 74 ++++++++++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 .github/workflows/codeql.yml diff --git a/.github/workflows/codeql.yml b/.github/workflows/codeql.yml new file mode 100644 index 0000000..d46b084 --- /dev/null +++ b/.github/workflows/codeql.yml @@ -0,0 +1,74 @@ +# For most projects, this workflow file will not need changing; you simply need +# to commit it to your repository. +# +# You may wish to alter this file to override the set of languages analyzed, +# or to provide custom queries or build logic. +# +# ******** NOTE ******** +# We have attempted to detect the languages in your repository. Please check +# the `language` matrix defined below to confirm you have the correct set of +# supported CodeQL languages. +# +name: "CodeQL" + +on: + push: + branches: [ "main" ] + pull_request: + # The branches below must be a subset of the branches above + branches: [ "main" ] + schedule: + - cron: '36 9 * * 6' + +jobs: + analyze: + name: Analyze + runs-on: ubuntu-latest + permissions: + actions: read + contents: read + security-events: write + + strategy: + fail-fast: false + matrix: + language: [ 'cpp', 'java', 'python' ] + # CodeQL supports [ 'cpp', 'csharp', 'go', 'java', 'javascript', 'python', 'ruby' ] + # Learn more about CodeQL language support at https://aka.ms/codeql-docs/language-support + + steps: + - name: Checkout repository + uses: actions/checkout@v3 + + # Initializes the CodeQL tools for scanning. + - name: Initialize CodeQL + uses: github/codeql-action/init@v2 + with: + languages: ${{ matrix.language }} + # If you wish to specify custom queries, you can do so here or in a config file. + # By default, queries listed here will override any specified in a config file. + # Prefix the list here with "+" to use these queries and those in the config file. + + # Details on CodeQL's query packs refer to : https://docs.github.com/en/code-security/code-scanning/automatically-scanning-your-code-for-vulnerabilities-and-errors/configuring-code-scanning#using-queries-in-ql-packs + # queries: security-extended,security-and-quality + + + # Autobuild attempts to build any compiled languages (C/C++, C#, or Java). + # If this step fails, then you should remove it and run the build manually (see below) + - name: Autobuild + uses: github/codeql-action/autobuild@v2 + + # ℹ️ Command-line programs to run using the OS shell. + # 📚 See https://docs.github.com/en/actions/using-workflows/workflow-syntax-for-github-actions#jobsjob_idstepsrun + + # If the Autobuild fails above, remove it and uncomment the following three lines. + # modify them (or add more) to build your code if your project, please refer to the EXAMPLE below for guidance. + + # - run: | + # echo "Run, Build Application using script" + # ./location_of_script_within_repo/buildscript.sh + + - name: Perform CodeQL Analysis + uses: github/codeql-action/analyze@v2 + with: + category: "/language:${{matrix.language}}" From cde5fe21fda875bdadf5ff33118c9d25bf472419 Mon Sep 17 00:00:00 2001 From: Atmagyan Singh <55326048+Black-D3vil007@users.noreply.github.com> Date: Wed, 12 Oct 2022 17:37:41 +0530 Subject: [PATCH 104/290] Create greetings.yml --- .github/workflows/greetings.yml | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 .github/workflows/greetings.yml diff --git a/.github/workflows/greetings.yml b/.github/workflows/greetings.yml new file mode 100644 index 0000000..4677434 --- /dev/null +++ b/.github/workflows/greetings.yml @@ -0,0 +1,16 @@ +name: Greetings + +on: [pull_request_target, issues] + +jobs: + greeting: + runs-on: ubuntu-latest + permissions: + issues: write + pull-requests: write + steps: + - uses: actions/first-interaction@v1 + with: + repo-token: ${{ secrets.GITHUB_TOKEN }} + issue-message: "Message that will be displayed on users' first issue" + pr-message: "Message that will be displayed on users' first pull request" From 65361a7c3d354a1dc32b8c7f779deaa0bafe4337 Mon Sep 17 00:00:00 2001 From: Vaibhav Agrawal <89623810+vaibhav23agrawal@users.noreply.github.com> Date: Wed, 12 Oct 2022 18:10:21 +0530 Subject: [PATCH 105/290] 622. Design Circular Queue --- designCircularQueue.cpp | 44 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 designCircularQueue.cpp diff --git a/designCircularQueue.cpp b/designCircularQueue.cpp new file mode 100644 index 0000000..a306dab --- /dev/null +++ b/designCircularQueue.cpp @@ -0,0 +1,44 @@ +struct Node { +public: + int val; + Node* next; + Node(int v, Node* n=nullptr) { + val = v; + next = n; + } +}; +class MyCircularQueue { +public: + MyCircularQueue(int k) { + maxSize = k; + } + bool enQueue(int val) { + if (isFull()) return false; + Node* newNode = new Node(val); + if (isEmpty()) head = newNode, tail = newNode; + else tail->next = newNode, tail = tail->next; + size++; + return true; + } + bool deQueue() { + if (isEmpty()) return false; + head = head->next; + size--; + return true; + } + int Front() { + return isEmpty() ? -1 : head->val; + } + int Rear() { + return isEmpty() ? -1 : tail->val; + } + bool isEmpty() { + return size == 0; + } + bool isFull() { + return size == maxSize; + } +private: + int maxSize, size = 0; + Node *head = new Node(0), *tail = new Node(0); +}; From 95886dac2492b04d924756a856e0132fb009c8e9 Mon Sep 17 00:00:00 2001 From: Ashish Tiwari <80841006+Ashish-100-tiwari@users.noreply.github.com> Date: Wed, 12 Oct 2022 18:11:59 +0530 Subject: [PATCH 106/290] added the solution of Coin_Change_2_DP --- Coin_Change_2_DP.cpp | 45 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 Coin_Change_2_DP.cpp diff --git a/Coin_Change_2_DP.cpp b/Coin_Change_2_DP.cpp new file mode 100644 index 0000000..07b6dcc --- /dev/null +++ b/Coin_Change_2_DP.cpp @@ -0,0 +1,45 @@ +//problem-statement +//You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. +//Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. +//You may assume that you have an infinite number of each kind of coin. +#include + +using namespace std; + +long countWaysToMakeChange(vector& arr, int n, int T){ + + vector> dp(n,vector(T+1,0)); + + + //Initializing base condition + for(int i=0;i<=T;i++){ + if(i%arr[0]==0) + dp[0][i]=1; + // Else condition is automatically fulfilled, + // as dp array is initialized to zero + } + + for(int ind=1; ind arr ={1,2,3}; + int target=4; + + int n =arr.size(); + + cout<<"The total number of ways is " < Date: Wed, 12 Oct 2022 18:13:22 +0530 Subject: [PATCH 107/290] 1680. Concatenation of Consecutive Binary Numbers Leetcode Problem Link: https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/ --- concatenationofConsecutiveBinaryNumbers.cpp | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 concatenationofConsecutiveBinaryNumbers.cpp diff --git a/concatenationofConsecutiveBinaryNumbers.cpp b/concatenationofConsecutiveBinaryNumbers.cpp new file mode 100644 index 0000000..cf03d5d --- /dev/null +++ b/concatenationofConsecutiveBinaryNumbers.cpp @@ -0,0 +1,12 @@ +class Solution { +public: + int concatenatedBinary(int n) { + long ans = 0, mod = 1e9+7; + for (int i = 1; i <= n; ++i) { + int len = 0; + for (int j = i; j; j >>= 1, ++len); + ans = ((ans << len) % mod + i) % mod; + } + return ans; + } +}; From 8f855ceef3b619f966b579a6ba2db574c601077c Mon Sep 17 00:00:00 2001 From: Ashish Tiwari <80841006+Ashish-100-tiwari@users.noreply.github.com> Date: Wed, 12 Oct 2022 18:17:16 +0530 Subject: [PATCH 108/290] add the solution max XOR of two Numbers in Array --- trie_Maximum_XOR.cpp | 73 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 73 insertions(+) create mode 100644 trie_Maximum_XOR.cpp diff --git a/trie_Maximum_XOR.cpp b/trie_Maximum_XOR.cpp new file mode 100644 index 0000000..fed2165 --- /dev/null +++ b/trie_Maximum_XOR.cpp @@ -0,0 +1,73 @@ +//Problem Statement: You are given two arrays of non-negative integers say ‘arr1’ and ‘arr2’ of sizes N and M respectively. +//Find the maximum value of ( ‘A’ xor ‘B’ ) where ‘A’ and ‘B’ are any elements from ‘arr1’ and ‘arr2’ respectively and ‘xor’ represents the bitwise xor operation. +//Maximum XOR of Two Numbers in an Array. +#include +#include +using namespace std; + +struct Node { + Node * links[2]; + + bool containsKey(int ind) { + return (links[ind] != NULL); + } + Node * get(int ind) { + return links[ind]; + } + void put(int ind, Node * node) { + links[ind] = node; + } +}; +class Trie { + private: Node * root; + public: + Trie() { + root = new Node(); + } + + public: + void insert(int num) { + Node * node = root; + // cout << num << endl; + for (int i = 31; i >= 0; i--) { + int bit = (num >> i) & 1; + if (!node -> containsKey(bit)) { + node -> put(bit, new Node()); + } + node = node -> get(bit); + } + } + public: + int findMax(int num) { + Node * node = root; + int maxNum = 0; + for (int i = 31; i >= 0; i--) { + int bit = (num >> i) & 1; + if (node -> containsKey(!bit)) { + maxNum = maxNum | (1 << i); + node = node -> get(!bit); + } else { + node = node -> get(bit); + } + } + return maxNum; + } +}; +int maxXOR(int n, int m, vector < int > & arr1, vector < int > & arr2) { + Trie trie; + for (int i = 0; i < n; i++) { + trie.insert(arr1[i]); + } + int maxi = 0; + for (int i = 0; i < m; i++) { + maxi = max(maxi, trie.findMax(arr2[i])); + } + return maxi; +} +int main() { + vector < int > arr1 = {6, 8}; + vector < int > arr2 = {7, 8, 2}; + int n = 2, m = 3; + cout << maxXOR(n, m, arr1, arr2) << endl; + return 0; +} From 0569cc00e61a9fcaeffae76b70ba816162f047fd Mon Sep 17 00:00:00 2001 From: Ashish Tiwari <80841006+Ashish-100-tiwari@users.noreply.github.com> Date: Wed, 12 Oct 2022 18:25:57 +0530 Subject: [PATCH 109/290] Create Power_Set_trie.cpp --- Power_Set_trie.cpp | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Power_Set_trie.cpp diff --git a/Power_Set_trie.cpp b/Power_Set_trie.cpp new file mode 100644 index 0000000..ce93038 --- /dev/null +++ b/Power_Set_trie.cpp @@ -0,0 +1,29 @@ +//Problem Statement: Given a string, find all the possible subsequences of the string. + +//Examples: + +//Example 1: +//Input: str = "abc" +//Output: a ab abc ac b bc c +//Explanation: Printing all the 7 subsequence for the string "abc". + +#include +using namespace std; +void solve(int i, string s, string &f) { + if (i == s.length()) { + cout << f << " "; + return; + } + //picking + f = f + s[i]; + solve(i + 1, s, f); + //poping out while backtracking + f.pop_back(); + solve(i + 1, s, f); +} +int main() { + string s = "abc"; + string f = ""; + cout<<"All possible subsequences are: "< Date: Wed, 12 Oct 2022 20:39:06 +0530 Subject: [PATCH 110/290] Remove Duplicates From Subarray ll has bee updated --- Remove duplicates for subarray ll.java | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 Remove duplicates for subarray ll.java diff --git a/Remove duplicates for subarray ll.java b/Remove duplicates for subarray ll.java new file mode 100644 index 0000000..1ada765 --- /dev/null +++ b/Remove duplicates for subarray ll.java @@ -0,0 +1,20 @@ +class Solution { + public int removeDuplicates(int[] nums) extends Exception { + if(nums.length==0){ + return 0; + } + int x=1,index=0; + for(int i=0;i Date: Wed, 12 Oct 2022 20:45:34 +0530 Subject: [PATCH 111/290] Add files via upload --- linked_list_ circular.cpp | 167 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 167 insertions(+) create mode 100644 linked_list_ circular.cpp diff --git a/linked_list_ circular.cpp b/linked_list_ circular.cpp new file mode 100644 index 0000000..ddc60f9 --- /dev/null +++ b/linked_list_ circular.cpp @@ -0,0 +1,167 @@ +#include +#include +using namespace std; + +class Node { + public: + int data; + Node* next; + + + Node(int d) { + this->data = d; + this->next = NULL; + } + + ~Node() { + int value = this->data; + if(this->next != NULL) { + delete next; + next = NULL; + } + cout << " memory is free for node with data " << value << endl; + } + +}; + +void insertNode(Node* &tail, int element, int d) { + + + + if(tail == NULL) { + Node* newNode = new Node(d); + tail = newNode; + newNode -> next = newNode; + } + else{ + + + Node* curr = tail; + + while(curr->data != element) { + curr = curr -> next; + } + + + Node* temp = new Node(d); + temp -> next = curr -> next; + curr -> next = temp; + + } + +} + +void print(Node* tail) { + + Node* temp = tail; + + + if(tail == NULL) { + cout << "List is Empty "<< endl; + return ; + } + + do { + cout << tail -> data << " "; + tail = tail -> next; + } while(tail != temp); + + cout << endl; +} + +void deleteNode(Node* &tail, int value) { + + + if(tail == NULL) { + cout << " List is empty, please check again" << endl; + return; + } + else{ + + Node* prev = tail; + Node* curr = prev -> next; + + while(curr -> data != value) { + prev = curr; + curr = curr -> next; + } + + prev -> next = curr -> next; + + + if(curr == prev) { + tail = NULL; + } + + + else if(tail == curr ) { + tail = prev; + } + + curr -> next = NULL; + delete curr; + + } + +} + +bool isCircularList(Node* head) { + + if(head == NULL) { + return true; + } + + Node* temp = head -> next; + while(temp != NULL && temp != head ) { + temp = temp -> next; + } + + if(temp == head ) { + return true; + } + + return false; + +} + +bool detectLoop(Node* head) { + + if(head == NULL) + return false; + + map visited; + + Node* temp = head; + + while(temp !=NULL) { + + + if(visited[temp] == true) { + return true; + } + + visited[temp] = true; + temp = temp -> next; + + } + return false; + +} + + +int main() { + + Node* tail = NULL; + + + + if(isCircularList(tail)) { + cout << " Linked List is Circular in nature" << endl; + } + else{ + cout << "Linked List is not Circular " << endl; + } + + return 0; +} + From cc7e201c796ea29ac5487f2aafa641f13546eb70 Mon Sep 17 00:00:00 2001 From: alifiyakapasi07 <103169791+alifiyakapasi07@users.noreply.github.com> Date: Wed, 12 Oct 2022 21:13:09 +0530 Subject: [PATCH 112/290] Added Create Grading Students problem --- Create Grading Students problem.py | 46 ++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 Create Grading Students problem.py diff --git a/Create Grading Students problem.py b/Create Grading Students problem.py new file mode 100644 index 0000000..5f23bbf --- /dev/null +++ b/Create Grading Students problem.py @@ -0,0 +1,46 @@ +#!/bin/python3 + +import math +import os +import random +import re +import sys + +def gradingStudents(grades): + + for i in range(0,len(grades)): + + if grades[i] < 38: #grade is less than 38 , no rounding occurs as the result will still be a failing grade + continue + else: + temp = grades[i] + te = temp % 5 #If the difference between grade and the next multiple of 5 is less than 3 , round up to the next multiple of 5 + if te == 3: + temp = temp + 2 + grades[i] = temp + elif te == 4: + temp = temp + 1 + grades[i] = temp + else: + continue + return grades + + + +if __name__ == '__main__': + fptr = open(os.environ['OUTPUT_PATH'], 'w') + + grades_count = int(input().strip()) + + grades = [] + + for _ in range(grades_count): + grades_item = int(input().strip()) + grades.append(grades_item) + + result = gradingStudents(grades) + + fptr.write('\n'.join(map(str, result))) + fptr.write('\n') + + fptr.close() \ No newline at end of file From d6f6926bcaa37d346b5d1dc953022fa66f0bf498 Mon Sep 17 00:00:00 2001 From: Pratik Suryawanshi <88839654+Pratik29121@users.noreply.github.com> Date: Wed, 12 Oct 2022 21:57:12 +0530 Subject: [PATCH 113/290] Balanced_Paranthesis.cpp --- Balanced Paranthesis.cpp | 51 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 Balanced Paranthesis.cpp diff --git a/Balanced Paranthesis.cpp b/Balanced Paranthesis.cpp new file mode 100644 index 0000000..fc62289 --- /dev/null +++ b/Balanced Paranthesis.cpp @@ -0,0 +1,51 @@ +#include +using namespace std; + +unordered_mapsymbol={ {'[',-1},{'(',-2},{'{',-3},{']',1},{')',2},{'}',3}}; +void solve() +{ + string s; + cin >> s; + stackst; + for(auto bracket : s) + { + if(symbol[bracket]<0) + { + st.push(bracket); + } + else + { + if(st.empty()) + { + cout << "NO\n"; + return; + } + char top=st.top(); + st.pop(); + if(symbol[top]+symbol[bracket]!=0) + { + cout << "NO\n"; + return; + } + } + } + if(st.empty()) + { + cout << "YES\n"; + return; + } + cout << "NO\n"; + return; + +} + +int main() +{ + int t; + cin >> t; + while(t--) + { + solve(); + } +} + From 513b63620d5289a8c93c9adc8e5243fd3ca15da0 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:16:33 +0530 Subject: [PATCH 114/290] Add files via upload --- count_dispaly.c | 67 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) create mode 100644 count_dispaly.c diff --git a/count_dispaly.c b/count_dispaly.c new file mode 100644 index 0000000..292837a --- /dev/null +++ b/count_dispaly.c @@ -0,0 +1,67 @@ +// Count and Sum Linked List +#include +#include +struct Node +{ + int data; + struct Node *next; +} *first = NULL; +void create(int A[], int n) +{ + int i; + struct Node *t, *last; + first = (struct Node *)malloc(sizeof(struct Node)); + first->data = A[0]; + first->next = NULL; + last = first; + for (i = 1; i < n; i++) + { + t = (struct Node *)malloc(sizeof(struct Node)); + t->data = A[i]; + t->next = NULL; + last->next = t; + last = t; + } +} +int count(struct Node *p) +{ + int l = 0; + while (p) + { + l++; + p = p->next; + } + return l; +} +int Rcount(struct Node *p) +{ + if (p != NULL) + return Rcount(p->next) + 1; + else + return 0; +} +int sum(struct Node *p) +{ + int s = 0; + while (p != NULL) + { + s += p->data; + p = p->next; + } + return s; +} +int Rsum(struct Node *p) +{ + if (p == NULL) + return 0; + else + return Rsum(p->next) + p->data; +} +int main() +{ + int A[] = {3, 5, 7, 10, 25, 8, 32, 2}; + create(A, 8); + printf("Count %d\n", count(first)); + printf("Sum %d\n", sum(first)); + return 0; +} \ No newline at end of file From 66b96f1d9a232cc575387c09aff791151eb6b815 Mon Sep 17 00:00:00 2001 From: Suryansh Prajapati Date: Wed, 12 Oct 2022 23:18:45 +0530 Subject: [PATCH 115/290] Matrix Diagonal Sum question add --- Matrix_Diagonal_Sum.java | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 Matrix_Diagonal_Sum.java diff --git a/Matrix_Diagonal_Sum.java b/Matrix_Diagonal_Sum.java new file mode 100644 index 0000000..d2cf174 --- /dev/null +++ b/Matrix_Diagonal_Sum.java @@ -0,0 +1,21 @@ +// Leetcode- 1572. Matrix Diagonal Sum +// https://leetcode.com/problems/matrix-diagonal-sum/ + + +class Solution { + public int diagonalSum(int[][] mat) { + int sum =0; + int j=0; + for(int i=0;i Date: Wed, 12 Oct 2022 23:20:30 +0530 Subject: [PATCH 116/290] Add files via upload --- circular_delete.c | 137 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 137 insertions(+) create mode 100644 circular_delete.c diff --git a/circular_delete.c b/circular_delete.c new file mode 100644 index 0000000..2a232f6 --- /dev/null +++ b/circular_delete.c @@ -0,0 +1,137 @@ +// Circular Linked List +#include +#include +struct Node +{ + int data; + struct Node *next; +} * Head; +void create(int A[], int n) +{ + int i; + struct Node *t, *last; + Head = (struct Node *)malloc(sizeof(struct Node)); + Head->data = A[0]; + Head->next = Head; + last = Head; + + for (i = 1; i < n; i++) + { + t = (struct Node *)malloc(sizeof(struct Node)); + t->data = A[i]; + t->next = last->next; + last->next = t; + last = t; + } +} +void Display(struct Node *h) +{ + do + { + printf("%d ", h->data); + h = h->next; + } while (h != Head); + printf("\n"); +} +void RDisplay(struct Node *h) +{ + static int flag = 0; + if (h != Head || flag == 0) + { + flag = 1; + printf("%d ", h->data); + RDisplay(h->next); + } + flag = 0; +} +int Length(struct Node *p) +{ + int len = 0; + do + { + len++; + p = p->next; + + } while (p != Head); + return len; +} +void Insert(struct Node *p, int index, int x) +{ + struct Node *t; + int i; + if (index < 0 || index > Length(p)) + return; + + if (index == 0) + { + t = (struct Node *)malloc(sizeof(struct Node)); + t->data = x; + if (Head == NULL) + { + Head = t; + Head->next = Head; + } + else + { + while (p->next != Head) + p = p->next; + p->next = t; + t->next = Head; + Head = t; + } + } + else + { + for (i = 0; i < index - 1; i++) + p = p->next; + t = (struct Node *)malloc(sizeof(struct Node)); + t->data = x; + t->next = p->next; + p->next = t; + } +} +int Delete(struct Node *p, int index) +{ + struct Node *q; + int i, x; + + if (index < 0 || index > Length(Head)) + return -1; + if (index == 1) + { + while (p->next != Head) + p = p->next; + x = Head->data; + if (Head == p) + { + free(Head); + Head = NULL; + } + else + { + p->next = Head->next; + free(Head); + Head = p->next; + } + } + else + { + for (i = 0; i < index - 2; i++) + p = p->next; + q = p->next; + p->next = q->next; + x = q->data; + free(q); + } + return x; +} +int main() +{ + int A[] = {2, 3, 4, 5, 6}; + create(A, 5); + + Delete(Head, 8); + + RDisplay(Head); + return 0; +} \ No newline at end of file From 2b75b25d88153b6e11a9a4e5ae32a2500a2d4dca Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:22:34 +0530 Subject: [PATCH 117/290] Add files via upload --- bst.c | 243 +++++++++++++++++++++++++++++++++++++++++++++++++++ bst_linked.c | 131 +++++++++++++++++++++++++++ 2 files changed, 374 insertions(+) create mode 100644 bst.c create mode 100644 bst_linked.c diff --git a/bst.c b/bst.c new file mode 100644 index 0000000..bcb7216 --- /dev/null +++ b/bst.c @@ -0,0 +1,243 @@ +// BST +#include +#include + +typedef struct tree +{ + struct tree *lchild; + int info; + struct tree *rchild; + +} tree; + +void create(tree **r, int n) +{ + + tree *p; + + if ((*r) == NULL) + { + p = (tree *)malloc(sizeof(tree)); + p->lchild = p->rchild = NULL; + p->info = n; + *r = p; // imprtant step + return; + } + else if ((*r)->info > n && (*r)->info != n) + create(&(*r)->lchild, n); + + else if ((*r)->info < n && (*r)->info != n) + create(&(*r)->rchild, n); + + else + { + printf("duplicate element entered \n"); + return; + } +} + +void inorder(tree *r) +{ + if (r == NULL) + return; + + inorder(r->lchild); + printf("%d ", r->info); + inorder(r->rchild); +} + +void preorder(tree *r) +{ + if (r == NULL) + return; + + printf("%d ", r->info); + preorder(r->lchild); + preorder(r->rchild); +} + +void postorder(tree *r) +{ + if (r == NULL) + return; + + postorder(r->lchild); + postorder(r->rchild); + printf("%d ", r->info); +} + +void delete (tree **r, int key) +{ + tree *p, *j = (*r); + + while (j != NULL) + { + if (key == j->info) + break; + + p = j; + + if (key < j->info) + { + j = j->lchild; + } + + else if (key > j->info) + j = j->rchild; + + else + { + printf("not found"); + return; + } + } + if ((j->lchild == NULL && j->rchild == NULL) && ((*r)->lchild != NULL || (*r)->rchild != NULL)) + { + printf("deleted element is leaf node \n"); + + if (p->info > key) + p->lchild = NULL; + else + p->rchild = NULL; + + free(j); + } + else if ((*r)->lchild == NULL && (*r)->rchild == NULL) + { + printf("only root element\n"); + free(j); + } + else if (j->lchild!=NULL || j->rchild!=NULL) + { + + } +} + +tree* search(tree *r, int key) +{ + while (r != NULL) + { + if (key == r->info) + return r; + + + if (key < r->info) + { + r = r->lchild; + } + + else if (key > r->info) + r = r->rchild; + + else + { + printf("not found"); + return NULL; + } + } + + return r; +} +int inorderpre(tree *r) +{ + r=r->lchild; + tree *p; + while (r != NULL) + { + p = r; + r = r->rchild; + } + + return p->info; +} + +int inordersucc(tree *r) +{ + r=r->rchild; + tree *p; + while (r != NULL) + { + p = r; + r = r->lchild; + } + + return p->info; +} + +int height(tree *r) +{ + tree *p = r; + int h1 = -1, h2 = -1 ; + + while (r != NULL) + { + r = r->lchild; + h1++; + } + + while (p != NULL) + { + p = p->rchild; + h2++; + } + + if (h1 >= h2) + return h1; + + else + return h2; +} + +int main() +{ + tree *root = NULL; + int n, ch, key; + + do + { + printf("\n1)Insert \n2)inorder \n3)preorder \n4)postorder \n5)delete \n6)height \n7)inorder succ \n8)inorder pred \n"); + printf("enter your choice : "); + scanf("%d", &ch); + + if (ch == 1) + { + printf("enter the digit to insert : "); + scanf("%d", &n); + create(&root, n); + } + + if (ch == 2) + { + inorder(root); + printf("\n"); + } + + if (ch == 3) + preorder(root); + + if (ch == 4) + postorder(root); + + if (ch == 5) + { + printf("enter element to delete : "); + scanf("%d", &key); + delete (&root, key); + } + if (ch == 6) + printf("height of tree is : %d\n",height(root)); + + if(ch==7) + { + printf("Enter element of which you want to find inoder pred: "); + scanf("%d",&key); + + printf("inorder pred is : %d\n",inorderpre(search(root,key))); + } + if(ch==8) + break; + + } while (1); + + return 0; +} \ No newline at end of file diff --git a/bst_linked.c b/bst_linked.c new file mode 100644 index 0000000..9a82977 --- /dev/null +++ b/bst_linked.c @@ -0,0 +1,131 @@ +#include +#include + +typedef struct tree +{ + struct tree *lchild; + int info; + struct tree *rchild; +} tree; + +void create(tree **r, int n) +{ + tree *p=(*r),*j; + if (*r == NULL) + { + p = (tree *)malloc(sizeof(tree)); + p->lchild = p->rchild = NULL; + p->info=n; + *r = p; + return; + } + while (p != NULL) + { + j = p; + + if (p->info>n) + p = p->lchild; + + else if (n > p->info) + p = p->rchild; + + else + { + printf("DUplicate element \n"); + return; + } + } + + if (p == NULL) + { + p = (tree *)malloc(sizeof(tree)); + p->lchild = p->rchild = NULL; + p->info=n; + + if(j->info>n) + { + j->lchild=p; + return; + } + else + { + j->rchild=p; + return; + } + } +} + +void inorder(tree *r) +{ + if (r == NULL) + return; + + inorder(r->lchild); + printf("%d ", r->info); + inorder(r->rchild); +} + +void preorder(tree *r) +{ + if (r == NULL) + return; + + printf("%d ", r->info); + preorder(r->lchild); + preorder(r->rchild); +} + +void postorder(tree *r) +{ + if (r == NULL) + return; + + postorder(r->lchild); + postorder(r->rchild); + printf("%d ", r->info); + +} + +int main() +{ + tree *root = NULL; + int n, ch, key; + + do + { + printf("\n1)Insert \n2)inorder \n3)preorder \n4)postorder \n5)delete \n6)exit \n"); + printf("enter your choice : "); + scanf("%d", &ch); + + if (ch == 1) + { + printf("enter the digit to insert : "); + scanf("%d", &n); + create(&root, n); + } + + if (ch == 2) + { + inorder(root); + printf("\n"); + } + + if (ch == 3) + preorder(root); + + if (ch == 4) + postorder(root); + + if (ch == 5) + { + printf("enter element to delete : "); + scanf("%d", &key); + // delete (&root, key); + } + if (ch == 6) + break; + + } while (1); + + return 0; +} \ No newline at end of file From 8f3034a1136ce96bfadfe319b7307a5292212dd3 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:27:10 +0530 Subject: [PATCH 118/290] Add files via upload --- tree.c | 187 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 187 insertions(+) create mode 100644 tree.c diff --git a/tree.c b/tree.c new file mode 100644 index 0000000..acb8458 --- /dev/null +++ b/tree.c @@ -0,0 +1,187 @@ +/*BINARY SEARCH TREE(BST) +Operations: +Insertion in BST +Displaying in inorder, postorder and preorder +Counting nodes +Deletion of node */ +#include +#include +typedef struct node +{ + struct node *left; + int info; + struct node *right; +}treetype; +void insert(treetype **root, int data) +{ + if (*root == NULL) + { + treetype *newnode = (treetype *)malloc(sizeof(treetype)); + if (newnode == NULL) + printf("Memory not allocated\n"); + else + { + newnode->left = NULL; + newnode->info = data; + newnode->right = NULL; + } + *root = newnode; + return; + } + if (data < (*root)->info) + insert(&(*root)->left, data); + else + insert(&(*root)->right, data); +} +void inorder_display(treetype *root) +{ + if (root == NULL) + return; + inorder_display(root->left); + printf("%d ", root->info); + inorder_display(root->right); +} +void preorder_display(treetype *root) +{ + if (root == NULL) + return; + printf("%d ", root->info); + preorder_display(root->left); + preorder_display(root->right); +} +void postorder_display(treetype *root) +{ + if (root == NULL) + return; + postorder_display(root->left); + postorder_display(root->right); + printf("%d ", root->info); +} +void fullcount(treetype *root, int *p) +{ + if (root == NULL) + return; + else + { + if (root) + *p = *p + 1; + fullcount(root->left, p); + fullcount(root->right, p); + } +} +void parentcount(treetype *root, int *p) +{ + if (root == NULL) + return; + else + { + if (root->left && root->right) + *p = *p + 1; + parentcount(root->left, p); + parentcount(root->right, p); + } +} +void leafcount(treetype *root, int *p) +{ + if (root == NULL) + return; + else + { + if (root->left == NULL && root->right == NULL) + *p = *p + 1; + leafcount(root->left, p); + leafcount(root->right, p); + } +} + +treetype *inordersuccessor(treetype *p) +{ + treetype *temp = p; + while (temp && temp->left != NULL) + temp = temp->left; + return temp; +} +void delete (treetype **root, int key) +{ + if (*root == NULL) + return; + else if (key < (*root)->info) + delete (&(*root)->left, key); + else if (key > (*root)->info) + delete (&(*root)->right, key); + else + { + if ((*root)->left == NULL && (*root)->right == NULL) + { + free(*root); + *root = NULL; + } + else if ((*root)->left == NULL) + { + treetype *temp = *root; + *root = (*root)->right; + free(temp); + } + else if ((*root)->right == NULL) + { + treetype *temp = *root; + *root = (*root)->left; + free(temp); + } + else + { + treetype *temp = inordersuccessor((*root)->right); + (*root)->info = temp->info; + delete (&(*root)->right, temp->info); + } + } +} +int main() +{ + treetype *root = NULL; + int data, ch, c = 0, c1 = 0, c2 = 0, key; + do + { + printf("Enter 1 for insert 2 for display 3 for node count 4 for deletion and 5 for exit: "); + scanf("%d", &ch); + switch (ch) + { + case 1: + printf("Enter data to insert in binary search tree: "); + scanf("%d", &data); + insert(&root, data); + break; + case 2: + preorder_display(root); + printf("\n"); + inorder_display(root); + printf("\n"); + postorder_display(root); + printf("\n"); + break; + case 3: + fullcount(root, &c); + printf("Number of nodes are: %d\n", c); + parentcount(root, &c1); + printf("Number of parent nodes are: %d\n", c1); + leafcount(root, &c2); + printf("Number of leaf nodes are: %d\n", c2); + break; + case 4: + if (root == NULL) + printf("Nothing to delete\n"); + else + { + printf("Enter the value you want to delete:"); + scanf("%d", &key); + delete (&root, key); + } + break; + case 5: + exit(0); + break; + } + } while (1); + + return 0; +} From bb09e6bf6bdf5313f47b70ea1590d97162229fdc Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:28:17 +0530 Subject: [PATCH 119/290] Add files via upload --- diagonal_matrix.c | 47 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 diagonal_matrix.c diff --git a/diagonal_matrix.c b/diagonal_matrix.c new file mode 100644 index 0000000..53e13d0 --- /dev/null +++ b/diagonal_matrix.c @@ -0,0 +1,47 @@ +#include +struct Matrix +{ + int A[10]; + int n; +}; +void Set(struct Matrix *m, int i, int j, int x) +{ + if (i == j) + m->A[i - 1] = x; +} +int Get(struct Matrix m, int i, int j) +{ + if (i == j) + return m.A[i - 1]; + else + return 0; +} +void Display(struct Matrix m) +{ + int i, j; + for (i = 0; i < m.n; i++) + { + for (j = 0; j < m.n; j++) + { + if (i == j) + printf("%d ", m.A[i]); + else + printf("0 "); + } + printf("\n"); + } +} +int main() +{ + struct Matrix m; + m.n = 4; + + Set(&m, 1, 1, 5); + Set(&m, 2, 2, 8); + Set(&m, 3, 3, 9); + Set(&m, + 4, 4, 12); + printf("%d \n", Get(m, 2, 2)); + Display(m); + return 0; +} \ No newline at end of file From 2269f6f6ad4ad0e8b837795da444aa65e438492d Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:28:48 +0530 Subject: [PATCH 120/290] Add files via upload --- sparse_create.c | 93 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 93 insertions(+) create mode 100644 sparse_create.c diff --git a/sparse_create.c b/sparse_create.c new file mode 100644 index 0000000..de3ce4d --- /dev/null +++ b/sparse_create.c @@ -0,0 +1,93 @@ +#include +#include +struct Element +{ + int i; + int j; + int x; +}; +struct Sparse +{ + int m; + int n; + int num; + struct Element *ele; +}; +void create(struct Sparse *s) +{ + int i; + printf("Eneter Dimensions"); + scanf("%d%d", &s->m, &s->n); + printf("Number of non-zero"); + scanf("%d", &s->num); + s->ele = (struct Element *)malloc(s->num * sizeof(struct Element)); + printf("Eneter non-zero Elements"); + for (i = 0; i < s->num; i++) + scanf("%d%d%d", &s->ele[i].i, &s->ele[i].j, &s->ele[i].x); +} +void display(struct Sparse s) +{ + int i, j, k = 0; + for (i = 0; i < s.m; i++) + { + for (j = 0; j < s.n; j++) + { + if (i == s.ele[k].i && j == s.ele[k].j) + printf("%d ", s.ele[k++].x); + else + printf("0 "); + } + printf("\n"); + } +} +struct Sparse *add(struct Sparse *s1, struct Sparse *s2) +{ + struct Sparse *sum; + int i, j, k; + i = j = k = 0; + if (s1->n != s2->n && s1->m != s2->m) + return NULL; + sum = (struct Sparse *)malloc(sizeof(struct Sparse)); + sum->ele = (struct Element *)malloc((s1->num + s2->num) * sizeof(struct Element)); + while (i < s1->num && j < s2->num) + { + if (s1->ele[i].i < s2->ele[j].i) + sum->ele[k++] = s1->ele[i++]; + else if (s1->ele[i].i > s2->ele[j].i) + sum->ele[k++] = s2->ele[j++]; + else + { + if (s1->ele[i].j < s2->ele[j].j) + sum->ele[k++] = s1->ele[i++]; + else if (s1->ele[i].j > s2->ele[j].j) + sum->ele[k++] = s2->ele[j++]; + else + { + sum->ele[k] = s1->ele[i]; + sum->ele[k++].x = s1->ele[i++].x + s2->ele[j++].x; + } + } + } + for (; i < s1->num; i++) + sum->ele[k++] = s1->ele[i]; + for (; j < s2->num; j++) + sum->ele[k++] = s2->ele[j]; + sum->m = s1->m; + sum->n = s1->n; + sum->num = k; + return sum; +} +int main() +{ + struct Sparse s1, s2, *s3; + create(&s1); + create(&s2); + s3 = add(&s1, &s2); + printf("First Matrix\n"); + display(s1); + printf("Second Matrix\n"); + display(s2); + printf("Sum Matrix\n"); + display(*s3); + return 0; +} \ No newline at end of file From d54eb246e643bb51eff02f7fb62708288d16b626 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:29:08 +0530 Subject: [PATCH 121/290] Add files via upload --- sparse_add.exe | Bin 0 -> 57161 bytes 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 sparse_add.exe diff --git a/sparse_add.exe b/sparse_add.exe new file mode 100644 index 0000000000000000000000000000000000000000..13c4fcdfa3a16b6a37aeb3e32a2d15e298b09b5d GIT binary patch literal 57161 zcmeIb3w&F}l|MeREk{nANO?E}NI(P!9GWv z4y4r7F`yN0T}r#{mUcs-EZxoSKi#D?ux!^MK+;0n6ey+d&{9@uC{0zbhW#id&C(}^*MX`oSw#JXK#N;q;mG` zndOpn(92lI?RHij_}37NGxik-a*AEbW)&1%z%BvOW}Gt_JH7y+g9^FmPs9s^+?2F3 zB{RQ^ti4^fn&pYg%KC@#wu%@S_s-rfBSF}|IIja4i|HcRVJgHuY=$Ra1x$} z68b@St7=3#NWmCR!mGoXb3lKaS5als%ych>* ze?(79OcFV4zYtpLth8Uamt**bUaRnBtWN=0{oD}}lp*;vl3L;$xrw`S6aBRyb=&&- z>yq11D1@wZ+5P>DW!Ugoa_ys3mF)bb_`4l{zD(IT@H6w$j_l6aoXyW5?$CNm^1A9V z-_Vm4kc~Y`5@dgR5o0I6VZYGDd|}^4pXKOn>uKOfeb)Xp-=fajem~2S+(1D=>W-m< zdr@MJ{q~#3$Hy~wo<^ejx#4fvKlQ|kZa{n^v(I&aViEo%m!W|q(6=JflNro%eDClW z6}TKQvwqg2ZYf9}7_ojEE#n(0`wkCgA48B~Y3oBgX}ynvw5Qw&d@Jxh8C!N4Dl&?? ztw-Gk!HT(C-7T%xY-{%2_S$EN_1L3O1!%UQSo-__>H7y?X44{G*zQFwh98F#Bfd=0 zGHQNbW=Q}ltNyhw6SD;}%kCe9n&$d8JZ;}w1H4DGgbfl zZ3QorDIPj)vF{~=%oL-(dv8MQi1lPIH&4KLHud-6U)%RqBSbwu?52Q$QnJ)rJ@y!& ztoj?{$Ffh(C8=l6J_plC*?h=>=G{lg>4L0nASyEsaj9nx^<*>y!uChkrhwbsJv)TU#9fJ z>|X=bHxje>(!b3fM%f2Y1c$S^^9RUdgiVJ3SIgIK2QVoE)i znw7mB%re%+NcwJjlI-mI4=OjfcermjZ2y|4yzPV)hA#96^C$t=f3pw)ZUVzUMY}yp z!(es`krBWwfDrA!KR`mweicFXT;vY_`baU^gnjrsKtKn(qwvI2h=DkDOCYDeJ6?AG zhZ#Guj=-a!@dFe-QcMg%>2ad;oh8V>1^MYi+4~V6)!S2!Pga*YAZ4$@Oq2cUnep*a z>R2>rxXk0(_lO7aXW8=ze|ReV>=y8ZiQDfPvp+KSyO%iGQE|Y=X=Xd|0v{S&?68EZ zL8~wQOUPK|OV>Mq`*}=h*#nEIYF?y+MHKqe$9(B0koyVBy_s@HX8#q%Z&xvg#%u!R zb^>1`!5Np$7e?7*KFgTTa?E$=cmd2Q+eX!KsxH>o-q@0)4w>5TVu8jV59;byTY z11Xxtw{?vbC!6k$AHMEv65=SzFDq9ipNO4?uz6Ieza$0f_il4YFu z044+~H+ef}IKe>11zn%cCmFDeL8e0=zAlFbSEkvfMix-JX9b}*M|_ra{hPip%;PAx z-J@i?Am_`>^rdZ?CR;jaJ8>VMWB#Yo-Ad9e5;Z){r8CvTHy!B;&n_MBB8#R_9$NT+ zO?zRCpgHZ5-*#}CGVe&f|1JH|lr)um#x^;Nt>h4z!~iWvJv3aN)f7lAga%Wk(eX`A z4yI}xW--3GM;4Hk5@#`*eHeZi?|U1(r|oxr2{X#cX37<&_b2HR#^H0%eVl=6+xaq1 z$Et_Cr>URP2!dMdxsTV52A^!2{^ih=P4f{dn`wPhXdsIr+@+3hPYz~pC)*qG9;eyp z?bGCCd&emLI*+%Gsd*>gMjpmKjH=&XgR$)PGHw$n=iNt45k7?Q6v6{2vyW)J@O$pH zKTP=B1U_hUd<-WXA8n=MKOpe$Cj3hT{%K#v;Y+uI1==s&3KlM;^&&T+2p?uKBMshQ zn9`-c@yn$oDEE7pj34u5tS=B?gv`;6XD;{ zS_BJ(lLhHxo)MSjs-caCSRnmG>eR`v==?I)>)PRljU|i4%I=7@4ry|(PTa(2rtxLp z!#;!Ru8dZX8LB%fS0m)XWR`rKYISh+7k{?$v+qM}!(rbMEN4KACC~Bw?s;E&$%hF8 z)4A{`55u1u36wj>%f5ldxG$5W=ob)mr=J`z`#d7)r^d^^N_jx5NFNz58>7UUWO;=r zecbmLB*Xzo^{MphzUrsbrxEjAbj-KmrQ|YlEq?c$FKs=25irtamOS3v|Mxxi>zXyRHZMpPAK_aPLvI%(=MTMYNxC%T>p#fbe@V$8v0qz2!G@nEf9A^+ z(t5D~{RRskfKtECEt9=Amm`S4%Jufjw@=8w9oq4dzCd)v8+OOua&Tg#dTxAN`)}Ci zqD}C>qkKL7J>{w1h8Q^ijCr=m4K1z1Dq0j?Ceei~WQ4R$9# zuC6ynmh49Q#2&OU$q#XUKx&M zpp6$nUwG~FVGKQQ!Ik%=zZXa!v45-+hJ@Docfeu(Lt~3ZX(Zn8e0%|%B%2p!!14sr z_K&8a+@V7j;8bk*ZR!W;epxr{0&VP1KWX3FBna&UA>T;NBfdkg7Wyow0_irVT-AAI zW0c7R%HgnM>%@H!s%1XQAu!)eWzvDFMdM}v(9bE__r6L^=_&V&1kVip{0~XnP}Vhc z{NGdULsmPmEkonB#B$eLM~dvjqre;0$xDUFB2n2SbWchkn zhA-WK(%T&4WoNK)gi&Xh))?bueS9}*_AIng`iblcSV_jq(&OpEjAzrCwCBn*Ct^UW ze(S{1KVrc=js^XuKXwBC#}nHDhXUMuRGWQwC26Ro92-TRszupf*ufv;AE3VU53?^I zIf|aw>b}OkjW(rdPbz19mRa&f2vYqhIoCH5If$Cm?t%M*ZsmroT$PP>)!*J4(v2s2!L<-lfDt!BuiUAgPZ`Sf#s)s zL#Jol`f2>n$}F^h>?p8@pR@0!$D#ewu&0n3R(3tWfn`?1GRzv0!?4>Hzs zz`Xh`NO@~7*Z#*AfC=qSSS`qbv3W9#wv6V$iNFf}_we#;*jpPq44Zwr;>so8Z)0rF zcTfBjjR1bMRd+QAWVYF`0kb5ttrS?L&@bvSyq+@Zil~WK3LFfi_Tg0)($dPys5U_M z|2rhcH5saE>LJuS?mICE>h{~oRT+BQY2W)19&y=+k0S!-!hMi-q5|pP!J`ORzDcf5 zApJ&mJ6uzu$aOc5I5rezitUeVL+?8guw;kc#+H&T^`OW8H4E@jzCQhg|F&-u_fFKg z-tK$CzkIA7`vg#$`(Oc>WD7y`dHHd|CEo+I-`ipVT54 zf$V!XBEmDrk7--eVm#h-52yWA6x? zPXRaCv+2`RWFv}@t!A&&#JCelE(USonOf1&P1vd$OFpydE($Ku=2c8{LcYgHi9&`F z5X>%y2d-7Y!z;}Nd=0x=ywbzhL)ST_o<~OY*ohf{()=QFxPXs}oL|Ex_4z^Mb3J}m ziGIJ2La0hZ~fGS;yhsK=$2`G$X;bfQTQUPj}@gMgCo*)OAsNNWq! z+BxOGE9bkhM& z=nvwa3;zCe7UOm|Cemw2eZ=zQDO$2_uRyyAGrd}x>9Cz58Ef|rF06eoT|dH1in+>p zy>I+D$&+iZ+qu0a>x8X7t=j6#)Gplqe+I6k`G1i1dJw|Xdc=9XW?ye@F2c}77fNz6 zg+ag04cb2ZA!MpXJ*?6G7eU*;moB_Wqvj+|enHsuv)rcb!|y}>$uFw*tO~hNC6sTk z7bAnyInj)Qqq5fuh?^uCJ8=a9m0pgepFkUD&%A}!{}Ox> zX05u{qx@P9t@uV}-v>(^FZ*~WbeLI^B(ucyi9N`brCkKt^eNcd0LjyrQs{;uS?y4OF&sKDu7B~?F(N8@xLqB?;!SWT#HO@ z;5#ElgT9eHhbvBEus&Sj+wh0vQsLnE(r?iEU^(dXE1Fo5)0p%@1(H;w0kkCiE%FC& zz3hACVDF|&)4udKQ`ev>*(cEGV71jBc5Q@6f#rw%mNB>eYr$gtxfTpR=O6K~MalOK z{R)~`a5pq@tfF(2bP?Ea2>UK^TOqc8Hhedps|)IL27M5JRKFGcv8%u}keua7k8wnj z56W0CBst*=Z{7$W%;P9l5#WCc`O6IQH-05$mwg+HN{|tu~_7L!gYoX7VGNXLy_gwNy++%>g5wO8HU1Xe>X~yX} zguZb#?BTik^s#t}r_gN+YGn3{9)4eEJrYL=lV7G$o%8X+|! zv$+%$U&5vRkNgsG@Z~~l)5+-7LEk32ABeU#7RAr?-FAYfhDw-kC6DpkUH{=*e#i&l z_G=BR^U=}qWeGvJ_c@bR<G5TqGTbJ^IvK8$;UzL$ zD8phIz6JM?^#7_1UzFj~GJHga56bY!Q!#E6u_ogH{GIAk$nK8iTmLB&?j?nKO`s!K;{t8{5K!9deed{xQv+BN8jiuUv=g;k zZUI9A8Cb3uj(q$Bt6hftV={eQhNtrK*%~9hdND#J@-4aBucqG%-<<}$eUW4&?)3EZ zM*0#x{e20xtYcXRYe@CB1Ki)~?CbAad2=M*4>*&^D#+=LMo=s%${>GPhm%z~SzS*& zk#yFFlJTAa)*K1<_jPEgRIeHpa=M0HJkmBOLIKtPoz98j8pZ*UZE#A1z+f)~5yk$p3WZJ8y$`~D}sT>=4MW* zr9U|-R*QzkSW7oRC%(K-@CCaM$Za8|T7cvLA``)=&( z-z96u|yOWWGGn90OG%B*$^m4&?e-gCR zlDm46-Oey>GIv%DEE{0JQ|lf}L{c67P+qh@93tLyqk6JG+#hwK4axSwvQixnrz+Rp zlSDh-9LdF3XRcw}eQ3g_lj5BgpEZYQjM%QY*nfz`u?J_Pey z?p$A4U0J0{^%oR6u;+l2?&)_Rya-n-ix96uxEp6F;)4huT)@}@#19~R4rc}8^h`!U z8Juav9SE1>>_)r_;YOS>#9av8IFpD65#GFzu>r&>ya6{0??s%#O^e|rBTnIhC5+vR zxD#P3&W8|hL-;h#1Bf3(_#2#$BYq0u?{JPG&fu{Y;(QWu2f|lz9wi)v*$WwaiQ)(^ zbRvzo6X7RuoV(#H$e2 z;9P;Y3*qc?=z{POK642!&LDmaVXOkry&z8E4$J^i#M=;Vc^@t#As$5d7|y+jk0Ja3 zE_2+2xC`NNoDU#Q;bSWq+fO(Me~R;Af+Ktb=Rw37t|obKK8|=0;ZJam5e~u@Tz-2N z@iv5C!1)5=`w-fzFyCG%=GnwXlROyt9}&2CQsWcM&W8`2>83KS@gbiRaxpJQvLz zUR3C4FRhx@HZxW-HshG}c;PA3N##xWt8?(J1F|J^!HZtUJq ziqyk0d{&0XW%!m1OYaeQi)C0TL!S({%P=X!yJYyF3?G-_F&X|!hJTdd;!g?s5uo)4hbg~iL-l)nvzj$CDf(*xC&ZA z?a>JPJV9$iu_U$|YWtxQJVE^c!2P4LGL#kH&DcLsj@)c$?c3GUhZ@&fnNvm9SBEaq+!$w`ej#Jo1>9PjI~)?BJtjyzECovs+A?JEztz3ye$+>Mc7BJ zlM-PMSS3@GrJV|_rBn#7E@SJNqSPvhSR_n4LyC|F`fmcfE0UyrsZhKt!J3iofmS1Z zJ6Q|G``eXHXatY*Ar-|w+fJU(SP1DvB&mdAF(tV>7GW$bAgKguB6fZlOE4uA?(K;7 zv0D)9O>`-dfgZ>=!j!Ox{WnuO>4|;Dwpuu8sHK;M3zYsojxeJr)ZQOYvh#{yp4eAm z?9w7p@`|F)SiGk%*~#2Ro$&}L)E9N`f*~Wer--(!2zzf)Z=^RIL+gwbNpv<^6iX$; z-Jv-91jQ0q3l=4?U)IUKSVX&Lp(tZtD@r8e(MTWGKNRZ=_r}-{i*~9kshiUr_P=y) z^)@wl18Y`Sc0?fy)-2%j=RSKAJHzp$DgjCHKRc@Cx+Wyxa0vLRB@^eX`?IGmoH&0% zqVECU)4+Qg`2U0ku!Y15xFoop5XZi17Y|qSfAb%<=YWsRBmTk;bN+jfzbp-0261Kk z)3%J({?AD}AQ+y1W*^6C8GI2tsYPr7;x@~chE`{7_2pvY+qtqgnd*yd3irn&tC0xB z!`++uaB-zC|Dn; z_IGgpJ2YY{KCWu5zAjwf!(R%QP`mnY{R)l` za;$m|0g6)ik0s+ul3BK{n1{keyND2_+ZQQBtYAi>8~#)tp&~04FH8|ekswL{tBnM( z+8X)4$em#np-2d41X^rbn%ASiQN#u9=ueSXU0^FxV?{-{v>8gWV)&Z9F-1{&+m&!C zj%$YltRUg|EN4t_2$^9UL3}x4B~&lGZAeM%PAIs(80|?w75gta7kL8M2PiA}$8r*Q zrb-z8ZI~6DYvD9=p*vZ@63hHOC~dWUl>ZYa4PzGy0_7sh!oTI2U*i9t%t3*(+!M!z z#)3-)8MWvxEn|f!tY*ZzdeKO%V6|l)F;v03RQTnVGUB4b`xCKfC`k(zR?j?mJ z>EGrE(4WBNMONSzd1^7NKRCF~1nv!e2-aS()tu4OM;SqpQ4Ej0J$fUqL$boP=MY1* z60WMI=n}OO#tNt>!iqk;U=!u^$FPd)V%Cf2koG7^%O7iXDK!EmsZFfwv?L(RdIe8f zZL@(>_@Ag(vCML*%)3fGmpaj_cR zXvSp=NfAZe$xu6%QHgFgV^tYFdtkMF9sjfL!QZ!VmeL=9&m)*Eup>9I8SCt?0ARJz zoxHQCdVfTOy8%ypM%8-2BH3#5{h=Q8AaSK zmK6Wgii<3L{fe546vh`?LSgSc9*HTqir?8Ypj0b#1)LS+!fFJpFc-F7z>4hAez20I ztUSev?Ww+ae-z7Gg>u;p`%XTdij>VB#d@DhSHcRbAeZg;XzAAxaj?Q)Aef240xMG~ zYl7LfTh60w3E!z_{FBI-tJaEguw?Gq%}Pst;@MA5uN zcTXoK3#>>>PH>P-f-t>dbSwE42bRw3#a$U<0bX))_8Xw-5Fp$yz)F72k;>*>_2B+X5l!yY&_Vlxo|Ku}HW+jV7x`OcAL3W8quRuE7jr0W~U4?YwCTt&-TqpoF5DiU$QL1FA zfULKafg|=YOD-0Gjg~U7BtW?UxC8)Zzf1r;pxPTEj7tQ-Cjh{>Q~&~&GKfhS6#@_x z0AMT^fEEY>!3gCt0og7gz_eAFyrg+E7}18D@|zyenII~7PhodZ$46mhF91|lChr!-;|+Ro<6A@RwU|rwQq5jv608CvR&y}mZy`#}tWeKU z%hmTL8m~Co|=0*~-nU&^hj}2hdu`Wey$eX>8rBg6HaB6}vIW=IKxs8PNGUH0bsy&A!H_7NxGWp|-`}*uWMT zbDO*^txXNhtV{>jHMTY>SGA&@0{(h`3tOmXLDMbQxSJqrlef-`MkdW{_BMFy{IxJg zc8-o3s0~UBSfm4+yb!3q(c`bXmYu7ENm>4eT93Duou@cy{*yjA-yYgjZKQ%<7r|`^xS6LpQ`xL?)a-;vzl6hT`)=ZdUm0n zBgg_>X$-=2iFPfw2d9oBo29v>2|7V5T%>2AN4NvHf!0fP--Zs&aiGISMYW=4wp7O_ zbu_zub?jmztTxc%VdX~H<`%Y0hX_II+yPL)u)rnVT<>R>A0d}dL z(TJhOU#HYIHf%#v`FS(c`BAy$#;oR?tjmm9b#+Z%Z;-uDhkCcSDC?`% ztiPOCVT@>KX=W?*>@BdSCNZ)#E6t<{bhH3lsbdhZwL#Trpb;hoQ}EZr{wgQKYHn$S z)v9Q#jA%i3?N+pnY(c8KhFN9AY`He*4S1U&7}0BH)y8a+rApa+trFbc*u+-rnPkdM z5E|nwSwOSW(x_~MwXc~1rLL*5o+H&vh(zt=ZE8lBZf0wB3^AA+Otmh^8`awcMX%E_ zsZAjRDx&0KTs|R&;06Ng^=#gqg3Z3xy3K5Z4i+|8v-w&Kt~5;ew?k1^==sEVi@U|= zZDLpIP*JLS_4>Mcw^HlFt?12cV{Z2L)oa&H*6f?6Ks2`e`wf_2r?vD43^~M1wHBA2 zBS+b5{4G8jU6@HR^_+%A8ZCluf0G;25xYvyQC$RbLd0ahH78Tbcr_mzSiqd)^9!e= zUeA&hBK5Hb9W0DG&?u+jX4a_ZkvVOz^=;YAf<_=}RK>2=VN?%c?=+6FCOt>kp6m;l zgebdN&z7DF6zcKwITU)QL90ba5tZc4&RTV_+D=!?nr_pxyqH;)ZPd`M!63TAHF{P6 z&BwMg+mrB1{|cTU_cpJQo+S4eJ0l^w0|37I-&z)uvnaet+JesaCYKfzSL0@5PTk!E zhl?gIV>(Fcldhvg;h^=Ku@6HA!hze#-i3e2)0>;GaR;S4$N^kz+}1~8yTMYr)4~Df zqUmC5G%Q|U?CAWN9n-r4GJ#aD@j~SSMcCQL=pJCoe|t8!AhSQMD_a^{HoIYtyyPsqA5Qsp zktnqXyj$ED7!q(r?kV4r)u2NJ)di*xv$ROg#JyL z^F-~o^Ldh!p3gCObb;Nw4g9GDPnX#@3!2UF=-|rhIp^5x>!qNJR9UoQ=jI5c0nd|C zX@K)303AbcTa4wK!cD-`%3IoBYk>LJtX~I1)RFu( z02Jf^u%K)4x7Ncxb)s@t_qiZ zb`E%JLjbm~qit=dhxzO2=B?LKozVqMFvY!X``YT&Y;I0gt-Ap|l9!m51NPT?2?kT~ zL#bFC>BQ8mW^WVZ!^$Wp3l3WViy|Ge#Y@w|!W_ufby)A{2$-`lL$O6Upsnk%%E`f~ z_td%TtE;fc(Se&i;9ZS%O&(}9)-`#cHCW8#foiaT$pN)+S{LSnRx@V~=sI#7tFb`Q z3(_w2(wrHFl~_s^pMzH^>!UX-DaZx!Q9B;T9y`BkskGxJxQ-C+Ix8tDDdU^|e1oH> zFWgTT6irw&1(uD*=zcuSqV`w?@tNqYd@L8eb#}=T!oWpHd99IO!z*gN+RwY*tXueu zQTSQHaaiewu_PQj#Am2+?dl>f^%X*(STr)=6c_pm92!8q2I$lvhKq!bBBhS54RYE# zjt;ba84_HH>&3h-7J?_yu~&fAV$h+7ve?}D zK$$g5&z?6sN0RkGo6j+rKt!TA$LnE?PjEHv;19`QZr91y08EvjK#NFKlo=>1B6 zp~o)BUBDXgZ?XJg&TRZ!;Be9-I+omY+KDg?D%1vUX)Nf4~PL z#J_k&3R`#iDAXI*>6D)r`#Rpb@pMvTdB z-VliEYDBmSLu@pK>ub3bjFPJuvU+q6$rRYgU6otO$?3{FMBahcps9GWBhs0u>?Tzu zk{u{3;^M|w5tmMtNZ>wTT$D!~BOzTM7f`y!jd4_f=_=t$en~QfXYv8Vg*6>zesid#R*;6i6?jDZaC-U zJOGDh?!o_Y%r=xNw9p;KdQnVd{J0oS0Oi_BwCDJ1IXZ6O7#LKb{6h*Ph}NOU55`Mbzln0xQ{VL5|HMFJp7(Wq{uDR zAYmk!Q-e_I>!3`BUW=oE#HQdy*uMbIAWmJv|3b=fmQv@Txt(XhaRCP?Ir3Zu$bqwH zj6PdO#i$)7v$4+t=hzf<=n*Tt@`m9?g&gkmqHEV#D1RF`RcFC@1vqVI!Fd}v!L#5v zP=f=&ACd zKL_SOkJEWw2|A;|K`^PFL&)4W1x}^>$|=c3+zTzs!DA~WwL|^FDFLXKg%%LZJ1XT@ zMhVQV*HWH`ffrxMFP2gUn1Bv-6ZQQ*1O<-#`YFYUOQEF&|7Dak9J^63>hE;s+n9lY}rBOm?)l62^Y8A4CRwuxbS|wcyt&&cRhpJW5rO>K666tuVHfYWe+DODgaa`cQ z?Oy8K6UO~j^t@nDt*Nm}oLEN>-G9BC-3)<+t1efum|nP$rGh zcWCMDhx+j+)0q4cFHuIbf!EDC6B$!&6)&ukTBSBH9;#NO01K@W4vkpG<54hiKx2Z} z2aK6WshS@~TxcF^TvCy$c3I*{5OB_x8k<1#vC0i=*4M1#^A5KtUhYMdYEw&b2z`Wf z5GQ`7zC-2kQ~__FV}?>zR8g}-&BBE|MCUswi6+ZA%4C+a(@ zCK`YO_sJ)DbY8zRAg>6he$DINW1ciRe@t-%x@o_BR@gaxwFyS~RaB5vs;Yb_X zM>OcP5XHQ@b2^^u+K{93LL%o7Lr}`QXwO7(`B6=nDIOCyuo(q68X|GgQ z9KaF1$%R;+w=A{#KI90iL-$fTW7SoZa;Y)tG>gt&$AJ z zyOZ&-Jf0-el)Eu)kyG2 zrRZ!400_GZI5bvGYV*=sHfnS#j7*SH z`%bq;XL4%^0Y~(mf#g7PV&CuBLTXcz*~IEytwE@6q?HNx24!E~smX)=HT9)hy74j> z2ncy5pD(ThP7GDn?T{XC^Wnsgw<2R7L9`8ns}4yM1g8%9BtdY~h@hidovw{tXr$?{ z0$eID%RbfcHT9|^WCye%ti`G2sS&l62Z1B3g?d1qrzfp9sP!h}d_uI;apSKv&BOgk zcIR#|aF%}$d4t$&BW+A%354`bQXWL0fO-qwER5)J3}`y!RYb=m9Z~T@2$eP9ECj@b zn^5%@TnET;4WhP%kcTYlLm+i2=cxX@n-M^hkbAHy1re%ku~%yg@{Np#+7=IJZ9zE3 z9e*Z`YJKCOuKHbSTM)6lLzU-mGs9V(E z01`An{vRr3fIJIG8{R#xmwE+|eFn(y0C6~Tac01lg9b=BAg45lS*x`Fn%8qXLdg(B zZo_#ttp=xRWjS9w46TZh#0QGTL$%%)fFnkd0U$sTIfrU3Pid{wiD#E{5M;CtHKhZ$ z=Am^e@elRn9ZeF4dvp_cR)pRraj?Y-I`je`FwQwt9qzkGjsdYcD)m_ce z!#`!+sZFURMVtN*hG8CYs7=X77HzuL*jQ35(jjS1=+KFn8I9VVT3fXH->bXa8%b?@@aA4cb({((J40a<$& zMgjw*=Eu;10kV!}SqYKcvlq!;@UFNY01*S_wR=t6X-qKStQ#|NKQ%4x`%T>Un7BV{ z;{J$<`{`+Mf5^l=Y2yB*i95ZFMruQ99*-PwD@F^-5&NCA`vWHKQ4{yaP23+aakov2 z`#ux*4ik5pFJw)HWv;u|#GSsT0W`AScTx9yP26{wxbHV{zuUxp(X_aK#>BnF#GSl2 zW8Lw20Tm+K-8n7p_n5c`Ox*7^alh5Xy<%G2M@`&4Chqr`xF=2A>1!!KdzbBgmx=pE z6ZgAJ+&^UEzJ6NV?=*3*F>xmkA87h$ysq8E-8C)ldrjQw{vHFbnms1&+fCek)8am8 z;$Cjzo-}a}nz#q2#eI*7`(hLKsEK=>iTn0xai^7lLCmXR$ytYW~h?ao=v@{(^~nxrzIWChnut;@)E7 z{;Y}nViWhLP24{-E$#sm_s31#OHJJO|B1N!OxzzfaW67)zt_Zl-?ZxPF>&8-;(iA6 z8_;s*xV<`exd(e6N{O{qh&Ex>4;En3O}|4?`5&L9sJ0WS!bcc}Xt0n|(EZ}3&B0ZUz1{)<+3%3f~VlmX;^kUu8t zKG9B>`WXmq&B(bN$teW}I9>(hxJrjZW`dUr!MnQU*eiHZy|87Px96bha8TwH^6M9Z zJ|~Gk)7o<){m4C{A{0HF4z~kG=y39D3WtFs><14HEAnddGyW$=+aevapeSwMlL7lstcfJ6%iGE>jcXd2;{`uOp<`q@uiN;K+ z=X)SC*XrarmmgI1!^bGyE+}TI*Speul}cH)gthmYH2)g7a0ykMbxB?GvfV3Gt-dSn zD@@$)F>!yz#J%0by=q$AD@@$)GI9U0iF=)i`}%2dFE?@DYvTTbiTipJch|JIJ5Aha zTm?|~>uR1gaW6M<_f3oYViWhIiTjf#?u$*_gVW-^$izKr;{LdaJKbj{^&@S5`?R<( zFmdlNaevsvo!(7vs;Iz2EV&Yz8 z;@)E7PAgX9Xfrk~?#E5sX@A2o0@MUd+@CdZKRPY$KQ?iH)5P6l;{LFS`>|MByFqpl)zcuD&?uGRul7T%c<9opA=5;3= z+NU*k7d(L#R`9%)138piz|?QbI+n`aFi!91Br}8|4q%DHf?JBznNdK_0YtshCmP%JU)MbO4@#rxS3shuluqXeAatO@lJbjyIH6>{?*GMcTzDT8;XsE`B}88*R&_|_ zY2!il0R;CsfT$jkfLsEI`t+HAYyw2rv-)-6*wWm(UrnV9^27k4L&!t1I|+hD)gku* z;^6vm%6jbw;4$0FCc4vA62j%N}t_98@l&tIdT0op!W>J!{PC#fET&Fw$h`K8)bT|UYYleD#0T83i z{{+Y}1Fxq6p+m@{er?&gG*|QA1&+ECD0rO&WS`a+;w#LM&QR(M;TU)=#ZcslJ5;B~?M^4&bae=|L(;?Am0i?#j zO95nuL7qK;R2X<=0C50LDg`?*S^7>({ajD>wz;0B08ORKy(Qe1y8QyJ*{-;JuXg^4UjtkDK~Kc z5+JJQi3}W%0n&z$QUdaQK-9a=1mx#{1T~p~$bJh5W3C+T)Ou|OnH_+1U!1F-rGOY) zc|9QI01EEvH_wAhb9++|IAg%kwLyIJ6 zAdefk7c9t~@qx^rL44DIvjjMIX%Oxs!Fq$h6?Iq00idxC{YUo!HlkEiD@Bw)2*{X0 zKPf;;4Kfb_V)P+D0myc(?!527Lo?d^7lCsebnufJI|zul|3}r~5kQg#d7cMkRF*&n zj$Z;Yn9D0n-XI-%E58k#9~cxb07}^GH9^guK^O1vIv>K1qdB_fB&Tk@)jWKb2p+?AznB>U>H}=1*F>mSp&$v zi*rYST0jnH5CxwfrWe??8S1qSIQr}<-f)MR(SXwpoI%J;vIu!b0HK&(i!TF0hYmRe z$O}NyHTEJPr!~zh^2J6jl+r1`4xAQ)p8o(ym8Mn97tu%`Rsk2O?L}N?qO-SYI0QKt zkQnITCuM#=AjdRq5KapqEd~jrfauyFoR0yb?hTTZj6Dd5%fRcafNV#O=mk5a3nHFa zae{j%zD`3W*DuYL`6-k-0H~<@_mQgXh_t7=ln_2L+Jz7I$Yf7nXTKT`wYSG3JJnRQ z2OpG{SeifjdB1w9u8y0TOgq|`>r{G;^J@||22j^{0_7Yt-+}V_$Y2P+8&yStWaWqv?DSQj%kmEo5_i9-t(8S z^uZMK>MORGCW3}0z$GWwjN5}L^_rf(`aEUHcXaMzXVGF;UrIq8BKVwpf1mn@yNQi_ zpiRE`rq=D2F+XC8f|vj4-~17MO8`6Yktz9^Alc=F0&c$fW)$n_SGuD8?fC3^2faAn z0O7BaH;G~RWCtm=2fg*?NC)fPtwizK`klh?az0`&no)eop6`#B=VZz++)o0>=Vj@; zCcP1SnO8ym=*3}5SE4i26UC>(*p_Cc7GKng3?!Q(;r@6B0lcarCjbS-=iYfWrHxUw zsn$6rXR5N?xj=V_LYK0Hu)cVx2mM=ZnnbcS5sBC1%EBNFWUWv!wNyC&5 z$l4LnzA+C^)0kH4iPz(B+4%IXV9%#NzPl1{*GyJc!J-D5@hCLx1(k_K=&Jxq9G_#s zCk0R(-7rM;+J!zw+OOQOw)*lKQ@xa?R(z4E9$z$U_O^QHlVX9!TJhZ#`beK?)KaD> z0Ay;1%2Z#p=f+5Mw|sAFPMY5jsi)Q9zS-+jcuh6KS97@CMAZ9dsV?-vG}NW4dJT*8 zrWA39CB?-3s>;M2Nz%g`3`j-Fjgj5L*i~KTPt15L%Bq{Og`s4174!jwNx`VK0J+qd+?UP5zI}m|jzzKRashHwV zH1zk8iH6#v5r1E83g1uaOL7E_Zlo{Oi}{fEUOc@V$0wCADfGTumm$y3Ag96LOwgUh zIk%@XQ7L?K1D$~T6bgEea4K|Tn>t&NKo6dZ#MIf7@}_3iZ-+MbPCjpi!o3~QK7lA! zSf=TR%w~BN9!?=(Zj>A)#n% zA3jgh!I~q<);=*hbZCQqT~8D)qm+VrSU)M5Ylu`Wv?KsxSqaAEYH$Vc5l^_3%EV5K zqUe^7ng>FOBu09Sw4{dJ_!eJp3r1jf0%AlcCQXn=GPtI?H;K6{sl*a|q?XLl{u6n# znwu(iU&-4Hg;7Ne6FnGoNOSx9rUDdZ2G@3=%q@x@V|0Hhu<7 zw(`}f2tK@q=HXm>G_HD~9J`lI9O_MU!IQ!YK`$rvaq>#>SrKpC7uR}tg{bm;{Q=`5 ze@%(TYI{2Ze8nPLMw{n#YLm~PT$`Mr$wL*=!er!N+0um@t` z^u_=@x>T$VpLZiS#M_tT&83=FcO(=u*rFIK^d6(>(6Hd3Hsz~NA?ze?=?UK`rc4!CwI);J>j-Dl zv0e{h!<-~~XMe)bElFjQ4L@j=NZiynr&>LVD)CE&x}@0K4?#CQ#ucp`DW!Lerm79a z=nKBmB}ajTa8VWbGF^S-#Pe}Pt{HJLiT5+uexe^U91X+plRMa?qxwV*;KyfVRrQc2 zO+50lK%mF{6-G|F{bFl46Ck#}S6?7y)G zJD#~4AjCI!!Z-CNQ9GklR7kzZENYlHeWJHgj~2tv)Fz+jn{hpmIiOSY8hu^rc48OS zxT7dkm*bgE+&^>ME@vB++a6~oYJx7vFUIB#tvSPk-q&({|NNDrYVTr(%XND3aa`=6 zDV@M=4#GeE9uRrd4R^D2u%Ve zTxICdsQjd>Sn^#bb=*asxo)B@4BbJ9PEBf@b%Yf1Za2MgaC;u@lB#Paeh+|_oXX9Z iYSl22CvkRPi7KNjRP}&0VZ=7CIx!_RpCPZmvHt^z_P#a% literal 0 HcmV?d00001 From ff4385aa8b7c345e6b1d01b396853dc8bdf679fd Mon Sep 17 00:00:00 2001 From: Suryansh Prajapati Date: Wed, 12 Oct 2022 23:35:16 +0530 Subject: [PATCH 122/290] Add the MaxDifferenceInArray question --- MaxDifferenceInArray.cpp | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 MaxDifferenceInArray.cpp diff --git a/MaxDifferenceInArray.cpp b/MaxDifferenceInArray.cpp new file mode 100644 index 0000000..d8ee6cd --- /dev/null +++ b/MaxDifferenceInArray.cpp @@ -0,0 +1,31 @@ +#include +#include +using namespace std; + +int main(){ + int n; + cout << "Enter the number of elements in the given array: "; + //taking input + cin >> n; + int a[n]; + cout << "Enter the elements" << endl; + for (int i = 0; i < n; i++) + cin >> a[i]; + + //easy way to find the maximum difference between 2 + //elements in a given array is to find the difference + //between maximum and minimum elements in the array + + int min = a[0], max = a[0]; + //applying linear search to find minimum and maximum of the given array + for (int i = 1; i max) + max = a[i]; + } + + //printing the difference + cout << "The maximum difference between 2 elements in the given array is " << abs(max - min); + return 0; +} From f04c0a12dc1be2df27825a9087937104190f3283 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:37:20 +0530 Subject: [PATCH 123/290] Add files via upload --- 1_activity_selec.cpp | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 1_activity_selec.cpp diff --git a/1_activity_selec.cpp b/1_activity_selec.cpp new file mode 100644 index 0000000..5249862 --- /dev/null +++ b/1_activity_selec.cpp @@ -0,0 +1,25 @@ +#include +using namespace std; + +void activity_selection(vector u, vector v, int n) +{ + sort(v.begin(),v.end()); +} + +int main() +{ + vector start,end; + int n; + cin>>n; + + for(int i = 0; i>u>>v; + start.push_back(u); + end.push_back(v); + } + + activity_selection(u,v,n); + return 0; +} \ No newline at end of file From 93eed0af2d5d3efca740995f64921176308881d9 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:48:25 +0530 Subject: [PATCH 124/290] Delete sparse_add.exe --- sparse_add.exe | Bin 57161 -> 0 bytes 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 sparse_add.exe diff --git a/sparse_add.exe b/sparse_add.exe deleted file mode 100644 index 13c4fcdfa3a16b6a37aeb3e32a2d15e298b09b5d..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 57161 zcmeIb3w&F}l|MeREk{nANO?E}NI(P!9GWv z4y4r7F`yN0T}r#{mUcs-EZxoSKi#D?ux!^MK+;0n6ey+d&{9@uC{0zbhW#id&C(}^*MX`oSw#JXK#N;q;mG` zndOpn(92lI?RHij_}37NGxik-a*AEbW)&1%z%BvOW}Gt_JH7y+g9^FmPs9s^+?2F3 zB{RQ^ti4^fn&pYg%KC@#wu%@S_s-rfBSF}|IIja4i|HcRVJgHuY=$Ra1x$} z68b@St7=3#NWmCR!mGoXb3lKaS5als%ych>* ze?(79OcFV4zYtpLth8Uamt**bUaRnBtWN=0{oD}}lp*;vl3L;$xrw`S6aBRyb=&&- z>yq11D1@wZ+5P>DW!Ugoa_ys3mF)bb_`4l{zD(IT@H6w$j_l6aoXyW5?$CNm^1A9V z-_Vm4kc~Y`5@dgR5o0I6VZYGDd|}^4pXKOn>uKOfeb)Xp-=fajem~2S+(1D=>W-m< zdr@MJ{q~#3$Hy~wo<^ejx#4fvKlQ|kZa{n^v(I&aViEo%m!W|q(6=JflNro%eDClW z6}TKQvwqg2ZYf9}7_ojEE#n(0`wkCgA48B~Y3oBgX}ynvw5Qw&d@Jxh8C!N4Dl&?? ztw-Gk!HT(C-7T%xY-{%2_S$EN_1L3O1!%UQSo-__>H7y?X44{G*zQFwh98F#Bfd=0 zGHQNbW=Q}ltNyhw6SD;}%kCe9n&$d8JZ;}w1H4DGgbfl zZ3QorDIPj)vF{~=%oL-(dv8MQi1lPIH&4KLHud-6U)%RqBSbwu?52Q$QnJ)rJ@y!& ztoj?{$Ffh(C8=l6J_plC*?h=>=G{lg>4L0nASyEsaj9nx^<*>y!uChkrhwbsJv)TU#9fJ z>|X=bHxje>(!b3fM%f2Y1c$S^^9RUdgiVJ3SIgIK2QVoE)i znw7mB%re%+NcwJjlI-mI4=OjfcermjZ2y|4yzPV)hA#96^C$t=f3pw)ZUVzUMY}yp z!(es`krBWwfDrA!KR`mweicFXT;vY_`baU^gnjrsKtKn(qwvI2h=DkDOCYDeJ6?AG zhZ#Guj=-a!@dFe-QcMg%>2ad;oh8V>1^MYi+4~V6)!S2!Pga*YAZ4$@Oq2cUnep*a z>R2>rxXk0(_lO7aXW8=ze|ReV>=y8ZiQDfPvp+KSyO%iGQE|Y=X=Xd|0v{S&?68EZ zL8~wQOUPK|OV>Mq`*}=h*#nEIYF?y+MHKqe$9(B0koyVBy_s@HX8#q%Z&xvg#%u!R zb^>1`!5Np$7e?7*KFgTTa?E$=cmd2Q+eX!KsxH>o-q@0)4w>5TVu8jV59;byTY z11Xxtw{?vbC!6k$AHMEv65=SzFDq9ipNO4?uz6Ieza$0f_il4YFu z044+~H+ef}IKe>11zn%cCmFDeL8e0=zAlFbSEkvfMix-JX9b}*M|_ra{hPip%;PAx z-J@i?Am_`>^rdZ?CR;jaJ8>VMWB#Yo-Ad9e5;Z){r8CvTHy!B;&n_MBB8#R_9$NT+ zO?zRCpgHZ5-*#}CGVe&f|1JH|lr)um#x^;Nt>h4z!~iWvJv3aN)f7lAga%Wk(eX`A z4yI}xW--3GM;4Hk5@#`*eHeZi?|U1(r|oxr2{X#cX37<&_b2HR#^H0%eVl=6+xaq1 z$Et_Cr>URP2!dMdxsTV52A^!2{^ih=P4f{dn`wPhXdsIr+@+3hPYz~pC)*qG9;eyp z?bGCCd&emLI*+%Gsd*>gMjpmKjH=&XgR$)PGHw$n=iNt45k7?Q6v6{2vyW)J@O$pH zKTP=B1U_hUd<-WXA8n=MKOpe$Cj3hT{%K#v;Y+uI1==s&3KlM;^&&T+2p?uKBMshQ zn9`-c@yn$oDEE7pj34u5tS=B?gv`;6XD;{ zS_BJ(lLhHxo)MSjs-caCSRnmG>eR`v==?I)>)PRljU|i4%I=7@4ry|(PTa(2rtxLp z!#;!Ru8dZX8LB%fS0m)XWR`rKYISh+7k{?$v+qM}!(rbMEN4KACC~Bw?s;E&$%hF8 z)4A{`55u1u36wj>%f5ldxG$5W=ob)mr=J`z`#d7)r^d^^N_jx5NFNz58>7UUWO;=r zecbmLB*Xzo^{MphzUrsbrxEjAbj-KmrQ|YlEq?c$FKs=25irtamOS3v|Mxxi>zXyRHZMpPAK_aPLvI%(=MTMYNxC%T>p#fbe@V$8v0qz2!G@nEf9A^+ z(t5D~{RRskfKtECEt9=Amm`S4%Jufjw@=8w9oq4dzCd)v8+OOua&Tg#dTxAN`)}Ci zqD}C>qkKL7J>{w1h8Q^ijCr=m4K1z1Dq0j?Ceei~WQ4R$9# zuC6ynmh49Q#2&OU$q#XUKx&M zpp6$nUwG~FVGKQQ!Ik%=zZXa!v45-+hJ@Docfeu(Lt~3ZX(Zn8e0%|%B%2p!!14sr z_K&8a+@V7j;8bk*ZR!W;epxr{0&VP1KWX3FBna&UA>T;NBfdkg7Wyow0_irVT-AAI zW0c7R%HgnM>%@H!s%1XQAu!)eWzvDFMdM}v(9bE__r6L^=_&V&1kVip{0~XnP}Vhc z{NGdULsmPmEkonB#B$eLM~dvjqre;0$xDUFB2n2SbWchkn zhA-WK(%T&4WoNK)gi&Xh))?bueS9}*_AIng`iblcSV_jq(&OpEjAzrCwCBn*Ct^UW ze(S{1KVrc=js^XuKXwBC#}nHDhXUMuRGWQwC26Ro92-TRszupf*ufv;AE3VU53?^I zIf|aw>b}OkjW(rdPbz19mRa&f2vYqhIoCH5If$Cm?t%M*ZsmroT$PP>)!*J4(v2s2!L<-lfDt!BuiUAgPZ`Sf#s)s zL#Jol`f2>n$}F^h>?p8@pR@0!$D#ewu&0n3R(3tWfn`?1GRzv0!?4>Hzs zz`Xh`NO@~7*Z#*AfC=qSSS`qbv3W9#wv6V$iNFf}_we#;*jpPq44Zwr;>so8Z)0rF zcTfBjjR1bMRd+QAWVYF`0kb5ttrS?L&@bvSyq+@Zil~WK3LFfi_Tg0)($dPys5U_M z|2rhcH5saE>LJuS?mICE>h{~oRT+BQY2W)19&y=+k0S!-!hMi-q5|pP!J`ORzDcf5 zApJ&mJ6uzu$aOc5I5rezitUeVL+?8guw;kc#+H&T^`OW8H4E@jzCQhg|F&-u_fFKg z-tK$CzkIA7`vg#$`(Oc>WD7y`dHHd|CEo+I-`ipVT54 zf$V!XBEmDrk7--eVm#h-52yWA6x? zPXRaCv+2`RWFv}@t!A&&#JCelE(USonOf1&P1vd$OFpydE($Ku=2c8{LcYgHi9&`F z5X>%y2d-7Y!z;}Nd=0x=ywbzhL)ST_o<~OY*ohf{()=QFxPXs}oL|Ex_4z^Mb3J}m ziGIJ2La0hZ~fGS;yhsK=$2`G$X;bfQTQUPj}@gMgCo*)OAsNNWq! z+BxOGE9bkhM& z=nvwa3;zCe7UOm|Cemw2eZ=zQDO$2_uRyyAGrd}x>9Cz58Ef|rF06eoT|dH1in+>p zy>I+D$&+iZ+qu0a>x8X7t=j6#)Gplqe+I6k`G1i1dJw|Xdc=9XW?ye@F2c}77fNz6 zg+ag04cb2ZA!MpXJ*?6G7eU*;moB_Wqvj+|enHsuv)rcb!|y}>$uFw*tO~hNC6sTk z7bAnyInj)Qqq5fuh?^uCJ8=a9m0pgepFkUD&%A}!{}Ox> zX05u{qx@P9t@uV}-v>(^FZ*~WbeLI^B(ucyi9N`brCkKt^eNcd0LjyrQs{;uS?y4OF&sKDu7B~?F(N8@xLqB?;!SWT#HO@ z;5#ElgT9eHhbvBEus&Sj+wh0vQsLnE(r?iEU^(dXE1Fo5)0p%@1(H;w0kkCiE%FC& zz3hACVDF|&)4udKQ`ev>*(cEGV71jBc5Q@6f#rw%mNB>eYr$gtxfTpR=O6K~MalOK z{R)~`a5pq@tfF(2bP?Ea2>UK^TOqc8Hhedps|)IL27M5JRKFGcv8%u}keua7k8wnj z56W0CBst*=Z{7$W%;P9l5#WCc`O6IQH-05$mwg+HN{|tu~_7L!gYoX7VGNXLy_gwNy++%>g5wO8HU1Xe>X~yX} zguZb#?BTik^s#t}r_gN+YGn3{9)4eEJrYL=lV7G$o%8X+|! zv$+%$U&5vRkNgsG@Z~~l)5+-7LEk32ABeU#7RAr?-FAYfhDw-kC6DpkUH{=*e#i&l z_G=BR^U=}qWeGvJ_c@bR<G5TqGTbJ^IvK8$;UzL$ zD8phIz6JM?^#7_1UzFj~GJHga56bY!Q!#E6u_ogH{GIAk$nK8iTmLB&?j?nKO`s!K;{t8{5K!9deed{xQv+BN8jiuUv=g;k zZUI9A8Cb3uj(q$Bt6hftV={eQhNtrK*%~9hdND#J@-4aBucqG%-<<}$eUW4&?)3EZ zM*0#x{e20xtYcXRYe@CB1Ki)~?CbAad2=M*4>*&^D#+=LMo=s%${>GPhm%z~SzS*& zk#yFFlJTAa)*K1<_jPEgRIeHpa=M0HJkmBOLIKtPoz98j8pZ*UZE#A1z+f)~5yk$p3WZJ8y$`~D}sT>=4MW* zr9U|-R*QzkSW7oRC%(K-@CCaM$Za8|T7cvLA``)=&( z-z96u|yOWWGGn90OG%B*$^m4&?e-gCR zlDm46-Oey>GIv%DEE{0JQ|lf}L{c67P+qh@93tLyqk6JG+#hwK4axSwvQixnrz+Rp zlSDh-9LdF3XRcw}eQ3g_lj5BgpEZYQjM%QY*nfz`u?J_Pey z?p$A4U0J0{^%oR6u;+l2?&)_Rya-n-ix96uxEp6F;)4huT)@}@#19~R4rc}8^h`!U z8Juav9SE1>>_)r_;YOS>#9av8IFpD65#GFzu>r&>ya6{0??s%#O^e|rBTnIhC5+vR zxD#P3&W8|hL-;h#1Bf3(_#2#$BYq0u?{JPG&fu{Y;(QWu2f|lz9wi)v*$WwaiQ)(^ zbRvzo6X7RuoV(#H$e2 z;9P;Y3*qc?=z{POK642!&LDmaVXOkry&z8E4$J^i#M=;Vc^@t#As$5d7|y+jk0Ja3 zE_2+2xC`NNoDU#Q;bSWq+fO(Me~R;Af+Ktb=Rw37t|obKK8|=0;ZJam5e~u@Tz-2N z@iv5C!1)5=`w-fzFyCG%=GnwXlROyt9}&2CQsWcM&W8`2>83KS@gbiRaxpJQvLz zUR3C4FRhx@HZxW-HshG}c;PA3N##xWt8?(J1F|J^!HZtUJq ziqyk0d{&0XW%!m1OYaeQi)C0TL!S({%P=X!yJYyF3?G-_F&X|!hJTdd;!g?s5uo)4hbg~iL-l)nvzj$CDf(*xC&ZA z?a>JPJV9$iu_U$|YWtxQJVE^c!2P4LGL#kH&DcLsj@)c$?c3GUhZ@&fnNvm9SBEaq+!$w`ej#Jo1>9PjI~)?BJtjyzECovs+A?JEztz3ye$+>Mc7BJ zlM-PMSS3@GrJV|_rBn#7E@SJNqSPvhSR_n4LyC|F`fmcfE0UyrsZhKt!J3iofmS1Z zJ6Q|G``eXHXatY*Ar-|w+fJU(SP1DvB&mdAF(tV>7GW$bAgKguB6fZlOE4uA?(K;7 zv0D)9O>`-dfgZ>=!j!Ox{WnuO>4|;Dwpuu8sHK;M3zYsojxeJr)ZQOYvh#{yp4eAm z?9w7p@`|F)SiGk%*~#2Ro$&}L)E9N`f*~Wer--(!2zzf)Z=^RIL+gwbNpv<^6iX$; z-Jv-91jQ0q3l=4?U)IUKSVX&Lp(tZtD@r8e(MTWGKNRZ=_r}-{i*~9kshiUr_P=y) z^)@wl18Y`Sc0?fy)-2%j=RSKAJHzp$DgjCHKRc@Cx+Wyxa0vLRB@^eX`?IGmoH&0% zqVECU)4+Qg`2U0ku!Y15xFoop5XZi17Y|qSfAb%<=YWsRBmTk;bN+jfzbp-0261Kk z)3%J({?AD}AQ+y1W*^6C8GI2tsYPr7;x@~chE`{7_2pvY+qtqgnd*yd3irn&tC0xB z!`++uaB-zC|Dn; z_IGgpJ2YY{KCWu5zAjwf!(R%QP`mnY{R)l` za;$m|0g6)ik0s+ul3BK{n1{keyND2_+ZQQBtYAi>8~#)tp&~04FH8|ekswL{tBnM( z+8X)4$em#np-2d41X^rbn%ASiQN#u9=ueSXU0^FxV?{-{v>8gWV)&Z9F-1{&+m&!C zj%$YltRUg|EN4t_2$^9UL3}x4B~&lGZAeM%PAIs(80|?w75gta7kL8M2PiA}$8r*Q zrb-z8ZI~6DYvD9=p*vZ@63hHOC~dWUl>ZYa4PzGy0_7sh!oTI2U*i9t%t3*(+!M!z z#)3-)8MWvxEn|f!tY*ZzdeKO%V6|l)F;v03RQTnVGUB4b`xCKfC`k(zR?j?mJ z>EGrE(4WBNMONSzd1^7NKRCF~1nv!e2-aS()tu4OM;SqpQ4Ej0J$fUqL$boP=MY1* z60WMI=n}OO#tNt>!iqk;U=!u^$FPd)V%Cf2koG7^%O7iXDK!EmsZFfwv?L(RdIe8f zZL@(>_@Ag(vCML*%)3fGmpaj_cR zXvSp=NfAZe$xu6%QHgFgV^tYFdtkMF9sjfL!QZ!VmeL=9&m)*Eup>9I8SCt?0ARJz zoxHQCdVfTOy8%ypM%8-2BH3#5{h=Q8AaSK zmK6Wgii<3L{fe546vh`?LSgSc9*HTqir?8Ypj0b#1)LS+!fFJpFc-F7z>4hAez20I ztUSev?Ww+ae-z7Gg>u;p`%XTdij>VB#d@DhSHcRbAeZg;XzAAxaj?Q)Aef240xMG~ zYl7LfTh60w3E!z_{FBI-tJaEguw?Gq%}Pst;@MA5uN zcTXoK3#>>>PH>P-f-t>dbSwE42bRw3#a$U<0bX))_8Xw-5Fp$yz)F72k;>*>_2B+X5l!yY&_Vlxo|Ku}HW+jV7x`OcAL3W8quRuE7jr0W~U4?YwCTt&-TqpoF5DiU$QL1FA zfULKafg|=YOD-0Gjg~U7BtW?UxC8)Zzf1r;pxPTEj7tQ-Cjh{>Q~&~&GKfhS6#@_x z0AMT^fEEY>!3gCt0og7gz_eAFyrg+E7}18D@|zyenII~7PhodZ$46mhF91|lChr!-;|+Ro<6A@RwU|rwQq5jv608CvR&y}mZy`#}tWeKU z%hmTL8m~Co|=0*~-nU&^hj}2hdu`Wey$eX>8rBg6HaB6}vIW=IKxs8PNGUH0bsy&A!H_7NxGWp|-`}*uWMT zbDO*^txXNhtV{>jHMTY>SGA&@0{(h`3tOmXLDMbQxSJqrlef-`MkdW{_BMFy{IxJg zc8-o3s0~UBSfm4+yb!3q(c`bXmYu7ENm>4eT93Duou@cy{*yjA-yYgjZKQ%<7r|`^xS6LpQ`xL?)a-;vzl6hT`)=ZdUm0n zBgg_>X$-=2iFPfw2d9oBo29v>2|7V5T%>2AN4NvHf!0fP--Zs&aiGISMYW=4wp7O_ zbu_zub?jmztTxc%VdX~H<`%Y0hX_II+yPL)u)rnVT<>R>A0d}dL z(TJhOU#HYIHf%#v`FS(c`BAy$#;oR?tjmm9b#+Z%Z;-uDhkCcSDC?`% ztiPOCVT@>KX=W?*>@BdSCNZ)#E6t<{bhH3lsbdhZwL#Trpb;hoQ}EZr{wgQKYHn$S z)v9Q#jA%i3?N+pnY(c8KhFN9AY`He*4S1U&7}0BH)y8a+rApa+trFbc*u+-rnPkdM z5E|nwSwOSW(x_~MwXc~1rLL*5o+H&vh(zt=ZE8lBZf0wB3^AA+Otmh^8`awcMX%E_ zsZAjRDx&0KTs|R&;06Ng^=#gqg3Z3xy3K5Z4i+|8v-w&Kt~5;ew?k1^==sEVi@U|= zZDLpIP*JLS_4>Mcw^HlFt?12cV{Z2L)oa&H*6f?6Ks2`e`wf_2r?vD43^~M1wHBA2 zBS+b5{4G8jU6@HR^_+%A8ZCluf0G;25xYvyQC$RbLd0ahH78Tbcr_mzSiqd)^9!e= zUeA&hBK5Hb9W0DG&?u+jX4a_ZkvVOz^=;YAf<_=}RK>2=VN?%c?=+6FCOt>kp6m;l zgebdN&z7DF6zcKwITU)QL90ba5tZc4&RTV_+D=!?nr_pxyqH;)ZPd`M!63TAHF{P6 z&BwMg+mrB1{|cTU_cpJQo+S4eJ0l^w0|37I-&z)uvnaet+JesaCYKfzSL0@5PTk!E zhl?gIV>(Fcldhvg;h^=Ku@6HA!hze#-i3e2)0>;GaR;S4$N^kz+}1~8yTMYr)4~Df zqUmC5G%Q|U?CAWN9n-r4GJ#aD@j~SSMcCQL=pJCoe|t8!AhSQMD_a^{HoIYtyyPsqA5Qsp zktnqXyj$ED7!q(r?kV4r)u2NJ)di*xv$ROg#JyL z^F-~o^Ldh!p3gCObb;Nw4g9GDPnX#@3!2UF=-|rhIp^5x>!qNJR9UoQ=jI5c0nd|C zX@K)303AbcTa4wK!cD-`%3IoBYk>LJtX~I1)RFu( z02Jf^u%K)4x7Ncxb)s@t_qiZ zb`E%JLjbm~qit=dhxzO2=B?LKozVqMFvY!X``YT&Y;I0gt-Ap|l9!m51NPT?2?kT~ zL#bFC>BQ8mW^WVZ!^$Wp3l3WViy|Ge#Y@w|!W_ufby)A{2$-`lL$O6Upsnk%%E`f~ z_td%TtE;fc(Se&i;9ZS%O&(}9)-`#cHCW8#foiaT$pN)+S{LSnRx@V~=sI#7tFb`Q z3(_w2(wrHFl~_s^pMzH^>!UX-DaZx!Q9B;T9y`BkskGxJxQ-C+Ix8tDDdU^|e1oH> zFWgTT6irw&1(uD*=zcuSqV`w?@tNqYd@L8eb#}=T!oWpHd99IO!z*gN+RwY*tXueu zQTSQHaaiewu_PQj#Am2+?dl>f^%X*(STr)=6c_pm92!8q2I$lvhKq!bBBhS54RYE# zjt;ba84_HH>&3h-7J?_yu~&fAV$h+7ve?}D zK$$g5&z?6sN0RkGo6j+rKt!TA$LnE?PjEHv;19`QZr91y08EvjK#NFKlo=>1B6 zp~o)BUBDXgZ?XJg&TRZ!;Be9-I+omY+KDg?D%1vUX)Nf4~PL z#J_k&3R`#iDAXI*>6D)r`#Rpb@pMvTdB z-VliEYDBmSLu@pK>ub3bjFPJuvU+q6$rRYgU6otO$?3{FMBahcps9GWBhs0u>?Tzu zk{u{3;^M|w5tmMtNZ>wTT$D!~BOzTM7f`y!jd4_f=_=t$en~QfXYv8Vg*6>zesid#R*;6i6?jDZaC-U zJOGDh?!o_Y%r=xNw9p;KdQnVd{J0oS0Oi_BwCDJ1IXZ6O7#LKb{6h*Ph}NOU55`Mbzln0xQ{VL5|HMFJp7(Wq{uDR zAYmk!Q-e_I>!3`BUW=oE#HQdy*uMbIAWmJv|3b=fmQv@Txt(XhaRCP?Ir3Zu$bqwH zj6PdO#i$)7v$4+t=hzf<=n*Tt@`m9?g&gkmqHEV#D1RF`RcFC@1vqVI!Fd}v!L#5v zP=f=&ACd zKL_SOkJEWw2|A;|K`^PFL&)4W1x}^>$|=c3+zTzs!DA~WwL|^FDFLXKg%%LZJ1XT@ zMhVQV*HWH`ffrxMFP2gUn1Bv-6ZQQ*1O<-#`YFYUOQEF&|7Dak9J^63>hE;s+n9lY}rBOm?)l62^Y8A4CRwuxbS|wcyt&&cRhpJW5rO>K666tuVHfYWe+DODgaa`cQ z?Oy8K6UO~j^t@nDt*Nm}oLEN>-G9BC-3)<+t1efum|nP$rGh zcWCMDhx+j+)0q4cFHuIbf!EDC6B$!&6)&ukTBSBH9;#NO01K@W4vkpG<54hiKx2Z} z2aK6WshS@~TxcF^TvCy$c3I*{5OB_x8k<1#vC0i=*4M1#^A5KtUhYMdYEw&b2z`Wf z5GQ`7zC-2kQ~__FV}?>zR8g}-&BBE|MCUswi6+ZA%4C+a(@ zCK`YO_sJ)DbY8zRAg>6he$DINW1ciRe@t-%x@o_BR@gaxwFyS~RaB5vs;Yb_X zM>OcP5XHQ@b2^^u+K{93LL%o7Lr}`QXwO7(`B6=nDIOCyuo(q68X|GgQ z9KaF1$%R;+w=A{#KI90iL-$fTW7SoZa;Y)tG>gt&$AJ z zyOZ&-Jf0-el)Eu)kyG2 zrRZ!400_GZI5bvGYV*=sHfnS#j7*SH z`%bq;XL4%^0Y~(mf#g7PV&CuBLTXcz*~IEytwE@6q?HNx24!E~smX)=HT9)hy74j> z2ncy5pD(ThP7GDn?T{XC^Wnsgw<2R7L9`8ns}4yM1g8%9BtdY~h@hidovw{tXr$?{ z0$eID%RbfcHT9|^WCye%ti`G2sS&l62Z1B3g?d1qrzfp9sP!h}d_uI;apSKv&BOgk zcIR#|aF%}$d4t$&BW+A%354`bQXWL0fO-qwER5)J3}`y!RYb=m9Z~T@2$eP9ECj@b zn^5%@TnET;4WhP%kcTYlLm+i2=cxX@n-M^hkbAHy1re%ku~%yg@{Np#+7=IJZ9zE3 z9e*Z`YJKCOuKHbSTM)6lLzU-mGs9V(E z01`An{vRr3fIJIG8{R#xmwE+|eFn(y0C6~Tac01lg9b=BAg45lS*x`Fn%8qXLdg(B zZo_#ttp=xRWjS9w46TZh#0QGTL$%%)fFnkd0U$sTIfrU3Pid{wiD#E{5M;CtHKhZ$ z=Am^e@elRn9ZeF4dvp_cR)pRraj?Y-I`je`FwQwt9qzkGjsdYcD)m_ce z!#`!+sZFURMVtN*hG8CYs7=X77HzuL*jQ35(jjS1=+KFn8I9VVT3fXH->bXa8%b?@@aA4cb({((J40a<$& zMgjw*=Eu;10kV!}SqYKcvlq!;@UFNY01*S_wR=t6X-qKStQ#|NKQ%4x`%T>Un7BV{ z;{J$<`{`+Mf5^l=Y2yB*i95ZFMruQ99*-PwD@F^-5&NCA`vWHKQ4{yaP23+aakov2 z`#ux*4ik5pFJw)HWv;u|#GSsT0W`AScTx9yP26{wxbHV{zuUxp(X_aK#>BnF#GSl2 zW8Lw20Tm+K-8n7p_n5c`Ox*7^alh5Xy<%G2M@`&4Chqr`xF=2A>1!!KdzbBgmx=pE z6ZgAJ+&^UEzJ6NV?=*3*F>xmkA87h$ysq8E-8C)ldrjQw{vHFbnms1&+fCek)8am8 z;$Cjzo-}a}nz#q2#eI*7`(hLKsEK=>iTn0xai^7lLCmXR$ytYW~h?ao=v@{(^~nxrzIWChnut;@)E7 z{;Y}nViWhLP24{-E$#sm_s31#OHJJO|B1N!OxzzfaW67)zt_Zl-?ZxPF>&8-;(iA6 z8_;s*xV<`exd(e6N{O{qh&Ex>4;En3O}|4?`5&L9sJ0WS!bcc}Xt0n|(EZ}3&B0ZUz1{)<+3%3f~VlmX;^kUu8t zKG9B>`WXmq&B(bN$teW}I9>(hxJrjZW`dUr!MnQU*eiHZy|87Px96bha8TwH^6M9Z zJ|~Gk)7o<){m4C{A{0HF4z~kG=y39D3WtFs><14HEAnddGyW$=+aevapeSwMlL7lstcfJ6%iGE>jcXd2;{`uOp<`q@uiN;K+ z=X)SC*XrarmmgI1!^bGyE+}TI*Speul}cH)gthmYH2)g7a0ykMbxB?GvfV3Gt-dSn zD@@$)F>!yz#J%0by=q$AD@@$)GI9U0iF=)i`}%2dFE?@DYvTTbiTipJch|JIJ5Aha zTm?|~>uR1gaW6M<_f3oYViWhIiTjf#?u$*_gVW-^$izKr;{LdaJKbj{^&@S5`?R<( zFmdlNaevsvo!(7vs;Iz2EV&Yz8 z;@)E7PAgX9Xfrk~?#E5sX@A2o0@MUd+@CdZKRPY$KQ?iH)5P6l;{LFS`>|MByFqpl)zcuD&?uGRul7T%c<9opA=5;3= z+NU*k7d(L#R`9%)138piz|?QbI+n`aFi!91Br}8|4q%DHf?JBznNdK_0YtshCmP%JU)MbO4@#rxS3shuluqXeAatO@lJbjyIH6>{?*GMcTzDT8;XsE`B}88*R&_|_ zY2!il0R;CsfT$jkfLsEI`t+HAYyw2rv-)-6*wWm(UrnV9^27k4L&!t1I|+hD)gku* z;^6vm%6jbw;4$0FCc4vA62j%N}t_98@l&tIdT0op!W>J!{PC#fET&Fw$h`K8)bT|UYYleD#0T83i z{{+Y}1Fxq6p+m@{er?&gG*|QA1&+ECD0rO&WS`a+;w#LM&QR(M;TU)=#ZcslJ5;B~?M^4&bae=|L(;?Am0i?#j zO95nuL7qK;R2X<=0C50LDg`?*S^7>({ajD>wz;0B08ORKy(Qe1y8QyJ*{-;JuXg^4UjtkDK~Kc z5+JJQi3}W%0n&z$QUdaQK-9a=1mx#{1T~p~$bJh5W3C+T)Ou|OnH_+1U!1F-rGOY) zc|9QI01EEvH_wAhb9++|IAg%kwLyIJ6 zAdefk7c9t~@qx^rL44DIvjjMIX%Oxs!Fq$h6?Iq00idxC{YUo!HlkEiD@Bw)2*{X0 zKPf;;4Kfb_V)P+D0myc(?!527Lo?d^7lCsebnufJI|zul|3}r~5kQg#d7cMkRF*&n zj$Z;Yn9D0n-XI-%E58k#9~cxb07}^GH9^guK^O1vIv>K1qdB_fB&Tk@)jWKb2p+?AznB>U>H}=1*F>mSp&$v zi*rYST0jnH5CxwfrWe??8S1qSIQr}<-f)MR(SXwpoI%J;vIu!b0HK&(i!TF0hYmRe z$O}NyHTEJPr!~zh^2J6jl+r1`4xAQ)p8o(ym8Mn97tu%`Rsk2O?L}N?qO-SYI0QKt zkQnITCuM#=AjdRq5KapqEd~jrfauyFoR0yb?hTTZj6Dd5%fRcafNV#O=mk5a3nHFa zae{j%zD`3W*DuYL`6-k-0H~<@_mQgXh_t7=ln_2L+Jz7I$Yf7nXTKT`wYSG3JJnRQ z2OpG{SeifjdB1w9u8y0TOgq|`>r{G;^J@||22j^{0_7Yt-+}V_$Y2P+8&yStWaWqv?DSQj%kmEo5_i9-t(8S z^uZMK>MORGCW3}0z$GWwjN5}L^_rf(`aEUHcXaMzXVGF;UrIq8BKVwpf1mn@yNQi_ zpiRE`rq=D2F+XC8f|vj4-~17MO8`6Yktz9^Alc=F0&c$fW)$n_SGuD8?fC3^2faAn z0O7BaH;G~RWCtm=2fg*?NC)fPtwizK`klh?az0`&no)eop6`#B=VZz++)o0>=Vj@; zCcP1SnO8ym=*3}5SE4i26UC>(*p_Cc7GKng3?!Q(;r@6B0lcarCjbS-=iYfWrHxUw zsn$6rXR5N?xj=V_LYK0Hu)cVx2mM=ZnnbcS5sBC1%EBNFWUWv!wNyC&5 z$l4LnzA+C^)0kH4iPz(B+4%IXV9%#NzPl1{*GyJc!J-D5@hCLx1(k_K=&Jxq9G_#s zCk0R(-7rM;+J!zw+OOQOw)*lKQ@xa?R(z4E9$z$U_O^QHlVX9!TJhZ#`beK?)KaD> z0Ay;1%2Z#p=f+5Mw|sAFPMY5jsi)Q9zS-+jcuh6KS97@CMAZ9dsV?-vG}NW4dJT*8 zrWA39CB?-3s>;M2Nz%g`3`j-Fjgj5L*i~KTPt15L%Bq{Og`s4174!jwNx`VK0J+qd+?UP5zI}m|jzzKRashHwV zH1zk8iH6#v5r1E83g1uaOL7E_Zlo{Oi}{fEUOc@V$0wCADfGTumm$y3Ag96LOwgUh zIk%@XQ7L?K1D$~T6bgEea4K|Tn>t&NKo6dZ#MIf7@}_3iZ-+MbPCjpi!o3~QK7lA! zSf=TR%w~BN9!?=(Zj>A)#n% zA3jgh!I~q<);=*hbZCQqT~8D)qm+VrSU)M5Ylu`Wv?KsxSqaAEYH$Vc5l^_3%EV5K zqUe^7ng>FOBu09Sw4{dJ_!eJp3r1jf0%AlcCQXn=GPtI?H;K6{sl*a|q?XLl{u6n# znwu(iU&-4Hg;7Ne6FnGoNOSx9rUDdZ2G@3=%q@x@V|0Hhu<7 zw(`}f2tK@q=HXm>G_HD~9J`lI9O_MU!IQ!YK`$rvaq>#>SrKpC7uR}tg{bm;{Q=`5 ze@%(TYI{2Ze8nPLMw{n#YLm~PT$`Mr$wL*=!er!N+0um@t` z^u_=@x>T$VpLZiS#M_tT&83=FcO(=u*rFIK^d6(>(6Hd3Hsz~NA?ze?=?UK`rc4!CwI);J>j-Dl zv0e{h!<-~~XMe)bElFjQ4L@j=NZiynr&>LVD)CE&x}@0K4?#CQ#ucp`DW!Lerm79a z=nKBmB}ajTa8VWbGF^S-#Pe}Pt{HJLiT5+uexe^U91X+plRMa?qxwV*;KyfVRrQc2 zO+50lK%mF{6-G|F{bFl46Ck#}S6?7y)G zJD#~4AjCI!!Z-CNQ9GklR7kzZENYlHeWJHgj~2tv)Fz+jn{hpmIiOSY8hu^rc48OS zxT7dkm*bgE+&^>ME@vB++a6~oYJx7vFUIB#tvSPk-q&({|NNDrYVTr(%XND3aa`=6 zDV@M=4#GeE9uRrd4R^D2u%Ve zTxICdsQjd>Sn^#bb=*asxo)B@4BbJ9PEBf@b%Yf1Za2MgaC;u@lB#Paeh+|_oXX9Z iYSl22CvkRPi7KNjRP}&0VZ=7CIx!_RpCPZmvHt^z_P#a% From bfcdaf3905e7e1a9f53eb4e174a02c082ee907c5 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:48:56 +0530 Subject: [PATCH 125/290] Delete 1_activity_selec.cpp --- 1_activity_selec.cpp | 25 ------------------------- 1 file changed, 25 deletions(-) delete mode 100644 1_activity_selec.cpp diff --git a/1_activity_selec.cpp b/1_activity_selec.cpp deleted file mode 100644 index 5249862..0000000 --- a/1_activity_selec.cpp +++ /dev/null @@ -1,25 +0,0 @@ -#include -using namespace std; - -void activity_selection(vector u, vector v, int n) -{ - sort(v.begin(),v.end()); -} - -int main() -{ - vector start,end; - int n; - cin>>n; - - for(int i = 0; i>u>>v; - start.push_back(u); - end.push_back(v); - } - - activity_selection(u,v,n); - return 0; -} \ No newline at end of file From 5b9b4cc674cef64238691031f7687872fc4d1909 Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Wed, 12 Oct 2022 23:56:39 +0530 Subject: [PATCH 126/290] Create Linked-List-Cycle-Detection.cpp Linked list cycle detection using Floyd's process. --- Linked-List-Cycle-Detection.cpp | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 Linked-List-Cycle-Detection.cpp diff --git a/Linked-List-Cycle-Detection.cpp b/Linked-List-Cycle-Detection.cpp new file mode 100644 index 0000000..b9566d8 --- /dev/null +++ b/Linked-List-Cycle-Detection.cpp @@ -0,0 +1,16 @@ +class Solution { +public: + bool hasCycle(ListNode *head) { + ListNode *fast = head; + ListNode *slow = head; + + while(fast!=NULL && fast->next!=NULL){ + slow = slow->next; + fast = fast->next->next; + if(fast==slow){ + return true; + } + } + return false; + } +}; \ No newline at end of file From 2f76ffd4b8efe20f10a56f9622f7d21997a8c092 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Wed, 12 Oct 2022 23:59:09 +0530 Subject: [PATCH 127/290] Delete MaxDifferenceInArray.cpp --- MaxDifferenceInArray.cpp | 31 ------------------------------- 1 file changed, 31 deletions(-) delete mode 100644 MaxDifferenceInArray.cpp diff --git a/MaxDifferenceInArray.cpp b/MaxDifferenceInArray.cpp deleted file mode 100644 index d8ee6cd..0000000 --- a/MaxDifferenceInArray.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include -#include -using namespace std; - -int main(){ - int n; - cout << "Enter the number of elements in the given array: "; - //taking input - cin >> n; - int a[n]; - cout << "Enter the elements" << endl; - for (int i = 0; i < n; i++) - cin >> a[i]; - - //easy way to find the maximum difference between 2 - //elements in a given array is to find the difference - //between maximum and minimum elements in the array - - int min = a[0], max = a[0]; - //applying linear search to find minimum and maximum of the given array - for (int i = 1; i max) - max = a[i]; - } - - //printing the difference - cout << "The maximum difference between 2 elements in the given array is " << abs(max - min); - return 0; -} From 5cde5e32f30f98f360cddf510f44350486efbdf9 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Thu, 13 Oct 2022 00:03:10 +0530 Subject: [PATCH 128/290] Add files via upload --- 1_bfs.cpp | 45 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 45 insertions(+) create mode 100644 1_bfs.cpp diff --git a/1_bfs.cpp b/1_bfs.cpp new file mode 100644 index 0000000..2863aac --- /dev/null +++ b/1_bfs.cpp @@ -0,0 +1,45 @@ +#include +using namespace std; + + +void bfs(int g[][7],int i,int n) +{ + queueq; + int arr[7]={0}; + // start ka index 1 + arr[i]=1; + cout< Date: Thu, 13 Oct 2022 05:19:41 +0530 Subject: [PATCH 129/290] Kadane's Algorithm added by me c++ Kadane's Algorithm Code added --- kadaneAlgorithm.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 kadaneAlgorithm.cpp diff --git a/kadaneAlgorithm.cpp b/kadaneAlgorithm.cpp new file mode 100644 index 0000000..5b13005 --- /dev/null +++ b/kadaneAlgorithm.cpp @@ -0,0 +1,32 @@ +// Time Complexity = O(n) +/* + It calculates the maximum sum subarray ending at a particular position by using the maximum sum subarray ending at the previous position +*/ + +#include +using namespace std; + +int largestSubarraySum(int *arr, int n) +{ + int currentSum = 0; + int largestSum = 0; + for (int i = 0; i < n; i++) + { + currentSum += arr[i]; + if (currentSum < 0) // Does not calculates negative as it will only cause reduction in maximum sum + currentSum = 0; // Instead of -ve it adds 0 for it + largestSum = max(largestSum, currentSum); + } + + return largestSum; +} + +int main() +{ + system("CLS"); + int arr[] = {-10, 20, -30, 40, 50, 60, -70, 80, -90}; + int n = sizeof(arr) / sizeof(int); + cout << largestSubarraySum(arr, n); + + return 0; +} From 2464317c0f387ad0b468c3435cc7487b71ee1e40 Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Thu, 13 Oct 2022 07:21:01 +0530 Subject: [PATCH 130/290] 125-Valid-Palindrome Leetcode question number 125 (valid palindrome) --- 125-Valid-Palindrome.cpp | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 125-Valid-Palindrome.cpp diff --git a/125-Valid-Palindrome.cpp b/125-Valid-Palindrome.cpp new file mode 100644 index 0000000..a1c6689 --- /dev/null +++ b/125-Valid-Palindrome.cpp @@ -0,0 +1,31 @@ +class Solution { +public: + bool isPalindrome(string s) { + //checking and making the string + for(int i =0;i'Z')&&(s[i]<'a'|| s[i]>'z')&&(s[i]<'0' || s[i]>'9')){ + s.erase(i,1); + i--; + } + } + if(s.compare("")==0){ + return true; + } + //all small + for(int i =0;i Date: Thu, 13 Oct 2022 07:28:03 +0530 Subject: [PATCH 131/290] 136-Single-number detect Single number in array using bitwise xor operator. --- 136-Single-number.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 136-Single-number.cpp diff --git a/136-Single-number.cpp b/136-Single-number.cpp new file mode 100644 index 0000000..dd4d11f --- /dev/null +++ b/136-Single-number.cpp @@ -0,0 +1,13 @@ +#include +class Solution { +public: + int singleNumber(vector& nums) { + + int xorresult = 0; + for(int i =0;i Date: Thu, 13 Oct 2022 07:32:07 +0530 Subject: [PATCH 132/290] Revert "136-Single-number" This reverts commit b55037f4c7cb51b4bb19fd39463cfec17006f825. --- 136-Single-number.cpp | 13 ------------- 1 file changed, 13 deletions(-) delete mode 100644 136-Single-number.cpp diff --git a/136-Single-number.cpp b/136-Single-number.cpp deleted file mode 100644 index dd4d11f..0000000 --- a/136-Single-number.cpp +++ /dev/null @@ -1,13 +0,0 @@ -#include -class Solution { -public: - int singleNumber(vector& nums) { - - int xorresult = 0; - for(int i =0;i Date: Thu, 13 Oct 2022 07:34:25 +0530 Subject: [PATCH 133/290] Single-Number.cpp Leetcode question number 136 using bitwise xor operator --- Single-Number.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 Single-Number.cpp diff --git a/Single-Number.cpp b/Single-Number.cpp new file mode 100644 index 0000000..8ddd4b2 --- /dev/null +++ b/Single-Number.cpp @@ -0,0 +1,13 @@ +#include +class Solution { +public: + int singleNumber(vector& nums) { + //approach 1 + int xorresult = 0; + for(int i =0;i Date: Thu, 13 Oct 2022 07:46:25 +0530 Subject: [PATCH 134/290] single number Leetcode question no. 136 using bitwise xor operator --- Single-Number.cpp => single_number.cpp | 1 - 1 file changed, 1 deletion(-) rename Single-Number.cpp => single_number.cpp (92%) diff --git a/Single-Number.cpp b/single_number.cpp similarity index 92% rename from Single-Number.cpp rename to single_number.cpp index 8ddd4b2..d1ff669 100644 --- a/Single-Number.cpp +++ b/single_number.cpp @@ -2,7 +2,6 @@ class Solution { public: int singleNumber(vector& nums) { - //approach 1 int xorresult = 0; for(int i =0;i Date: Thu, 13 Oct 2022 08:35:05 +0530 Subject: [PATCH 135/290] Create Trapping Rain Water.cpp --- Trapping Rain Water.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Trapping Rain Water.cpp diff --git a/Trapping Rain Water.cpp b/Trapping Rain Water.cpp new file mode 100644 index 0000000..58bdee6 --- /dev/null +++ b/Trapping Rain Water.cpp @@ -0,0 +1,18 @@ +class Solution { // 4 ms, faster than 89.31% +public: + int trap(vector& height) { + int n = height.size(); + vector leftMax(n), rightMax(n); + for (int i = 1; i < n; ++i) + leftMax[i] = max(height[i-1], leftMax[i-1]); + for (int i = n-2; i >= 0; --i) + rightMax[i] = max(height[i+1], rightMax[i+1]); + + int ans = 0; + for (int i = 0; i < n; ++i) { + int waterLevel = min(leftMax[i], rightMax[i]); + if (waterLevel >= height[i]) ans += waterLevel - height[i]; + } + return ans; + } +}; From 09033df09e586d922f44965d54abad3c13fc5df2 Mon Sep 17 00:00:00 2001 From: Arin Agarwal Date: Thu, 13 Oct 2022 10:34:09 +0530 Subject: [PATCH 136/290] Add files via upload --- 4_prims.cpp | 43 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 4_prims.cpp diff --git a/4_prims.cpp b/4_prims.cpp new file mode 100644 index 0000000..601cce3 --- /dev/null +++ b/4_prims.cpp @@ -0,0 +1,43 @@ +#include +#define I INT_MAX +#define V 8 +using namespace std; + +void prime_mst(int cost[][V], int n) +{ + int u, v, i, j, k, min = I; + vector near; + for (i = 1; i <= n; i++) + { + for (j = i; j <= n; j++) + { + if (cost[i][j] < min) + { + u = i; + v = j; + } + } + } + + +} + +int main() +{ + + int cost[V][V]{ + {I, I, I, I, I, I, I, I}, + {I, I, 25, I, I, I, 5, I}, + {I, 25, I, 12, I, I, I, 10}, + {I, I, 12, I, 8, I, I, I}, + {I, I, I, 8, I, 16, I, 14}, + {I, I, I, I, 16, I, 20, 18}, + {I, 5, I, I, I, 20, I, I}, + {I, I, 10, I, 14, 18, I, I}, + }; + + int n = sizeof(cost[0]) / sizeof(cost[0][0]) - 1; + + prime_mst(cost, n); + return 0; +} \ No newline at end of file From d1e975793358d02b4acb78024026f599dfa227da Mon Sep 17 00:00:00 2001 From: Rahul Verma <33773797+vrintle@users.noreply.github.com> Date: Thu, 13 Oct 2022 12:21:47 +0530 Subject: [PATCH 137/290] Create Number of Pairs Satisfying Inequality.cpp Added solution to LeetCode 2426. Number of Pairs Satisfying Inequality (Hard) --- Number of Pairs Satisfying Inequality.cpp | 73 +++++++++++++++++++++++ 1 file changed, 73 insertions(+) create mode 100644 Number of Pairs Satisfying Inequality.cpp diff --git a/Number of Pairs Satisfying Inequality.cpp b/Number of Pairs Satisfying Inequality.cpp new file mode 100644 index 0000000..04126f8 --- /dev/null +++ b/Number of Pairs Satisfying Inequality.cpp @@ -0,0 +1,73 @@ +// Problem: https://leetcode.com/contest/biweekly-contest-88/problems/number-of-pairs-satisfying-inequality/ +// Author: vrintle +// Category: LeetCode Hard + +/* + +Problem statement +----------------- + +You are given two 0-indexed integer arrays nums1 and nums2, each of size n, and an integer diff. Find the number of pairs (i, j) such that: + +0 <= i < j <= n - 1 and +nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff. +Return the number of pairs that satisfy the conditions. + +*/ + +template +class segtree { + public: + vector t; + int n; + T def; + function fx; + void build(int _n, T _def, function _fx) { + n = _n, def = _def, fx = _fx; + t.assign(n * 2, def); + for(int i = n - 1; i; i--) t[i] = fx(t[i * 2], t[i * 2 + 1]); + } + void build(vector& a, T _def, function _fx) { + n = a.size(), def = _def, fx = _fx; + t.assign(n * 2, def); + for(int i = 0; i < n; i++) t[i + n] = a[i]; + for(int i = n - 1; i; i--) t[i] = fx(t[i * 2], t[i * 2 + 1]); + } + void update(int i, T v) { + for(t[i += n] += v; i > 1; ) { + i /= 2; + t[i] = fx(t[i * 2], t[i * 2 + 1]); + } + } + // this query is made on [l, r) + T query(int l, int r) { + T lans = def, rans = def; + for(l += n, r += n; l < r; l /= 2, r /= 2) { + if(l % 2) lans = fx(lans, t[l++]); + if(r % 2) rans = fx(t[--r], rans); + } + return fx(lans, rans); + } +}; + +class Solution { +public: + long long numberOfPairs(vector& nums1, vector& nums2, int diff) { + int n = nums1.size(), N = 1e5; + vector a(n); + auto E = [&](int x) { + return x + N / 2; + }; + segtree Sum; + Sum.build(N, 0, [&](int x, int y) { + return x + y; + }); + long long ans = 0; + for(int i = 0; i < n; i++) { + a[i] = nums1[i] - nums2[i]; + ans += Sum.query(0, E(a[i] + diff) + 1); + Sum.update(E(a[i]), 1); + } + return ans; + } +}; From 3406bd6e7316d56b14b9210169edb02af6720ef3 Mon Sep 17 00:00:00 2001 From: developerayuva Date: Thu, 13 Oct 2022 12:43:23 +0530 Subject: [PATCH 138/290] Added two pointer approach in two sum problem --- two sum.cpp | 42 +++++++++++++++++++++++++++++++++++++++++- 1 file changed, 41 insertions(+), 1 deletion(-) diff --git a/two sum.cpp b/two sum.cpp index e17336c..e0cb799 100644 --- a/two sum.cpp +++ b/two sum.cpp @@ -1,4 +1,7 @@ -https://leetcode.com/problems/two-sum/ +// Link for problem +https://leetcode.com/problems/two-sum/ + +// Map based approach class Solution { public: vector twoSum(vector& nums, int target) { @@ -9,4 +12,41 @@ class Solution { } return{}; } +}; + +// Two pointer based approach +// Time Complexity - O(nlogn) +class Solution { +public: + vector twoSum(vector& nums, int target) { + int n=nums.size(); + vector ans; + + vector> arr(n); + for(int i=0;itarget) + --j; + // If sum of elements at i and j is smaller than the target then we have to increase the ith element + else + ++i; + } + + return ans; + } }; \ No newline at end of file From ae33bd8a9dc079eaf70bc6984ddb71b310dae4e4 Mon Sep 17 00:00:00 2001 From: Abhaysharmaa23 <113036363+Abhaysharmaa23@users.noreply.github.com> Date: Thu, 13 Oct 2022 12:54:21 +0530 Subject: [PATCH 139/290] table_program Sir, I want to contribute to your repository please add my code --- table_program | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 table_program diff --git a/table_program b/table_program new file mode 100644 index 0000000..6bd8ebd --- /dev/null +++ b/table_program @@ -0,0 +1,13 @@ +#include +int main() +{ + printf("Table Program (Using Loop) \n\n\n"); + printf("Enter A Number That You want the Table : \n"); + int num; + scanf("%d", &num); + + for (int i = 1; i <= 10; i++) + { + printf("%d * %d = %d \n", num, i, num * i); + } +} From ea1796d6ed6389a2eccceeb6c0828e0c71c1da59 Mon Sep 17 00:00:00 2001 From: developerayuva Date: Thu, 13 Oct 2022 13:10:22 +0530 Subject: [PATCH 140/290] Added Sieve approach in prime or not problem --- prime-or-not.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) diff --git a/prime-or-not.cpp b/prime-or-not.cpp index 86f7617..9a857cd 100644 --- a/prime-or-not.cpp +++ b/prime-or-not.cpp @@ -39,3 +39,35 @@ int main() return 0; } + + +// Efficient approach based on Sieve of Eratosthenes to check for multiple numbers if they are prime or not +vector sieve; +void prime(int n){ + sieve.resize(n+1,true); + sieve[0]=sieve[1]=false; + for(int i=2;(long long)i*i<=n;++i){ + if(sieve[i]) + for(int j=i*i;j<=n;j+=i) + sieve[j]=false; + } +} + +int main{ + cout<<"Enter total numbers you wanted to check for prime: "; + int t; + cin>>t; + + // Initialise the sieve upto the maximum number + prime(100005); + while(t--){ + int n; + cin>>n; + if(sieve[n]==true) + cout<<"Number "< Date: Thu, 13 Oct 2022 13:20:57 +0530 Subject: [PATCH 141/290] Create Sum of Prefix Scores of Strings.cpp Added solution to 2416. Sum of Prefix Scores of Strings --- Sum of Prefix Scores of Strings.cpp | 61 +++++++++++++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 Sum of Prefix Scores of Strings.cpp diff --git a/Sum of Prefix Scores of Strings.cpp b/Sum of Prefix Scores of Strings.cpp new file mode 100644 index 0000000..459f4cc --- /dev/null +++ b/Sum of Prefix Scores of Strings.cpp @@ -0,0 +1,61 @@ +// Problem: https://leetcode.com/contest/weekly-contest-311/problems/sum-of-prefix-scores-of-strings/ +// Author: vrintle +// Category: LeetCode Hard + +/* + +Problem statement +----------------- + +You are given an array words of size n consisting of non-empty strings. + +We define the score of a string word as the number of strings words[i] such that word is a prefix of words[i]. + +For example, if words = ["a", "ab", "abc", "cab"], then the score of "ab" is 2, since "ab" is a prefix of both "ab" and "abc". +Return an array answer of size n where answer[i] is the sum of scores of every non-empty prefix of words[i]. + +Note that a string is considered as a prefix of itself. + +*/ + +struct Trie { + map mp; + int cnt; + Trie() { + cnt = 0; + } +}; + +class Solution { +public: + vector sumPrefixScores(vector& words) { + Trie *root = new Trie(); + int n = words.size(); + for(int i = 0; i < n; i++) { + Trie *t = root; + for(auto& e: words[i]) { + if(t->mp.find(e) == t->mp.end()) { + t->mp[e] = new Trie(); + } + t = t->mp[e]; + } + t->cnt++; + } + function dfs = [&](Trie *t) { + for(auto& e: t->mp) { + t->cnt += dfs(e.second); + } + return t->cnt; + }; + dfs(root); + vector ans(n); + for(int i = 0; i < n; i++) { + Trie *t = root; + for(auto& e: words[i]) { + t = t->mp[e]; + ans[i] += t->cnt; + } + } + return ans; + } +}; From 0d4e3ed573c740184c12224b99a6865fd56da80c Mon Sep 17 00:00:00 2001 From: Javesshhh Date: Thu, 13 Oct 2022 13:46:50 +0530 Subject: [PATCH 142/290] leetcode gfg contribution --- GFG-Sets_Problem.cpp | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 GFG-Sets_Problem.cpp diff --git a/GFG-Sets_Problem.cpp b/GFG-Sets_Problem.cpp new file mode 100644 index 0000000..fbb5121 --- /dev/null +++ b/GFG-Sets_Problem.cpp @@ -0,0 +1,39 @@ +//Given two arrays A and B contains integers of size N and M, the task is to find numbers +// which are present in the first array, but not present in the second array. +// Example 1: + +// Input: N = 6, M = 5 +// A[] = {1, 2, 3, 4, 5, 10} +// B[] = {2, 3, 1, 0, 5} +// Output: 4 10 +// Explanation: 4 and 10 are present in +// first array, but not in second array. + +// Constraints: +// 1 ≤ N, M ≤ 10^6 +// -10^6 ≤ A[i], B[i] ≤ 10^6 + +#include +using namespace std; + +int main() { + int n,m; + cin>>n>>m; + int arr1[n]; + int arr2[m]; + for(int i=0;i>arr1[i]; + for(int i=0;i>arr2[i]; + unordered_set s; + for (int i = 0; i < m; i++) + s.insert(arr2[i]); + for (int i = 0; i < n; i++) + if (s.find(arr1[i]) == s.end()) + cout << arr1[i] << " "; +// Agr element set me nahi hota hai to set ka end point return krdeta hai +// Aur agr element hota hai to wo s.end ke equal nahi hoga wo us element ka pointer dedega +// s.find(element) returns an iterator pointing to the element, if the iterator reaches s.end() +// that means if it reaches the end of set s, which actually means that the element is not in the set +// and we had reached the end searching the whole set, then cout< Date: Thu, 13 Oct 2022 14:02:18 +0530 Subject: [PATCH 143/290] Adds leetcode solutions --- 1232. Check If It Is a Straight Line.cpp | 13 +++++++++ 1338. Reduce Array Size to The Half.cpp | 17 +++++++++++ 1539. Kth Missing Positive Number.cpp | 15 ++++++++++ 21. Merge Two Sorted Lists.cpp | 23 +++++++++++++++ 234. Palindrome Linked List.cpp | 28 +++++++++++++++++++ 274. H-Index.cpp | 13 +++++++++ 326. Power of Three.cpp | 9 ++++++ 342. Power of Four.cpp | 6 ++++ ...it Array into Consecutive Subsequences.cpp | 19 +++++++++++++ ...gest Continuous Increasing Subsequence.cpp | 19 +++++++++++++ 804. Unique Morse Code Words.cpp | 13 +++++++++ 871. Minimum Number of Refueling Stops.cpp | 17 +++++++++++ 88. Merge Sorted Array.cpp | 12 ++++++++ 936. Stamping The Sequence.cpp | 26 +++++++++++++++++ 14 files changed, 230 insertions(+) create mode 100644 1232. Check If It Is a Straight Line.cpp create mode 100644 1338. Reduce Array Size to The Half.cpp create mode 100644 1539. Kth Missing Positive Number.cpp create mode 100644 21. Merge Two Sorted Lists.cpp create mode 100644 234. Palindrome Linked List.cpp create mode 100644 274. H-Index.cpp create mode 100644 326. Power of Three.cpp create mode 100644 342. Power of Four.cpp create mode 100644 659. Split Array into Consecutive Subsequences.cpp create mode 100644 674. Longest Continuous Increasing Subsequence.cpp create mode 100644 804. Unique Morse Code Words.cpp create mode 100644 871. Minimum Number of Refueling Stops.cpp create mode 100644 88. Merge Sorted Array.cpp create mode 100644 936. Stamping The Sequence.cpp diff --git a/1232. Check If It Is a Straight Line.cpp b/1232. Check If It Is a Straight Line.cpp new file mode 100644 index 0000000..dcb56c8 --- /dev/null +++ b/1232. Check If It Is a Straight Line.cpp @@ -0,0 +1,13 @@ +class Solution { +public: + bool checkStraightLine(vector>& a) { + int i, n, val, x, y; + n = a.size(); + x = a[1][0] - a[0][0]; + y = a[1][1] - a[0][1]; + for(i=0; i& a) { + int i, n=a.size(), size=n, ans=1; + unordered_map mp; + priority_queue> pq; + for(auto x: a) mp[x]++; + for(auto x: mp) { + pq.push({x.second, x.first}); + } + while(size-pq.top().first > (n/2)) { + size -= pq.top().first; pq.pop(); + ans++; + } + return ans; + } +}; \ No newline at end of file diff --git a/1539. Kth Missing Positive Number.cpp b/1539. Kth Missing Positive Number.cpp new file mode 100644 index 0000000..22c4e4b --- /dev/null +++ b/1539. Kth Missing Positive Number.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + int findKthPositive(vector& a, int k) { + int i,n=a.size(),ans; + unordered_map A; + for(i=0;ival < b->val) { + temp->next = a; + a = a->next; + temp = temp->next; + } + else { + temp->next = b; + b = b->next; + temp = temp->next; + } + } + if(a) temp->next = a; + if(b) temp->next = b; + return dummy->next; + } +}; \ No newline at end of file diff --git a/234. Palindrome Linked List.cpp b/234. Palindrome Linked List.cpp new file mode 100644 index 0000000..7cfa4da --- /dev/null +++ b/234. Palindrome Linked List.cpp @@ -0,0 +1,28 @@ +class Solution { +public: + ListNode *reverse(ListNode *head){ + ListNode *curr=head, *next=NULL, *prev=NULL; + while(curr){ + next=curr->next; + curr->next=prev; + prev=curr; + curr=next; + } + return head=prev; + } + bool isPalindrome(ListNode* head) { + ListNode *curr=head, *slow=head, *fast=head; + while(fast->next && fast->next->next) { + slow=slow->next; + fast=fast->next->next; + } + slow->next=reverse(slow->next); + slow=slow->next; + while(slow){ + if(slow->val != curr->val) return 0; + slow=slow->next; + curr=curr->next; + } + return 1; + } +}; \ No newline at end of file diff --git a/274. H-Index.cpp b/274. H-Index.cpp new file mode 100644 index 0000000..4295b56 --- /dev/null +++ b/274. H-Index.cpp @@ -0,0 +1,13 @@ +class Solution { +public: + int hIndex(vector& a) { + int lo = 0, hi = a.size() - 1, mid; + sort(a.begin(), a.end()); + while(lo <= hi) { + mid = (lo + hi) >> 1; + if(a[mid] < a.size() - mid) lo = mid + 1; + else hi = mid - 1; + } + return a.size() - lo; + } +}; diff --git a/326. Power of Three.cpp b/326. Power of Three.cpp new file mode 100644 index 0000000..ca1435e --- /dev/null +++ b/326. Power of Three.cpp @@ -0,0 +1,9 @@ +class Solution { +public: + bool isPowerOfThree(int n) { + if(n<=0) return 0; + return ((1162261467%n) == 0); + } +}; + + diff --git a/342. Power of Four.cpp b/342. Power of Four.cpp new file mode 100644 index 0000000..512bcbc --- /dev/null +++ b/342. Power of Four.cpp @@ -0,0 +1,6 @@ +class Solution { +public: + bool isPowerOfFour(int n) { + return ((n > 0) && ((n&(n-1)) == 0) && (n%3 == 1)); + } +}; \ No newline at end of file diff --git a/659. Split Array into Consecutive Subsequences.cpp b/659. Split Array into Consecutive Subsequences.cpp new file mode 100644 index 0000000..c079d9a --- /dev/null +++ b/659. Split Array into Consecutive Subsequences.cpp @@ -0,0 +1,19 @@ +class Solution { +public: + bool isPossible(vector& a) { + unordered_map mp; + for(auto x: a) mp[x]++; + for(auto x: a) { + if(mp[x] == 0) continue; + int freq = mp[x], count = 0, currElement = x; + while(mp.count(currElement) && mp[currElement] >= freq) { + freq = max( freq, mp[currElement]); + mp[currElement]--; + currElement++; + count++; + } + if(count < 3) return 0; + } + return 1; + } +}; \ No newline at end of file diff --git a/674. Longest Continuous Increasing Subsequence.cpp b/674. Longest Continuous Increasing Subsequence.cpp new file mode 100644 index 0000000..27e3d93 --- /dev/null +++ b/674. Longest Continuous Increasing Subsequence.cpp @@ -0,0 +1,19 @@ +class Solution { +public: + int findLengthOfLCIS(vector& nums) { + int prev=INT_MIN, cnt=0, ans=0; + for(auto x: nums) { + if(x > prev) { + cnt++; + ans = max(ans, cnt); + prev=x; + } + else { + cnt=1; + ans=max(ans, cnt); + prev=x; + } + } + return ans; + } +}; \ No newline at end of file diff --git a/804. Unique Morse Code Words.cpp b/804. Unique Morse Code Words.cpp new file mode 100644 index 0000000..45be310 --- /dev/null +++ b/804. Unique Morse Code Words.cpp @@ -0,0 +1,13 @@ +class Solution { +public: + int uniqueMorseRepresentations(vector& words) { + vector A = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."}; + unordered_set st; + for(auto x : words) { + string str = ""; + for(auto ch : x) str += A[ch - 'a']; + st.insert(str); + } + return st.size(); + } +}; \ No newline at end of file diff --git a/871. Minimum Number of Refueling Stops.cpp b/871. Minimum Number of Refueling Stops.cpp new file mode 100644 index 0000000..f4e6d94 --- /dev/null +++ b/871. Minimum Number of Refueling Stops.cpp @@ -0,0 +1,17 @@ +class Solution { +public: + int minRefuelStops(int target, int startFuel, vector>& stations) { + int i=0, ans=0; + priority_queue pq; + while(startFuel < target) { + while(i < stations.size() && stations[i][0] <= startFuel) { + pq.push(stations[i][1]); + i++; + } + if(pq.size()==0) return -1; + startFuel += pq.top(); pq.pop(); + ans++; + } + return ans; + } +}; \ No newline at end of file diff --git a/88. Merge Sorted Array.cpp b/88. Merge Sorted Array.cpp new file mode 100644 index 0000000..6053fae --- /dev/null +++ b/88. Merge Sorted Array.cpp @@ -0,0 +1,12 @@ +class Solution { +public: + void merge(vector& a, int m, vector& b, int n) { + int ind = m + n - 1, i = m - 1, j = n - 1; + while(i >= 0 && j >= 0) { + if(a[i] >= b[j]) a[ind--] = a[i--]; + else a[ind--] = b[j--]; + } + while(i >= 0) a[ind--] = a[i--]; + while(j >= 0) a[ind--] = b[j--]; + } +}; \ No newline at end of file diff --git a/936. Stamping The Sequence.cpp b/936. Stamping The Sequence.cpp new file mode 100644 index 0000000..7ed7117 --- /dev/null +++ b/936. Stamping The Sequence.cpp @@ -0,0 +1,26 @@ +class Solution { +public: + vector movesToStamp(string stamp, string target) { + vector res; + int n = stamp.size(), total = 0; + while (true) { + bool isStamped = false; + for (int size = n; size > 0; --size) { + for (int i = 0; i <= n - size; ++i) { + string t = string(i, '*') + stamp.substr(i, size) + string(n - size - i, '*'); + auto pos = target.find(t); + while (pos != string::npos) { + res.push_back(pos); + isStamped = true; + total += size; + fill(begin(target) + pos, begin(target) + pos + n, '*'); + pos = target.find(t); + } + } + } + if (!isStamped) break; + } + reverse(res.begin(), res.end()); + return total == target.size() ? res : vector(); + } +}; \ No newline at end of file From 186fd36cfc0d1e50063b8d7b4e7646c181833091 Mon Sep 17 00:00:00 2001 From: developerayuva Date: Thu, 13 Oct 2022 17:09:56 +0530 Subject: [PATCH 144/290] Added solution for Edit distance problem in three approach in c++ --- 72._Edit_Distance.cpp | 99 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 99 insertions(+) create mode 100644 72._Edit_Distance.cpp diff --git a/72._Edit_Distance.cpp b/72._Edit_Distance.cpp new file mode 100644 index 0000000..0cb7e97 --- /dev/null +++ b/72._Edit_Distance.cpp @@ -0,0 +1,99 @@ +// Problem Link +// https://leetcode.com/problems/edit-distance/ + +// Recursion based approach +class Solution { +public: + + int editDis(string& word1, string& word2, int n1, int n2) + { + if(n1 == 0) + return n2; + if(n2 == 0) + return n1; + if(word1[n1-1] == word2[n2-1]) { + return editDis(word1, word2, n1-1, n2-1); + } + + return 1+min(editDis(word1, word2, n1, n2-1), + min(editDis(word1, word2, n1-1, n2), + editDis(word1, word2, n1-1, n2-1))); + } + + int minDistance(string word1, string word2) { + int n1 = word1.size(); + int n2 = word2.size(); + return editDis(word1, word2, n1, n2); + + } +}; + +// DP tabulation based approach +class Solution { +public: + int minDistance(string word1, string word2) { + int n=word1.length(); + int m=word2.length(); + vector> dp(n+1,vector(m+1,0)); + + for(int i=0;i<=m;++i) + dp[0][i]=i; + for(int i=0;i<=n;++i) + dp[i][0]=i; + + for(int i=1;i<=n;++i){ + for(int j=1;j<=m;++j){ + if(word1[i-1]==word2[j-1]) + dp[i][j]=dp[i-1][j-1]; + else + dp[i][j]=1+min({dp[i-1][j],dp[i-1][j-1],dp[i][j-1]}); + } + } + + return dp[n][m]; + } +}; + +// DP memoization based approach +class Solution { +public: + int dp[1001][1001]; + + int editDis(string& word1, string& word2, int n1, int n2) + { + if(n1 == 0) + return n2; + if(n2 == 0) + return n1; + + if(dp[n1][n2] !=-1) + { + return dp[n1][n2]; + } + + if(word1[n1-1] == word2[n2-1]) { + dp[n1][n2] = editDis(word1, word2, n1-1, n2-1); + return dp[n1][n2]; + } + + dp[n1][n2]= 1+min(editDis(word1, word2, n1, n2-1), + min(editDis(word1, word2, n1-1, n2), + editDis(word1, word2, n1-1, n2-1))); + return dp[n1][n2]; + } + + int minDistance(string word1, string word2) { + int n1 = word1.size(); + int n2 = word2.size(); + for(int i=0;i<=n1+1;i++) + { + for(int j=0;j<=n2+1;j++) + { + dp[i][j] = -1; + } + } + + dp[n1][n2] = editDis(word1, word2, n1, n2); + return dp[n1][n2]; + } +}; \ No newline at end of file From 930aaf2b1395612d91e298ed5cd488a4a025f2a1 Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Thu, 13 Oct 2022 17:27:55 +0530 Subject: [PATCH 145/290] 136-single-number Leetcode question no. 136 using bit wise xor operator --- single_number.cpp => 136-single-number | 1 + 1 file changed, 1 insertion(+) rename single_number.cpp => 136-single-number (92%) diff --git a/single_number.cpp b/136-single-number similarity index 92% rename from single_number.cpp rename to 136-single-number index d1ff669..8ddd4b2 100644 --- a/single_number.cpp +++ b/136-single-number @@ -2,6 +2,7 @@ class Solution { public: int singleNumber(vector& nums) { + //approach 1 int xorresult = 0; for(int i =0;i Date: Thu, 13 Oct 2022 17:33:40 +0530 Subject: [PATCH 146/290] 88-Merge-Sorted-Array leetcode question 88 using resize() function and inbuilt sort() function. --- 88-Merge-Sorted-Array.cpp | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 88-Merge-Sorted-Array.cpp diff --git a/88-Merge-Sorted-Array.cpp b/88-Merge-Sorted-Array.cpp new file mode 100644 index 0000000..050fa86 --- /dev/null +++ b/88-Merge-Sorted-Array.cpp @@ -0,0 +1,10 @@ +class Solution { +public: + void merge(vector& nums1, int m, vector& nums2, int n) { + nums1.resize(m); + for(int i =0;i Date: Thu, 13 Oct 2022 19:25:41 +0530 Subject: [PATCH 147/290] Add files via upload --- korasuls_strongly_connected.cpp | 98 +++++++++++++++++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 korasuls_strongly_connected.cpp diff --git a/korasuls_strongly_connected.cpp b/korasuls_strongly_connected.cpp new file mode 100644 index 0000000..3f00da5 --- /dev/null +++ b/korasuls_strongly_connected.cpp @@ -0,0 +1,98 @@ +#include +using namespace std; + + +void topo_dfss(int it, vector adj[],stack &st,vector&vis) +{ + vis[it] = 1; + + for(auto i : adj[it]){ + if(!vis[i]) + topo_dfss(i,adj,st,vis); + } + + st.push(it); +} + +void topo_dfs(vector adj[],vector &topo,int n) +{ + stack st; + vector vis(n,0); + + for(int i =0; i adj[],vector&t,vector &vt) +{ + t[it] = 1; + + for(auto i : adj[it]){ + if(!t[i]) + dfs(i,adj,t,vt); + } + + vt.push_back(it); +} + +void kos(vector adj[],vectortopo, int n, vector &strong) +{ + vector t(n,0); + vector transpose[n]; + + for(int i = 0; i topo) +{ + int n = topo.size(); + + for (int i = 0; i < n; i++) + { + cout<>n>>v; + vector adj[n]; + + for(int i = 0; i>u>>V; + adj[u].push_back(V); + } + + // step 1 -> topo sort pehle + vector topo,strong; + topo_dfs(adj,topo,n); + print(topo); + // step 2 do dfs acc to topo sort + kos(adj,topo,n,strong); + print(strong); + + return 0; +} \ No newline at end of file From 545f6dba04c0b3cfb3f67d14e93260f38195a0f7 Mon Sep 17 00:00:00 2001 From: Sam0204 <97906758+Sam0204@users.noreply.github.com> Date: Thu, 13 Oct 2022 19:59:26 +0530 Subject: [PATCH 148/290] Goal Parser --- Goal Parser.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Goal Parser.cpp diff --git a/Goal Parser.cpp b/Goal Parser.cpp new file mode 100644 index 0000000..bf652f6 --- /dev/null +++ b/Goal Parser.cpp @@ -0,0 +1,26 @@ +class Solution { +public: + string interpret(string command) { + + string result; + for(int i=0;i Date: Thu, 13 Oct 2022 20:02:48 +0530 Subject: [PATCH 149/290] Added Tower of Honoi --- tower_of_honoi.java | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 tower_of_honoi.java diff --git a/tower_of_honoi.java b/tower_of_honoi.java new file mode 100644 index 0000000..d8de481 --- /dev/null +++ b/tower_of_honoi.java @@ -0,0 +1,26 @@ +// Java recursive program to solve tower of hanoi puzzle + +class Codespeedy +{ + + static void result(long n, char source, char destination, char auxiliary) + { + if (n == 1) + { + System.out.println("Move disk 1 from " + source + " to " + destination); // print the task + return; + } + + result(n-1, source, auxiliary, destination); + + System.out.println("Move disk " + n + " from " + source + " to " + destination); // print the task + + result(n-1, auxiliary, destination, source); + } + + + public static void main(String args[]) + { + long n = 3; // Number of disks + result(n,'A','C','B'); // A, B and C are names of rods + } } \ No newline at end of file From 1ca651562b0fa55a20babe6cf8a148b0323667ef Mon Sep 17 00:00:00 2001 From: Arun G Nayak <84305637+Arun9739@users.noreply.github.com> Date: Thu, 13 Oct 2022 20:13:11 +0530 Subject: [PATCH 150/290] Create FindCustomerReferee.sql --- FindCustomerReferee.sql | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 FindCustomerReferee.sql diff --git a/FindCustomerReferee.sql b/FindCustomerReferee.sql new file mode 100644 index 0000000..b39d760 --- /dev/null +++ b/FindCustomerReferee.sql @@ -0,0 +1,10 @@ +# MySQL query for problem of Finding Customer Referee + +# Problem link : https://leetcode.com/problems/find-customer-referee/ + +SELECT name +From Customer +WHERE id NOT IN (SELECT id + WHERE referee_id = 2); + + From 2fb6c3ffed297183359b2e14f9fbe63458fc714b Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Thu, 13 Oct 2022 20:53:12 +0530 Subject: [PATCH 151/290] 1-two-sums leetcode question no. 1 using vector and iteration. Time: 1055 ms (6.00%), Space: 10.3 MB (58.79%) --- 1-two-sums.cpp | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 1-two-sums.cpp diff --git a/1-two-sums.cpp b/1-two-sums.cpp new file mode 100644 index 0000000..cc3d391 --- /dev/null +++ b/1-two-sums.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + vector twoSum(vector& nums, int target) { + vectorresult; + for(int i =0;i Date: Thu, 13 Oct 2022 20:57:36 +0530 Subject: [PATCH 152/290] Create SalesPerson.sql --- SalesPerson.sql | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 SalesPerson.sql diff --git a/SalesPerson.sql b/SalesPerson.sql new file mode 100644 index 0000000..e3ce506 --- /dev/null +++ b/SalesPerson.sql @@ -0,0 +1,10 @@ +# MySQL query to the problem of Sales Person + +# Problem link : https://leetcode.com/problems/sales-person/ + + +SELECT name +FROM SalesPerson +Where sales_id NOT IN (SELECT a.sales_id + FROM Orders a JOIN Company b on a.com_id = b.com_id + WHERE b.name = 'RED') From 49654763c88032101d85f1cc862fbb50dc48fcff Mon Sep 17 00:00:00 2001 From: Rajkumar Bhatt Date: Thu, 13 Oct 2022 20:58:23 +0530 Subject: [PATCH 153/290] Create frequenciesOfElementsInArray.cpp --- frequenciesOfElementsInArray.cpp | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 frequenciesOfElementsInArray.cpp diff --git a/frequenciesOfElementsInArray.cpp b/frequenciesOfElementsInArray.cpp new file mode 100644 index 0000000..35fc6db --- /dev/null +++ b/frequenciesOfElementsInArray.cpp @@ -0,0 +1,28 @@ +#include +using namespace std; + +void printFrequencies (int arr[], int n) { + int frequency = 1, i = 1; + while (i < n) { + while (i < n && arr[i-1] == arr[i]) { + frequency++; + i++; + } + cout << arr[i-1] <<' ' << frequency << '\n'; + i++; + frequency = 1; + if (n == 1 || arr[n-1] != arr[n-2]) { + cout << arr[n-1] <<' ' << '1' << '\n'; + } + } +} + +int main() { + int n; cin >> n; + int arr[n]; + for (int i = 0; i < n; i++) { + cin >> arr[i]; + } + printFrequencies (arr, n); + return 0; +} From 55577c4ff5dfe04ac14e454cdd4e512d423d9d81 Mon Sep 17 00:00:00 2001 From: Arun G Nayak <84305637+Arun9739@users.noreply.github.com> Date: Thu, 13 Oct 2022 21:03:40 +0530 Subject: [PATCH 154/290] Create BigCountries.sql --- BigCountries.sql | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 BigCountries.sql diff --git a/BigCountries.sql b/BigCountries.sql new file mode 100644 index 0000000..a01f157 --- /dev/null +++ b/BigCountries.sql @@ -0,0 +1,7 @@ +# MySQL query to the problem of Big Countries + +# Problem link : https://leetcode.com/problems/big-countries/ + +SELECT name, population, area +FROM World +WHERE area >= 3000000 OR population >= 25000000; From 5f3718f8d6b2d995d8f77e42ec189d4ab107702b Mon Sep 17 00:00:00 2001 From: JasweenBrar <88180809+JasweenBrar@users.noreply.github.com> Date: Thu, 13 Oct 2022 21:39:47 +0530 Subject: [PATCH 155/290] Create segregate_even_and_odd_nodes_in_LL.cpp --- segregate_even_and_odd_nodes_in_LL.cpp | 153 +++++++++++++++++++++++++ 1 file changed, 153 insertions(+) create mode 100644 segregate_even_and_odd_nodes_in_LL.cpp diff --git a/segregate_even_and_odd_nodes_in_LL.cpp b/segregate_even_and_odd_nodes_in_LL.cpp new file mode 100644 index 0000000..f94df00 --- /dev/null +++ b/segregate_even_and_odd_nodes_in_LL.cpp @@ -0,0 +1,153 @@ +/* +GFG PROBLEM: Segregate even and odd nodes in a Linked List + +Given a link list of size N, modify the list such that all the even numbers appear before all the odd numbers in the modified list. +The order of appearance of numbers within each segregation should be same as that in the original list. + +Example 1: + +Input: +N = 7 +Link List: +17 -> 15 -> 8 -> 9 -> 2 -> 4 -> 6 -> NULL + +Output: 8 2 4 6 17 15 9 + +Explanation: 8,2,4,6 are the even numbers +so they appear first and 17,15,9 are odd +numbers that appear later. +*/ + +// CODE: +// { Driver Code Starts +// Initial template for C++ + +#include + +using namespace std; + +struct Node +{ + int data; + struct Node *next; + + Node(int x) + { + data = x; + next = NULL; + } +}; +void printList(Node *node) +{ + while (node != NULL) + { + cout << node->data << " "; + node = node->next; + } + cout << "\n"; +} + +// } Driver Code Ends +// User function template for C++ + +/* +struct Node +{ + int data; + struct Node* next; + + Node(int x){ + data = x; + next = NULL; + } +}; +*/ +class Solution +{ +public: + Node *divide(int N, Node *head) + { + // code here + Node *evenHead = NULL; + Node *evenTail = NULL; + Node *oddHead = NULL; + Node *oddTail = NULL; + + Node *temp = head; + while (temp != NULL) + { + if (temp->data % 2 == 0) + { + if (evenHead == NULL) + { + evenHead = temp; + evenTail = temp; + } + else + { + evenTail->next = temp; + evenTail = temp; + } + } + else + { + if (oddHead == NULL) + { + oddHead = temp; + oddTail = temp; + } + else + { + oddTail->next = temp; + oddTail = temp; + } + } + temp = temp->next; + } + + if (evenHead == NULL) + { + return oddHead; + } + if (oddHead == NULL) + { + return evenHead; + } + else + { + evenTail->next = oddHead; + oddTail->next = NULL; + return evenHead; + } + } +}; + +// { Driver Code Starts. + +int main() +{ + // code + int t; + cin >> t; + while (t--) + { + int N; + cin >> N; + int data; + cin >> data; + struct Node *head = new Node(data); + struct Node *tail = head; + for (int i = 0; i < N - 1; ++i) + { + cin >> data; + tail->next = new Node(data); + tail = tail->next; + } + + Solution ob; + Node *ans = ob.divide(N, head); + printList(ans); + } + return 0; +} +// } Driver Code Ends From f63ee3dee200725952afa662f189530c33c757bc Mon Sep 17 00:00:00 2001 From: Virendragurjar067 <115646146+Virendragurjar067@users.noreply.github.com> Date: Thu, 13 Oct 2022 21:41:03 +0530 Subject: [PATCH 156/290] Bubble sort program added --- bubble_sort.cpp | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 bubble_sort.cpp diff --git a/bubble_sort.cpp b/bubble_sort.cpp new file mode 100644 index 0000000..f632362 --- /dev/null +++ b/bubble_sort.cpp @@ -0,0 +1,36 @@ +#include +using namespace std; +int main() +{ + int arr[50], tot, i, j, k, elem, index; + cout<<"Enter the Size for Array: "; + cin>>tot; + cout<<"Enter "<>arr[i]; + for(i=1; ij; k--) + arr[k] = arr[k-1]; + break; + } + } + } + else + continue; + arr[index] = elem; + } + cout<<"\nThe New Array (Sorted Array):\n"; + for(i=0; i Date: Thu, 13 Oct 2022 21:44:40 +0530 Subject: [PATCH 157/290] Added calculator program in python --- calculator_application.py | 54 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 calculator_application.py diff --git a/calculator_application.py b/calculator_application.py new file mode 100644 index 0000000..47616f4 --- /dev/null +++ b/calculator_application.py @@ -0,0 +1,54 @@ +# Program make a simple calculator + +# This function adds two numbers +def add(x, y): + return x + y + +# This function subtracts two numbers +def subtract(x, y): + return x - y + +# This function multiplies two numbers +def multiply(x, y): + return x * y + +# This function divides two numbers +def divide(x, y): + return x / y + + +print("Select operation.") +print("1.Add") +print("2.Subtract") +print("3.Multiply") +print("4.Divide") + +while True: + # take input from the user + choice = input("Enter choice(1/2/3/4): ") + + # check if choice is one of the four options + if choice in ('1', '2', '3', '4'): + num1 = float(input("Enter first number: ")) + num2 = float(input("Enter second number: ")) + + if choice == '1': + print(num1, "+", num2, "=", add(num1, num2)) + + elif choice == '2': + print(num1, "-", num2, "=", subtract(num1, num2)) + + elif choice == '3': + print(num1, "*", num2, "=", multiply(num1, num2)) + + elif choice == '4': + print(num1, "/", num2, "=", divide(num1, num2)) + + # check if user wants another calculation + # break the while loop if answer is no + next_calculation = input("Let's do next calculation? (yes/no): ") + if next_calculation == "no": + break + + else: + print("Invalid Input") \ No newline at end of file From ea9f6bf5bedd9cbf4822f554c15cb94414f832b9 Mon Sep 17 00:00:00 2001 From: Rajkumar Bhatt Date: Thu, 13 Oct 2022 21:53:33 +0530 Subject: [PATCH 158/290] Create maximumSubarraySum.cpp --- maximumSubarraySum.cpp | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 maximumSubarraySum.cpp diff --git a/maximumSubarraySum.cpp b/maximumSubarraySum.cpp new file mode 100644 index 0000000..3e20d02 --- /dev/null +++ b/maximumSubarraySum.cpp @@ -0,0 +1,22 @@ +#include +using namespace std; + +int maxSum (int arr[], int n) { + int maxEnding = arr[0], result = arr[0]; + for (int i = 1; i < n; i++) { + maxEnding = max (maxEnding + arr[i], arr[i]); + result = max (maxEnding, result); + } + return result; +} + +int main() { + int n; cin >> n; + int arr[n]; + for (int i = 0; i < n; i++) { + cin >> arr[i]; + } + int result = maxSum (arr, n); + cout << result << '\n'; + return 0; +} From 165406d5df4f4b7b16ae54db17998543ba79a25a Mon Sep 17 00:00:00 2001 From: keshavgarg040 <115724702+keshavgarg040@users.noreply.github.com> Date: Thu, 13 Oct 2022 22:07:13 +0530 Subject: [PATCH 159/290] merge sort program added --- merge_sort.cs | 102 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 102 insertions(+) create mode 100644 merge_sort.cs diff --git a/merge_sort.cs b/merge_sort.cs new file mode 100644 index 0000000..9060f6c --- /dev/null +++ b/merge_sort.cs @@ -0,0 +1,102 @@ +#include +using namespace std; + +// Merges two subarrays of array[]. +// First subarray is arr[begin..mid] +// Second subarray is arr[mid+1..end] +void merge(int array[], int const left, int const mid, + int const right) +{ + auto const subArrayOne = mid - left + 1; + auto const subArrayTwo = right - mid; + + // Create temp arrays + auto *leftArray = new int[subArrayOne], + *rightArray = new int[subArrayTwo]; + + // Copy data to temp arrays leftArray[] and rightArray[] + for (auto i = 0; i < subArrayOne; i++) + leftArray[i] = array[left + i]; + for (auto j = 0; j < subArrayTwo; j++) + rightArray[j] = array[mid + 1 + j]; + + auto indexOfSubArrayOne + = 0, // Initial index of first sub-array + indexOfSubArrayTwo + = 0; // Initial index of second sub-array + int indexOfMergedArray + = left; // Initial index of merged array + + // Merge the temp arrays back into array[left..right] + while (indexOfSubArrayOne < subArrayOne + && indexOfSubArrayTwo < subArrayTwo) { + if (leftArray[indexOfSubArrayOne] + <= rightArray[indexOfSubArrayTwo]) { + array[indexOfMergedArray] + = leftArray[indexOfSubArrayOne]; + indexOfSubArrayOne++; + } + else { + array[indexOfMergedArray] + = rightArray[indexOfSubArrayTwo]; + indexOfSubArrayTwo++; + } + indexOfMergedArray++; + } + // Copy the remaining elements of + // left[], if there are any + while (indexOfSubArrayOne < subArrayOne) { + array[indexOfMergedArray] + = leftArray[indexOfSubArrayOne]; + indexOfSubArrayOne++; + indexOfMergedArray++; + } + // Copy the remaining elements of + // right[], if there are any + while (indexOfSubArrayTwo < subArrayTwo) { + array[indexOfMergedArray] + = rightArray[indexOfSubArrayTwo]; + indexOfSubArrayTwo++; + indexOfMergedArray++; + } + delete[] leftArray; + delete[] rightArray; +} + +// begin is for left index and end is +// right index of the sub-array +// of arr to be sorted */ +void mergeSort(int array[], int const begin, int const end) +{ + if (begin >= end) + return; // Returns recursively + + auto mid = begin + (end - begin) / 2; + mergeSort(array, begin, mid); + mergeSort(array, mid + 1, end); + merge(array, begin, mid, end); +} + +// UTILITY FUNCTIONS +// Function to print an array +void printArray(int A[], int size) +{ + for (auto i = 0; i < size; i++) + cout << A[i] << " "; +} + +// Driver code +int main() +{ + int arr[] = { 12, 11, 13, 5, 6, 7 }; + auto arr_size = sizeof(arr) / sizeof(arr[0]); + + cout << "Given array is \n"; + printArray(arr, arr_size); + + mergeSort(arr, 0, arr_size - 1); + + cout << "\nSorted array is \n"; + printArray(arr, arr_size); + return 0; +} \ No newline at end of file From 305839dbd8de7822de4ece48b3a1ac3fc91a8327 Mon Sep 17 00:00:00 2001 From: Sam0204 <97906758+Sam0204@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:26:51 +0530 Subject: [PATCH 160/290] Pascal --- Pascal.cpp | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 Pascal.cpp diff --git a/Pascal.cpp b/Pascal.cpp new file mode 100644 index 0000000..cf155e6 --- /dev/null +++ b/Pascal.cpp @@ -0,0 +1,40 @@ +#include +using namespace std; +const int N=42; +int main() +{ + int t; + cin>>t; + + long long int a[N][N]; + a[0][0] = 1; + + for(int i = 1 ; i < N; i++) + { + a[i][0] = 1; + a[i][i] = 1; + + for(int j=1; j>n; + + for(int i=0; i Date: Thu, 13 Oct 2022 23:47:17 +0530 Subject: [PATCH 161/290] Rectangle --- Rectangle.cpp | 85 +++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 Rectangle.cpp diff --git a/Rectangle.cpp b/Rectangle.cpp new file mode 100644 index 0000000..5a8402a --- /dev/null +++ b/Rectangle.cpp @@ -0,0 +1,85 @@ +/*Divide the stick in 4 parts codeforces "Pasha and Stick" problem. +Note +There is only one way to divide the stick in the first sample {1, 1, 2, 2}. + +Four ways to divide the stick in the second sample are {1, 1, 9, 9}, {2, 2, 8, 8}, {3, 3, 7, 7} and {4, 4, 6, 6}. Note that {5, 5, 5, 5} doesn't work. + + + + +EXAMPLE:- +INPUT 1: +6 + +OUTPUT 1: +1 //divide like(1, 1, 2, 2) + +INPUT 2: +20 + +OUTPUT: +4 //divide like {1, 1, 9, 9}, {2, 2, 8, 8}, {3, 3, 7, 7}, {4, 4, 6, 6} + + +stick = l+l+b+b +stick = 2(l+b) +stick/2 = l+b + +*/ + + + +//SOLUTION 1: +#include +using namespace std; + +int main() +{ + long int n; + cin>>n; + + if(n%2==1) // here by default is 1. Not needed to write ==1 + { + cout<<0; + } + n=n/2; + + if(n%2==1) // here by default is 1. Not needed to write ==1 + { + cout< + +int main(){ + int i, n, p, k; + long t; + + scanf("%ld", &t); + if(t%2 !=0){ + printf("0\n"); + } + else{ + if(t%4==0){ + printf("%ld\n", (t/4)-1); + } + else printf("%ld\n", t/4); + } + + return 0; +} +*/ From 903d9a1b173216cf7d61ec5e5ff48fb728b7a456 Mon Sep 17 00:00:00 2001 From: Dhanraj Chaurasia <81418590+dhanrajchaurasia@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:51:16 +0530 Subject: [PATCH 162/290] Create Minimize_XOR.cpp --- Minimize_XOR.cpp | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Minimize_XOR.cpp diff --git a/Minimize_XOR.cpp b/Minimize_XOR.cpp new file mode 100644 index 0000000..5703072 --- /dev/null +++ b/Minimize_XOR.cpp @@ -0,0 +1,31 @@ +class Solution { +public: + int minimizeXor(int num2, int num1) { + int g = __builtin_popcount(num1); + int ans = num2; + map a; + for (int i = 0; i <= 30; i++) + if ((num2 >> i) & 1) + a[i] = 1; + if (g <= a.size()){ + g = a.size() - g; + for (auto &e : a){ + if (!g) + break; + --g; + ans -= (1 << e.first); + } + return ans; + } + g -= a.size(); + for (int i = 0; g > 0 and i <= 30; i++){ + if (!a[i]){ + --g; + ans += (1 << i); + } + } + return ans; + } + /* + Solution to Miniminze XOR (https://leetcode.com/contest/weekly-contest-313/problems/minimize-xor/) + */ From 0302b46bc90bb4b73c6714959ba7bb0969b0b7cb Mon Sep 17 00:00:00 2001 From: Laxmikant-Dwivedi <108624982+Laxmikant-Dwivedi@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:52:31 +0530 Subject: [PATCH 163/290] Create Bubble_sort.cpp --- Bubble_sort.cpp | 42 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 Bubble_sort.cpp diff --git a/Bubble_sort.cpp b/Bubble_sort.cpp new file mode 100644 index 0000000..15a42a3 --- /dev/null +++ b/Bubble_sort.cpp @@ -0,0 +1,42 @@ +#include +using namespace std; + +// A function to implement bubble sort +void bubbleSort(int arr[], int n) +{ + int i, j; + for (i = 0; i < n - 1; i++) + + // Last i elements are already + // in place + for (j = 0; j < n - i - 1; j++) + if (arr[j] > arr[j + 1]) + swap(arr[j], arr[j + 1]); + /* + //can also be done using a temporary varibale + + temp = arr[j]; + arr[j] = arr[j+1]; + arr[j+1] = temp + */ +} + +// Function to print an array +void printArray(int arr[], int size) +{ + int i; + for (i = 0; i < size; i++) + cout << arr[i] << " "; + cout << endl; +} + +// Driver code +int main() +{ + int arr[] = { 5, 1, 4, 2, 8}; + int N = sizeof(arr) / sizeof(arr[0]); + bubbleSort(arr, N); + cout << "Sorted array: \n"; + printArray(arr, N); + return 0; +} From c72d29b0ba2fa181491ab9bae6a72fe0728d750f Mon Sep 17 00:00:00 2001 From: Laxmikant-Dwivedi <108624982+Laxmikant-Dwivedi@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:53:59 +0530 Subject: [PATCH 164/290] Create 4Sum.cpp --- 4Sum.cpp | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 4Sum.cpp diff --git a/4Sum.cpp b/4Sum.cpp new file mode 100644 index 0000000..6979ff4 --- /dev/null +++ b/4Sum.cpp @@ -0,0 +1,35 @@ +vector> fourSum(vector& nums, int target) { + int n = nums.size(); + sort(nums.begin() , nums.end()); // sort the array to use the two pointers method + vector> ans; + set> store; // to store and remove the duplicate answers + + for(int i = 0 ; i < n; i++){ + + for(int j = i + 1; j < n ; j++){ + + int new_target = target - nums[i] - nums[j]; + + int x = j+1 , y = n-1; + + while(x < y){ + + int sum = nums[x] + nums[y]; + + if(sum > new_target) y--; + else if(sum < new_target ) x++; + else { + store.insert({nums[i] , nums[j] , nums[x] , nums[y]}); + x++; + y--; + }; + } + } + } + + for(auto i : store){ + ans.push_back(i); // store the answers in an array(ans) + } + + return ans; + } From 19eac4c807b9a04d1eb9f120a335d47c126991ea Mon Sep 17 00:00:00 2001 From: Laxmikant-Dwivedi <108624982+Laxmikant-Dwivedi@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:54:56 +0530 Subject: [PATCH 165/290] Create Binary_search.cpp --- Binary_search.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Binary_search.cpp diff --git a/Binary_search.cpp b/Binary_search.cpp new file mode 100644 index 0000000..a090a8c --- /dev/null +++ b/Binary_search.cpp @@ -0,0 +1,24 @@ +#include +using namespace std; +int bin_search(int arr[],int n, int s){ + int mid=n/2; + int temp[mid]; + if (arr[mid]==s){ + cout<<"Element found at position "<>n; + int arr[n]; + for(int i=0; i>arr[i]; + } + cin>>s; + bin_search(arr,n,s); +} From 39a90cc5fd4642461a8cf768802f95070668e684 Mon Sep 17 00:00:00 2001 From: Laxmikant-Dwivedi <108624982+Laxmikant-Dwivedi@users.noreply.github.com> Date: Thu, 13 Oct 2022 23:56:11 +0530 Subject: [PATCH 166/290] Create Linkedlist_Implementation.cpp --- Linkedlist_Implementation.cpp | 178 ++++++++++++++++++++++++++++++++++ 1 file changed, 178 insertions(+) create mode 100644 Linkedlist_Implementation.cpp diff --git a/Linkedlist_Implementation.cpp b/Linkedlist_Implementation.cpp new file mode 100644 index 0000000..0551bca --- /dev/null +++ b/Linkedlist_Implementation.cpp @@ -0,0 +1,178 @@ +#include +using namespace std; + +struct node{ + int data; + node* link; +}; + +node* head=NULL; +void InsertAtEnd(int d){ + node* n = new node(); + n->data=d; + n->link=NULL; + if(head==NULL){ + head=n; + cout<link)!=NULL){ + temp=temp->link; + } + temp->link=n; + cout<data=d; + n->link=head; + head=n; + cout<link; + free(ptr); + cout<link!=NULL){ + prev=temp; + temp=temp->link; + } + prev->link=NULL; + free(temp); + cout<link != NULL){ + temp=temp->link; + count++; + } + temp=head; + mid=count/2; + for(int i=0; ilink; + } + cout<data<link!=NULL){ + slow=slow->link; + fast=fast->link; + fast=fast->link; //or instead of writng 2 times, write fast->link->link; + } + cout<data<link; + cur->link=prev; + prev=cur; + cur=next; + } + head=prev; + } +} + +void display(){ + if(head==NULL){ + cout<data<<"->"; + temp=temp->link; + } + cout<<"NULL"; + } +} + +int main(){ + int choice,d; + char ans='y'; + while(ans=='y'){ + cout<<"1. Display Linked List"<>choice; + switch(choice){ + case 1: + display(); + break; + case 2: + cout<<"Enter the value to be added: "; + cin>>d; + InsertAtBeg(d); + break; + case 3: + cout<<"Enter the value to be added: "; + cin>>d; + InsertAtEnd(d); + break; + case 4: + DeleteBeg(); + break; + case 5: + DeleteEnd(); + break; + case 6: + MidDisplay(); + break; + case 7: + reverse(); + break; + default: + cout<<"Invalid Choice!"; + break; + } + cout<>ans; + } +} From c68424f3a993f302a0607f719f712b635c70ef7e Mon Sep 17 00:00:00 2001 From: Dhanraj Chaurasia <81418590+dhanrajchaurasia@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:00:04 +0530 Subject: [PATCH 167/290] Create Count_Number_Of_Texts.cpp C++ Solution | DP | Bottom Up Approach --- Count_Number_Of_Texts.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Count_Number_Of_Texts.cpp diff --git a/Count_Number_Of_Texts.cpp b/Count_Number_Of_Texts.cpp new file mode 100644 index 0000000..4b69d6a --- /dev/null +++ b/Count_Number_Of_Texts.cpp @@ -0,0 +1,24 @@ +class Solution { +public: + int countTexts(string s) { + int n = s.size(); + int mod = 1e9 + 7; + vector dp(n + 1); + dp[0] = 1; + for (int i = 0; i < n; i++) + { + dp[i + 1] = dp[i]; + if (i > 0 and s[i] == s[i - 1]) + { + dp[i + 1] = (dp[i + 1] + dp[i - 1]) % mod; + if (i > 1 and s[i] == s[i - 2]) + { + dp[i + 1] = (dp[i + 1] + dp[i - 2]) % mod; + if (i > 2 and s[i] == s[i - 3] and (s[i] == '7' or s[i] == '9')) + dp[i + 1] = (dp[i + 1] + dp[i - 3]) % mod; + } + } + } + return dp[n]; + } +}; From 03e4f42c84acca4e88ccefe5f5457f525fe465c4 Mon Sep 17 00:00:00 2001 From: Sentious <115402871+Sentious@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:01:05 +0530 Subject: [PATCH 168/290] Create Rearrange array elements by sign.cpp --- Rearrange array elements by sign.cpp | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Rearrange array elements by sign.cpp diff --git a/Rearrange array elements by sign.cpp b/Rearrange array elements by sign.cpp new file mode 100644 index 0000000..f81030d --- /dev/null +++ b/Rearrange array elements by sign.cpp @@ -0,0 +1,19 @@ +class Solution { +public: + vector rearrangeArray(vector& nums) { + int x= nums.size(); + vector a(x); + int i=0,j=1; + for(int k=0;k0){ + a[i]=nums[k]; + i+=2; + } + else{ + a[j]=nums[k]; + j+=2; + } + } + return a; + } +}; From 7e659611e6eab50feb3d53ff481f767973e4778b Mon Sep 17 00:00:00 2001 From: Aditya Ghyar <101800022+mgaditya-er@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:11:35 +0530 Subject: [PATCH 169/290] created Delete Node in a Linked List.cpp --- Delete Node in a Linked List.cpp | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 Delete Node in a Linked List.cpp diff --git a/Delete Node in a Linked List.cpp b/Delete Node in a Linked List.cpp new file mode 100644 index 0000000..a63ebac --- /dev/null +++ b/Delete Node in a Linked List.cpp @@ -0,0 +1,9 @@ +class Solution { +public: + void deleteNode(ListNode* node) { + ListNode* temp = node -> next; + node -> val = temp -> val; + node -> next = temp -> next; + delete temp; + } +}; From a6cd21aa3aa18a6484acbe768d30ad174f15ab87 Mon Sep 17 00:00:00 2001 From: Pranav Patil <96427560+PRANAVPATIL234@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:26:49 +0530 Subject: [PATCH 170/290] Calculator --- Calculator.py | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Calculator.py diff --git a/Calculator.py b/Calculator.py new file mode 100644 index 0000000..7a50b2c --- /dev/null +++ b/Calculator.py @@ -0,0 +1,18 @@ + +a=int(input("Enter First Number:")) +b=int(input("Enter Second Number:")) +c=input("Enter The sign:") +if c=='*': + print("Multiplication:",a*b) +if c=='+': + print("Addition:",a+b) +if c=='-': + print("Substraction:",a-b) +if c=='/': + print("Division:",a/b) +if c=='%': + print("Moduls:",a%b) +if c=='**': + print("Power:",a**b) +if c=='//': + print("Floor Division:",a//b) From e074ea1d57c40ce45c6cca77f287a5ef1ad4e410 Mon Sep 17 00:00:00 2001 From: Aditya Ghyar <101800022+mgaditya-er@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:28:51 +0530 Subject: [PATCH 171/290] created Next Permutation.java --- Next Permutation.java | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 Next Permutation.java diff --git a/Next Permutation.java b/Next Permutation.java new file mode 100644 index 0000000..9db977f --- /dev/null +++ b/Next Permutation.java @@ -0,0 +1,27 @@ +class Solution { + public void nextPermutation(int[] A) { + if (A == null || A.length <= 1) + return; + int i = A.length - 2; + while (i >= 0 && A[i] >= A[i + 1]) + i--; // Find 1st id i that breaks descending order + if (i >= 0) { // If not entirely descending + int j = A.length - 1; // Start from the end + while (A[j] <= A[i]) + j--; // Find rightmost first larger id j + swap(A, i, j); // Switch i and j + } + reverse(A, i + 1, A.length - 1); // Reverse the descending sequence + } + + public void swap(int[] A, int i, int j) { + int tmp = A[i]; + A[i] = A[j]; + A[j] = tmp; + } + + public void reverse(int[] A, int i, int j) { + while (i < j) + swap(A, i++, j--); + } +} From 5bcf309752cc7b51835bb1129a8cc9a949b14418 Mon Sep 17 00:00:00 2001 From: Dhanraj Chaurasia <81418590+dhanrajchaurasia@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:29:20 +0530 Subject: [PATCH 172/290] Create Ugly_Number_II.cpp C++ Solution | DP | O (n) --- Ugly_Number_II.cpp | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Ugly_Number_II.cpp diff --git a/Ugly_Number_II.cpp b/Ugly_Number_II.cpp new file mode 100644 index 0000000..a933bd6 --- /dev/null +++ b/Ugly_Number_II.cpp @@ -0,0 +1,19 @@ +/* +C++ Solution | DP | O (n) +*/ +class Solution { +public: + int nthUglyNumber(int n) { + vector dp(n); + dp[0] = 1; + int x = 0, y = 0, z = 0; + for (int i = 1; i < n; i++) + { + dp[i] = min({2 * dp[x], 3 * dp[y], 5 * dp[z]}); + x += (dp[i] == 2 * dp[x]); + y += (dp[i] == 3 * dp[y]); + z += (dp[i] == 5 * dp[z]); + } + return dp[n - 1]; + } +}; From 2f1aaf8d61f797ea24c14740d93859d90801e657 Mon Sep 17 00:00:00 2001 From: Dhanraj Chaurasia <81418590+dhanrajchaurasia@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:33:04 +0530 Subject: [PATCH 173/290] Create Design_A_Text_Editor.cpp C++ Solution | List STL --- Design_A_Text_Editor.cpp | 86 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 86 insertions(+) create mode 100644 Design_A_Text_Editor.cpp diff --git a/Design_A_Text_Editor.cpp b/Design_A_Text_Editor.cpp new file mode 100644 index 0000000..34a39d0 --- /dev/null +++ b/Design_A_Text_Editor.cpp @@ -0,0 +1,86 @@ +class TextEditor { +public: + std::list v; + std::list::iterator itr; + TextEditor() { + v.clear(); + v.insert(v.begin(), '#'); + itr = v.end(); + } + void showme() + { + for (auto &i : v) + cout << i; + cout << endl; + } + void addText(string text) { + for (auto &i : text) + v.insert(itr, i); + } + + int deleteText(int k) { + int res = 0; + while (k-- and itr != v.begin()) + itr--, res++; + if (itr == v.begin()) + itr++, res--; + k = res; + while (res-- and itr != v.end()) + itr = v.erase(itr); + return k; + } + + string cursorLeft(int k) { + while (k-- and itr != v.begin()) + itr--; + if (itr == v.begin()) + { + itr++; + return ""; + } + auto it = itr; + k = 10; + string ans = ""; + while (it != v.begin() and k--) + { + it--; + ans += *it; + } + if (it == v.begin()) + { + ans.pop_back(); + it++; + } + reverse(ans.begin(), ans.end()); + return ans; + } + + string cursorRight(int k) { + while (k-- and itr != v.end()) + itr++; + auto it = itr; + k = 10; + string ans = ""; + while (it != v.begin() and k--) + { + it--; + ans += *it; + } + if (it == v.begin()) + { + ans.pop_back(); + it++; + } + reverse(ans.begin(), ans.end()); + return ans; + } +}; + +/** + * Your TextEditor object will be instantiated and called as such: + * TextEditor* obj = new TextEditor(); + * obj->addText(text); + * int param_2 = obj->deleteText(k); + * string param_3 = obj->cursorLeft(k); + * string param_4 = obj->cursorRight(k); + */ From 60631ad497d68feff876ca11322a1ce40935df01 Mon Sep 17 00:00:00 2001 From: AyushAhuja2707 <69260450+AyushAhuja2707@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:33:19 +0530 Subject: [PATCH 174/290] Create SetMatrixZero.java --- SetMatrixZero.java | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 SetMatrixZero.java diff --git a/SetMatrixZero.java b/SetMatrixZero.java new file mode 100644 index 0000000..2a08cbe --- /dev/null +++ b/SetMatrixZero.java @@ -0,0 +1,19 @@ +class Solution { + public void setZeroes(int[][] matrix) { + int col0 = 1, rows = matrix.length, cols = matrix[0].length; + + for (int i = 0; i < rows; i++) { + if (matrix[i][0] == 0) col0 = 0; + for (int j = 1; j < cols; j++) + if (matrix[i][j] == 0) + matrix[i][0] = matrix[0][j] = 0; + } + + for (int i = rows - 1; i >= 0; i--) { + for (int j = cols - 1; j >= 1; j--) + if (matrix[i][0] == 0 || matrix[0][j] == 0) + matrix[i][j] = 0; + if (col0 == 0) matrix[i][0] = 0; + } + } +} From 9455eb2e9117149b5f6dc07ee11063980b2bbcf0 Mon Sep 17 00:00:00 2001 From: Sentious <115402871+Sentious@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:35:16 +0530 Subject: [PATCH 175/290] Create Combination_Sum.cpp --- Combination_Sum.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 Combination_Sum.cpp diff --git a/Combination_Sum.cpp b/Combination_Sum.cpp new file mode 100644 index 0000000..c4e7fff --- /dev/null +++ b/Combination_Sum.cpp @@ -0,0 +1,33 @@ +class Solution { +public: + vector> combinationSum2(vector& candidates, int target) { + vector> ans; + vector sum; + sort(candidates.begin(),candidates.end()); + combination(candidates, target, sum, 0, ans); + return ans; + } + + void combination(vector & nums, int target, vector &sum, int idx, vector>& ans) + { + if(target==0) + { + return ans.push_back(sum); + } + + if(target<0) + { + return; + } + + for(int i=idx;iidx && nums[i]==nums[i-1]) + continue; + + sum.push_back(nums[i]); + combination(nums,target-nums[i],sum,i+1,ans); + sum.pop_back(); + } + } +}; From d10c7fafd1af7ea83efe9efa4e8cfd2fcae79759 Mon Sep 17 00:00:00 2001 From: Pranav Patil <96427560+PRANAVPATIL234@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:35:18 +0530 Subject: [PATCH 176/290] Mouseactivity --- Mouseactivity.java | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Mouseactivity.java diff --git a/Mouseactivity.java b/Mouseactivity.java new file mode 100644 index 0000000..9e83509 --- /dev/null +++ b/Mouseactivity.java @@ -0,0 +1,26 @@ +import java.awt.*; +import java.awt.event.*; +public class mouse extends Frame implements KeyListener { + Label l; + TextArea area; + mouse() { + l = new Label(); + l.setBounds (20, 50, 100, 20); + area = new TextArea(); + area.setBounds (20, 80, 200, 100); + area.addKeyListener(this); + add(l); + add(area); + setSize (400, 400); + setLayout (null); + setVisible (true); + } + public void keyPressed (KeyEvent e) { + l.setText ("Key Pressed"); + } + public void keyReleased (KeyEvent e) {} + public void keyTyped (KeyEvent e) {} + public static void main(String[] args) { + new mouse(); + } +} From 8ba5b555988444626f94a140ada1e45be0a3d8a1 Mon Sep 17 00:00:00 2001 From: Dhanraj Chaurasia <81418590+dhanrajchaurasia@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:35:42 +0530 Subject: [PATCH 177/290] Create longest-increasing-subsequence-ii.cpp C++ Solution | Segment Tree | DP Intution --- longest-increasing-subsequence-ii.cpp | 56 +++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 longest-increasing-subsequence-ii.cpp diff --git a/longest-increasing-subsequence-ii.cpp b/longest-increasing-subsequence-ii.cpp new file mode 100644 index 0000000..f89aa28 --- /dev/null +++ b/longest-increasing-subsequence-ii.cpp @@ -0,0 +1,56 @@ +template +class SegmentTree{ +private: + int n; + vector segtree; +public: + SegmentTree(int n){ + this->n = n; + segtree.resize(4 * n + 1); + } + T op(T x, T y){ + return max(x, y); + } + void updateVal(int x, int l, int r, int idx, T val){ + if (l > idx or r < idx) + return; + if (l == r) + { + segtree[x] = val; + return; + } + int mid = (l + r) / 2LL; + updateVal(2 * x, l, mid, idx, val); + updateVal(2 * x + 1, mid + 1, r, idx, val); + segtree[x] = op(segtree[2 * x], segtree[2 * x + 1]); + } + void update(int idx, T val){ + updateVal(1, 1, n, idx, val); + } + T cal(int x, int l, int r, int L, int R){ + if (L <= l and R >= r) + return segtree[x]; + if (L > r or R < l) + return 0; + int mid = (l + r) / 2LL; + return op(cal(2 * x, l, mid, L, R), cal(2 * x + 1, mid + 1, r, L, R)); + } + T query(int l, int r){ + return l > r ? 0 : cal(1, 1, n, l, r); + } +}; +class Solution { +public: + int lengthOfLIS(vector& nums, int k) { + const int M = 1e5 + 1; + SegmentTree dp(M); + for (auto &e : nums) + { + int x = dp.query(e - k, e - 1) + 1; + int y = dp.query(e, e); + if (y < x) + dp.update(e, x); + } + return dp.query(1, M); + } +}; From 6d261cb08dc168c12c51c1ccf594978a498f3ef1 Mon Sep 17 00:00:00 2001 From: vedu__sutar <103143204+vedu7649@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:38:29 +0530 Subject: [PATCH 178/290] check ASCII value --- ASCII.cpp | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 ASCII.cpp diff --git a/ASCII.cpp b/ASCII.cpp new file mode 100644 index 0000000..f4b981b --- /dev/null +++ b/ASCII.cpp @@ -0,0 +1,8 @@ +#include +using namespace std; +int main() +{ + char c = 'A'; + cout << "The ASCII value of " << c << " is " << int(c); + return 0; +} From faccee624af10977fd88f408ab4bcc7586f5b481 Mon Sep 17 00:00:00 2001 From: AyushAhuja2707 <69260450+AyushAhuja2707@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:40:00 +0530 Subject: [PATCH 179/290] Create TrainglePattern.java --- TrainglePattern.java | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 TrainglePattern.java diff --git a/TrainglePattern.java b/TrainglePattern.java new file mode 100644 index 0000000..5a77509 --- /dev/null +++ b/TrainglePattern.java @@ -0,0 +1,27 @@ +/* + * + * * + * * + * * +* * +*/ +public class TrianglePattern { + public static void main(String[] args) { + // Write code here + int rows = 5; + for (int i = 1; i <= rows; i++) { + for (int j = rows; j > i; j--) { + System.out.print(" "); + } + System.out.print("*"); + for (int j = 1; j < (i - 1) * 2; j++) { + System.out.print(" "); + } + if (i == 1) { + System.out.print("\n"); + } else { + System.out.print("*" + "\n"); + } + } + } +} From a35ec570a067c3946827bcd058605e40ae1acadf Mon Sep 17 00:00:00 2001 From: AyushAhuja2707 <69260450+AyushAhuja2707@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:44:41 +0530 Subject: [PATCH 180/290] Delete Node in a Linked List --- deleteNode.java | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 deleteNode.java diff --git a/deleteNode.java b/deleteNode.java new file mode 100644 index 0000000..cf3c770 --- /dev/null +++ b/deleteNode.java @@ -0,0 +1,10 @@ +class Solution { + public void deleteNode(ListNode node) { + ListNode nextNode = node.next; + + node.val = nextNode.val; + + node.next = nextNode.next; + nextNode.next = null; + } +} From f94584363c3384204e23ded6245cdb8a2351c7ae Mon Sep 17 00:00:00 2001 From: sourabh jadhav <114357226+sourabhjadhav0812@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:45:56 +0530 Subject: [PATCH 181/290] calculate Digit --- calculateDigit.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 calculateDigit.cpp diff --git a/calculateDigit.cpp b/calculateDigit.cpp new file mode 100644 index 0000000..013abb5 --- /dev/null +++ b/calculateDigit.cpp @@ -0,0 +1,33 @@ +#include +using namespace std; + +int main() +{ + int t; + cin>>t; + + while(t--) + { + + int n; + cin>>n; + + int digit_sum=0; + while(n > 0) + { + int last_digit=n%10; + digit_sum += last_digit; + n=n / 10; + } +/* Use can use also the folowing while loop + while👎 + { + digit_sum+=n%10; + n=n/10; + } + +*/ + cout< Date: Fri, 14 Oct 2022 00:50:57 +0530 Subject: [PATCH 182/290] Create 235. Lowest Common Ancestor of a Binary Search Tree.cpp --- ...Common Ancestor of a Binary Search Tree.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 235. Lowest Common Ancestor of a Binary Search Tree.cpp diff --git a/235. Lowest Common Ancestor of a Binary Search Tree.cpp b/235. Lowest Common Ancestor of a Binary Search Tree.cpp new file mode 100644 index 0000000..d0d09c1 --- /dev/null +++ b/235. Lowest Common Ancestor of a Binary Search Tree.cpp @@ -0,0 +1,18 @@ +class Solution { +public: + TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { + if(root==NULL) + return root; + if(root==p || root==q) + return root; + TreeNode* lca1=lowestCommonAncestor(root->left,p,q); + TreeNode* lca2=lowestCommonAncestor(root->right,p,q); + if(lca1 && lca2) + return root; + if(lca1) + return lca1; + if(lca2) + return lca2; + return NULL; + } +}; From 0fe4ffa5648ca4c9bf3c5e4aeb4841aec45de473 Mon Sep 17 00:00:00 2001 From: Varun Sharma <62585746+varunsharma6956@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:51:58 +0530 Subject: [PATCH 183/290] Create Missingnumber.cpp --- Missingnumber.cpp | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 Missingnumber.cpp diff --git a/Missingnumber.cpp b/Missingnumber.cpp new file mode 100644 index 0000000..45f5eee --- /dev/null +++ b/Missingnumber.cpp @@ -0,0 +1,22 @@ +#include +using namespace std; + +int findMissingNo (int arr[], int len){ + int temp; + temp = ((len+1)*(len+2))/2; + for (int i = 0; i>n; + int arr[n-1]; + for(int i=0; i>arr[i]; + } + int missingNo = findMissingNo(arr,5); + cout<<"Missing Number is: "< Date: Fri, 14 Oct 2022 00:54:00 +0530 Subject: [PATCH 184/290] remove String --- removeString.cpp | 98 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 98 insertions(+) create mode 100644 removeString.cpp diff --git a/removeString.cpp b/removeString.cpp new file mode 100644 index 0000000..c71d211 --- /dev/null +++ b/removeString.cpp @@ -0,0 +1,98 @@ +/* +//Remove character + +Given two strings string1 and string2, remove those characters from first string(string1) which are present in second string(string2). Both the strings are different and contain only lowercase characters. +NOTE: Size of first string is always greater than the size of second string( |string1| > |string2|). + + +Example 1: + +Input: +string1 = "computer" +string2 = "cat" +Output: "ompuer" +Explanation: After removing characters(c, a, t) +from string1 we get "ompuer". +Example 2: + +Input: +string1 = "occurrence" +string2 = "car" +Output: "ouene" +Explanation: After removing characters +(c, a, r) from string1 we get "ouene". + + +Your Task: +You dont need to read input or print anything. Complete the function removeChars() which takes string1 and string2 as input parameter and returns the result string after removing characters from string2 from string1. + + +Expected Time Complexity:O( |String1| + |String2| ) +Expected Auxiliary Space: O(K),Where K = Constant +*/ + + +/* +Approach: + +Keep on iterating string1(outer for loop) and set the flag to 0 + +In the inner for loop iterate through string2 + +If any element of string2 matches the corresponding character of string1 then set the flag to 1 + +After completion of the inner for loop, if the flag is not equal to 1 i.e if the corresponding string1 character is not present in string2 then add that character to the resulting string. + +Return the resulting string after the iteration of loops is completed. +*/ + + +//https://practice.geeksforgeeks.org/problems/remove-character3815/1 + + //{ Driver Code Starts +// Initial template for C++ +#include +using namespace std; + + +// } Driver Code Ends +// User function template for c++ +class Solution { + public: + string removeChars(string string1, string string2) { + // code here + string ans; + for (int i = 0; i < string1.length(); i++) + { + int flag = 0; + + for (int j = 0; j> string1; + cin >> string2; + Solution ob; + cout << ob.removeChars(string1,string2) << endl; + + + return 0; +} + +// } Driver Code Ends From 9491f00466665448f378131f80a56677920b046c Mon Sep 17 00:00:00 2001 From: Suddhabrato Ghosh <79144740+suddhabrato@users.noreply.github.com> Date: Fri, 14 Oct 2022 00:59:34 +0530 Subject: [PATCH 185/290] Create 692. Top K Frequent Words.cpp --- 692. Top K Frequent Words.cpp | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 692. Top K Frequent Words.cpp diff --git a/692. Top K Frequent Words.cpp b/692. Top K Frequent Words.cpp new file mode 100644 index 0000000..02769c4 --- /dev/null +++ b/692. Top K Frequent Words.cpp @@ -0,0 +1,28 @@ +class Solution { +public: + vector topKFrequent(vector& words, int k) { + unordered_map freq; + for(auto w : words){ + freq[w]++; + } + + auto comp = [&](const pair& a, const pair& b) { + return a.second > b.second || (a.second == b.second && a.first < b.first); + }; + typedef priority_queue< pair, vector>, decltype(comp) > my_priority_queue_t; + my_priority_queue_t pq(comp); + + for(auto w : freq ){ + pq.emplace(w.first, w.second); + if(pq.size()>k) pq.pop(); + } + + vector output; + while(!pq.empty()){ + output.insert(output.begin(), pq.top().first); + pq.pop(); + } + return output; + + } +}; From 155a8d5e6c4655554f03452adec01428f8498e2a Mon Sep 17 00:00:00 2001 From: sourabh jadhav <114357226+sourabhjadhav0812@users.noreply.github.com> Date: Fri, 14 Oct 2022 01:01:53 +0530 Subject: [PATCH 186/290] count Solutions --- countSolutions.cpp | 94 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 94 insertions(+) create mode 100644 countSolutions.cpp diff --git a/countSolutions.cpp b/countSolutions.cpp new file mode 100644 index 0000000..8c8fc7c --- /dev/null +++ b/countSolutions.cpp @@ -0,0 +1,94 @@ +#include + +using namespace std; + +string ltrim(const string &); +string rtrim(const string &); +vector split(const string &); + +/* + * Complete the 'countSolutions' function below. + * + * The function is expected to return an INTEGER. + * The function accepts following parameters: + * 1. INTEGER a + * 2. INTEGER b + * 3. INTEGER c + * 4. INTEGER d + */ + +int countSolutions(int a, int b, int c, int d) { + +} + +int main() +{ + ofstream fout(getenv("OUTPUT_PATH")); + + string q_temp; + getline(cin, q_temp); + + int q = stoi(ltrim(rtrim(q_temp))); + + for (int q_itr = 0; q_itr < q; q_itr++) { + string first_multiple_input_temp; + getline(cin, first_multiple_input_temp); + + vector first_multiple_input = split(rtrim(first_multiple_input_temp)); + + int a = stoi(first_multiple_input[0]); + + int b = stoi(first_multiple_input[1]); + + int c = stoi(first_multiple_input[2]); + + int d = stoi(first_multiple_input[3]); + + int result = countSolutions(a, b, c, d); + + fout << result << "\n"; + } + + fout.close(); + + return 0; +} + +string ltrim(const string &str) { + string s(str); + + s.erase( + s.begin(), + find_if(s.begin(), s.end(), not1(ptr_fun(isspace))) + ); + + return s; +} + +string rtrim(const string &str) { + string s(str); + + s.erase( + find_if(s.rbegin(), s.rend(), not1(ptr_fun(isspace))).base(), + s.end() + ); + + return s; +} + +vector split(const string &str) { + vector tokens; + + string::size_type start = 0; + string::size_type end = 0; + + while ((end = str.find(" ", start)) != string::npos) { + tokens.push_back(str.substr(start, end - start)); + + start = end + 1; + } + + tokens.push_back(str.substr(start)); + + return tokens; +} From 11ed75648701a74df934e02ff2dbbe6c323abfdb Mon Sep 17 00:00:00 2001 From: Suddhabrato Ghosh <79144740+suddhabrato@users.noreply.github.com> Date: Fri, 14 Oct 2022 01:05:21 +0530 Subject: [PATCH 187/290] Create 62. Unique Paths.cpp --- 62. Unique Paths.cpp | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 62. Unique Paths.cpp diff --git a/62. Unique Paths.cpp b/62. Unique Paths.cpp new file mode 100644 index 0000000..a304a2f --- /dev/null +++ b/62. Unique Paths.cpp @@ -0,0 +1,11 @@ +class Solution { +public: + int uniquePaths(int m, int n) { + if(m Date: Fri, 14 Oct 2022 01:11:54 +0530 Subject: [PATCH 188/290] Create 394. Decode String.cpp --- 394. Decode String.cpp | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 394. Decode String.cpp diff --git a/394. Decode String.cpp b/394. Decode String.cpp new file mode 100644 index 0000000..ecef681 --- /dev/null +++ b/394. Decode String.cpp @@ -0,0 +1,30 @@ +class Solution { +public: + string decodeString(const string& s, int& i) { + string res; + + while (i < s.length() && s[i] != ']') { + if (!isdigit(s[i])) + res += s[i++]; + else { + int n = 0; + while (i < s.length() && isdigit(s[i])) + n = n * 10 + s[i++] - '0'; + + i++; // '[' + string t = decodeString(s, i); + i++; // ']' + + while (n-- > 0) + res += t; + } + } + + return res; + } + + string decodeString(string s) { + int i = 0; + return decodeString(s, i); + } +}; From 6861b595bdd4858dfa96bdd25776da3476fef653 Mon Sep 17 00:00:00 2001 From: fulpopy Date: Fri, 14 Oct 2022 01:31:40 +0530 Subject: [PATCH 189/290] Added CPP solution of leetcode 2433. Find The Original Array of Prefix Xor --- 2433.FindTheOriginalArrayofPrefixXor | Bin 0 -> 72171 bytes 2433.FindTheOriginalArrayofPrefixXor.cpp | 22 +++++++ bubble_sort.cpp | 70 +++++++++++------------ tempCodeRunnerFile.cpp | 20 +++++++ 4 files changed, 77 insertions(+), 35 deletions(-) create mode 100644 2433.FindTheOriginalArrayofPrefixXor create mode 100644 2433.FindTheOriginalArrayofPrefixXor.cpp create mode 100644 tempCodeRunnerFile.cpp diff --git a/2433.FindTheOriginalArrayofPrefixXor b/2433.FindTheOriginalArrayofPrefixXor new file mode 100644 index 0000000000000000000000000000000000000000..280c1ac073e62684821ef595b68fd2ee2395993f GIT binary patch literal 72171 zcmeFa3w#vS**`wByCDk+*#yExjk;)1PzVVG1O?5KY)B-RH5V=dF1c(V8j_gIa#4`b zO)UGaYtxp#rG4#N5Zlt$wzTz!RM7^42`JS_sZya9mFmV&OD$r!=>EUYIdj>`ZZ740 z-{1fD`TaUNnVIK&pUZj9bDneN%&?Pxf2&{=1i^$o7!-tkIMSBE{to=73B_?Yz7Quo zH~e=K_KA7Fn^3a4y3tzSP`9d~Y>l;|thTmJvX;B74enZNb*(k4u-Lk$uF{nBzQJ zT;bxUr6Q}BAXqt;7>Ea(eBc*51R)U3Pp{^$sZ9{ZM__znrywMfVf}0=l54$$vS(-G z4;e&tRV#sWY%2xF%9P47sSM{yL~vk7orSyULfbNg)V7oc4t$0hb0v0?m4Q8E11@7) zIwu^z2FH5r*J97&H03YhQpy_}>6&b$c8Rn#k=|;qm-%o9P-g58=+Vr+%%T#aGGFb% z3DtwzHe_QssfOvb61@#O;Z|c0*$6i+jaP)+Cv;&a+=FzXZ5cww{AttYFhYXSiZ zJ>`G@mFH}dFDu#V6MVwFufyZ(3g-E7Xk0lj3I|KeQJB=3mCPcu)07;8%fPwY1;NuR zTAFiEuNHtl0@eTAEo6OKo99r{L6gubU(eeHF;ecle|4izax3nCNf)KAqp60_d{U!Uhwa~mH6jf z&#F}lT8ITyy}&hGl(ZC8YECDBiPc-Sp!;T!T4f(7G>a@JRP&p+F)K)0;H7xQioblx zHOfe)@kc;<4hOrB=*wb=({J{J|Aq)HH zGT7xg8%yW$8E7vOb=DN1zPZ!v$Pm1yy#0PecgxWLb0@n;jNfwomT=Px=`bgML6Po|QUaBk ziP4n2uRcQvzO{2am9$BBf?^}R>5ASLpjD8@5Jw?NgMZ_>H1ENdW72Ri5O44pPEr%W zc`ZWN@9JIlz>0QMvonfxo|up!yxfI9JzIK4s&%Ck)Yo%%{7ze@;5f|@3z#w9zGy}Ozl(lVec!Ukwk~}sRo;(n+ zZ~|v3hk%}+zDVvS&5!|8Q3ad@N&AVOJH74P?tf53pCGMkVsQp4;r|F!kAbd;=QYMd zm|S4|uJcRLBL1=~?abrm-&o<_z*;Cf!YSiDo6Ms7#x0v-Y1-x<%K<9@fW1$T0oe8h z@|A+7cpxAOsWSv9HB$QoCvJb5;yE~Rn|y4Qk59rgra&3;-Q+`^_A>&uPWy2> zpd-h3+Pmn~d(dk?$~yT(ny7dV$9wIE)7s?m#nT~LUM>i>9Pz#;H8x$o$I|Ra{VZR5 z4xCMwZ?!b#-eod$LQ@bdEAbPW4M0>8Yzx4aP-C|d-K}@c8oSO z1E6l;%Wv~s9ByeQ6a9<>(F6SVi5=oi z8tpaEb|yXz*9#X+IT@J5K*yX-M;qKedl%|k>%GLl5GQp1C%_%3jr|1b&Bj?8WqkI- zlt_H`qtsm=!IZW;S@CaR;YCWPa+8woTQ%KiPX!3XMmoIN zeUxl`>Zv8(gP6iv1;_WETJpWLt{>C6rMVl`Elz8*JWT<85*Pd6aKZ9)THA#VQ8GgB zg;%Un)W{}KFLX2!#qjw-bS;5SO>`=V(i+cUGcv%Ivow81+PD1Nl^4;HO8nTqd0R1}4@(8sgchiB7E-4ls){c1=PL+6UQ9mZ#^@ zVeLe+8dqs;Eyp%Q?Gtdt_%dKQnKV3#SeE?*iBH~k#ycn!Fmm09VWz4z*u^M*hsl>= z@{XZW1Vy*!Q0zb2slAZe#`~_%$U&F59F!)soRngNiQi+_J)-+O(yMSCa_=jjBd!mP zU)G*>lBM`e(U;glsFq{yb3I42{qliGh@7YEs^7(nPr`ISY0v6Aj zg{IiCyubQN*o?>I!z7-KoQTLA)HDRgJGwl7q}-h7nYS8B4B$zYMs!B83uyH88l+K} z*h}|#4ka=H%N~H9mlOA72wOg(zn(9RkA0AK(&wQIm}9^^v)wf3UH4yg91uK-5(QO* zren-F81@SgdUomTNo&*Eg6hlcgBNpPVBq^!WR>ePa7t6ElhV|xR-e%eL1R$>62_7& zoS}hYF-tQ0GELs}W$w`xP=9 zp5v-tMxqJ!JSh)c za(hrbF=KqoldUkwf~ZMrTc+6~yJ8z;`Nk-&I3|tr8RoRRNAwi<%ya%IP4*u2%{PPn z?@Fa(xo%mS7H_^Bv-e&z`S3y92`lJ#aSls+x*%m2De-pooaEyHyFWzyiPD0GaR@{A zaK(2nCC1tnN;x|L)_q2n+!;lVrY-P}tmBA`mJ)d(1&Jz&?yp$Wm&oXofsc{B&=+L4 z1y0iCw<%QE#^Pls-MFCT%;O+S2|T})oD6AJ%rpH?*kN>g3{z}kRfiirx*Ff(`$0ykC#|R`yMsfRJ#>F?L_!gRcqdo0r~XmWJJG0!0@TC82Y|Kx^`M%w-b(hIfvEb7HiEAeP~{@Wz53ggYN zEwAD(GC28D@l6uz%}Y-Dje$(s4U@WKz=m#U**n{NshPlU02`eAIYGsX3=Fpjfkz4a zE-d2lIQj2Jvnq|O4%||=B9}3slCQ2#2Ur1@5-Ye3b$o@H=-k>zq z)BB|~>yK8;^BGC7DE0yyV&kPK%g;-aW7%?0duLRl1Gk*mPJYnyF26zrg26EYjO#hN zlZtzON%oV6zaj_%`rz*m^hBi{@%%&dd?2drVR<F$`b3J>}J}*!sFs8I)-mdnvV?8hF#w%2NIc)2|7~;!_^)C_qrtg76puTIynyUAJ zH`~0=2ujNl>86&G-gi2)so8|bM)Q37vDkuJZ^R;Q+CC-s(5R&4XN-qBeaJ_hl;h@F zULH?b0D)rlTwdY*lcl)~rg|<TWd*~kIbCg*2j`jY@`}yZcnTT=0{cG=( zEer)gR{uJ~miNerIe)VFEnq^L zP4))7ulFQC-z5LsNi9KX@|+%TK&olE;9o7e17zA%GPDy2X6TJ%XlF~%{WkKb)dvZl z_pO$_!{)A#%I0pCGI6ul+~)oS3r84&>7J~r^{(Z~Nm8NZWhYtK{qKm{m!`rp@8{hg z;vDl42QnqvX1DxRnmXsQ z_X|t&LP&>$HU-^h(3*kRv8c=|ii5r!0|&j*@>loo`#Q+dJQs{GGmbmy?FW^K{zt?Efhf;8TDu!>dHGHMx}e{V z{$XjZrWm=1yZOJu*-aOh@qFKO@iys!3&4ufaP)pla|#8*D`=fyGlKYWTzw9)6egCI zgVan|A3~=I+=6=10NxQu!Wrt8G`Ry~SF?vOU6W6E4o#8U+p@P*^tLx$y3HNW`)fPe zZ#1r@&(hkOk4b;q!**YUOPe+a1xqtC{*|5&TfJ{hez*HR2$kcj z>0*kdnFeml%LhDx6joi>Vrh96v~F6p_OCFI3fR(inQW16^Zu#lTk3fAa;fNf#X##3 zuMo$}Ow_Q?PjvUv*9wL07&X&>Hw{YfPVT2ZA&r>|jEnej9K&r<~ z#Wz3JIN#(qwa}d~0>Xs3s25%M8>5k;+N4`(950UbW}5vQMDb1WlJ`-}_P2JL=*Axt zt$5aD+i}9u9}VIZhRR$nk=^4(1|)cd#UO5CW!FmAM&0HRFe7jqrUv3m~yr31sk=|+-cG^bC*kFeD34FJ&Jh(n~(hC zhnD7;D9D9cSTG8fh$rT>TRc@*mqq_-?BFcOA3Hk znjad*$}P?1IPp7zbAIoB&$2fo=q)|G)xHajybJ2hbC+9M8UXN>9=7at@50@12i89< zdku4^S+=#KblU;*YwnLxL&io%*`LAk7;4>VKZ<(5J^OvamXCxcoNmIBl%+WV)|2UP zjHJ-;c3PVE!6!cZGgK(Cs)2gl28-OvPhFr^W_oDpQNY~? z-6OPYWD=i4m08PE1biT#Bhy~R)C;$(fp5@MOpTTjCdYe@CTbYmMk3o{iqm{->!P5P zWZ4@}180wAF9jHlF-jSdd2DjvtEesf(cwL1XrEOB{P z9NnE^X^{}Iz7_ju?Eg8C6NL=&?sMMGp2UC|7PYitO1{wa*iD$mBzs?@E)#^c)Gyud z2F5Z)46*rL@0*x`o$`U%{v76`boU(ig1OYvJf75)KIg4BcV<8h?mg%aRzWOJo}fOH zY3lwAZH$&i?xx2qKG$xnt0@a;RjpoE8#!wYI zp5`{JJ^Bm8t|G#2?kxb!-6Rd4JH?%WsigZZPdDaJ9&m0o5Cn}2sqf&_fR$DM{f6eY zt@A~9ddGZ&QnT(j)Q{xD#3|7GE&FlH-WA82Px>1~2x-1Z&iJ(FNz4Zp7`^X!I*mPk zKK>jKUnJLb*pG`nT~)1Hp{@g3hj}^;-DY(9xl^!E4S=_omYPvbOi6RZrpucxEjNPD zwB8`NM|HQLh{>b*uJnlafMxGegWqNVPCDCk`B7;@)8$R>QqL!%`z5fW8;d>BWUpl} zRnKz(qrlerLH9YIoszQ8-G#J6-QrWv>tf)eOIYpd6}|2*WER-ebk7t^^Ycjd$Vffo zFf_NgKxO(nRG0W%ZQTjL!1dkPl)ZX;TB!GbNbS7|JzHzU3wf@bR&Aj#h!6m z|Al3+560PoQaojq&F-_7z4M9K^8t14#yHj|&Rd$ljT4|_B=@o``cfo4!;qEVC z!v%X+yrtzG_{+QEaEE=@@=p6R@R-ouh(1qJ+;~ReE8T}%j~HL6*=OGu*aa!RP5b>$ zJSe?FCSMDaeG5#Kf<{4*XVXzEnRr+1?=B)4%JWQLzL^qq8-)8@d%8EF49ZP>0hY`2 z_VV0y1U-of#9|LpV1@}xZKUXzL^ooR@i(MNx#v)h#N#cLev?XFySw*dhC%%a)Y9jC zrEQRj?o0UxT{w_WsQfl`P0QY_*cc@0TQE-CHu`tksZv6BE4kIkb4$y3YFPWe?s&#}8fJEv(CMZ_EkX28 zxIQq7OyL8*d%tfO>JWUJoJi9Ktd~CA! z+%06aFWcl>gpn6d$oxrk4=Fr$jW65m`J3o7jh8!6JyjwYbbo{b^ad-J(7hC7dcMt6 z@HY;?j#wjK28<|0Gq+14sFz(2yS?qSpmrJ_RWN_X)Ya!Uv$bfuxoNiGei#s%&(ivo z>3t5R%Rn=z{(2ENY^I$xt!NYo-3{69z!6P#h4U=%ysY`7B>Mx0unx4&OSeeyl1MGNBT?dv@^ zX!*Lzb7{Hvur$i@yu;wnF<{+Hng!Z4_lK6}6TFAnX)GpbmgnQ?Tslt-(kFzABOXkY z8JGLjIqox-ulS*bsbp5YhrG+JdK+gx_nF_|$-m$|SLKa^$h2cs-gw0~SX?D{qF4y@ zviYlsH|mDhpVjbr2lB3oMML5V!S_8dT=NKU4z_oC|F!;^bGy-}7Y z-=(@-gpc5h3BZwrD(`(?O666a*~@7WYcccCIRM;$_SsLQU8wS=F}o3jeBchm!gMU# zAxb4vhiRBDtgI-buyWvtno&l;qY;X!bG$j0ORP~WEgRHs8QxUg%TdVMX zR(Up?1WU_loQ8(+9-78O-)Wk$yUjhmsyU0nL1PAjp?ef5Szy9D9hT=8m?-+#^H{vo z0j1q3aJ!}Dr}X#v{P(Lo7pF-h@E6|vwnCee18H7%|%+aSFdIEk}P0joDc&(8y|vx`K!*cmv$F3=b0 z5n|-}+`{XFeAXd3udX`l#^_C#<2SsHft_S??Uz;)^Mg%I=#$MOi0@6|P0tDA z@T#yEZlkNqRo=vCdg5U6e}&m_Y(m#WX2QomCJWrd4g}&o?HF{01D=z{$(Q|}Br*vZ zhemB`6H9Y5B>8ub2OXm+>%w?`L+f?h0KpI$2o$3;Q9M3QFQH0}`{>a5xbn&|Whkmi zwrR^Da;Dsot6C3y98bN6UV32jarv4iSnN9Bfr7LPodS!Wg8>Q0PJt!_J^w4PN-kqj z_e0Dh(k=vU2Ce72>iiZsb9)ajda`dEU`Lw4e3x)SE&HrwFE z+M9VHHE2;n{(C?vEfW_})>O~G`HIP2&WR-&&tQJA9vc85# zgVf_;*$7_~)!B0>wmm@Wl%Ym_ton;Rzr=JVnN{+_`a-JDVi=A|#2ua&$y-79bv;uQ z`KkkN#{3XkMsp`4UgvapnMs>Z$dnFUbI9$mdHnk ze9V)NIr1?}K4!?rx$<$gd`y>*sq%4(e4Hd7ljUQQd>k(yW96esK3>_$?dp|}=j7vA z`FKV?cFD)1^6{{IJR~36NN_*eV~N zkdLS2;|X@ed=ep-jybK*9*fuf=2D~uaF2D~v+2C>*c=~DaCwkQu~>Z|V8q-Dq3s** zD?P6gKfzRli1BIfc;h{5&Wk+R7dZPj(fCSTl(*{aOXWqtpf{@7MVX^ZHgy8LNE`wk5 z_Yp(S$Ah1Y!_Y}GDv|a{q<;Ork2kfBF?4atSI47W{!U?pqUXsRMIR z2e^#6cq*L>SkT0qQHM;+R%rH7Mz}|QBa-apVnS^qvAS!Y^1h`Wk2XzY&LsyjhG2_*$M$tH-+R>NyZ5or# zn)>1W14=bsP3B8F`XmGnVnD8u+)tz=c$Xqlp2%X@_t|N77TAcaj52>>3mlIqix;~T zAGgB&S{?DatRN)qiw9d6f~iEr}T^pXbb`HSY+!VbG`Y;;Yb+s39auP^xHpDdeLwY zs4dFS7Sy80{iVDNZ+RXF{FGG@FXw-Ri;r1vJ&v=LAmhQj{W!8VcrTLB4m!Jwq|h=i zO?V|ffGoqHN!2@!aPOHyZ_Jah?-7!{RX^@eI70#^!9Ehqs3NHHg9J8Ykx$gI7=vd# z_sEBsNFk8@(0wym(N1SeSta3dtb=~AH4moHb35k28(4tG^1!FoxklCawNrB7$Lewk zFb_isk9N7k;#s(whL)guJlccE;Y~SlBAsH&^&Cc>w83aQ2!WvCxcqIMdD7savPGzd=`CKEtRya~$>8ByO9g=R78$D;6zcpalt znb{syD6B*|ollCIE@bj^Cj4K2{zp83^dq2|gF=QNl%O4{P5(y}{Y&WoaUQ6tE?-qq z;cRqPuA4qJEv2%iMsPYCT&t=ZC0B#93jdDZ<*cr)sspvs6^YISJUBIN7U#Wpt+Pnx z&a5eGY;-m9DpQQnhG{NaTB2zf&7JY8fndd+fxQX44$$W^B7OiKOo{~3gA5|jdKhk^ zna<%j;`xn$r+#c@i{hOyijBlacAmQ~L&&eLUA4}NA25)r*SM@zWz{wA2G^Y<1gmvX zb%W$CtGUnZYS_RET$R?Ux(4gSN^AKB$<=5rldNTxl?|@OM(f0Shyzb)?L)P7>uRm_ zjV^a(owdPLQ&&+YRo8*iP$$(@)YVwmx*8gZFtIX)Y#fNEyjrq0RzKoWuqnc-n!0kd zV(Qd2WcG~dq?I0lV6zIsg3Qc2t&27*;kLBxz?b_z{kREzaCxm_ITq%VQ*YCD?PG#!?HFWyWPZ z8fRktyat!`prcw$9`*eu>>K;gwt==4G`5C~bHeS$-W)>f&+bXUk=?6-eGf;~Hv8j7 zkI8UwM7yoS_6jPQ6~k~jfK1sH46@z_j=>);sF%enDv=Z(4TFjm-bgtC%o9F*;c^oL}jFVe?N7m^5xixpU%~~Eg9G+ zgr$Au?}9=6I{}Sv+0gjn@%|Xhp| zn5`!8;?79pT|BT(#nue)T}``Y9S#Ps57oDHX!=fr4{zCNcHTQQzAnT=q<%v6psl|? zuf#$L;;;}n(|7vBf_-Q?*a}{fwH$KnB^Y%&?H=11 z3}%P&88U{{4$nXzJ@8Z8Vb##|t#7}&_S=YDF)>tM+0gVY#~A(3^dl>Du<-+Yy16OF z57$t~540i8k5u0bF~=mLj=HuV;uv}AK%dwiVxLd$8>2(i=eSC~GiZBuZ=v+1`9o{N zF7!cKCs6&#hlqaf6O{4Tfm|PHEiiU;knOBjGjQum_zkt4Xlsm2c+`~__9Lz*!|=N z=l_g8rA?j%-+!e| zdhsOdYR2LvXv^HtSTNXG5DnI!YY?;lOg-nyG4SlRVDS62D5>Nt`M%aTRb!IJ3uK$cc@LZ85TWui4;ikL!1hf#gz~AKEUDF9mV& z%dy5|1&#XhDbSU%++)DP(Ssx6%r*$L#jv%UCBT@!BhP1W-k+UHTwQ^@OyFn@suW95 zIWa4tO%P}eihMK$vXnX8;|5z?tj7ps<%qc0>~<*bh%;rztkzxeHKq07Z2~X3mbU)v zAU$MDC9o@Tq;}BsrHdfCa;O~N*|B&S{-#Xx1h%n{Ga6?vc6J+YbnETnaFbO=Tv8R4F z82mQz!`d?V(iT(A04s1lpG1J(pC6R=cmgu+B^f$Dz&{{Sd+bN~Ik~)r+T*KekNC$; zwzx!3)PlH`OX5m0<5pIWh)YBb2|#n?00v+#WR zHHzN{Y%&YD^e%N61ZTi)ob4vMDGZ#{&jxhZ5}jz*j+hc9jqDV93#0o&QX2 z6ChWB{a^HOg7yDC{>+SX7;8m13PGUrWoC>aALOh)WLu1Z+!{{ic2T?K?Z8@G|N1fv zJ0i3T)Gdrarr4!EKtC0mh_%k;IH!8Z?S;7Tn5g0zXfM=2Z7*94iqL&k0@%oRt&lSX za+Lfl_rnEo*1C`$lO03z-u=Kjfb~$)Wxm52btYdEG*%iza%U#Pp9Ox;PlCY@09WzK z8e(<`9F@udg#Hms{ZE5Ir;OLfptZ112&-WLkQnqNe!;F$LNMLHlb*iVYSYF9(Ce z38=(}d_O{@p>FGUXvi}^6oe;sVq6cQT>K^e+&D&*aO%< z#r`FB^A7}J6!s+Sldw<6J{Nm7b_e$5*lAmh<3{Y;U&*{VaAf{F#hB6?;AQ zjo6#9)Alc)g!|+TAbMQt|?oOe_(*?dZ*J>ySBOk4Is4e>ni%9gCKkdSB);oSyo@~ls43Z za#C1YaJ}esH8j-LQC4+U)#Hr_7pM>5++9;sUnZ>_dS1%tDm6aQ`?C0yfOrn2(721&>?mEl_oq~~4}0t9bV2*N|ADzu~^tTk1wL*U?S zmuZb$_7l^Z@ky?F8JaLlT=qzw+?M#idu^rR@X{Z`0>0bD3R)*4*%{fc(eWAUmz@9f_I(tJ2A`>B( z_BD-bD;gwDorLTEzxGf&=E4qTkMM4m;6V9McJMYzl@+(&jyHGcrLKWCde3PG_J3{v zZ+bv%%Mg;V&uz^ROnd$n2mdcc0o_L!ScOgOZ(u@(z@AIXPDo_sn8>p?DP`in4*%D9 zfNq=Q_7|yA)c&Jx$`Ddgrt$w98!D#Z4PpKQ=rlegO{=J@t*Tx%t$N1nS<@;utirq| zrC6A@x^9hY+C#2tY4tSXV(*|b-g0+!O{FG9c{_D#MMGU<9JxEr?Aeh*J~0AvTFrl9`sq-(j^*T_d?`UGrACYF!Q06}T*Gs8~I(dgkm| z)~TzM{|l#Erz(3Dvj*?SPUV%cPOYk~o7yOqRXjA6-onL{8I$|ifgQkEr>9i>H`kh$ z2n?nu%pV2gS#}=nuBDkLUM?o0!4TcJ8na%jo@$P&sjFROWq%kf*2K;$>)hp-yc)z| zG))tXccYCVUd5Sc+U>3qtm3hEQ55B@ml_1|IGy970t&@HkQt^ZHklN}x2VV*<*ceH zTP28ZQ&}voa6g6L5TvVkut60G75_+tM6kN6@S3t9zC+jJqny&3`l?#IST2YsNnDaJ z%yc)7(b>6qc0oL~m{gp>pUc>X3nSRAf%vy`xH1@`c=cH&P0_3(I#-Nv;^w77FjSB( zcCl74RAwT?hnYy(2;EJM;Yki_+|cMm{4@xLSBYRI?s3?I~jIs#K$ zyrwM}F7+}c2!D2YS-o6S_8?-&a780j*An3iBE&fPJ(IyMk}`uSnqJ~&H$5Zja9>wj zDH!K6yKsg71>-#BicB=#tz4m|g3(5{#yBg>Hq=zFS}h5tL7wgdW5xt=>ahl@2In1;le@AY^pVzR*(H{`s#KFSBu7`!FS?}R`nCT<@9Z6NYj1vas z_z|j9XMG*o9gdHB@dv>00@uSD`Q>9E8$`1j5iIKCaUX*2URRGBnpJ{{EHz&rz;KsP zTSqs-tPEG^({%qRhzSj@dM9pEtE$&K)134&zhDTZrE{7wls22wObIo0P$Y9ju`6L% zg1fc>x7e;qCzT4(32RxB;aBDa{5uKUIK#H#Xn5FVHbx0TFHUg%R~&|!veACVFK`-z zs@1#j?=_g&jl!_`A^~OcT8;iyMyDH8UUi({HhI+sAvU`G5r~hXd-~`@|9~@uDAFDM z3c17-Ra=J}uvN7}bO*JCSuoxKv?d48Mj<`AZ6C>S^MB6Zr1%x050U^OieGddCN{xL zy6BVzol!6n-zcP6TArzEa8}?Zu@MWi(MNxPmCPvodkG=>cigBNSD6s~I-Q%)>8q0l3SXR?D7x6xo*U+`haE1u$ zqt>ihFLQiI9LEdWq75Ihdi*(Ty zRfWbBqA$_Kalo+35`CF2PDE8ztj5I^x;Pb8)%Y-0iK4%ttJ9<9^`2-!>_&ah&^4__ z$=89=jYt7l&}fv_NU|NGNStSt67rv1Vq_)floIAhxyZzd&W}b%50w?g$i0jV7t6|c zea)=wN}^0eF){P9;jBy$6N$w7Ckq$3bOb9k@lrP}pscD5EstU4W?mj@Wh^U*6%)~q zDxFfZXq_n{9EY8faXO&`>5khm=ib`^AdCnsH0%w-pVK2zC7i2EQD4=l_+nxQO z40=?tBM-}6kW?%fwGxFlJI}U&sVOe8<>d(`4Uu2CXo(ONa&6BqEL!T!&n?ckm1O2P zIm0jwkX;I!GV>iyTS1m{evz#JApCQ$=z$Tl(gpLth~h#rvRD}22WHDF4N)bG(29%f zw&LQ#OlNKZ*7*v_PpF$cPlySJWIJ?-SPfyz%q-0>&9jx*orR?(3kq`!7C3E1uw$f# zaTFEi6)q^XJ4=hH7%sC5aayt6ksDTQ(Td4md3GCk;x(e9v^d9^&wMQ;Xk?O~hbBj< zFiIn56_(Cd$fGr~f-ZCji5gV_gE~f|I&4|a;+(>w5@&X4L1syAVSzAKUs_}@DJ?1} z7RG7h?84F_=e?z9?7ZCk+!A5DR)pp%S!^qUtwr{1J0gWVGv8id&(6(6Obgd&(7a5C z97fk_L^NI&Jeif7y;QhPBa^do3o^6pnL?6AMGM;(*o&N5+2F9V1}GM;*UAeWB~IId zQsD-TWLs32n?-(iW)~JYZCP1G!i`#KabDqKXD-?ufAVKcr&>NyEs^Qe095pP&_P){4-rY{ zElkwYGV@BZgj@8q`6a@wdP+_%b60jQjF_Y^Dh?@{tS`#WF0$Jl!fhJWzNExCJ9WnF zJDiz?1xN@5CB?$+TJa)#W=UaD?)`Qr4?SUuR<-~Ufo{nXle3s=gU*sCOw|xXEGU4$nX=$6I8 zObx-ax-Q(1$~YK}FiS&Hr0|Ath9d5Wh)@O0){0q|a1`g1X3rPqXk=NYl3bnkCHBlx zmOk#(K)hF^&tHlxO8Fpn3A}k%X!(-qGiUYJ%yS0->RWoA4w*K6w%W3HYbA32Tbx^x zL;YU3M=P@BEw(K!c4lMH!VqTz06{HeXn@iJr20JSmU;F9!KM`y=j3LWqzUsi%Kdig zv`b1bYCE~Ef-E6ZD@UKsFN8njPDsf{$kK|lZN(+BuLQeB4oQp7#YMR#b|G6UWGN#* z&ABMo=0rp;&`JslOW<9HEw{*qfkMd9N|YG@%`x~`o*Pmq+jt+#2Ex7JB{{i#PO(rc zk}E{+6Y?}N57oRvd4Mby^0hJw&Lx>S3+4+2dLn9+Dimrost1oa%3Oj&E8!s~MbmKJED$%sp+ zr|^j*yPjXX*yfPuiHyK(j^Z}o0G09_n@@|GVVcb*0~r-V6KVB!47YYd^k@TBd91Ut z4)>{Uy4l0Ca_4INx`UI$*HpP`D*#M0JPHZJOhx!R2EYB_te{_Xkf+vnMXkWsloARG zd1wj=n1)adv*=(*$fScYVLly93B|c|j7rF2$6*N=UO*_ud^Iz#aQ=KdqJb043HR}n z;gDS5lrKgkaMwB8s(6uEY8>5Ll zKaWqKF)ur}2!TU|3A`#x*!ajqk75XRIy%9=2>OYGT_+~Y=Q4{iyTg1}D;b-RpD!Ca zPO(L08y{kjO1wt4N+nz?6KF=wv|WelmuM=ILdsR9>l5;A#S5LxOvZErC$RGynT_n! znt(|piFIZon2Iq%Oc0D)(7@~#tpQESV#*;H%W)o4S-xKTHIOxBSi7n)6Nn0CrS~bS zN|Vm^UMAq$P%OdTy3&nyt88Ynj%1Vab`w}2(NrTK_n z4U}hFh}(pM62!7blz|{1w8O~hSohP21%(Jh8v^a5ip_LJ;{` z*|z+&RP-N>I6n)frs0;T4{17Xhx(9a;5MiaDIK>vA*2!}>)O7g>A2C+Q1{b>FAaA& z8i^K0uMZgpgy?IATgD?u*&+iaSt0t`5DH7K4HTyA8IrTS&RttcFOWq~7|xda8DDj6 zMIAj53j^K6KxRs&=McS0?>mk2801`*a`6Hddfvq01i-T#`FRjq+>S22FPC+J;cm+6 z#%u783=L-fU?lwMh{0s4!U7f^WSEVxr@qFu-l`Bx%EO{~wMe0iS1G!uO7SKq9t1%g z=7561YIHi41!1RPo&-Yz(@yhcs3-APs9;?zZzKCM(XhIL402L$B z)uMZ@nR^YIL?%S#j^>2e2~af+;zo`UZ@q@I#zispmRlep-o$Lk9j#cAFbN`)z%Ytg z7p2fg%ho|MS(g}ciOP-%5feq`jU5LuWD$OS=T;oXrwa>6N0b3M;QzjD4XR`ia`9Ib zFUO6N^0$D?}OSEdt}yqIlCyOBbfDnzwXm>a@FWy2&6y zd@&#fA)gfVRT%mLf&2qjQ?*wQkU?wQcy=?eSt#uTr1uU6X96hnt%iXa@G7NLSzVX1 zn*4-QJUQg&cz+fTZ237oJ>_TgL=@=`7kKbW50s{|=T>F4QX^=1WJ&K);0*bj&Za^H z72r~N%>WNn1z}Zr%~X0ffy!{HlvU8hRd4a&3}QpmY&7F{h3L1RtgDZg@U)hP1I z+Nmlf1#e~JrEIn#s05=p3uU42mI*>iIqoOrjiT5n(m&PGZz=5U5<$QR;e{`Q=msLP z4W$RXJ|vanw+3rd@UC(BgTzJLOb%V(N8tHJb%JVaJFrt4*C;>7Rfb|SnHga_1X?P3 zBd@zsFV00a-vB<$DnhoD$}*`;zGk{au=m-Nx~n#ekq4Ml;M<3tBpAg?{3VInmeQap zqgoop3av2Y>_a*SE5{^+lWhLnymIsn=2HqaYNE z8W+7^L@}*VqEX9@I?7~FnsgNU!d0`5QU}Ub9pxLKJfWlP0i{((c>|PfI?CTb*{-9E zgK1CcC>fya&{3*Ec}7S11}M9AlovsHR!2Dl${roXY{CIu& zzk$-GqtJ&o59uiHfO1$zF`>ba>L_WTbm=JfgK}I)*#gQ59p%TMP~XrjJO;{X9pxe@ zXLJ<$##KN^Spdpe9pzzA&gm%IK{>CZ{1%j69pz(CuIMOZqj8Bi(=40^ib+SQ1ZCw^ z21C!Ke-;6U$s0m~ZQE1~axb|1Zn!*%d{vP>` zZwl9URE)y)Ym$?y=o$;S<|KuyL&Ydu$3c+>;rd9$C|sX`vV0IOGhRvH7=>#rD3a>= zc%@40s92bxViYbHC@WPiea2R}o>Vak*RMcHSGjJ74h5^7y`y3jt}j42tF~7SxDd|r zrtse}Lcu6pHK1IXp?H1*@Zp~Snu<}leg?`3l`Ai+&b3QT1Wu_OhuMg=-Ti4pkTZl3uts4yYJ~i#kTK zsw*zUK0&SFohnA*sskl2P4PzLnBS#h6s}{S#7|ea3ZW}J+kBy76t0_L)Jm1h4lc!W z+F7oOQMeuirAw{X z(;bR8B1i8L6{B#aBOFevToh5^t-MUdC|sLBnVq8OLJ)*(iiJN?F$&jFP_hQ$x}ahd zuIrF0&Z^#sTrazdQMeuir9|zO9@rNi8!xLEg=^#}%zso1$A{EPP^08N6{B#qf?`rz zIdXd)S1}6L=+T%tOjmrE1YO~tcc~bK>sO%6PF1)fd*iT*QMmpH$`#eZ$XtI@F$x#` z3x!zK^YlA-;TFzTF$&j1plnmQvLkXmtzs0ec7*W>*Bq5GbxHf}wXpo-rJr$#H?FHqE$^}!^IMUAOXG1wg;mRC` zUa7Y7l!z8eDn{Yj0m>v*SL9ZHSH&n?;}GVPR3Ao;Ub~7>xN1S!twwKTT|ZJW3fD%73Dq0gNDjBC-ZWw=$1w`m3{bAjQgmVJ9I`1n%Bx}&u6ICr zZl=P8P8+f*TvQMh8!>5r=xMvlXIDn{X|2IT}g2#;R4CPJ_L zzKT(}xM6MsH7=`OCP*MkJWh)jyI7Z=efpS>& zJSL_go8tKwRE)wk0u%pa)rVQ&3D5JjDn{Y@9Vlnin8%P4vMIXghrc;S;hJK_=rD*6 z3sj84^$;kh)p}7xQOog7(baBMFbdaLbdK{XS7dL@Rxt`!DJWM|uE-JfxQbD@eg#UG z$`x7HA5@IO^$$>1590ZWHz^o}s|b|ys^=qTn{TTah3jolo=`JDE}SRI9u(9JFym$g zqj3EjC?^J~*UwZ8aXImW0Torw)Tfay=-!j}k=KBEPDi-{%KIusSwrJ@tTd+lC(J{K z3)z%4G>T3GcB57S6{W19SwVqtV8TJl`dB5EGt55x4c`)yaql^s`^hNY7Y0aSYwwtk zsTi^>T;GSFCcGL>Y7DG-d7`Pl5 z7D3Kqz^onwvlEydD#ighWIf*$dkzD0PQ_%QFdWkZOghLWDitH!W0;6Fy+JV70Q1Zs zm{ed+4T5<9m_!&ekUc(N@>ERZws;{u6xogSd)nw*d7}&87d~S zJ>LRmql$^F>yN-t9~`LeH{6Olg+VY?z$6bFSk5!REFT1O3YcvwCbAD>CZSDLOjblc z&jiLAJ+M71fLSsK#sf_2Aec5_4iAD!r(0X|!1g$SnLP-`4@~_am=}TBJqV^7nA3w` zY`C!=KYU=Dy}&pI!Mq8~)aFu;?hWnsLb~8T3+jN@^-er7tr= zvixk_41iu&SD3DCVY-^abZs1huJ|xrN5gcrhUuc`wY(OxH)hojLD%>&T{H^oB1c}IkL~D^lpwpn~L=7??|bAwtFGx9A-`InePB{ zIELiVuf3xJA)9gsJqa|J4GfKI;hU3|vM{^oPZx1C0F$a*9pja^j(R-|wagp|05l%M~P~8-dWq`sxW>w2V zPcA|-eGWh`xsB-}$uWre384(?+hQw0?XTUH)gCL{0s)Zo6P*mYQ2JLFMsxC>Hd1d7 z>+dyT{hiii(0MhkS=(U@r}UqnPlV~Bw>orkX3{E+j*?yyriLkys z4AbQZ)3tgaUGiIb1(3tv4XeV>N04{*TOw8yX`^0l6n})j;rYcXW6%wONyOjqEk(v4 z@PK(3f2rlPO=;7BQg`t-tx!HwatmpI*^m(g^c26L>ubUZa&F-LVOh z<8PKFldwLUqKjil7kw>&-bm0kB^xU>jyUefZ;+l=?V(%|zI`3`v|^&5)%|Hu9O!5o z<=3F>&{19i<(!T}PZ%7xhjMj;(xg(@dui@V6e59)|fe3`0*MbX>FO7r}ItnNz|r?}lL}g<;+b!z71cj`qdOI@p&oGbxPg zg)q$cFwD>UVrD%PM)_`E%FNg>IZyV*%zC^pWu_^N>ya?b6?6)nS7%j*VS2+b_lIH5 zg<5+yIRjRqAw=B3%yx~3Fn&G6()z?UDk6^7S&N^(XRmN zC^HX-VGf014uxTU7=~#J!~A;~W`7vwu`tZOFid$E=D9G8BMh@A3^O+j^K2MqN*HE$ z80OkA%rjw_*f7kFFwB*{@jUaXFwDncnC)Shcf&B-!Z2N7nAR}NzA(%aVVE6#G3o2W zVl|9w=BY3_UxxYTL>PufY+bCT9}3eI!X?kTqrnySZ(;D8{P;auwq3$_x*adNpwqD# z2IgUS?|^1usG3X}3rZ>`r8IU&oC(XTSlZj^OtkKgGHX&LqkeriWd>4@0t`J7brH`g z?5fRuo{3X=*uPKdXQkqHwO*u)=AYq4%>gEd)txZprEtuLpst6X@jo!(Gf!o9K`zy` z;H=udxo+lph}UCsG>km^3IM}&K_9*=0}G!}v@0vg)90c@Cub=4anl`PTtisJN?+dB z=9%?&6~=W!<)WIFqoztup!Z2C*vC9}OyQA9@rtkZ0CQMJ@q@BW zmdr8V4e=PK{00z2)lpPb@A1vpUQ}pd>=A z#`Op&Z8{(NKxx)tehLazgz_r4`4A{(9i|HuzG82cG2NgDI(xnVg|CJIBVL1I7}sY@ z#4C_jV4h~-ZJ;Pwool~?UX#S8`FS-c%DNWEd=(UBMB|iifuhWoIpqhk9Ialz28G@T zq6|r%=O2-YhcVi{=UXzDru{Tgbg|J3ijuXsu2FZPUb?ohf-(-O$p;*h2Fe~?TigSR zGDG8-#h~=+Fx8+yIa|x+m`6cbj#KVK{1yoNkdRf!-;AuO)3`z3NM98{v9aF zeI@w^-+aN(V$h~}<0LQ|#VLOpX{Ap4Ibf_hU0;Ht-2L%d#99p}3Kj-JVuKA; zLPm&o8*%A$Eu`U0*E(gOoYr9;24${JR}*pRF#iUMGCM`x<)8S?(P6$1%nqHLpMpZG zSXw-{fuhey?}C!5lhX~#IW=0G{MY7LZqZ`(GBC7hSu}bc`l+r>$AXflvu7eGN#FvJ z?fAwVDEoBUZJ?y8a_}q7?4wihDhAJ7kTc6jxg2$zQps%5a#R82WFT>95xyK0hbo8o zt3aWR#}9sP1;1LFU$Pn$t)^>%k#v-=fRe1EJSof3wErh4nu9O^st1+yipH>hkJFb*8${za{`mgu3nQh?Fwj$f~?p-+a@t98e3+OQ9d z#ez#~i+SK04~o{C9H1!kD8eDnfugLXaLQUxtU3$73JQtUvfnzpk(N5J_SmvPS;0FPJD{gFl`ylu0^F3Q^Qrph&nA6lE=iOLl_7pMR0f*8(FF zP`9lI<_Vpg7eFDL=EGy4(56v70Hs97^(iPyymRee5SPw}qvvBh)z#~IP?Wn8&Xo>| z@+^r{Y@pDl#o;1Qv^fcttp=r648^RKxip)<0m^nA<_BSzmq6ifKEPunSU3#I5}b1F zl>O+#gX49zI01}ur^)6>^l?3bzavC)Xk?_X4rJ)KJ^>d!pU~QUSSChc_8d*oJ{FWN z9oIxq^jRVclz)W6#Zp;=gwfHtxVkpK52+GAskjOsvvD{ECg{adUfP`cYFCA8T{V7Wl>OvUgS$df z%4V?iUxptvqG4L5&cde)=sOvlf3_3f{$U^Vz;(eKm{sd`R;*v2H$9EMoLN;yAN-&% zOyFnbYN{(X*cI8SC`A3($0uY{(xiqB^jV8gT54G(erri3;k%h>GvOT9dTuTKKvUjK ze08?b#Uw{8pH*Ae=q_*UA21s#s@LF?1^q+rpwEfoCw2Nqq@~(3@dKX~4b}Bh|EQVl z!<+q=&&DtEV5oLg_79m+w(g<+OVd~3(>VPX&vXr3o;IC+0I+65Eq)5ItfqfCX*1T8 z(bq%dCLSC}U#2Lp8-hdvx`qlYuUj`X)vkenb9i0KYI%4@45GAj4kGhv@lo6X)Xw5a zbSHc%%8d`H435PwRIYWFtu3n_NN##nT?0f9!RM(mvT>j|N>k+F8%q^+^#j%Y4q09m zeVQ3RBULjHcm@`i*mr{l>o93DkbWF<02fW?Fc-eMG9XUYTaK^9;oCL?2$c2WGb$AW zbfh#HR$tcOsvVlNfohS?Yk`mUlHP%kvR*dy46e7aeqd=cRlUdycu9ExiL>PP;J-SG zPy7ymm5pS-r>ej(7F4<<#4tt`XEDY-e0i*z{pPBKuf8Cov9|`2F;2|J=aJp?dF(k= z_!^9@p`mO8eU^9@|L9h3b#Ym4wVjI{B2*QGq8H42V_l`oxr@yuKEDz zJJYHJy$U!kZ5EC5{441gxG_J0)|u?*-8AnG3{v&=C$3LhMUgcFHfQl1XA$~GNt%;Q8vb{w(yBJwndQQQPu&LO(Q5lz z7?s8?N>wZx5TOVPb;OKX*E+4A(EzWE-yyv`GH6KR)LszVWel%6e3gip_|UYu%Th;Jecf|14{ zby`PV_`krens624Q97k3266OYR1=(M>FmS9gJ!*`^QI`dB0YdlQ7TM z$H#wPslu$+z zS@O(qtI9+0NUgqitEIM~sYhXmd2N8v@r5=<9|*lCKnDsNNo4KV4{BPD4H>@8i%cH= zl1o@FS$7tDZIa37yu3x-mA)Qjxb8CDH~42)cpD6d3@zSizGn{;s9UFO8&qvD)&XA= z+d+7r6dVv)TP6i-Cc0&{D~|=;XbwI;umiiswN6kX@0fLk&8D)>F%KG@qZZry6idO* z&Tl43GTC>(vHyOx(O9cFG1ITs&mw9&&=S)n^ZUSM70FOVo12+*^(1S;Rpnj2Cdq}^ zfT-@4{&`vN`j!Q(b-VfwBst_m@IjkfHbhsbYbR-u_l~|K3XGAZwBi(MS z0`40V;1Y7Otq4r5|5X8qY2qk)TMl;MJtf@MxZNI{+>Tb_m(K5y03UE8qZ0uOfYQG8 zAw9vFp3Ff3D#6#|FDXZv!X+L!m-y~r9m+9X9?I3%^#0ca(2DI)TV{PF34fttj_gHp zKiqSnzdw~Fboe{Iaf`378{88yXYx{%UAkaXJY@y0pWxGA74G-A>p?F#!t~~Z1=;Q_ zOM?!4fSfa~9U?nn*rT^#07(w@JV^a%VenY0f8k>~C-l|MXHiG&V56Z2qfawQQUe7NNSQHa15 za;oi044V$AJUArUc%5M6_`#b!I=KVc9UN^nPo4AlS`o)Fw2jcZ;|dgxi)qj(d0X%X zJ{=J;tb@JxQH$p5wAJ;g;0#0$)%i@2l<_IY)}uoyjPb2Iqwrt{#{7me1Fbd6L}C#; zVrFp%{tA0_nZtn2(Y^A^D)>HBugh&=gbx)jg zJL-5#(3NmC1kJUW2a#&5Hv{}1EB|=46IW;*On%A6Ut{+YnRdqFhx zH>fnevNEYr0_2ab^C>!BQtKOF88bS&v*XJHvhUQBwDE`8ZK+=cepqPI>v$XKkdL~+ zqnPM~x?X97IsSGuNG?G82BNxJj>bEL-PKn-Jm~dk6dbyQjFMe0^8^SeE#daa!?x<@)v#x6I3@ zzw700wm=^bZsnn+2hFVL!pRmZLvMs$EejlxKr85BUYp-leS=$+InMOa38Wv%mrLl; z^W5O&pgil#WRFI*6*^vM4*g*s4-cfZsJ%m5PM(|l;+Y|azb*?d-0A_`lw_{Yr_@wS zSLHElQP4Nd&2oi)g;{~7B73*bH8gG4_B7~~vRzQO1=v!|nJcn3@qke6|KfLZbWief zIj0t^?m@l4J>HUumpQl?k$Vrasz#@SKjaZI^B%QDRe2AZqPVvYPOpytN=$O`4K1=* zmm00?AA?3L5|dnG-$i+e8@S}7GrNbMKkt9uk@p66tXwq33SwuD0x&XLV@R1!sgL5c ztcqi_Ih$W40HxLCvTkwf^2_AV4K@Ezdms?H`gw7E1`IE!$;%vEy!fRp?gXdK>C; zU=GUSjE!FYf2#sGvRTM7gBCcL4O;Y2RG(pC+}A(}enrN|gNgGO=&$M+Po~xMY>-jc zRRauvrPZq7=@d0<5_6=8b+amIV0iZ?0 z8ex}q=t+AqWP|rYWOp#93>?6vjxuXl%yd#=>RZAW?Q~f^gWHb$0GCrNaa=>1JWKyY zCk{2gJ)@g&W*&-VLq$*4av}+@BIvXLZi}9jktfnTZrO-?jwN-&IlQsVjmcI^toF2H zhSIgFM_K?kP%dj~Wfa*hGP;4%>3<+wx^IK90Y6ti;+QO#QWIQ>xB>F3Romn+8-q)M z8MzDrT(XCu^SYz5Zuo@lfTV?u8D;~+zv_Hd6@RkM9gE5j4BhGx3BRs#5_>QHI~WoA zA8t?}-r0RD()(Q~TVy^xPX09FT)rmX&n}qpf+LF1ktvP@`|5;_pvJPw+~CYzNo?FP zIA?Z?)-u>V06YD;E7FBhA0fmvCV$*B6V^UY&F#B_V8knA{Mx7@G6iqp#}w9}aQi|7jy13Y zsDd^CUKDpVo;W=7Us%1Zfk(ey??S*fmb!BWJO(%OSiMBBos=4J1W;Hs%g%~9+v$0o zf*$s=qI0sOG<@%vo_wKo=#Ewf^^`AzJF#brXNlE*OrrM(`ikS| z&8thwqj>&#kv>Gji$Le1JjOcY=`2fGIN=}hOcE|)W@2A(f_bEd9dlGDAQb}B9eyz3 z(8)&93gi4!=SZV|ajh$bQy>=O950z8WX6JSpB(vaPzOs9ecMw9VrMY$ueeMNvic}W zdg9E2Uh&{i|IY)GAnDsbsnVt?nh~^F&m}2lIQ9iM>|Em!&xEiY5@@;CRw$O@tcJl4 zOxlZ{&8l|6b8SB3?`hoHHgo4yHl=av1KyjAR`j+cVR;_Dg2%<(irXsvEh!WuYG26& z8b}UqJM#PK2^*nhQ)7dN)>rdDK?lA{5@rNRZU0>&h(ztaY46R9LWVQ8`(imSD!ln2 z#Y3I$Df_VRP;{ZGSFRvJ`EC`$LnI4H?QK9*^8t2M&f8mHz(g}G%I|tgKzmM?K@GC` zVK&UbMw8q1UTHL}2a(ZIGjy6dh>b@(m-#?uy(D^x=?yl&TFUN%$$_n~jReOwWEprr Wfdr)?lSkbTbIrcYtrJK@ +using namespace std; +class Solution +{ +public: + vector findArray(vector &A) + { + for (int i = A.size() - 1; i > 0; --i) + A[i] ^= A[i - 1]; + return A; + } +}; + +int main() +{ + Solution b; + vector arr = {5, 2, 0, 3, 1}; + auto ans = b.findArray(arr); + for (int x : ans) + cout << x << endl; + return 0; +} \ No newline at end of file diff --git a/bubble_sort.cpp b/bubble_sort.cpp index f632362..12aa9ac 100644 --- a/bubble_sort.cpp +++ b/bubble_sort.cpp @@ -1,36 +1,36 @@ -#include -using namespace std; -int main() -{ - int arr[50], tot, i, j, k, elem, index; - cout<<"Enter the Size for Array: "; - cin>>tot; - cout<<"Enter "<>arr[i]; - for(i=1; ij; k--) - arr[k] = arr[k-1]; - break; - } - } - } - else - continue; - arr[index] = elem; - } - cout<<"\nThe New Array (Sorted Array):\n"; - for(i=0; i +using namespace std; +int main() +{ + int arr[50], tot, i, j, k, elem, index; + cout<<"Enter the Size for Array: "; + cin>>tot; + cout<<"Enter "<>arr[i]; + for(i=1; ij; k--) + arr[k] = arr[k-1]; + break; + } + } + } + else + continue; + arr[index] = elem; + } + cout<<"\nThe New Array (Sorted Array):\n"; + for(i=0; i +using namespace std; +class Solution +{ +public: + vector findArray(vector &A) + { + for (int i = A.size() - 1; i > 0; --i) + A[i] ^= A[i - 1]; + return A; + } +}; + +int main() +{ + Solution b; + vector arr = {5, 2, 0, 3, 1}; + cout << b.findArray(arr) << endl; + return 0; +} \ No newline at end of file From 542aef9116c69c23e603fc1b3915586596dbe18a Mon Sep 17 00:00:00 2001 From: fulpopy Date: Fri, 14 Oct 2022 01:39:57 +0530 Subject: [PATCH 190/290] 2428. Maximum Sum of an Hourglass --- 2428. Maximum Sum of an Hourglass.cpp | 30 +++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 2428. Maximum Sum of an Hourglass.cpp diff --git a/2428. Maximum Sum of an Hourglass.cpp b/2428. Maximum Sum of an Hourglass.cpp new file mode 100644 index 0000000..0d2cf04 --- /dev/null +++ b/2428. Maximum Sum of an Hourglass.cpp @@ -0,0 +1,30 @@ +#include +using namespace std; +class Solution +{ +public: + int maxSum(vector> &grid) + { + // vector> pos = {{0,0},{0,1},{0,2},{1,1},{2,0},{2,1},{2,2}}; + int sum = 0; + for (int i = 0; i < grid.size(); i++) + { + for (int j = 0; j < grid[0].size(); j++) + { + if (i + 2 < grid.size() && j + 2 < grid[0].size()) + { + int temp = grid[i][j] + grid[i][j + 1] + grid[i][j + 2] + grid[i + 1][j + 1] + grid[i + 2][j] + grid[i + 2][j + 1] + grid[i + 2][j + 2]; + sum = max(sum, temp); + } + } + } + return sum; + } +}; +int main() +{ + Solution b; + vector> grid = {{6, 2, 1, 3}, {4, 2, 1, 5}, {9, 2, 8, 7}, {4, 1, 2, 9}}; + cout << b.maxSum(grid) << endl; + return 0; +} \ No newline at end of file From a8b67fa354c00f713dd6f7881bc1ac773f7137c2 Mon Sep 17 00:00:00 2001 From: Abhaysharmaa23 <113036363+Abhaysharmaa23@users.noreply.github.com> Date: Fri, 14 Oct 2022 08:33:26 +0530 Subject: [PATCH 191/290] rotate_bits Sir, I want to contribute to your repository please add my code --- rotate_bits | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 rotate_bits diff --git a/rotate_bits b/rotate_bits new file mode 100644 index 0000000..89ac4df --- /dev/null +++ b/rotate_bits @@ -0,0 +1,29 @@ +#include +using namespace std; + +int INT_BITS = 32; + + +int leftRotate(int n, unsigned int d) { + return (n << d)|(n >> (INT_BITS - d)); +} + + +int rightRotate(int n, unsigned int d) { + return (n >> d)|(n << (INT_BITS - d)); +} + +int main() { + + int n = 4; + + + int d = 2; + + + cout << "Left Rotation of " << n << " by " << d << " is " << leftRotate(n, d)<<"\n"; + + cout << "Right Rotation of " << n <<" by " << d << " is "<< rightRotate(n, d); + + return 0; +} From 016b71c6763fb0533b7ca88c514b1ef4714553ca Mon Sep 17 00:00:00 2001 From: Amit Das <91092039+das-amit@users.noreply.github.com> Date: Fri, 14 Oct 2022 11:33:14 +0530 Subject: [PATCH 192/290] Added LeetCode daily problem 14th Oct 2022 --- ...Delete_the_Middle_Node_of_a_Linked_List.java | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 2095_Delete_the_Middle_Node_of_a_Linked_List.java diff --git a/2095_Delete_the_Middle_Node_of_a_Linked_List.java b/2095_Delete_the_Middle_Node_of_a_Linked_List.java new file mode 100644 index 0000000..bb15df5 --- /dev/null +++ b/2095_Delete_the_Middle_Node_of_a_Linked_List.java @@ -0,0 +1,17 @@ +class Solution { + public ListNode deleteMiddle(ListNode head) { + if(head.next == null){ + return head.next; + } + ListNode slow = head; + ListNode fast = head; + ListNode prev = null; + while(fast != null && fast.next != null){ + prev = slow; + slow = slow.next; + fast = fast.next.next; + } + prev.next = prev.next.next; + return head; + } +} From ce5e1470c4485959115afa557c5ec819e1f8f8b2 Mon Sep 17 00:00:00 2001 From: khushbubijawat <68491547+khushbubijawat@users.noreply.github.com> Date: Fri, 14 Oct 2022 12:17:54 +0530 Subject: [PATCH 193/290] Add files via upload --- dijkstras.cpp | 81 +++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 81 insertions(+) create mode 100644 dijkstras.cpp diff --git a/dijkstras.cpp b/dijkstras.cpp new file mode 100644 index 0000000..8c2bfd3 --- /dev/null +++ b/dijkstras.cpp @@ -0,0 +1,81 @@ +#include +using namespace std; +#include + + +#define V 9 + +int minDistance(int dist[], bool sptSet[]) +{ + + + int min = INT_MAX, min_index; + + for (int v = 0; v < V; v++) + if (sptSet[v] == false && dist[v] <= min) + min = dist[v], min_index = v; + + return min_index; +} + + +void printSolution(int dist[]) +{ + cout << "Vertex \t Distance from Source" << endl; + for (int i = 0; i < V; i++) + cout << i << " \t\t\t\t" << dist[i] << endl; +} + + +void dijkstra(int graph[V][V], int src) +{ + int dist[V]; + + bool sptSet[V]; + for (int i = 0; i < V; i++) + dist[i] = INT_MAX, sptSet[i] = false; + + + dist[src] = 0; + + + for (int count = 0; count < V - 1; count++) { + + int u = minDistance(dist, sptSet); + + + sptSet[u] = true; + + + for (int v = 0; v < V; v++) + + + if (!sptSet[v] && graph[u][v] + && dist[u] != INT_MAX + && dist[u] + graph[u][v] < dist[v]) + dist[v] = dist[u] + graph[u][v]; + } + + + printSolution(dist); +} + + +int main() +{ + + + int graph[V][V] = { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, + { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, + { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, + { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, + { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, + { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, + { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, + { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, + { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; + + dijkstra(graph, 0); + + return 0; +} From 35a611eddc883641d57f688385c6eab65af40908 Mon Sep 17 00:00:00 2001 From: khushbubijawat <68491547+khushbubijawat@users.noreply.github.com> Date: Fri, 14 Oct 2022 12:48:56 +0530 Subject: [PATCH 194/290] Add files via upload --- merge two sorted array.cpp | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 merge two sorted array.cpp diff --git a/merge two sorted array.cpp b/merge two sorted array.cpp new file mode 100644 index 0000000..aa4ff1b --- /dev/null +++ b/merge two sorted array.cpp @@ -0,0 +1,37 @@ +#include +using namespace std; + +void mergeArrays(int arr1[], int arr2[], int n1, + int n2, int arr3[]) +{ + int i = 0, j = 0, k = 0; + + while(i < n1){ + arr3[k++] = arr1[i++]; + } + + + while(j < n2){ + arr3[k++] = arr2[j++]; + } + + + sort(arr3, arr3+n1+n2); +} +int main() +{ + int arr1[] = {1, 3, 5, 7}; + int n1 = sizeof(arr1) / sizeof(arr1[0]); + + int arr2[] = {2, 4, 6, 8}; + int n2 = sizeof(arr2) / sizeof(arr2[0]); + + int arr3[n1+n2]; + mergeArrays(arr1, arr2, n1, n2, arr3); + + cout << "Array after merging" < Date: Fri, 14 Oct 2022 13:17:19 +0530 Subject: [PATCH 195/290] Add files via upload --- traping rain water.cpp | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 traping rain water.cpp diff --git a/traping rain water.cpp b/traping rain water.cpp new file mode 100644 index 0000000..0b3eddd --- /dev/null +++ b/traping rain water.cpp @@ -0,0 +1,39 @@ +#include +using namespace std; + + +int maxWater(int arr[], int n) +{ + + int res = 0; + + + for (int i = 1; i < n - 1; i++) { + + + int left = arr[i]; + for (int j = 0; j < i; j++) + left = max(left, arr[j]); + + + int right = arr[i]; + for (int j = i + 1; j < n; j++) + right = max(right, arr[j]); + + + res = res + (min(left, right) - arr[i]); + } + + return res; +} + + +int main() +{ + int arr[] = { 0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1 }; + int n = sizeof(arr) / sizeof(arr[0]); + + cout << maxWater(arr, n); + + return 0; +} From 057e3046434f55c2d2274d0af5390153ebc47eef Mon Sep 17 00:00:00 2001 From: khushbubijawat <68491547+khushbubijawat@users.noreply.github.com> Date: Fri, 14 Oct 2022 13:28:44 +0530 Subject: [PATCH 196/290] Add files via upload --- pascal's triangle.cpp | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 pascal's triangle.cpp diff --git a/pascal's triangle.cpp b/pascal's triangle.cpp new file mode 100644 index 0000000..362a101 --- /dev/null +++ b/pascal's triangle.cpp @@ -0,0 +1,40 @@ +#include +using namespace std; + +int binomialCoeff(int n, int k); + + +void printPascal(int n) +{ + for (int line = 0; line < n; line++) + { + + for (int i = 0; i <= line; i++) + cout <<" "<< binomialCoeff(line, i); + cout <<"\n"; + } +} + + +int binomialCoeff(int n, int k) +{ + int res = 1; + if (k > n - k) + k = n - k; + for (int i = 0; i < k; ++i) + { + res *= (n - i); + res /= (i + 1); + } + + return res; +} + + +int main() +{ + int n = 7; + printPascal(n); + return 0; +} + From a838296d36c89baac95a3a35e3a36c3babfb2c5e Mon Sep 17 00:00:00 2001 From: khushbubijawat <68491547+khushbubijawat@users.noreply.github.com> Date: Fri, 14 Oct 2022 13:39:41 +0530 Subject: [PATCH 197/290] combination sum --- combination sum.cpp | 74 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 combination sum.cpp diff --git a/combination sum.cpp b/combination sum.cpp new file mode 100644 index 0000000..6b04b0a --- /dev/null +++ b/combination sum.cpp @@ -0,0 +1,74 @@ +#include +using namespace std; + + +void findNumbers(vector& ar, int sum, + vector >& res, vector& r, + int i) +{ + + if (sum == 0) { + res.push_back(r); + return; + } + + + while (i < ar.size() && sum - ar[i] >= 0) { + + + r.push_back(ar[i]); + + + findNumbers(ar, sum - ar[i], res, r, i); + i++; + + // Remove number from list (backtracking) + r.pop_back(); + } +} + + +vector > combinationSum(vector& ar, + int sum) +{ + sort(ar.begin(), ar.end()); + + + ar.erase(unique(ar.begin(), ar.end()), ar.end()); + + vector r; + vector > res; + findNumbers(ar, sum, res, r, 0); + + return res; +} + +int main() +{ + vector ar; + ar.push_back(2); + ar.push_back(4); + ar.push_back(6); + ar.push_back(8); + int n = ar.size(); + + int sum = 8; + vector > res = combinationSum(ar, sum); + + + if (res.size() == 0) { + cout << "Empty"; + return 0; + } + + + for (int i = 0; i < res.size(); i++) { + if (res[i].size() > 0) { + cout << " ( "; + for (int j = 0; j < res[i].size(); j++) + cout << res[i][j] << " "; + cout << ")"; + } + } + return 0; +} From ac1be39012070ed40e8ce74dd7291e5c0b61678f Mon Sep 17 00:00:00 2001 From: Debasis Nayak <91651461+dNhunter3107@users.noreply.github.com> Date: Fri, 14 Oct 2022 13:44:22 +0530 Subject: [PATCH 198/290] Create Huffman_encoding.py --- Huffman_encoding.py | 53 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 Huffman_encoding.py diff --git a/Huffman_encoding.py b/Huffman_encoding.py new file mode 100644 index 0000000..91dc4e7 --- /dev/null +++ b/Huffman_encoding.py @@ -0,0 +1,53 @@ + +class NodeTree(object): + + def __init__(self, left=None, right=None): + self.left = left + self.right = right + + def children(self): + return (self.left, self.right) + + def nodes(self): + return (self.left, self.right) + + def __str__(self): + return '%s_%s' % (self.left, self.right) + + +def huffman_code_tree(node, left=True, binString=''): + if type(node) is str: + return {node: binString} + (l, r) = node.children() + d = dict() + d.update(huffman_code_tree(l, True, binString + '0')) + d.update(huffman_code_tree(r, False, binString + '1')) + return d + + +freq = {} +for c in string: + if c in freq: + freq[c] += 1 + else: + freq[c] = 1 + +freq = sorted(freq.items(), key=lambda x: x[1], reverse=True) + +nodes = freq + +while len(nodes) > 1: + (key1, c1) = nodes[-1] + (key2, c2) = nodes[-2] + nodes = nodes[:-2] + node = NodeTree(key1, key2) + nodes.append((node, c1 + c2)) + + nodes = sorted(nodes, key=lambda x: x[1], reverse=True) + +huffmanCode = huffman_code_tree(nodes[0][0]) + +print(' Char | Huffman code ') +print('----------------------') +for (char, frequency) in freq: + print(' %-4r |%12s' % (char, huffmanCode[char])) From a9b809d013e2770c7b0fe54d114a795b17a5a841 Mon Sep 17 00:00:00 2001 From: sair020 <115787501+sair020@users.noreply.github.com> Date: Fri, 14 Oct 2022 15:52:25 +0530 Subject: [PATCH 199/290] Create frequencyofcharacters_string.java --- frequencyofcharacters_string.java | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 frequencyofcharacters_string.java diff --git a/frequencyofcharacters_string.java b/frequencyofcharacters_string.java new file mode 100644 index 0000000..9179264 --- /dev/null +++ b/frequencyofcharacters_string.java @@ -0,0 +1,21 @@ +#include +using namespace std; + +int main() +{ + string str = "C++ Programming is awesome"; + char checkCharacter = 'a'; + int count = 0; + + for (int i = 0; i < str.size(); i++) + { + if (str[i] == checkCharacter) + { + ++ count; + } + } + + cout << "Number of " << checkCharacter << " = " << count; + + return 0; +} From 94134eaf8d5f1ba84410fe59d9027523e4ebc217 Mon Sep 17 00:00:00 2001 From: Javesshhh Date: Fri, 14 Oct 2022 17:46:33 +0530 Subject: [PATCH 200/290] hacktober cpp contribution --- stack_next greater element one direction.cpp | 34 ++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 stack_next greater element one direction.cpp diff --git a/stack_next greater element one direction.cpp b/stack_next greater element one direction.cpp new file mode 100644 index 0000000..3b3c9f9 --- /dev/null +++ b/stack_next greater element one direction.cpp @@ -0,0 +1,34 @@ +// https://www.hackerrank.com/contests/second/challenges/next-greater-element/problem +// problem + + +#include +using namespace std; + +int main() { + int n; + cin>>n; + int nums[n]; + for(int i=0;i>nums[i]; + } + int nge[n]; + for(int i=0;ist; + for (int i = n - 1; i >= 0; i--) { + while (!st.empty() && st.top() <= nums[i]) { + st.pop(); + } + + if (i < n) { + if (!st.empty()) + nge[i] = st.top(); + } + st.push(nums[i]); + } + for(int i=0;i Date: Fri, 14 Oct 2022 17:53:52 +0530 Subject: [PATCH 201/290] Rename stack_next greater element one direction.cpp to stack_next_greater_element.cpp --- ... element one direction.cpp => stack_next_greater_element.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename stack_next greater element one direction.cpp => stack_next_greater_element.cpp (99%) diff --git a/stack_next greater element one direction.cpp b/stack_next_greater_element.cpp similarity index 99% rename from stack_next greater element one direction.cpp rename to stack_next_greater_element.cpp index 3b3c9f9..a17f2db 100644 --- a/stack_next greater element one direction.cpp +++ b/stack_next_greater_element.cpp @@ -31,4 +31,4 @@ int main() { for(int i=0;i Date: Fri, 14 Oct 2022 17:57:10 +0530 Subject: [PATCH 202/290] cpp contribution --- stack_next_greater_element.cpp | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 stack_next_greater_element.cpp diff --git a/stack_next_greater_element.cpp b/stack_next_greater_element.cpp new file mode 100644 index 0000000..3b3c9f9 --- /dev/null +++ b/stack_next_greater_element.cpp @@ -0,0 +1,34 @@ +// https://www.hackerrank.com/contests/second/challenges/next-greater-element/problem +// problem + + +#include +using namespace std; + +int main() { + int n; + cin>>n; + int nums[n]; + for(int i=0;i>nums[i]; + } + int nge[n]; + for(int i=0;ist; + for (int i = n - 1; i >= 0; i--) { + while (!st.empty() && st.top() <= nums[i]) { + st.pop(); + } + + if (i < n) { + if (!st.empty()) + nge[i] = st.top(); + } + st.push(nums[i]); + } + for(int i=0;i Date: Fri, 14 Oct 2022 18:08:38 +0530 Subject: [PATCH 203/290] Added BFS --- BFS_2.cpp | 62 +++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 BFS_2.cpp diff --git a/BFS_2.cpp b/BFS_2.cpp new file mode 100644 index 0000000..fce318a --- /dev/null +++ b/BFS_2.cpp @@ -0,0 +1,62 @@ +#include +using namespace std; +class Graph +{ + int V; + vector> adj; +public: + Graph(int V); + void addEdge(int v, int w); + void BFS(int s); +}; + +Graph::Graph(int V) +{ + this->V = V; + adj.resize(V); +} + +void Graph::addEdge(int v, int w) +{ + adj[v].push_back(w); +} + +void Graph::BFS(int s) +{ + vector visited; + visited.resize(V,false); + list queue; + visited[s] = true; + queue.push_back(s); + + while(!queue.empty()) + { + s = queue.front(); + cout << s << " "; + queue.pop_front(); + for (auto adjecent: adj[s]) + { + if (!visited[adjecent]) + { + visited[adjecent] = true; + queue.push_back(adjecent); + } + } + } +} +int main() +{ + Graph g(4); + g.addEdge(0, 1); + g.addEdge(0, 2); + g.addEdge(1, 2); + g.addEdge(2, 0); + g.addEdge(2, 3); + g.addEdge(3, 3); + + cout << "Following is Breadth First Traversal " + << "(starting from vertex 2) \n"; + g.BFS(2); + + return 0; +} From 0e19ec40ebdc82b263b4cdb45f95f3121c7a3132 Mon Sep 17 00:00:00 2001 From: Pankaj2025-1 <88729459+Pankaj2025-1@users.noreply.github.com> Date: Fri, 14 Oct 2022 18:20:01 +0530 Subject: [PATCH 204/290] Create Smallest Subtree with all the Deepest Nodes --- Smallest Subtree with all the Deepest Nodes | 84 +++++++++++++++++++++ 1 file changed, 84 insertions(+) create mode 100644 Smallest Subtree with all the Deepest Nodes diff --git a/Smallest Subtree with all the Deepest Nodes b/Smallest Subtree with all the Deepest Nodes new file mode 100644 index 0000000..b7d714d --- /dev/null +++ b/Smallest Subtree with all the Deepest Nodes @@ -0,0 +1,84 @@ + +#include +using namespace std; + +// Structure of a Node +struct TreeNode { + + int val; + TreeNode* left; + TreeNode* right; + + TreeNode(int data) + { + this->val = data; + left = NULL; + right = NULL; + } +}; + +int find_ht(TreeNode* root) +{ + if (!root) + return 0; + + // If current node is a leaf node + if (root->left == NULL + && root->right == NULL) + return 1; + + return max(find_ht(root->left), + find_ht(root->right)) + + 1; +} + +void find_node(TreeNode* root, TreeNode*& req_node) +{ + if (!root) + return; + + // Stores height of left subtree + int left_ht = find_ht(root->left); + + // Stores height of right subtree + int right_ht = find_ht(root->right); + + // If height of left subtree exceeds + // that of the right subtree + if (left_ht > right_ht) { + + // Traverse left subtree + find_node(root->left, req_node); + } + + // If height of right subtree exceeds + // that of the left subtree + else if (right_ht > left_ht) { + find_node(root->right, req_node); + } + + // Otherwise + else { + + // Return current node + req_node = root; + return; + } +} + +// Driver Code +int main() +{ + struct TreeNode* root + = new TreeNode(1); + root->left = new TreeNode(2); + root->right = new TreeNode(3); + + TreeNode* req_node = NULL; + + find_node(root, req_node); + + cout << req_node->val; + + return 0; +} From 7fbbeb035b2e52daa83bca01bd9510d4e46df810 Mon Sep 17 00:00:00 2001 From: Pankaj2025-1 <88729459+Pankaj2025-1@users.noreply.github.com> Date: Fri, 14 Oct 2022 18:22:10 +0530 Subject: [PATCH 205/290] Create Majority Element --- Majority Element | 57 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 Majority Element diff --git a/Majority Element b/Majority Element new file mode 100644 index 0000000..43e214b --- /dev/null +++ b/Majority Element @@ -0,0 +1,57 @@ + +#include +using namespace std; + +int findCandidate(int a[], int size) +{ + int maj_index = 0, count = 1; + for (int i = 1; i < size; i++) { + if (a[maj_index] == a[i]) + count++; + else + count--; + if (count == 0) { + maj_index = i; + count = 1; + } + } + return a[maj_index]; +} + +/* Function to check if the candidate +occurs more than n/2 times */ +bool isMajority(int a[], int size, int cand) +{ + int count = 0; + for (int i = 0; i < size; i++) + + if (a[i] == cand) + count++; + + if (count > size / 2) + return 1; + + else + return 0; +} + +void printMajority(int a[], int size) +{ + int cand = findCandidate(a, size); + + if (isMajority(a, size, cand)) + cout << " " << cand << " "; + + else + cout << "No Majority Element"; +} + +int main() +{ + int a[] = { 1, 3, 3, 1, 2 }; + int size = (sizeof(a)) / sizeof(a[0]); + + printMajority(a, size); + + return 0; +} From c992234d6264c147ba3d1a2691b1baeeae1f6e36 Mon Sep 17 00:00:00 2001 From: Pankaj2025-1 <88729459+Pankaj2025-1@users.noreply.github.com> Date: Fri, 14 Oct 2022 18:23:49 +0530 Subject: [PATCH 206/290] Create Reverse alternate levels of a perfect binary tree --- ... alternate levels of a perfect binary tree | 75 +++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 Reverse alternate levels of a perfect binary tree diff --git a/Reverse alternate levels of a perfect binary tree b/Reverse alternate levels of a perfect binary tree new file mode 100644 index 0000000..50acc4c --- /dev/null +++ b/Reverse alternate levels of a perfect binary tree @@ -0,0 +1,75 @@ + +#include +using namespace std; + +struct Node +{ + char key; + Node *left, *right; +}; + +void preorder(struct Node *root1, struct Node* + root2, int lvl) +{ + if (root1 == NULL || root2==NULL) + return; + + if (lvl%2 == 0) + swap(root1->key, root2->key); + + preorder(root1->left, root2->right, lvl+1); + preorder(root1->right, root2->left, lvl+1); +} + + +void reverseAlternate(struct Node *root) +{ +preorder(root->left, root->right, 0); +} + + +void printInorder(struct Node *root) +{ + if (root == NULL) + return; + printInorder(root->left); + cout << root->key << " "; + printInorder(root->right); +} + +// A utility function to create a new node +Node *newNode(int key) +{ + Node *temp = new Node; + temp->left = temp->right = NULL; + temp->key = key; + return temp; +} + +int main() +{ + struct Node *root = newNode('a'); + root->left = newNode('b'); + root->right = newNode('c'); + root->left->left = newNode('d'); + root->left->right = newNode('e'); + root->right->left = newNode('f'); + root->right->right = newNode('g'); + root->left->left->left = newNode('h'); + root->left->left->right = newNode('i'); + root->left->right->left = newNode('j'); + root->left->right->right = newNode('k'); + root->right->left->left = newNode('l'); + root->right->left->right = newNode('m'); + root->right->right->left = newNode('n'); + root->right->right->right = newNode('o'); + + cout << "Inorder Traversal of given tree\n"; + printInorder(root); + + reverseAlternate(root); + + cout << "\n\nInorder Traversal of modified tree\n"; + printInorder(root); + return 0; +} From 22e13b44577ad54a202820e6b492d6726160ce14 Mon Sep 17 00:00:00 2001 From: Pankaj2025-1 <88729459+Pankaj2025-1@users.noreply.github.com> Date: Fri, 14 Oct 2022 18:25:16 +0530 Subject: [PATCH 207/290] Create Trim given Binary Tree for any subtree containing only 0s --- ...ry Tree for any subtree containing only 0s | 72 +++++++++++++++++++ 1 file changed, 72 insertions(+) create mode 100644 Trim given Binary Tree for any subtree containing only 0s diff --git a/Trim given Binary Tree for any subtree containing only 0s b/Trim given Binary Tree for any subtree containing only 0s new file mode 100644 index 0000000..3e3bb63 --- /dev/null +++ b/Trim given Binary Tree for any subtree containing only 0s @@ -0,0 +1,72 @@ + +#include +using namespace std; + +class TreeNode { + +public: + int data; + TreeNode* left; + TreeNode* right; + TreeNode(int val) + { + data = val; + left = NULL; + right = NULL; + } +}; + +void inorderPrint(TreeNode* root) +{ + if (root == NULL) + return; + inorderPrint(root->left); + cout << root->data << " "; + inorderPrint(root->right); +} + +TreeNode* TrimTree(TreeNode* root) +{ + if (!root) + return nullptr; + + root->left = TrimTree(root->left); + root->right = TrimTree(root->right); + + // We only trim if the node's value is 0 + // and children are null + if (root->data == 0 && root->left == nullptr + && root->right == nullptr) { + + // We trim the subtree by returning nullptr + return nullptr; + } + + // Otherwise we leave the node the way it is + return root; +} + +// Driver code +int main() +{ + /* + 1 + / \ + 0 1 + / \ / \ + 0 0 0 1 + */ + + TreeNode* root = new TreeNode(1); + root->left = new TreeNode(0); + root->right = new TreeNode(1); + root->left->left = new TreeNode(0); + root->left->right = new TreeNode(0); + root->right->left = new TreeNode(0); + root->right->right = new TreeNode(1); + + TreeNode* ReceivedRoot = TrimTree(root); + cout << endl; + inorderPrint(ReceivedRoot); + +} From 5f71e3e227bc576b2cf0f10d7fa7d0fea8aa0cf4 Mon Sep 17 00:00:00 2001 From: Pankaj2025-1 <88729459+Pankaj2025-1@users.noreply.github.com> Date: Fri, 14 Oct 2022 18:27:27 +0530 Subject: [PATCH 208/290] Create Distance of nearest cell having 1 --- Distance of nearest cell having 1 | 46 +++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 Distance of nearest cell having 1 diff --git a/Distance of nearest cell having 1 b/Distance of nearest cell having 1 new file mode 100644 index 0000000..89d0d22 --- /dev/null +++ b/Distance of nearest cell having 1 @@ -0,0 +1,46 @@ + +#include +#define N 3 +#define M 4 +using namespace std; + +void printDistance(int mat[N][M]) +{ + int ans[N][M]; + + for (int i = 0; i < N; i++) + for (int j = 0; j < M; j++) + ans[i][j] = INT_MAX; + + for (int i = 0; i < N; i++) + for (int j = 0; j < M; j++) { + // Traversing the whole matrix + // to find the minimum distance. + for (int k = 0; k < N; k++) + for (int l = 0; l < M; l++) { + // If cell contain 1, check + // for minimum distance. + if (mat[k][l] == 1) + ans[i][j] + = min(ans[i][j], + abs(i - k) + abs(j - l)); + } + } + + for (int i = 0; i < N; i++) { + for (int j = 0; j < M; j++) + cout << ans[i][j] << " "; + + cout << endl; + } +} + +int main() +{ + int mat[N][M] = { 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0 }; + + // Function call + printDistance(mat); + + return 0; +} From 9180a05933d291f7b71d863e636b42668755a7ff Mon Sep 17 00:00:00 2001 From: Anaya S Rao Date: Fri, 14 Oct 2022 19:50:34 +0530 Subject: [PATCH 209/290] Added Longest Palindromic Subsequence Program in C++ --- Longest_Palindromic_Subsequence.cpp | 33 +++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 Longest_Palindromic_Subsequence.cpp diff --git a/Longest_Palindromic_Subsequence.cpp b/Longest_Palindromic_Subsequence.cpp new file mode 100644 index 0000000..9dd8dbe --- /dev/null +++ b/Longest_Palindromic_Subsequence.cpp @@ -0,0 +1,33 @@ +#include +using namespace std; + +int lps(string& s1, string& s2, int n1, int n2) +{ + if (n1 == 0 || n2 == 0) { + return 0; + } + if (dp[n1][n2] != -1) { + return dp[n1][n2]; + } + if (s1[n1 - 1] == s2[n2 - 1]) { + return dp[n1][n2] = 1 + lps(s1, s2, n1 - 1, n2 - 1); + } + else { + return dp[n1][n2] = max(lps(s1, s2, n1 - 1, n2),lps(s1, s2, n1, n2 - 1)); + } +} + + +int main() +{ + string seq = "CARORCAR"; + int n = seq.size(); + int dp[n][n]; + memset(dp, -1, sizeof(dp)); + string s2 = seq; + reverse(s2.begin(), s2.end()); + cout<<"The length of the LPS is "< Date: Fri, 14 Oct 2022 20:06:06 +0530 Subject: [PATCH 210/290] Added Cpp Solution to Swap Nodes in Pairs Problem --- 24.Swap_Nodes_in_Pairs.cpp | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 24.Swap_Nodes_in_Pairs.cpp diff --git a/24.Swap_Nodes_in_Pairs.cpp b/24.Swap_Nodes_in_Pairs.cpp new file mode 100644 index 0000000..43d8f11 --- /dev/null +++ b/24.Swap_Nodes_in_Pairs.cpp @@ -0,0 +1,34 @@ + +// Solution to the Problem : https://leetcode.com/problems/swap-nodes-in-pairs/ +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ +class Solution { +public: + ListNode* swapPairs(ListNode* head) { + ListNode *current = head; + ListNode *prev = NULL; + ListNode *next = NULL; + int i = 0; + while(current!=NULL&&i<2){ + + next = current->next; + current->next = prev; + prev = current; + current = next; + + i++; + } + if(next!=NULL){ + head->next = swapPairs(next); + } + return prev; + } +}; \ No newline at end of file From 25b2fa63df8bbc90f07ab2b137be429d8c45de27 Mon Sep 17 00:00:00 2001 From: Ajitesh Sarangi <72181191+ajiteshsarangi@users.noreply.github.com> Date: Fri, 14 Oct 2022 20:31:28 +0530 Subject: [PATCH 211/290] Create matrix_chain_mult.cpp --- matrix_chain_mult.cpp | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 matrix_chain_mult.cpp diff --git a/matrix_chain_mult.cpp b/matrix_chain_mult.cpp new file mode 100644 index 0000000..d08f8f0 --- /dev/null +++ b/matrix_chain_mult.cpp @@ -0,0 +1,34 @@ +#include +using namespace std; + +int MatrixChainOrder(int p[], int i, int j) +{ + if (i == j) + return 0; + int k; + int mini = INT_MAX; + int count; + + for (k = i; k < j; k++) + { + count = MatrixChainOrder(p, i, k) + + MatrixChainOrder(p, k + 1, j) + + p[i - 1] * p[k] * p[j]; + + mini = min(count, mini); + } + + return mini; +} + +// Driver Code +int main() +{ + int arr[] = { 1, 2, 3, 4, 3 }; + int N = sizeof(arr) / sizeof(arr[0]); + + // Function call + cout << "Minimum number of multiplications is "<< MatrixChainOrder(arr, 1, N - 1); + return 0; +} + From bf2f1798aeaca2da4bf07e6e3a5faea19f7ed2f3 Mon Sep 17 00:00:00 2001 From: Anaya S Rao Date: Fri, 14 Oct 2022 20:38:58 +0530 Subject: [PATCH 212/290] added first non-repeting number in an array --- First_Non_Repeating_Number.cpp | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 First_Non_Repeating_Number.cpp diff --git a/First_Non_Repeating_Number.cpp b/First_Non_Repeating_Number.cpp new file mode 100644 index 0000000..5b2aa1a --- /dev/null +++ b/First_Non_Repeating_Number.cpp @@ -0,0 +1,25 @@ +#include +using namespace std; + +int firstNonRepeating(int arr[], int n) +{ + + unordered_map mp; + for (int i = 0; i < n; i++) + mp[arr[i]]++; + + + for (int i = 0; i < n; i++) + if (mp[arr[i]] == 1) + return arr[i]; + return -1; +} + + +int main() +{ + int arr[] = { 9, 4, 9, 6, 7, 4 }; + int n = sizeof(arr) / sizeof(arr[0]); + cout << firstNonRepeating(arr, n); + return 0; +} From 7c0fba588ae953d442b9495b7c5a4cfa3307e96f Mon Sep 17 00:00:00 2001 From: Mohan0006 <87588310+Mohan0006@users.noreply.github.com> Date: Fri, 14 Oct 2022 21:13:54 +0530 Subject: [PATCH 213/290] Added Solution to the Problem Reordered Power Of 2 Problem in CPP (Efficient approach) --- 869.Reordered_Power_of_2.cpp | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 869.Reordered_Power_of_2.cpp diff --git a/869.Reordered_Power_of_2.cpp b/869.Reordered_Power_of_2.cpp new file mode 100644 index 0000000..3248db7 --- /dev/null +++ b/869.Reordered_Power_of_2.cpp @@ -0,0 +1,27 @@ +// Solution to : Reordered Power Of 2 +// https://leetcode.com/problems/reordered-power-of-2/ + +// This Solution has very minimal runtime + +class Solution { +public: + bool reorderedPowerOf2(int n) { + string s = to_string(n); + sort(s.begin(),s.end()); + + vector power; + for(int i=0;i<=30;i++){ + int p = pow(2,i); + power.push_back(to_string(p)); + } + + for(int i=0;i<=30;i++){ + sort(power[i].begin(),power[i].end()); + } + + for(int i=0;i<=30;i++){ + if(power[i] == s ) return true; + } + return false; + } +}; \ No newline at end of file From 654b61cd521634fc2dd4b8b052a90f5e4bc4b8d8 Mon Sep 17 00:00:00 2001 From: Mohan0006 <87588310+Mohan0006@users.noreply.github.com> Date: Fri, 14 Oct 2022 21:18:33 +0530 Subject: [PATCH 214/290] Added Solution to the Problem Sort the matrix Diagonally Problem in CPP (Efficient approach) --- 1329.Sort_the_Matrix_Diagonally.cpp | 76 +++++++++++++++++++++++++++++ 1 file changed, 76 insertions(+) create mode 100644 1329.Sort_the_Matrix_Diagonally.cpp diff --git a/1329.Sort_the_Matrix_Diagonally.cpp b/1329.Sort_the_Matrix_Diagonally.cpp new file mode 100644 index 0000000..52e147c --- /dev/null +++ b/1329.Sort_the_Matrix_Diagonally.cpp @@ -0,0 +1,76 @@ +// Solution to the Problem : Sort the matrix Diagonally +//https://leetcode.com/problems/sort-the-matrix-diagonally/ + +class Solution { +public: + vector> diagonalSort(vector>& mat) { + int m = mat.size(); + int n = mat[0].size(); + cout << n; + int d = m*n-1; + + vector> ans(mat.size(),vector(mat[0].size(),0)); + + + for(int i = 0 ; i < m ; i++ ){ + vector diag; + int a = i; + int b = 0; + + while(a diag; + int a = 0; + int b = i; + + while(b Date: Fri, 14 Oct 2022 21:25:27 +0530 Subject: [PATCH 215/290] Added Solution to the Problem Rotate Image Problem in CPP (Efficient approach) --- 48.Rotate_Image.cpp | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 48.Rotate_Image.cpp diff --git a/48.Rotate_Image.cpp b/48.Rotate_Image.cpp new file mode 100644 index 0000000..67a01b6 --- /dev/null +++ b/48.Rotate_Image.cpp @@ -0,0 +1,25 @@ +// Solution to the Problem : Rotate Image +// https://leetcode.com/problems/rotate-image/ + +class Solution { +public: + void rotate(vector>& matrix) { + int m = matrix.size(); + int n = matrix[0].size(); + + for(int i = 0 ; i < m ; i++){ + + for(int j = i ; j < n ; j++){ + swap(matrix[i][j],matrix[j][i]); + } + + } + + for(int i = 0 ; i < m ; i++){ + for(int j = 0 ; j < n /2 ;j++){ + swap(matrix[i][j],matrix[i][n-j-1]); + } + } + + } +}; \ No newline at end of file From af01dc966d6a8a1208032d9982e7e51804aa7c42 Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Fri, 14 Oct 2022 21:28:03 +0530 Subject: [PATCH 216/290] 35-search-insert-position Leetcode question number 35. Time: 13 ms (14.12%), Space: 9.8 MB (22.93%) --- 35-search-insert-position.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 35-search-insert-position.cpp diff --git a/35-search-insert-position.cpp b/35-search-insert-position.cpp new file mode 100644 index 0000000..427d870 --- /dev/null +++ b/35-search-insert-position.cpp @@ -0,0 +1,23 @@ +class Solution { +public: + int searchInsert(vector& nums, int target) { + int indx; + if(nums[0]>target){ + indx = 0; + } + else if(nums[nums.size()-1]target){ + indx = i+1; + } + } + } + return indx; + } +}; \ No newline at end of file From ce3f6a9c60edf6be3c36189f033748bca5eaacc1 Mon Sep 17 00:00:00 2001 From: Mohan0006 <87588310+Mohan0006@users.noreply.github.com> Date: Fri, 14 Oct 2022 21:29:18 +0530 Subject: [PATCH 217/290] Added Solution to the Problem Number Of Islands Problem in CPP (DFS approach) --- 200.Number_of_Islands.cpp | 47 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) create mode 100644 200.Number_of_Islands.cpp diff --git a/200.Number_of_Islands.cpp b/200.Number_of_Islands.cpp new file mode 100644 index 0000000..8a262c8 --- /dev/null +++ b/200.Number_of_Islands.cpp @@ -0,0 +1,47 @@ +// Solution to the Problem : Number Of Islands +// https://leetcode.com/problems/number-of-islands/ + +class Solution { +public: + + + void checkIslands(vector>&grid,int i,int j,int m,int n){ + + if(i<0||j<0||i>=m||j>=n||grid[i][j]!='1'){ + return; + } + grid[i][j] = '2'; + checkIslands(grid,i-1,j,m,n); + checkIslands(grid,i,j-1,m,n); + checkIslands(grid,i+1,j,m,n); + checkIslands(grid,i,j+1,m,n); + + + } + + + + int countIslands(vector> &grid){ + + int m = grid.size(); + int n = grid[0].size(); + int count = 0; + for(int i = 0 ; i < m ;i++){ + for(int j = 0 ;j < n ;j++){ + if(grid[i][j]=='1'){ + count++; + checkIslands(grid,i,j,m,n); + } + } + } + + return count; + + + } + + + int numIslands(vector>& grid) { + return countIslands(grid); + } +}; \ No newline at end of file From 5e61198129351abfaf3216ecd51a663b5c5eca80 Mon Sep 17 00:00:00 2001 From: RITABRATA DEY Date: Fri, 14 Oct 2022 21:38:31 +0530 Subject: [PATCH 218/290] 0202-happy-number Leetcode question number 0202. Time: 0 ms (100.00%), Space: 5.6 MB (99.47%) --- 0202-happy-number.cpp | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 0202-happy-number.cpp diff --git a/0202-happy-number.cpp b/0202-happy-number.cpp new file mode 100644 index 0000000..c00ca0e --- /dev/null +++ b/0202-happy-number.cpp @@ -0,0 +1,18 @@ +class Solution { +public: + bool isHappy(int n) { + if(n == 1) + return true; + if(n > 1 && n <= 4) + return false; + + int sum = 0; + while(n > 0) { + int m = n % 10; + sum = sum + (m * m); + n = n / 10; + } + + return isHappy(sum); + } +}; \ No newline at end of file From 997b3308f74bf11c86f2e156d83c9010b55dabf7 Mon Sep 17 00:00:00 2001 From: Anaya S Rao Date: Fri, 14 Oct 2022 21:39:32 +0530 Subject: [PATCH 219/290] Added Height Of A Binary Tree in C++ --- Height_Of_A_Binary_Tree.cpp | 49 +++++++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 Height_Of_A_Binary_Tree.cpp diff --git a/Height_Of_A_Binary_Tree.cpp b/Height_Of_A_Binary_Tree.cpp new file mode 100644 index 0000000..f1c17da --- /dev/null +++ b/Height_Of_A_Binary_Tree.cpp @@ -0,0 +1,49 @@ +#include +using namespace std; + +class node { +public: + int data; + node* left; + node* right; +}; + +int maxHeight(node* node) +{ + if (node == NULL) + return 0; + else + { + int lHeight = mmaxHeight(node->left); + int rHeight = maxHeight(node->right); + + return max(lHeight+1,rHeight+1); + + } +} + + +node* newNode(int data) +{ + node* Node = new node(); + Node->data = data; + Node->left = NULL; + Node->right = NULL; + + return (Node); +} + +// Driver code +int main() +{ + node* root = newNode(1); + root->left = newNode(2); + root->right = newNode(3); + root->left->left = newNode(4); + root->left->right = newNode(5); + + cout<<"Height of tree is "< Date: Fri, 14 Oct 2022 22:08:30 +0530 Subject: [PATCH 220/290] Added subarray with given sum in C++ --- Subarray_With_Given_Sum.cpp | 44 +++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 Subarray_With_Given_Sum.cpp diff --git a/Subarray_With_Given_Sum.cpp b/Subarray_With_Given_Sum.cpp new file mode 100644 index 0000000..1ff9536 --- /dev/null +++ b/Subarray_With_Given_Sum.cpp @@ -0,0 +1,44 @@ +#include +using namespace std; + +int subArraySum(int arr[], int n, int sum) +{ + + int currentSum = arr[0], start = 0, i; + + + for (i = 1; i <= n; i++) { + + while (currentSum > sum && start < i - 1) { + currentSum = currentSum - arr[start]; + start++; + } + + + if (currentSum == sum) { + cout << "Sum found between indexes " << start + << " and " << i - 1; + return 1; + } + + + if (i < n) + currentSum = currentSum + arr[i]; + } + + + cout << "No subarray found"; + return 0; +} + + +int main() +{ + int arr[] = { 15, 2, 4, 8, 9, 5, 10, 23 }; + int n = sizeof(arr) / sizeof(arr[0]); + int sum = 23; + subArraySum(arr, n, sum); + return 0; +} + + From e9fc47830bf94822b7f33a42644c2976fc956184 Mon Sep 17 00:00:00 2001 From: Nithin1306 <110409408+Nithin1306@users.noreply.github.com> Date: Fri, 14 Oct 2022 22:12:07 +0530 Subject: [PATCH 221/290] Subtract 12 Operation.cpp --- Subtract 12 Operation.cpp | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Subtract 12 Operation.cpp diff --git a/Subtract 12 Operation.cpp b/Subtract 12 Operation.cpp new file mode 100644 index 0000000..792b714 --- /dev/null +++ b/Subtract 12 Operation.cpp @@ -0,0 +1,29 @@ +#include +#include +using namespace std; +#define int long long + + + int n,a[20000],s; + void solve(){ + cin>> n;s=0; + for(int i=1;i<=n;++i) cin >> a[i]; + for(int i=n;i>1;--i) + if(a[i]>0){ + a[i-1]-=a[i]/2; + a[i]=a[i]%2; + if(a[i]==1&&(a[i-1]%2==1||((i==2)&&a[1]>0))){ + a[i]=-1; + a[i-1]--; + } + } + for(int i=1;i<=n;++i) s+=abs(a[i]); + cout << s << endl; + } + + signed main(){ + int T; + cin >> T; + while(T--) solve(); + } + From c05f13829a9871c0ed6d0f367820dc53087001cf Mon Sep 17 00:00:00 2001 From: adityaajay29 Date: Fri, 14 Oct 2022 22:23:54 +0530 Subject: [PATCH 222/290] add problem-leetcode 19 --- 19-remove-nth-node-from-end-of-list.cpp | 36 +++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 19-remove-nth-node-from-end-of-list.cpp diff --git a/19-remove-nth-node-from-end-of-list.cpp b/19-remove-nth-node-from-end-of-list.cpp new file mode 100644 index 0000000..cdc0cd9 --- /dev/null +++ b/19-remove-nth-node-from-end-of-list.cpp @@ -0,0 +1,36 @@ +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ + +// *********************************************************************************** +// Problem link : https://leetcode.com/problems/remove-nth-node-from-end-of-list/ + +class Solution { +public: + ListNode* removeNthFromEnd(ListNode* head, int n) { + ListNode *dummy = new ListNode(0); + dummy->next = head; + ListNode *slow = dummy, *fast = dummy; + while(n && fast->next) + { + fast = fast->next; + n--; + } + while(fast->next) + { + slow = slow->next; + fast = fast->next; + } + ListNode *temp = slow->next; + slow->next = slow->next->next; + delete temp; + return dummy->next; + } +}; \ No newline at end of file From 2e764048bf28bee600b1b81476a9f5d522a10faf Mon Sep 17 00:00:00 2001 From: Tia Kansal <91783392+anonymousss-112@users.noreply.github.com> Date: Fri, 14 Oct 2022 22:24:15 +0530 Subject: [PATCH 223/290] Create Longest_Common_Subsequence.cpp --- Longest_Common_Subsequence.cpp | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 Longest_Common_Subsequence.cpp diff --git a/Longest_Common_Subsequence.cpp b/Longest_Common_Subsequence.cpp new file mode 100644 index 0000000..45a96ff --- /dev/null +++ b/Longest_Common_Subsequence.cpp @@ -0,0 +1,27 @@ +#include +using namespace std; +int solve(string& s, string& t, int i, int j, vector>& dp){ + if(i==s.size()) return 0; + if(j==t.size()) return 0; + if(dp[i][j]!=-1) return dp[i][j]; + int ans=0; + if(s[i]==t[j]) ans=1+solve(s,t,i+1,j+1,dp); + else ans=max(solve(s,t,i+1,j,dp), solve(s,t,i,j+1,dp)); + dp[i][j]=ans; + return dp[i][j]; +} +int longestCommonSubsequence(string text1, string text2) { + int n=text1.size(), m=text2.size(); + vector> dp(n, vector(m, -1)); + int ans=solve(text1,text2,0,0,dp); + return ans; +} +int main(){ + string s,t; + cin>>s>>t; + int ans=longestCommonSubsequence(s,t); + cout< Date: Fri, 14 Oct 2022 22:24:58 +0530 Subject: [PATCH 224/290] added leetcode solution added cpp solution for leetcode problem 1255. maximum-score-words-formed-by-letters --- maximum-score-words-formed-by-letters | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 maximum-score-words-formed-by-letters diff --git a/maximum-score-words-formed-by-letters b/maximum-score-words-formed-by-letters new file mode 100644 index 0000000..4ff2bd4 --- /dev/null +++ b/maximum-score-words-formed-by-letters @@ -0,0 +1,22 @@ +class Solution { +public: + int solve(int n,vector&w,unordered_map&m,vector&score){ + if(n<0) return 0; + bool flag=true; + int sr=0; + for(auto x:w[n]){ + if(!m[x]) flag=false; + m[x]--;sr+=score[x-'a']; + } + int a=0,b=0; + if(flag) a=sr+solve(n-1,w,m,score); + for(auto x:w[n]) m[x]++; + b=solve(n-1,w,m,score); + return max(a,b); + } + int maxScoreWords(vector& words, vector& letters, vector& score) { + unordered_mapm; + for(auto x: letters) m[x]++; + return solve(words.size()-1,words,m,score); + } +}; From 8d60d67321077f12a51b634282956808512e8de0 Mon Sep 17 00:00:00 2001 From: Rishi gupta <82485566+rishigupta877@users.noreply.github.com> Date: Fri, 14 Oct 2022 22:29:48 +0530 Subject: [PATCH 225/290] 210.CourseSchedular2 this question is variation of toposort. here we use the toposort using bfs(khan algorithm) which uses the concept of indegree. --- CourseSchedular.cpp | 59 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 CourseSchedular.cpp diff --git a/CourseSchedular.cpp b/CourseSchedular.cpp new file mode 100644 index 0000000..a4c7f4b --- /dev/null +++ b/CourseSchedular.cpp @@ -0,0 +1,59 @@ +class Solution { +public: + vector findOrder(int V, vector>& a) { + + + + vectoradj[V+1]; + for(int i=0;iindegree(V,0); + + for(int i=0;iq; + for(int i=0;iv; + while(!q.empty()){ + + + + + int x=q.front(); + v.push_back(x); + q.pop(); + + for(auto it : adj[x]){ + + indegree[it]--; + if(indegree[it]==0)q.push(it); + } + + + } + if(v.size()!=V){ + + return {}; + } + return v; + } +}; From 996c58cf0aeb0fb276ef1ada8fae16e3b0282421 Mon Sep 17 00:00:00 2001 From: Sarthak Aggarwal Date: Fri, 14 Oct 2022 22:35:13 +0530 Subject: [PATCH 226/290] added clone_graph --- clone_graph.cpp | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 clone_graph.cpp diff --git a/clone_graph.cpp b/clone_graph.cpp new file mode 100644 index 0000000..37a4cfc --- /dev/null +++ b/clone_graph.cpp @@ -0,0 +1,20 @@ +// runtime 22ms +// author -> Sarthak Aggarwal + +class Solution { +public: + Node* cloneGraph(Node* node) { + if (!node) { + return NULL; + } + if (copies.find(node) == copies.end()) { + copies[node] = new Node(node -> val, {}); + for (Node* neighbor : node -> neighbors) { + copies[node] -> neighbors.push_back(cloneGraph(neighbor)); + } + } + return copies[node]; + } +public: + unordered_map copies; +}; \ No newline at end of file From 57d937277388f2c2749736d50cac5c5f76f60699 Mon Sep 17 00:00:00 2001 From: Abhijeet Date: Fri, 14 Oct 2022 22:40:23 +0530 Subject: [PATCH 227/290] sum of nodes at kth level --- Sum of nodes at level k.cpp | 69 +++++++++++++++++++++++++++++++++++++ 1 file changed, 69 insertions(+) create mode 100644 Sum of nodes at level k.cpp diff --git a/Sum of nodes at level k.cpp b/Sum of nodes at level k.cpp new file mode 100644 index 0000000..76d7a33 --- /dev/null +++ b/Sum of nodes at level k.cpp @@ -0,0 +1,69 @@ +/*Question: +Given a binary tree with N nodes and an integer K, the task is to find the sum of all the nodes +present at the Kth level. +*/ +#include +#include +using namespace std; +struct node { //Create self referential structure with 2 pointers for each node + int data; //data denotes the value present in a node + struct node* left; + struct node* right; +}; + +struct node* CreateNode(int data)//This function creates a subtree with left and right nodes for every node +{ + struct node* temp = new struct node; + temp->data = data; + temp->left = nullptr; + temp->right = nullptr; + return temp; +}; + int sumatlevelk(struct node* root,int k)//This is a slight modification of BFS +{ + if (root == NULL)//if tree is empty + return 0; + queue que; + que.push(root);//Push the root inside the queue + int level = 0;//This denotes the level that will be updated at every iteration + int sum = 0;//Initialize the sum + int f = 0; + while (!que.empty()) {//Loop until queue is empty + int size = que.size(); + for(int i=0;idata;//Increment sum + } + else { + if (ptr->left)//If left node exists + que.push(ptr->left);//Put it in queue as it acts as the root node for left subtree + if (ptr->right)//If right node exists + que.push(ptr->right);//Push it in queue as it acts as root node for right subtree + } + } + level++;//Increment level when the nodes of a particular level are processed + if (f == 1) + break; + } + return sum; +} +int main() +{ + struct node* root = new struct node; + cout<<"Enter level at which you want to get the sum"<<'\n'; + int k; + cin>>k; + root = CreateNode(50); + root->left = CreateNode(30); + root->right = CreateNode(70); + root->left->left = CreateNode(20); + root->left->right = CreateNode(40); + root->right->left = CreateNode(60); + int ans = sumatlevelk(root, k); + cout << ans; + + return 0; +} \ No newline at end of file From 8b8a572cb5dfb48ea97a63471c0c4a36247fd687 Mon Sep 17 00:00:00 2001 From: aishwarya1735 Date: Fri, 14 Oct 2022 23:21:15 +0530 Subject: [PATCH 228/290] changing the merge by adding a solution --- single_file_program.cpp | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 single_file_program.cpp diff --git a/single_file_program.cpp b/single_file_program.cpp new file mode 100644 index 0000000..2322241 --- /dev/null +++ b/single_file_program.cpp @@ -0,0 +1,29 @@ +#include + using namespace std; + + int main() + { + int tc, n , m, k; + scanf("%d",&tc); + while(tc--) { + scanf("%d %d %d",&n,&m,&k); + int ar[n+1] = {0}; + int sum = 0,ans = 0 ; + for(int i = 0; i < n; i++) scanf("%d",&ar[i]); + for(int i = 0, j = 0; i < n*m; i++) { + j = i + 1; + sum = 0; + if(ar[i%n] <= k){ + ans++; + sum = ar[i%n] + ar[j%n]; + + while(j < n*m and sum <= k) { + ans++;j++; + sum += ar[j%n]; + } + } + } + cout << ans << endl; + } + return 0; + } \ No newline at end of file From d89f8a9c30605acbce0a2763aa31dbd779e85a47 Mon Sep 17 00:00:00 2001 From: Vandana Date: Fri, 14 Oct 2022 23:28:53 +0530 Subject: [PATCH 229/290] Create Length_of_Longest_Substring_without_any_Repeating _Character --- ...Substring_without_any_Repeating _Character | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Length_of_Longest_Substring_without_any_Repeating _Character diff --git a/Length_of_Longest_Substring_without_any_Repeating _Character b/Length_of_Longest_Substring_without_any_Repeating _Character new file mode 100644 index 0000000..1eb51ed --- /dev/null +++ b/Length_of_Longest_Substring_without_any_Repeating _Character @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int solve(string str) { + + if(str.size()==0) + return 0; + int maxans = INT_MIN; + for (int i = 0; i < str.length(); i++) // outer loop for traversing the string + { + unordered_set < int > set; + for (int j = i; j < str.length(); j++) // nested loop for getting different string starting with str[i] + { + if (set.find(str[j]) != set.end()) // if element if found so mark it as ans and break from the loop + { + maxans = max(maxans, j - i); + break; + } + set.insert(str[j]); + } + } + return maxans; +} + +int main() { + string str = "takeUforward"; + cout << "The length of the longest substring without repeating characters is " << + solve(str); + return 0; +} From a61f5083e591bb60dc73e8504f7de24e8c7490f4 Mon Sep 17 00:00:00 2001 From: Krishna Soni <92522740+Krishna1922@users.noreply.github.com> Date: Fri, 14 Oct 2022 23:29:42 +0530 Subject: [PATCH 230/290] Create check-if-there-is-a-valid-partition-of-array.cpp --- ...if-there-is-a-valid-partition-of-array.cpp | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 check-if-there-is-a-valid-partition-of-array.cpp diff --git a/check-if-there-is-a-valid-partition-of-array.cpp b/check-if-there-is-a-valid-partition-of-array.cpp new file mode 100644 index 0000000..f6488e1 --- /dev/null +++ b/check-if-there-is-a-valid-partition-of-array.cpp @@ -0,0 +1,32 @@ + +bool validPartition(vector& nums) { + int n = nums.size(); + int dp[n+1]; + dp[0] = 0; + dp[1] = 0; + dp[2] = (nums[0]==nums[1]); + if(n>=3){ + if(nums[0]==nums[1] && nums[1]==nums[2]){ + dp[3] = true; + } + else if(nums[2] == nums[1]+1 && nums[1] == nums[0] + 1){ + dp[3] = true; + }else{ + dp[3] = false; + } + + } + + if(n>=4){ + for(int i = 4;i<=n;i++){ + bool a=false,b=false,c=false; + if(nums[i-1]==nums[i-2]) a = dp[i-2]; + if(nums[i-1]==nums[i-2] && nums[i-2] == nums[i-3]) b = dp[i-3]; + if(nums[i-1]-1==nums[i-2] && nums[i-2]-1 == nums[i-3]) c = dp[i-3]; + + dp[i] = a||b||c; + } + } + return dp[n]; + + } From e5c95ea12a85ef743c19bcfdb3694e95ad4ba12b Mon Sep 17 00:00:00 2001 From: Vandana Date: Fri, 14 Oct 2022 23:32:14 +0530 Subject: [PATCH 231/290] Create Length_of_Longest_Substring_without_any_Repeating _Character --- ...Substring_without_any_Repeating _Character | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Length_of_Longest_Substring_without_any_Repeating _Character diff --git a/Length_of_Longest_Substring_without_any_Repeating _Character b/Length_of_Longest_Substring_without_any_Repeating _Character new file mode 100644 index 0000000..1eb51ed --- /dev/null +++ b/Length_of_Longest_Substring_without_any_Repeating _Character @@ -0,0 +1,31 @@ +#include + +using namespace std; + +int solve(string str) { + + if(str.size()==0) + return 0; + int maxans = INT_MIN; + for (int i = 0; i < str.length(); i++) // outer loop for traversing the string + { + unordered_set < int > set; + for (int j = i; j < str.length(); j++) // nested loop for getting different string starting with str[i] + { + if (set.find(str[j]) != set.end()) // if element if found so mark it as ans and break from the loop + { + maxans = max(maxans, j - i); + break; + } + set.insert(str[j]); + } + } + return maxans; +} + +int main() { + string str = "takeUforward"; + cout << "The length of the longest substring without repeating characters is " << + solve(str); + return 0; +} From 20cdd17b9422c795f8f3135d16788d95ce3b8e99 Mon Sep 17 00:00:00 2001 From: Vandana Date: Fri, 14 Oct 2022 23:34:03 +0530 Subject: [PATCH 232/290] Delete Length_of_Longest_Substring_without_any_Repeating _Character --- ...Substring_without_any_Repeating _Character | 31 ------------------- 1 file changed, 31 deletions(-) delete mode 100644 Length_of_Longest_Substring_without_any_Repeating _Character diff --git a/Length_of_Longest_Substring_without_any_Repeating _Character b/Length_of_Longest_Substring_without_any_Repeating _Character deleted file mode 100644 index 1eb51ed..0000000 --- a/Length_of_Longest_Substring_without_any_Repeating _Character +++ /dev/null @@ -1,31 +0,0 @@ -#include - -using namespace std; - -int solve(string str) { - - if(str.size()==0) - return 0; - int maxans = INT_MIN; - for (int i = 0; i < str.length(); i++) // outer loop for traversing the string - { - unordered_set < int > set; - for (int j = i; j < str.length(); j++) // nested loop for getting different string starting with str[i] - { - if (set.find(str[j]) != set.end()) // if element if found so mark it as ans and break from the loop - { - maxans = max(maxans, j - i); - break; - } - set.insert(str[j]); - } - } - return maxans; -} - -int main() { - string str = "takeUforward"; - cout << "The length of the longest substring without repeating characters is " << - solve(str); - return 0; -} From fdafd3fb74afba19dd25a87619f25fbfc3463fff Mon Sep 17 00:00:00 2001 From: Vandana Date: Fri, 14 Oct 2022 23:36:52 +0530 Subject: [PATCH 233/290] Create Length_of_Longest_Substring_without_any_Repeating_Character.java --- ...tring_without_any_Repeating_Character.java | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 Length_of_Longest_Substring_without_any_Repeating_Character.java diff --git a/Length_of_Longest_Substring_without_any_Repeating_Character.java b/Length_of_Longest_Substring_without_any_Repeating_Character.java new file mode 100644 index 0000000..db7f1e7 --- /dev/null +++ b/Length_of_Longest_Substring_without_any_Repeating_Character.java @@ -0,0 +1,32 @@ +import java.util.*; +public class Main { + static int solve(String str) { + + if(str.length()==0) + return 0; + int maxans = Integer.MIN_VALUE; + for (int i = 0; i < str.length(); i++) // outer loop for traversing the string + { + Set < Character > se = new HashSet < > (); + for (int j = i; j < str.length(); j++) // nested loop for getting different + string starting with str[i] + { + if (se.contains(str.charAt(j))) // if element if found so mark it as ans + and break from the loop + { + maxans = Math.max(maxans, j - i); + break; + } + se.add(str.charAt(j)); + } + } + return maxans; + } + + public static void main(String args[]) { + String str = "takeUforward"; + System.out.println("The length of the longest substring without repeating + characters is " + solve(str)); + + } +} From f8079ef18da8b72ebcba6877d122d70c16f14d6c Mon Sep 17 00:00:00 2001 From: Uthsav Jain <85090938+uthsavj@users.noreply.github.com> Date: Sat, 15 Oct 2022 08:11:25 +0530 Subject: [PATCH 234/290] Some CP questions --- ActivitySelection.cpp | 34 ++++++++++++++ NQueen.cpp | 66 +++++++++++++++++++++++++++ RatInMaze.cpp | 64 ++++++++++++++++++++++++++ SudokuSolver.cpp | 104 ++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 268 insertions(+) create mode 100644 ActivitySelection.cpp create mode 100644 NQueen.cpp create mode 100644 RatInMaze.cpp create mode 100644 SudokuSolver.cpp diff --git a/ActivitySelection.cpp b/ActivitySelection.cpp new file mode 100644 index 0000000..414a498 --- /dev/null +++ b/ActivitySelection.cpp @@ -0,0 +1,34 @@ +#include +#include +using namespace std; +struct Activitiy +{ + int start, end; +}; +bool comp(Activitiy act1, Activitiy act2) +{ + return (act1.end < act2.end); +} +void maxActivity(Activitiy act[], int n) +{ + sort(act, act + n, comp); // sort activities using compare function + + cout << "Selected Activities are: " << endl; + int i = 0; // first activity as 0 is selected + cout << "Activity: " << i << " , Start: " << act[i].start << " End: " << act[i].end << endl; + for (int j = 1; j < n; j++) + { // for all other activities + if (act[j].start >= act[i].end) + { // when start time is >= endtime, print the activity + cout << "Activity: " << j << " , Start: " << act[j].start << " End: " << act[j].end << endl; + i = j; + } + } +} +int main() +{ + Activitiy actArr[] = {{5, 9}, {1, 2}, {3, 4}, {0, 6}, {5, 7}, {8, 9}}; + int n = 6; + maxActivity(actArr, n); + return 0; +} \ No newline at end of file diff --git a/NQueen.cpp b/NQueen.cpp new file mode 100644 index 0000000..df106b6 --- /dev/null +++ b/NQueen.cpp @@ -0,0 +1,66 @@ +#include +using namespace std; +#define N 8 + +void printBoard(int board[N][N]) +{ + for (int i = 0; i < N; i++) + { + for (int j = 0; j < N; j++) + cout << board[i][j] << " "; + cout << endl; + } +} + +bool isValid(int board[N][N], int row, int col) +{ + for (int i = 0; i < col; i++) // check whether there is queen in the left or not + if (board[row][i]) + return false; + for (int i = row, j = col; i >= 0 && j >= 0; i--, j--) + if (board[i][j]) // check whether there is queen in the left upper diagonal or not + return false; + for (int i = row, j = col; j >= 0 && i < N; i++, j--) + if (board[i][j]) // check whether there is queen in the left lower diagonal or not + return false; + return true; +} + +bool solveNQueen(int board[N][N], int col) +{ + if (col >= N) // when N queens are placed successfully + return true; + for (int i = 0; i < N; i++) + { // for each row, check placing of queen is possible or not + if (isValid(board, i, col)) + { + board[i][col] = 1; // if validate, place the queen at place (i, col) + if (solveNQueen(board, col + 1)) // Go for the other columns recursively + return true; + + board[i][col] = 0; // When no place is vacant remove that queen + } + } + return false; // when no possible order is found +} + +bool checkSolution() +{ + int board[N][N]; + for (int i = 0; i < N; i++) + for (int j = 0; j < N; j++) + board[i][j] = 0; // set all elements to 0 + + if (solveNQueen(board, 0) == false) + { // starting from 0th column + cout << "Solution does not exist"; + return false; + } + printBoard(board); + return true; +} + +int main() +{ + checkSolution(); +} diff --git a/RatInMaze.cpp b/RatInMaze.cpp new file mode 100644 index 0000000..383304a --- /dev/null +++ b/RatInMaze.cpp @@ -0,0 +1,64 @@ +#include +#define N 5 +using namespace std; + +int maze[N][N] = { + {1, 0, 0, 0, 0}, + {1, 1, 0, 1, 0}, + {0, 1, 1, 1, 0}, + {0, 0, 0, 1, 0}, + {1, 1, 1, 1, 1}}; + +int sol[N][N]; // final solution of the maze path is stored here +void showPath() +{ + for (int i = 0; i < N; i++) + { + for (int j = 0; j < N; j++) + cout << sol[i][j] << " "; + cout << endl; + } +} + +bool isValidPlace(int x, int y) +{ // function to check place is inside the maze and have value 1 + if (x >= 0 && x < N && y >= 0 && y < N && maze[x][y] == 1) + return true; + return false; +} + +bool solveRatMaze(int x, int y) +{ + if (x == N - 1 && y == N - 1) + { // when (x,y) is the bottom right room + sol[x][y] = 1; + return true; + } + + if (isValidPlace(x, y) == true) + { // check whether (x,y) is valid or not + sol[x][y] = 1; // set 1, when it is valid place + if (solveRatMaze(x + 1, y) == true) // find path by moving right direction + return true; + if (solveRatMaze(x, y + 1) == true) // when x direction is blocked, go for bottom direction + return true; + sol[x][y] = 0; // if both are closed, there is no path + return false; + } + return false; +} + +bool findSolution() +{ + if (solveRatMaze(0, 0) == false) + { + cout << "There is no path"; + return false; + } + showPath(); + return true; +} +int main() +{ + findSolution(); +} \ No newline at end of file diff --git a/SudokuSolver.cpp b/SudokuSolver.cpp new file mode 100644 index 0000000..3a737d3 --- /dev/null +++ b/SudokuSolver.cpp @@ -0,0 +1,104 @@ +#include +#define N 9 +using namespace std; + +int grid[N][N] = { + {6, 5, 0, 8, 7, 3, 0, 9, 0}, + {0, 0, 3, 2, 5, 0, 0, 0, 8}, + {9, 8, 0, 1, 0, 4, 3, 5, 7}, + {1, 0, 5, 0, 0, 0, 0, 0, 0}, + {4, 0, 0, 0, 0, 0, 0, 0, 2}, + {0, 0, 0, 0, 0, 0, 5, 0, 3}, + {5, 7, 8, 3, 0, 1, 0, 2, 6}, + {2, 0, 0, 0, 4, 8, 9, 0, 0}, + {0, 9, 0, 6, 2, 5, 0, 8, 1}}; + +bool isPresentInCol(int col, int num) +{ // check whether num is present in col or not + + for (int row = 0; row < N; row++) + if (grid[row][col] == num) + return true; + + return false; +} + +bool isPresentInRow(int row, int num) +{ // check whether num is present in row or not + + for (int col = 0; col < N; col++) + if (grid[row][col] == num) + return true; + return false; +} + +bool isPresentInBox(int boxStartRow, int boxStartCol, int num) +{ // check whether num is present in 3x3 box or not + + for (int row = 0; row < 3; row++) + for (int col = 0; col < 3; col++) + if (grid[row + boxStartRow][col + boxStartCol] == num) + return true; + return false; +} + +void sudokuGrid() +{ // print the sudoku grid after solve + for (int row = 0; row < N; row++) + { + cout << "[ "; + for (int col = 0; col < N; col++) + { + + cout << grid[row][col] << " "; + } + cout << "]" << endl; + } + cout << endl; +} + +bool findEmptyPlace(int &row, int &col) +{ // get empty location and update row and column + for (row = 0; row < N; row++) + for (col = 0; col < N; col++) + if (grid[row][col] == 0) // marked with 0 is empty + return true; + return false; +} + +bool isValidPlace(int row, int col, int num) +{ + // when item not found in col, row and current 3x3 box + return !isPresentInRow(row, num) && !isPresentInCol(col, num) && !isPresentInBox(row - row % 3, col - col % 3, num); +} + +bool solveSudoku() +{ + int row, col; + if (!findEmptyPlace(row, col)) + return true; // when all places are filled + for (int num = 1; num <= 9; num++) + { + // valid numbers are 1 - 9 + if (isValidPlace(row, col, num)) + { + // check validation, if yes, put the number in the grid + grid[row][col] = num; + if (solveSudoku()) + // recursively go for other rooms in the grid + return true; + // the core of backtracking + grid[row][col] = 0; + // turn to unassigned space when conditions are not satisfied + } + } + return false; +} + +int main() +{ + if (solveSudoku() == true) + sudokuGrid(); + else + cout << "No solution exists"; +} \ No newline at end of file From 17a3b67fc93cd2eaf776e345704ca2a5a2b09156 Mon Sep 17 00:00:00 2001 From: Uthsav Jain <85090938+uthsavj@users.noreply.github.com> Date: Sat, 15 Oct 2022 08:23:23 +0530 Subject: [PATCH 235/290] Rod Cutting Problem | DP --- RodCutting.cpp | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 RodCutting.cpp diff --git a/RodCutting.cpp b/RodCutting.cpp new file mode 100644 index 0000000..249f05f --- /dev/null +++ b/RodCutting.cpp @@ -0,0 +1,39 @@ +// A recursive solution for Rod cutting problem +#include +#include +#include +using namespace std; + +// A utility function to get the maximum of two integers +int max(int a, int b) { return (a > b) ? a : b; } + +/* Returns the best obtainable price for a rod of length n +and price[] as prices of different pieces */ +int cutRod(int price[], int index, int n) +{ + // base case + if (index == 0) + { + return n * price[0]; + } + // At any index we have 2 options either + // cut the rod of this length or not cut + // it + int notCut = cutRod(price, index - 1, n); + int cut = INT_MIN; + int rod_length = index + 1; + + if (rod_length <= n) + cut = price[index] + cutRod(price, index, n - rod_length); + + return max(notCut, cut); +} +int main() +{ + int arr[] = {1, 5, 8, 9, 10, 17, 17, 20}; + int size = sizeof(arr) / sizeof(arr[0]); + cout << "Maximum Obtainable Value is " + << cutRod(arr, size - 1, size); + getchar(); + return 0; +} \ No newline at end of file From 052fcac3506722506e24a3ebd29ffb770fa03e2a Mon Sep 17 00:00:00 2001 From: Uthsav Jain <85090938+uthsavj@users.noreply.github.com> Date: Sat, 15 Oct 2022 08:24:13 +0530 Subject: [PATCH 236/290] Closest Pair of Points | O(nlogn) Implementation --- CLosestPAirOfPoints.cpp | 144 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 144 insertions(+) create mode 100644 CLosestPAirOfPoints.cpp diff --git a/CLosestPAirOfPoints.cpp b/CLosestPAirOfPoints.cpp new file mode 100644 index 0000000..d43aa87 --- /dev/null +++ b/CLosestPAirOfPoints.cpp @@ -0,0 +1,144 @@ +// A divide and conquer program in C++ to find the smallest distance from a +// given set of points. +#include +#include +#include +#include +using namespace std; + +// A structure to represent a Point in 2D plane +struct Point +{ + int x, y; +}; +// Needed to sort array of points according to X coordinate +int compareX(const void *a, const void *b) +{ + Point *p1 = (Point *)a, *p2 = (Point *)b; + return (p1->x != p2->x) ? (p1->x - p2->x) : (p1->y - p2->y); +} +// Needed to sort array of points according to Y coordinate +int compareY(const void *a, const void *b) +{ + Point *p1 = (Point *)a, *p2 = (Point *)b; + return (p1->y != p2->y) ? (p1->y - p2->y) : (p1->x - p2->x); +} + +// A utility function to find the distance between two points +float dist(Point p1, Point p2) +{ + return sqrt((p1.x - p2.x) * (p1.x - p2.x) + + (p1.y - p2.y) * (p1.y - p2.y)); +} + +// A Brute Force method to return the smallest distance between two points +// in P[] of size n +float bruteForce(Point P[], int n) +{ + float min = FLT_MAX; + for (int i = 0; i < n; ++i) + for (int j = i + 1; j < n; ++j) + if (dist(P[i], P[j]) < min) + min = dist(P[i], P[j]); + return min; +} + +// A utility function to find a minimum of two float values +float min(float x, float y) +{ + return (x < y) ? x : y; +} + +// A utility function to find the distance between the closest points of +// strip of a given size. All points in strip[] are sorted according to +// y coordinate. They all have an upper bound on minimum distance as d. +// Note that this method seems to be a O(n^2) method, but it's a O(n) +// method as the inner loop runs at most 6 times +float stripClosest(Point strip[], int size, float d) +{ + float min = d; // Initialize the minimum distance as d + + // Pick all points one by one and try the next points till the difference + // between y coordinates is smaller than d. + // This is a proven fact that this loop runs at most 6 times + for (int i = 0; i < size; ++i) + for (int j = i + 1; j < size && (strip[j].y - strip[i].y) < min; ++j) + if (dist(strip[i], strip[j]) < min) + min = dist(strip[i], strip[j]); + + return min; +} + +// A recursive function to find the smallest distance. The array Px contains +// all points sorted according to x coordinates and Py contains all points +// sorted according to y coordinates +float closestUtil(Point Px[], Point Py[], int n) +{ + // If there are 2 or 3 points, then use brute force + if (n <= 3) + return bruteForce(Px, n); + + // Find the middle point + int mid = n / 2; + Point midPoint = Px[mid]; + + // Divide points in y sorted array around the vertical line. + // Assumption: All x coordinates are distinct. + Point Pyl[mid]; // y sorted points on left of vertical line + Point Pyr[n - mid]; // y sorted points on right of vertical line + int li = 0, ri = 0; // indexes of left and right subarrays + for (int i = 0; i < n; i++) + { + if ((Py[i].x < midPoint.x || (Py[i].x == midPoint.x && Py[i].y < midPoint.y)) && li < mid) + Pyl[li++] = Py[i]; + else + Pyr[ri++] = Py[i]; + } + + // Consider the vertical line passing through the middle point + // calculate the smallest distance dl on left of middle point and + // dr on right side + float dl = closestUtil(Px, Pyl, mid); + float dr = closestUtil(Px + mid, Pyr, n - mid); + + // Find the smaller of two distances + float d = min(dl, dr); + + // Build an array strip[] that contains points close (closer than d) + // to the line passing through the middle point + Point strip[n]; + int j = 0; + for (int i = 0; i < n; i++) + if (abs(Py[i].x - midPoint.x) < d) + strip[j] = Py[i], j++; + + // Find the closest points in strip. Return the minimum of d and closest + // distance is strip[] + return stripClosest(strip, j, d); +} + +// The main function that finds the smallest distance +// This method mainly uses closestUtil() +float closest(Point P[], int n) +{ + Point Px[n]; + Point Py[n]; + for (int i = 0; i < n; i++) + { + Px[i] = P[i]; + Py[i] = P[i]; + } + + qsort(Px, n, sizeof(Point), compareX); + qsort(Py, n, sizeof(Point), compareY); + + // Use recursive function closestUtil() to find the smallest distance + return closestUtil(Px, Py, n); +} +int main() +{ + Point P[] = {{2, 3}, {12, 30}, {40, 50}, {5, 1}, {12, 10}, {3, 4}}; + int n = sizeof(P) / sizeof(P[0]); + cout << "The smallest distance is " << closest(P, n); + return 0; +} From bc5cfe66aa26aa19be29d9bf6908908e4d95145d Mon Sep 17 00:00:00 2001 From: Uthsav Jain <85090938+uthsavj@users.noreply.github.com> Date: Sat, 15 Oct 2022 08:24:59 +0530 Subject: [PATCH 237/290] Partition Problem solution --- PartitionProblem.cpp | 59 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 59 insertions(+) create mode 100644 PartitionProblem.cpp diff --git a/PartitionProblem.cpp b/PartitionProblem.cpp new file mode 100644 index 0000000..e87b6e9 --- /dev/null +++ b/PartitionProblem.cpp @@ -0,0 +1,59 @@ +// A recursive C++ program for partition problem +#include +using namespace std; + +// A utility function that returns true if there is +// a subset of arr[] with sum equal to given sum +bool isSubsetSum(int arr[], int n, int sum) +{ + // Base Cases + if (sum == 0) + return true; + if (n == 0 && sum != 0) + return false; + + // If last element is greater than sum, then + // ignore it + if (arr[n - 1] > sum) + return isSubsetSum(arr, n - 1, sum); + + /* else, check if sum can be obtained by any of + the following + (a) including the last element + (b) excluding the last element + */ + return isSubsetSum(arr, n - 1, sum) || isSubsetSum(arr, n - 1, sum - arr[n - 1]); +} + +// Returns true if arr[] can be partitioned in two +// subsets of equal sum, otherwise false +bool findPartiion(int arr[], int n) +{ + // Calculate sum of the elements in array + int sum = 0; + for (int i = 0; i < n; i++) + sum += arr[i]; + + // If sum is odd, there cannot be two subsets + // with equal sum + if (sum % 2 != 0) + return false; + + // Find if there is subset with sum equal to + // half of total sum + return isSubsetSum(arr, n, sum / 2); +} +int main() +{ + int arr[] = {3, 1, 5, 9, 12}; + int n = sizeof(arr) / sizeof(arr[0]); + + // Function call + if (findPartiion(arr, n) == true) + cout << "Can be divided into two subsets " + "of equal sum"; + else + cout << "Can not be divided into two subsets" + " of equal sum"; + return 0; +} From 72b47aa33d2371dc95ee280579cc15a2c07c2241 Mon Sep 17 00:00:00 2001 From: khushi-web <59950580+khushi-web@users.noreply.github.com> Date: Sat, 15 Oct 2022 11:13:29 +0530 Subject: [PATCH 238/290] Add files via upload --- single_num_2.cpp | 28 ++++++++++++++++++++++++++++ wildcard_matching.cpp | 33 +++++++++++++++++++++++++++++++++ 2 files changed, 61 insertions(+) create mode 100644 single_num_2.cpp create mode 100644 wildcard_matching.cpp diff --git a/single_num_2.cpp b/single_num_2.cpp new file mode 100644 index 0000000..f7eb38f --- /dev/null +++ b/single_num_2.cpp @@ -0,0 +1,28 @@ +class Solution { +public: + vector singleNumber(vector& nums) { + int x=0,x1=0,x2=0,pos=-1; + for(int i=0;i vect; + vect.push_back(x1); + vect.push_back(x2); + return vect; + } +}; \ No newline at end of file diff --git a/wildcard_matching.cpp b/wildcard_matching.cpp new file mode 100644 index 0000000..96407c2 --- /dev/null +++ b/wildcard_matching.cpp @@ -0,0 +1,33 @@ +class Solution { +public: + bool isMatch(string a, string b) { + int n=a.size(),m=b.size(); + bool dp[n+1][m+1]; + memset(dp,false,sizeof(dp)); + if(m==0) + return n==0; + + dp[0][0]=true; + for(int i=1;i<=m;i++) + if(b[i-1]=='*') + dp[0][i]=dp[0][i-1]; + + + for(int i=1;i<=n;i++) + { + for(int j=1;j<=m;j++) + { + if(b[j-1]=='?' || b[j-1]==a[i-1]) + dp[i][j]=dp[i-1][j-1]; + else if(b[j-1]=='*') + dp[i][j]=dp[i-1][j] || dp[i][j-1]; + else if(b[j-1]!=a[i-1]) + dp[i][j]=false; + } + } + if(dp[n][m]) + return 1; + return 0; + + } +}; \ No newline at end of file From 2577809c1525c5c4589164cd1e6f1d3b3baf12bd Mon Sep 17 00:00:00 2001 From: mufzaal <115857912+mufzaal@users.noreply.github.com> Date: Sat, 15 Oct 2022 12:59:47 +0530 Subject: [PATCH 239/290] Create CODE_OF_CONDUCT.md Added the Code of Conduct adapted from the Contributor Covenant, v2.0. --- CODE_OF_CONDUCT.md | 127 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 127 insertions(+) create mode 100644 CODE_OF_CONDUCT.md diff --git a/CODE_OF_CONDUCT.md b/CODE_OF_CONDUCT.md new file mode 100644 index 0000000..41dd9eb --- /dev/null +++ b/CODE_OF_CONDUCT.md @@ -0,0 +1,127 @@ +# Contributor Covenant Code of Conduct + +## Our Pledge + +We as members, contributors, and leaders pledge to make participation in our +community a harassment-free experience for everyone, regardless of age, body +size, visible or invisible disability, ethnicity, sex characteristics, gender +identity and expression, level of experience, education, socio-economic status, +nationality, personal appearance, race, religion, or sexual identity +and orientation. + +We pledge to act and interact in ways that contribute to an open, welcoming, +diverse, inclusive, and healthy community. + +## Our Standards + +Examples of behavior that contributes to a positive environment for our +community include: + +* Demonstrating empathy and kindness toward other people +* Being respectful of differing opinions, viewpoints, and experiences +* Giving and gracefully accepting constructive feedback +* Accepting responsibility and apologizing to those affected by our mistakes, + and learning from the experience +* Focusing on what is best not just for us as individuals, but for the + overall community + +Examples of unacceptable behavior include: + +* The use of sexualized language or imagery, and sexual attention or + advances of any kind +* Trolling, insulting or derogatory comments, and personal or political attacks +* Public or private harassment +* Publishing others' private information, such as a physical or email + address, without their explicit permission +* Other conduct which could reasonably be considered inappropriate in a + professional setting + +## Enforcement Responsibilities + +Community leaders are responsible for clarifying and enforcing our standards of +acceptable behavior and will take appropriate and fair corrective action in +response to any behavior that they deem inappropriate, threatening, offensive, +or harmful. + +Community leaders have the right and responsibility to remove, edit, or reject +comments, commits, code, wiki edits, issues, and other contributions that are +not aligned to this Code of Conduct, and will communicate reasons for moderation +decisions when appropriate. + +## Scope + +This Code of Conduct applies within all community spaces, and also applies when +an individual is officially representing the community in public spaces. +Examples of representing our community include using an official e-mail address, +posting via an official social media account, or acting as an appointed +representative at an online or offline event. + +## Enforcement + +Instances of abusive, harassing, or otherwise unacceptable behavior may be +reported to the community leaders responsible for enforcement. +All complaints will be reviewed and investigated promptly and fairly. + +All community leaders are obligated to respect the privacy and security of the +reporter of any incident. + +## Enforcement Guidelines + +Community leaders will follow these Community Impact Guidelines in determining +the consequences for any action they deem in violation of this Code of Conduct: + +### 1. Correction + +**Community Impact**: Use of inappropriate language or other behavior deemed +unprofessional or unwelcome in the community. + +**Consequence**: A private, written warning from community leaders, providing +clarity around the nature of the violation and an explanation of why the +behavior was inappropriate. A public apology may be requested. + +### 2. Warning + +**Community Impact**: A violation through a single incident or series +of actions. + +**Consequence**: A warning with consequences for continued behavior. No +interaction with the people involved, including unsolicited interaction with +those enforcing the Code of Conduct, for a specified period of time. This +includes avoiding interactions in community spaces as well as external channels +like social media. Violating these terms may lead to a temporary or +permanent ban. + +### 3. Temporary Ban + +**Community Impact**: A serious violation of community standards, including +sustained inappropriate behavior. + +**Consequence**: A temporary ban from any sort of interaction or public +communication with the community for a specified period of time. No public or +private interaction with the people involved, including unsolicited interaction +with those enforcing the Code of Conduct, is allowed during this period. +Violating these terms may lead to a permanent ban. + +### 4. Permanent Ban + +**Community Impact**: Demonstrating a pattern of violation of community +standards, including sustained inappropriate behavior, harassment of an +individual, or aggression toward or disparagement of classes of individuals. + +**Consequence**: A permanent ban from any sort of public interaction within +the community. + +## Attribution + +This Code of Conduct is adapted from the [Contributor Covenant][homepage], +version 2.0, available at +https://www.contributor-covenant.org/version/2/0/code_of_conduct.html. + +Community Impact Guidelines were inspired by [Mozilla's code of conduct +enforcement ladder](https://github.com/mozilla/diversity). + +[homepage]: https://www.contributor-covenant.org + +For answers to common questions about this code of conduct, see the FAQ at +https://www.contributor-covenant.org/faq. Translations are available at +https://www.contributor-covenant.org/translations. From e6e718e4684ee41c1b4feda954c114657fe2258a Mon Sep 17 00:00:00 2001 From: Sachin Kanzariya <114856060+sachin027@users.noreply.github.com> Date: Sat, 15 Oct 2022 13:59:44 +0530 Subject: [PATCH 240/290] sqrt(x) --- sqrt(x).java | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 sqrt(x).java diff --git a/sqrt(x).java b/sqrt(x).java new file mode 100644 index 0000000..e61c633 --- /dev/null +++ b/sqrt(x).java @@ -0,0 +1,28 @@ +class Solution { + int BinarySearch(int n){ + long s = 0; + long e = n ; + long mid = s + (e-s)/2; + long ans = -1; + while(s<=e){ + long sq = mid*mid; + + if(sq==n){ + return (int)mid; + } + + if(sq < n){ + ans = mid; + s = mid + 1; + } + else{ + e = mid - 1; + } + mid = s + (e-s)/2; + } + return (int)ans ; + } + public int mySqrt(int x) { + return BinarySearch(x); + } +} From a73fefd0dfe8072ea7f1731341f45a6ac45acb7c Mon Sep 17 00:00:00 2001 From: Arunangshu Roy <89198409+77Spencer77@users.noreply.github.com> Date: Sat, 15 Oct 2022 16:21:42 +0530 Subject: [PATCH 241/290] created 99. Recover Binary Search Tree.cpp important leetcode standard question --- 99. Recover Binary Search Tree.cpp | 36 ++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 99. Recover Binary Search Tree.cpp diff --git a/99. Recover Binary Search Tree.cpp b/99. Recover Binary Search Tree.cpp new file mode 100644 index 0000000..dec211d --- /dev/null +++ b/99. Recover Binary Search Tree.cpp @@ -0,0 +1,36 @@ +class Solution { +public: + vector> v; + void ans(TreeNode* root){ + if(root==NULL){ + return; + } + ans(root->left); + v.push_back({root->val,root}); + ans(root->right); + + } + void recoverTree(TreeNode* root) { + ans(root); + vector b; + for(int i=0;ival; + change1->val=change2->val; + change2->val=a; + return ; + } +}; From f31bcfebf2bc8cd277189bbbdb8a98f4e11cde92 Mon Sep 17 00:00:00 2001 From: Arunangshu Roy <89198409+77Spencer77@users.noreply.github.com> Date: Sat, 15 Oct 2022 16:25:21 +0530 Subject: [PATCH 242/290] created 98. Validate Binary Search Tree standard BST question --- 98. Validate Binary Search Tree.cpp | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 98. Validate Binary Search Tree.cpp diff --git a/98. Validate Binary Search Tree.cpp b/98. Validate Binary Search Tree.cpp new file mode 100644 index 0000000..fe3f386 --- /dev/null +++ b/98. Validate Binary Search Tree.cpp @@ -0,0 +1,23 @@ +class Solution { +public: + static bool valid(TreeNode* root,long long Left,long long Right){ + if(root==NULL){ + return true; + } + if(root->val<=Left || root->val>=Right){ + return false; + } + return valid(root->left,Left,root->val) && valid(root->right,root->val,Right); + + + + } + bool isValidBST(TreeNode* root) { + if(root->left==NULL && root->right==NULL){ + return true; + } + return valid(root,-3147483648,3147483647); + + + } +}; From d2b4fc49e088d72d65d8d9734c058c5320521c4b Mon Sep 17 00:00:00 2001 From: Arunangshu Roy <89198409+77Spencer77@users.noreply.github.com> Date: Sat, 15 Oct 2022 16:31:12 +0530 Subject: [PATCH 243/290] created 994. Rotting Oranges from leetcode Implementation of DFS using QUEUE data structure. --- 994. Rotting Oranges.cpp | 48 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 994. Rotting Oranges.cpp diff --git a/994. Rotting Oranges.cpp b/994. Rotting Oranges.cpp new file mode 100644 index 0000000..9da6fd9 --- /dev/null +++ b/994. Rotting Oranges.cpp @@ -0,0 +1,48 @@ +class Solution { +public: + bool ispos(int a,int b,int m,int n,vector>& grid){ + if(a<0||a>=m||b<0||b>=n){ + return false; + } + if(grid[a][b]==1){ + return true; + } + return false; + } + int orangesRotting(vector>& grid) { + queue> q; + for(int i=0;i Date: Sat, 15 Oct 2022 19:37:40 +0530 Subject: [PATCH 244/290] passwordGenrator --- passwordGenrator.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 passwordGenrator.cpp diff --git a/passwordGenrator.cpp b/passwordGenrator.cpp new file mode 100644 index 0000000..9f333ad --- /dev/null +++ b/passwordGenrator.cpp @@ -0,0 +1,24 @@ +#include +#include +#include +using namespace std; + +static const char alphanum[] = +"0123456789" +"!@#$%^&*" +"ABCDEFGHIJKLMNOPQRSTUVWXYZ" +"abcdefghijklmnopqrstuvwxyz"; +int size = sizeof(alphanum) - 1; + +int main() +{ + //password length + int length = 8; + + srand(time(0)); + for (int i = 0; i < length; i++) + { + cout << alphanum[rand() % ::size]; + } + return 0; +} From f718ce9b3ed292ce8426f44f62562788dab9714c Mon Sep 17 00:00:00 2001 From: sourabh jadhav <114357226+sourabhjadhav0812@users.noreply.github.com> Date: Sat, 15 Oct 2022 19:55:29 +0530 Subject: [PATCH 245/290] onoffBULB --- onoffBULB.HTML | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 onoffBULB.HTML diff --git a/onoffBULB.HTML b/onoffBULB.HTML new file mode 100644 index 0000000..1e7ca18 --- /dev/null +++ b/onoffBULB.HTML @@ -0,0 +1,35 @@ + + + + + On Off Bulb + + + + +

+
+
+
+
+
+ + + + + From c17dfc633b88fbc1cf8aaec4689151de79434f82 Mon Sep 17 00:00:00 2001 From: SubratKumar Date: Sun, 16 Oct 2022 09:23:30 +0530 Subject: [PATCH 246/290] FourSum Problem LeetCode --- fourSum.java | 53 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 fourSum.java diff --git a/fourSum.java b/fourSum.java new file mode 100644 index 0000000..b8a8ebd --- /dev/null +++ b/fourSum.java @@ -0,0 +1,53 @@ +import java.util.*; + +public class fourSum { + public List> fourSumLC(int[] nums, int target) { + ArrayList> result = new ArrayList>(); + + if (nums == null || nums.length == 0) + return result; + + int l = nums.length; + + Arrays.sort(nums); + + for (int i = 0; i < l; i++) { + + int target_3 = target - nums[i]; + + for (int j = i + 1; j < l; j++) { + + int target_2 = target_3 - nums[j]; + + int front = j + 1; + int back = l - 1; + + while(front < back) { + + int two_sum = nums[front] + nums[back]; + + if (two_sum < target_2) front++; + + else if (two_sum > target_2) back--; + + else { + + List quad = new ArrayList<>(); + quad.add(nums[i]); + quad.add(nums[j]); + quad.add(nums[front]); + quad.add(nums[back]); + result.add(quad); + + while (front < back && nums[front] == quad.get(2)) ++front; + + while (front < back && nums[back] == quad.get(3)) --back; + } + } + while(j + 1 < l && nums[j + 1] == nums[j]) ++j; + } + while (i + 1 < l && nums[i + 1] == nums[i]) ++i; + } + return result; + } +} From ab0fae99415433e406bdac728c2cff1edade6712 Mon Sep 17 00:00:00 2001 From: Atshaya Ananthakrishnan Date: Sun, 16 Oct 2022 11:41:33 +0530 Subject: [PATCH 247/290] Added solution for Word Break II program from leetcode --- Word Break II.py | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Word Break II.py diff --git a/Word Break II.py b/Word Break II.py new file mode 100644 index 0000000..4e6e245 --- /dev/null +++ b/Word Break II.py @@ -0,0 +1,23 @@ +# https://leetcode.com/problems/word-break-ii/description/ + +class Solution: + def wordBreak(self, s: str, wordDict: List[str]) -> List[str]: + + def recur(idx, str_): + if idx >= len(s): + recur.res.append(str_.strip()) + return + + for i in range(idx, len(s)): + if s[idx:i+1] in wordDict: + temp = str_ + str_ += s[idx:i+1] + ' ' + recur(i+1, str_) + str_ = temp + + return + + recur.res = [] + + recur(0, '') + return recur.res \ No newline at end of file From 65ca73e3539ae64b1e5abb69312641f8a31274f8 Mon Sep 17 00:00:00 2001 From: SubratKumar Date: Sun, 16 Oct 2022 15:17:53 +0530 Subject: [PATCH 248/290] reverse pairs --- Count_Reverse_Pairs.java | 55 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 Count_Reverse_Pairs.java diff --git a/Count_Reverse_Pairs.java b/Count_Reverse_Pairs.java new file mode 100644 index 0000000..16da23a --- /dev/null +++ b/Count_Reverse_Pairs.java @@ -0,0 +1,55 @@ +//https://leetcode.com/problems/reverse-pairs/ +//Given an array of numbers, you need to return the count of reverse pairs. Reverse Pairs are those pairs where i2*arr[j]. +// Time Complexity : O( N log N ) + O (N) + O (N) +// Space Complexity : O(N) + +import java.util.*; + +public class Count_Reverse_Pairs { + static int merge(int[] nums, int low, int mid, int high) { + int cnt = 0; + int j = mid + 1; + for(int i = low;i<=mid;i++) { + while(j<=high && nums[i] > (2 * (long) nums[j])) { + j++; + } + cnt += (j - (mid+1)); + } + + ArrayList temp = new ArrayList<>(); + int left = low, right = mid+1; + while(left <= mid && right<=high) { + if(nums[left]<=nums[right]) { + temp.add(nums[left++]); + } + else { + temp.add(nums[right++]); + } + } + + while(left<=mid) { + temp.add(nums[left++]); + } + while(right<=high) { + temp.add(nums[right++]); + } + + for(int i = low; i<=high;i++) { + nums[i] = temp.get(i - low); + } + return cnt; + } + static int mergeSort(int[] nums, int low, int high) { + if(low>=high) return 0; + int mid = (low + high) / 2; + int inv = mergeSort(nums, low, mid); + inv += mergeSort(nums, mid+1, high); + inv += merge(nums, low, mid, high); + return inv; + } + public int reversePairs(int[] nums) { + return mergeSort(nums, 0, nums.length - 1); + } +} + + From 25eb51fec686d5a1ad4d96e2ca3e107eed43e66e Mon Sep 17 00:00:00 2001 From: yashas-gune <115809687+yashas-gune@users.noreply.github.com> Date: Sun, 16 Oct 2022 23:15:20 +0530 Subject: [PATCH 249/290] 53. Maximum Subarray.java Java code for finding the contiguous subarray (containing at least one number) which has the largest sum and return its sum. --- 53. Maximum Subarray.java | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 53. Maximum Subarray.java diff --git a/53. Maximum Subarray.java b/53. Maximum Subarray.java new file mode 100644 index 0000000..63279bb --- /dev/null +++ b/53. Maximum Subarray.java @@ -0,0 +1,16 @@ + public int maxSubArray(int[] nums) { + int maxsofar=nums[0]; + int sum=0; + for(int i=0;imaxsofar) + { + maxsofar=sum; + } + if(sum<0) + { + sum=0; + } + } + return maxsofar; + } From 21261feaf885f77ce13c5c7cb8ff33f96e2c4868 Mon Sep 17 00:00:00 2001 From: Prashant <98750053+Prashant0664@users.noreply.github.com> Date: Sun, 16 Oct 2022 23:21:13 +0530 Subject: [PATCH 250/290] Create Hexadecimal_to_decimal_counter.cpp You are given a number str(in string format) in hexadecimal. A new number can be made from the number str by selecting any subsequence of it (in HexaDecimal) and rearranging it. You have tell the number of distinct numbers that can be made from number n --- Hexadecimal_to_decimal_counter.cpp | 101 +++++++++++++++++++++++++++++ 1 file changed, 101 insertions(+) create mode 100644 Hexadecimal_to_decimal_counter.cpp diff --git a/Hexadecimal_to_decimal_counter.cpp b/Hexadecimal_to_decimal_counter.cpp new file mode 100644 index 0000000..b5b9e91 --- /dev/null +++ b/Hexadecimal_to_decimal_counter.cpp @@ -0,0 +1,101 @@ +/* +You are given a number str(in string format) in hexadecimal. A new number can be made from the number str by selecting any subsequence of it (in HexaDecimal) and rearranging it. +You have tell the number of distinct numbers that can be made from number n. +*/ +#include +using namespace std; + +class Solution { +public: +int countOfDistinctNo(string str){ + // Code here + int n = str.length() ; + long long int dp[n+1] , hash[256] ; + vector>dp_aux(n+1 , vector(n+1 , 0)); + memset(dp , 0 , sizeof(dp)); + memset(hash , 0 , sizeof(hash)); + + + long long int mod = 1000000007; + + + for(int i=0;i<=n;i++){ + + for(int j=0;j<=i;j++){ + + if(j == 0 || j == i) dp_aux[i][j] = 1; + + else if(j == 1) dp_aux[i][j] = i; + else dp_aux[i][j] = dp_aux[i-1][j] + dp_aux[i-1][j-1]; + + dp_aux[i][j] %= mod; + + } + } + + + + + + dp[0] = 1; + int zero = 0; + + + for(int i=0;i=0;k--){ + + for(int j=1;j<=freq;j++){ + + + if(k-j < 0) break; + dp[k] += (dp[k-j]* 1LL * dp_aux[k][k-j]) % mod; + dp[k] %= mod; + + } + } + } + + + for(int k=n;k>=0;k--){ + + for(int j=1;j<=zero;j++){ + + if(k-j <= 0) break; + + dp[k] += (dp[k-j] * 1LL * dp_aux[k-1][k-j-1]) % mod; + dp[k] %= mod; + } + } + + if(zero) dp[1]++; + + long long int sum = 0; + for(int i=1;i<=n;i++){ + + sum += dp[i]; + sum %= mod; + } + + return sum; +} +}; +int main(){ +int t; +cin>>t; +while(t--){ +string s; +cin>>s; +Solution a; +cout< Date: Sun, 16 Oct 2022 23:24:53 +0530 Subject: [PATCH 251/290] Create 1531. String Compression II.cpp --- 1531. String Compression II.cpp | 49 +++++++++++++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 1531. String Compression II.cpp diff --git a/1531. String Compression II.cpp b/1531. String Compression II.cpp new file mode 100644 index 0000000..42f773d --- /dev/null +++ b/1531. String Compression II.cpp @@ -0,0 +1,49 @@ +class Solution { +public: + + int helper(int currIdx,int prevchar,int curFreq,int k, vector>>> &dp, string &s) + { + if(k < 0) return 100000000; + if(currIdx >= s.size()) return 0; + + if(curFreq >= 10) curFreq = 10; + if(dp[currIdx][prevchar][curFreq][k] != -1) return dp[currIdx][prevchar][curFreq][k]; + +// // exclude + int res = 100000000; + res = min(res, helper(currIdx + 1, prevchar, curFreq, k - 1, dp, s)); + +// // include + if(s[currIdx] - 'a' != prevchar) + { + res = min(res, 1 + helper(currIdx + 1, s[currIdx] - 'a', 1, k, dp, s)); + } + else + { + if(curFreq == 1 || curFreq == 9) + { + res = min(res, 1 + helper(currIdx + 1, prevchar, curFreq + 1, k, dp, s)); + } + else res = min(res, helper(currIdx + 1, prevchar, curFreq + 1, k, dp, s)); + } + + return dp[currIdx][prevchar][curFreq][k] = res; + } + +int getLengthOfOptimalCompression(string s, int k) +{ + int n = s.size(); + cout<>>> dp + (n+1,vector>>(28,vector>(11,vector(n+1,-1)))); + return helper(0, 27, 0, k, dp, s); +} + +}; From 4580314813f21248ee0c770e03af7139ed8768d2 Mon Sep 17 00:00:00 2001 From: Pratyay Mondal <81563083+Pratyay008@users.noreply.github.com> Date: Mon, 17 Oct 2022 21:33:21 +0530 Subject: [PATCH 252/290] Create 74. Search a 2D Matrix.java Search for the target element in a 2D matrix. --- 74. Search a 2D Matrix.java | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 74. Search a 2D Matrix.java diff --git a/74. Search a 2D Matrix.java b/74. Search a 2D Matrix.java new file mode 100644 index 0000000..8862744 --- /dev/null +++ b/74. Search a 2D Matrix.java @@ -0,0 +1,13 @@ +class Solution { + public boolean searchMatrix(int[][] matrix, int target) { + for (int r=0; r Date: Mon, 17 Oct 2022 22:42:36 +0530 Subject: [PATCH 253/290] Create ladder prob.cpp for solving problem --- ladder prob.cpp | 56 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 56 insertions(+) create mode 100644 ladder prob.cpp diff --git a/ladder prob.cpp b/ladder prob.cpp new file mode 100644 index 0000000..0c92228 --- /dev/null +++ b/ladder prob.cpp @@ -0,0 +1,56 @@ +class Solution { +public: + int ladderLength(string beginWord, string endWord, vector& wordList) { + + unordered_map> mp; + unordered_map bank,visited; + vector mywordList; + + mywordList.push_back(beginWord); + bank[beginWord]=true; + for(auto it:wordList){ + bank[it]=true; + mywordList.push_back(it); + } + + for(int i=0;i q; + q.push(beginWord); + visited[beginWord]=true; + int level=2; + + while(!q.empty()) + { + int n=q.size(); + for(int i=0;i Date: Mon, 17 Oct 2022 22:44:02 +0530 Subject: [PATCH 254/290] Created digit.cpp check it --- digit.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 digit.cpp diff --git a/digit.cpp b/digit.cpp new file mode 100644 index 0000000..e254a82 --- /dev/null +++ b/digit.cpp @@ -0,0 +1,13 @@ +#include +class Solution { +public: + int singleNumber(vector& nums) { + //approach 1 + int xorresult = 0; + for(int i =0;i Date: Tue, 18 Oct 2022 00:12:26 +0530 Subject: [PATCH 255/290] Unique Paths --- 62. Unique paths.js | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 62. Unique paths.js diff --git a/62. Unique paths.js b/62. Unique paths.js new file mode 100644 index 0000000..60b41f4 --- /dev/null +++ b/62. Unique paths.js @@ -0,0 +1,15 @@ +var uniquePaths = function(m, n,memo = {}) { + let key = m + ',' + n; + if(key in memo) + return memo[key]; + + + if(m===0 || n===0) + return 0; + + if(m===1 || n===1) + return 1; + + memo[key] = uniquePaths(m, n-1,memo) + uniquePaths(m-1, n,memo) + return memo[key] ; +}; From ae56fc55ce454ded938d46cf5f2fd751aacfc4c4 Mon Sep 17 00:00:00 2001 From: Ashish Tiwari <80841006+Ashish-100-tiwari@users.noreply.github.com> Date: Tue, 18 Oct 2022 10:37:21 +0530 Subject: [PATCH 256/290] update read.me --- README.md | 52 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) diff --git a/README.md b/README.md index 8400436..e48a20e 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,55 @@ # Leetcode75 Leetcode 75 days Contribute here + +The Repository Conatins Famous DSA Problems and Best Course Materials + + +# 🌟Getting started + +#### :dart: Let's celebrate [Hacktoberfest](https://hacktoberfest.com/) by getting involved in the open source community and start your journey in open source. +#### :dart: We at [Hash Define](https://hashdefinebpit.netlify.app) aim to build a platform that will not only encourage you to find which domain interests you but will also help you to come forward and gain expertise in that. + + + +

+ + +![image](https://user-images.githubusercontent.com/96205648/193408591-1c9cf31d-b6c8-49ba-9ee4-f9bf832cf686.png) + +

+ + + + + +## :label: Participation Rules 📝 + +➡️ Pull requests can be made to any public repository on GitHub, look for the "hacktoberfest" topic to know whether the project is participating or not. The pull request must contain commits you made yourself. + +➡️ If a maintainer reports your pull request as 🔴 spam , it will not be counted towards your participation in Hacktoberfest. + +➡️ If a maintainer reports behavior that’s not in line with the project’s code of conduct, you will be ineligible to participate. + + +## :label: Rules Regarding Submission of PR :bookmark: +➡️ Participant can contribute anything he wishes for. + +➡️ Make sure to pull request in the respective folder. + +➡️ Your PR must be valid. + +➡️ Don't just copy and paste code from other website/blogs . + +➡️ Submitting someone else work will be reported as 🔴spam. + +➡️ Please read [CONTRIBUTING.md](/CONTRIBUTING.md) for details about the process for submitting pull requests to us. + + + From f4dfd900962c3fa13b2f4fbd699f5f81ba88cf25 Mon Sep 17 00:00:00 2001 From: Tabish Malik <76650437+Dark-Hope-tech@users.noreply.github.com> Date: Wed, 19 Oct 2022 19:11:16 +0530 Subject: [PATCH 257/290] Create 2095-Delete-the-Middle-Node-of-a-Linked-List.cpp --- 2095-Delete-the-Middle-Node-of-a-Linked-List.cpp | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 2095-Delete-the-Middle-Node-of-a-Linked-List.cpp diff --git a/2095-Delete-the-Middle-Node-of-a-Linked-List.cpp b/2095-Delete-the-Middle-Node-of-a-Linked-List.cpp new file mode 100644 index 0000000..d189186 --- /dev/null +++ b/2095-Delete-the-Middle-Node-of-a-Linked-List.cpp @@ -0,0 +1,16 @@ +class Solution { +public: + ListNode* deleteMiddle(ListNode* head) { + ListNode *slow=head; + ListNode *fast=head; + ListNode *prev=NULL; + if(head->next==NULL) return NULL; + while(fast!=NULL and fast->next!=NULL){ + prev=slow; + slow=slow->next; + fast=fast->next->next; + } + prev->next=slow->next; + return head; + } +}; From 32b1445f99cb4104e5c12eeecc9ced077b985616 Mon Sep 17 00:00:00 2001 From: vishalgt3078 <112457139+vishalgt3078@users.noreply.github.com> Date: Thu, 20 Oct 2022 13:36:20 +0530 Subject: [PATCH 258/290] First commit --- javascript clock/project.html | 112 ++++++++++++++++++++++++++++++++++ 1 file changed, 112 insertions(+) create mode 100644 javascript clock/project.html diff --git a/javascript clock/project.html b/javascript clock/project.html new file mode 100644 index 0000000..e8380ca --- /dev/null +++ b/javascript clock/project.html @@ -0,0 +1,112 @@ + + + + + + + + + + + + Hello, world! + + + + + + + + + + + + + +
+
+

Current Time Is:

+

This is a simple hero unit, a simple jumbotron-style component for calling extra attention + to featured content or information.

+
+

We are here to show you time for different countries:

+ Browse times +
+
+ + + + + \ No newline at end of file From ab4286b332606b53757487c6076211053e2b06f0 Mon Sep 17 00:00:00 2001 From: Gauri Date: Thu, 20 Oct 2022 13:44:16 +0530 Subject: [PATCH 259/290] First commit --- generate_paranthesis.cpp | 31 +++++++++++++++++++++++++++++++ maximize_array.cpp | 22 ++++++++++++++++++++++ 2 files changed, 53 insertions(+) create mode 100644 generate_paranthesis.cpp create mode 100644 maximize_array.cpp diff --git a/generate_paranthesis.cpp b/generate_paranthesis.cpp new file mode 100644 index 0000000..319381a --- /dev/null +++ b/generate_paranthesis.cpp @@ -0,0 +1,31 @@ +#include + +using namespace std; +class Solution { +public: + vector generateParenthesis(int n) { + int obc=0; + int cbc=0; + vectorv; + ans(v,n,obc,cbc,""); + return v; + + } + void ans(vector&v,int n,int obc,int cbc,string s){ + + if(obc==n&&(cbc==n)){ + + v.push_back(s); + return ; + } + +if(obccbc){ + + ans(v,n,obc,cbc+1,s+")"); + } + + } +}; \ No newline at end of file diff --git a/maximize_array.cpp b/maximize_array.cpp new file mode 100644 index 0000000..1745aca --- /dev/null +++ b/maximize_array.cpp @@ -0,0 +1,22 @@ +#include + +using namespace std; +class Solution { +public: + int maxSubArray(vector& nums) { + + int n=nums.size(); + int sum=0; + int maxi=INT_MIN; + for(int i=0;i Date: Thu, 20 Oct 2022 13:57:18 +0530 Subject: [PATCH 260/290] second commit --- majority_element2.cpp | 21 +++++++++++++++++++++ two_sum.cpp | 37 +++++++++++++++++++++++++++++++++++++ 2 files changed, 58 insertions(+) create mode 100644 majority_element2.cpp create mode 100644 two_sum.cpp diff --git a/majority_element2.cpp b/majority_element2.cpp new file mode 100644 index 0000000..ab5ca02 --- /dev/null +++ b/majority_element2.cpp @@ -0,0 +1,21 @@ +#include + +using namespace std; + +class Solution { +public: + vector majorityElement(vector& nums) { + vectorans; + int n=nums.size(); + unordered_mapmp; + for(int i=0;i(n/3)){ +ans.push_back(x.first); + } + } + return ans; + } +}; \ No newline at end of file diff --git a/two_sum.cpp b/two_sum.cpp new file mode 100644 index 0000000..f1f812f --- /dev/null +++ b/two_sum.cpp @@ -0,0 +1,37 @@ +#include + +using namespace std; + +class Solution { +public: + vector twoSum(vector& nums, int target) { + + + + int n=nums.size(); + + unordered_setst; +// for(int i=0;ians; + for(int i=0;i Date: Fri, 21 Oct 2022 16:27:47 +0530 Subject: [PATCH 261/290] Add files via upload --- passwordgenerator.py | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 passwordgenerator.py diff --git a/passwordgenerator.py b/passwordgenerator.py new file mode 100644 index 0000000..f3c3373 --- /dev/null +++ b/passwordgenerator.py @@ -0,0 +1,15 @@ +import random + +pass1 = ['a', 'b', 'c', 'd', 'f', 'g', 'h', 'i', 'j', + 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', + 't', 'u', 'v', 'x', 'y', 'z', 'A', 'B', 'C', + 'D', 'E', 'F', 'G', 'H', 'I', 'K', 'L', 'M', + 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'W', + 'X', 'Y', 'Z', '1', '2', '3', '4', '5', '6', + '7', '8', '9', '0', '@', '#', '$', '_', '*', + '.', '!', '(', ')', '%', '^', '/', '|', ' '] +password = " " +for x in range(16): + password = password + random.choice(pass1)[0] + +print('your new password is:\n', password) From 1280656680967340559b78ac10fd09682c0bcec1 Mon Sep 17 00:00:00 2001 From: SABA LANGA <112406847+sabalanga06@users.noreply.github.com> Date: Fri, 21 Oct 2022 18:46:07 +0530 Subject: [PATCH 262/290] moving car in c --- CARCG.C | 92 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 92 insertions(+) create mode 100644 CARCG.C diff --git a/CARCG.C b/CARCG.C new file mode 100644 index 0000000..1722717 --- /dev/null +++ b/CARCG.C @@ -0,0 +1,92 @@ +// C program to draw a moving car. This +// program run in gcc compiler having +// graphics.h library installed +#include +#include + +// Function to draw moving car +void draw_moving_car(void) { + + int i, j = 0, gd = DETECT, gm; + + // Passed three arguments to initgraph + // function to initialize graphics mode + initgraph(&gd, &gm, "C:\\TURBOC3\\BGI"); + + for (i = 0; i <= 420; i = i + 10) { + + // Set color of car as red + setcolor(RED); + + // Thease lines for bonnet and + // body of car + line(0 + i, 300, 210 + i, 300); + line(50 + i, 300, 75 + i, 270); + line(75 + i, 270, 150 + i, 270); + line(150 + i, 270, 165 + i, 300); + line(0 + i, 300, 0 + i, 330); + line(210 + i, 300, 210 + i, 330); + + // For left wheel of car + circle(65 + i, 330, 15); + circle(65 + i, 330, 2); + + // For right wheel of car + circle(145 + i, 330, 15); + circle(145 + i, 330, 2); + + // Line left of left wheel + line(0 + i, 330, 50 + i, 330); + + // Line middle of both wheel + line(80 + i, 330, 130 + i, 330); + + // Line right of right wheel + line(210 + i, 330, 160 + i, 330); + + delay(100); + + // To erase previous drawn car, draw + // the whole car at same position + // but color using black + //setcolor(BLACK); + + // Lines for bonnet and body of car + //line(0 + i, 300, 210 + i, 300); + //line(50 + i, 300, 75 + i, 270); + //line(75 + i, 270, 150 + i, 270); + //line(150 + i, 270, 165 + i, 300); + //line(0 + i, 300, 0 + i, 330); + //line(210 + i, 300, 210 + i, 330); + + // For left wheel of car + //circle(65 + i, 330, 15); + //circle(65 + i, 330, 2); + + // For right wheel of car + //circle(145 + i, 330, 15); + //circle(145 + i, 330, 2); + + // Line left of left wheel + //line(0 + i, 330, 50 + i, 330); + + // Line middle of both wheel + //line(80 + i, 330, 130 + i, 330); + + // Line right of right wheel + //line(210 + i, 330, 160 + i, 330); + Cleardevice(); + } + + getch(); + + closegraph(); +} + +// Driver code +int main() +{ + draw_moving_car(); + + return 0; +} From 3f6a4c4c147eacf0f561e24ca78dcdbe012773a4 Mon Sep 17 00:00:00 2001 From: ankitgautam03 Date: Sat, 22 Oct 2022 17:26:10 +0530 Subject: [PATCH 263/290] Java Leetcode Problems --- JewelsAndStones.java | 17 +++++++++++++++++ SquaresOfSortedArray.java | 22 ++++++++++++++++++++++ 2 files changed, 39 insertions(+) create mode 100644 JewelsAndStones.java create mode 100644 SquaresOfSortedArray.java diff --git a/JewelsAndStones.java b/JewelsAndStones.java new file mode 100644 index 0000000..42aafc9 --- /dev/null +++ b/JewelsAndStones.java @@ -0,0 +1,17 @@ +//Problem Link:- https://leetcode.com/problems/jewels-and-stones/ + +//Problem Solution in Java: + +class Solution { + public int numJewelsInStones(String jewels, String stones) { + int count=0; + for(int i=0;i=0 && nums[k]>key){ + nums[k+1] = nums[k]; + k=k-1; + } + nums[k+1] = key; + } + return nums; + } +} \ No newline at end of file From bfaa16b3af30278ec644191e03b74aa15a262888 Mon Sep 17 00:00:00 2001 From: rahulvarma5297 <95268505+rahulvarma5297@users.noreply.github.com> Date: Sat, 22 Oct 2022 18:18:30 +0530 Subject: [PATCH 264/290] Added LeetCode 108 Problem --- ...ert_Sorted_Array_to_Binary_Search_Tree.cpp | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp diff --git a/108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp b/108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp new file mode 100644 index 0000000..e487c97 --- /dev/null +++ b/108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp @@ -0,0 +1,36 @@ +#include +#include +#include + +using namespace std; + +class Solution +{ +public: + TreeNode *sortedArrayToBST(vector &nums) + { + return helper(nums, 0, nums.size() - 1); + } + + TreeNode *helper(vector &nums, int left, int right) + { + + // base case + // If the left pointer crosses right return null; + if (left > right) + { + return NULL; + } + + // as middle of the array will be the root node + int mid = (left + right) / 2; + TreeNode *temp = new TreeNode(nums[mid]); + + // left part from middle will be left subtree + temp->left = helper(nums, left, mid - 1); + + // right part of array will be right subtree + temp->right = helper(nums, mid + 1, right); + return temp; + } +}; \ No newline at end of file From a68a41a2abe85eb80302997376d2668480b265c3 Mon Sep 17 00:00:00 2001 From: rahulvarma5297 Date: Sat, 22 Oct 2022 18:24:33 +0530 Subject: [PATCH 265/290] rahulvarma --- 704_Binary_Search.cpp | 42 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 704_Binary_Search.cpp diff --git a/704_Binary_Search.cpp b/704_Binary_Search.cpp new file mode 100644 index 0000000..6b6bc7f --- /dev/null +++ b/704_Binary_Search.cpp @@ -0,0 +1,42 @@ +#include +#include +#include + +using namespace std; + +class Solution +{ +public: + int search(vector &nums, int target) + { + int low = 0; // Least element + int high = nums.size() - 1; // Highest element + + // Loop while low and high intersect + while (low <= high) + { + int mid = low + (high - low) / 2; + // Mid value to check target is left side of mid or right side of mid + + if (nums[mid] < target) + { + // If target > nums[mid] value + // ==> target is on right side so we should search in the range (mid+1 to high) so change low to mid + 1; + low = mid + 1; + } + else if (nums[mid] > target) + { + // If target < nums[mid] value + // ==> target is on left side so we should search in the range (low to mid-1) so change high to mid - 1; + high = mid - 1; + } + else + { + // Found the target !!! + return mid; + } + } + // Target is not present in array + return -1; + } +}; \ No newline at end of file From 0d0534497dbac470bfe24e9a6d9ae66d59b9212a Mon Sep 17 00:00:00 2001 From: Drashti Ashara <85386840+drashti-03@users.noreply.github.com> Date: Sun, 23 Oct 2022 13:33:52 +0530 Subject: [PATCH 266/290] 59) SpiralMatrixII This program is solution to the second spiral matrix program. --- Spiral Matrix II.java | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Spiral Matrix II.java diff --git a/Spiral Matrix II.java b/Spiral Matrix II.java new file mode 100644 index 0000000..d05a4b5 --- /dev/null +++ b/Spiral Matrix II.java @@ -0,0 +1,23 @@ +class Matrix { + public int[][] generateMatrix(int n) { + int[][] result = new int[n][n]; + int cnt = 1; + int dir[][] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; + int d = 0; + int row = 0; + int col = 0; + while (cnt <= n * n) { + result[row][col] = cnt++; + int r = Math.floorMod(row + dir[d][0], n); + int c = Math.floorMod(col + dir[d][1], n); + + // change direction if next cell is non zero + if (result[r][c] != 0) d = (d + 1) % 4; + + row += dir[d][0]; + col += dir[d][1]; + } + return result; + } +} + From 3a78663b2363adfcf239833d7678dd9176b58e8d Mon Sep 17 00:00:00 2001 From: Rakeshm2309 <116485797+Rakeshm2309@users.noreply.github.com> Date: Sun, 23 Oct 2022 20:40:44 +0530 Subject: [PATCH 267/290] added two sums code --- Twosums.cpp | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 Twosums.cpp diff --git a/Twosums.cpp b/Twosums.cpp new file mode 100644 index 0000000..08359e9 --- /dev/null +++ b/Twosums.cpp @@ -0,0 +1,15 @@ +class Solution { +public: + vector twoSum(vector& nums, int target) { + vectorresult; + for(int i =0;i Date: Mon, 24 Oct 2022 09:43:16 +0530 Subject: [PATCH 268/290] Create strongnum.cpp --- strongnum.cpp | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 strongnum.cpp diff --git a/strongnum.cpp b/strongnum.cpp new file mode 100644 index 0000000..a96c3a9 --- /dev/null +++ b/strongnum.cpp @@ -0,0 +1,40 @@ +#include +using namespace std; + +// function to calculate factorial +int factorial(int n){ + int fact = 1; + + for(int i = 1; i <= n; i++) + fact = fact * i; + + return fact; +} + +int Strongnum(int num){ + + int digit, sum = 0; + int temp = num; + + // calculate 1! + 4! + 5! + while(temp!=0){ + digit = temp % 10; + + sum = sum + factorial(digit); + temp /= 10; + } + + + return sum == num; + +} +int main () +{ + int num = 120; + + if(Strongnum(num)) + cout << num << " is Strong Number"; + else + cout << num << " is Not Strong Number"; + +} From 8eba10dc1874eb23303676d930bbb2e1aa4c16e1 Mon Sep 17 00:00:00 2001 From: Disha <108977933+disha815@users.noreply.github.com> Date: Tue, 25 Oct 2022 21:56:48 +0530 Subject: [PATCH 269/290] Create 1662. Check If Two String Arrays are Equivalent --- 1662. Check If Two String Arrays are Equivalent | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 1662. Check If Two String Arrays are Equivalent diff --git a/1662. Check If Two String Arrays are Equivalent b/1662. Check If Two String Arrays are Equivalent new file mode 100644 index 0000000..e027752 --- /dev/null +++ b/1662. Check If Two String Arrays are Equivalent @@ -0,0 +1,12 @@ +class Solution { +public: + bool arrayStringsAreEqual(vector& word1, vector& word2) { + string sol1=""; + string sol2=""; + for(auto i:word1) + sol1+=i; + for(auto i:word2) + sol2+=i; + return sol1==sol2; + } +}; From 52c111904e20a26f5a27e8b175eb662ca2d2fbc4 Mon Sep 17 00:00:00 2001 From: sourabh jadhav <114357226+sourabhjadhav0812@users.noreply.github.com> Date: Wed, 26 Oct 2022 22:26:02 +0530 Subject: [PATCH 270/290] Duplicates --- duplicates.c++ | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 duplicates.c++ diff --git a/duplicates.c++ b/duplicates.c++ new file mode 100644 index 0000000..f9ffab8 --- /dev/null +++ b/duplicates.c++ @@ -0,0 +1,19 @@ +#include +using namespace std; +map m; +int main() +{ + int n,a,ans=0; + cin>>n; + while(n--) + { + cin>>a; + if(m[a]==0) + { + m[a]++; + ans++; + } + } + cout< Date: Thu, 27 Oct 2022 13:06:06 +0530 Subject: [PATCH 271/290] Create 20_Valid_Parentheses.cpp --- 20_Valid_Parentheses.cpp | 42 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 20_Valid_Parentheses.cpp diff --git a/20_Valid_Parentheses.cpp b/20_Valid_Parentheses.cpp new file mode 100644 index 0000000..f3b5ef7 --- /dev/null +++ b/20_Valid_Parentheses.cpp @@ -0,0 +1,42 @@ +// https://leetcode.com/problems/valid-parentheses/ + +class Solution { +public: + bool isValid(string s) { + stack Stack; + for(int i{0}; i Date: Thu, 27 Oct 2022 13:15:49 +0530 Subject: [PATCH 272/290] Create 268_Missing_Number.cpp --- 268_Missing_Number.cpp | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 268_Missing_Number.cpp diff --git a/268_Missing_Number.cpp b/268_Missing_Number.cpp new file mode 100644 index 0000000..5520c1a --- /dev/null +++ b/268_Missing_Number.cpp @@ -0,0 +1,19 @@ +// https://leetcode.com/problems/missing-number/ + +class Solution { +public: + int missingNumber(vector& nums) { + sort(nums.begin(),nums.end()); + int ans{}; + for(int i{0}; i Date: Thu, 27 Oct 2022 13:44:34 +0530 Subject: [PATCH 273/290] Create 9_Palindrome_Number.cpp --- 9_Palindrome_Number.cpp | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 9_Palindrome_Number.cpp diff --git a/9_Palindrome_Number.cpp b/9_Palindrome_Number.cpp new file mode 100644 index 0000000..67f192f --- /dev/null +++ b/9_Palindrome_Number.cpp @@ -0,0 +1,20 @@ +// https://leetcode.com/problems/palindrome-number/ + +class Solution { +public: + bool isPalindrome(int x) { + int count{0}; + string s{to_string(x)}; + for(int i{0}; i Date: Thu, 27 Oct 2022 16:14:37 +0530 Subject: [PATCH 274/290] Create 26_Remove_Duplicates_From_Sorted_Array.cpp --- 26_Remove_Duplicates_From_Sorted_Array.cpp | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 26_Remove_Duplicates_From_Sorted_Array.cpp diff --git a/26_Remove_Duplicates_From_Sorted_Array.cpp b/26_Remove_Duplicates_From_Sorted_Array.cpp new file mode 100644 index 0000000..0c0f444 --- /dev/null +++ b/26_Remove_Duplicates_From_Sorted_Array.cpp @@ -0,0 +1,14 @@ +// https://leetcode.com/problems/remove-duplicates-from-sorted-array/ + +class Solution { +public: + int removeDuplicates(vector& nums) { + for(int i{0}; i Date: Thu, 27 Oct 2022 16:17:24 +0530 Subject: [PATCH 275/290] Create 1207_Unique_Number_Of_Occurrences.cpp --- 1207_Unique_Number_Of_Occurrences.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 1207_Unique_Number_Of_Occurrences.cpp diff --git a/1207_Unique_Number_Of_Occurrences.cpp b/1207_Unique_Number_Of_Occurrences.cpp new file mode 100644 index 0000000..3d45159 --- /dev/null +++ b/1207_Unique_Number_Of_Occurrences.cpp @@ -0,0 +1,24 @@ +// https://leetcode.com/problems/unique-number-of-occurrences/ + +class Solution { +public: + bool uniqueOccurrences(vector& arr) { + bool flag{true}; + map m; + for(int i{0}; i count; + for(auto val : m){ + count.push_back(val.second); + } + sort(count.begin(),count.end()); + for(int i{0}; i Date: Sat, 29 Oct 2022 18:05:47 +0530 Subject: [PATCH 276/290] Create 1752_Check_If_Array_Is_Sorted_And_Rotated.cpp --- 1752_Check_If_Array_Is_Sorted_And_Rotated.cpp | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 1752_Check_If_Array_Is_Sorted_And_Rotated.cpp diff --git a/1752_Check_If_Array_Is_Sorted_And_Rotated.cpp b/1752_Check_If_Array_Is_Sorted_And_Rotated.cpp new file mode 100644 index 0000000..023c9b8 --- /dev/null +++ b/1752_Check_If_Array_Is_Sorted_And_Rotated.cpp @@ -0,0 +1,22 @@ +// https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/ + +class Solution { +public: + bool check(vector& nums) { + int count{0}; + for(int i{0}; i nums.at(i+1)){ + count++; + } + } + if(nums.at(nums.size()-1) > nums.at(0)){ + count++; + } + if(count <= 1){ + return true; + } + else{ + return false; + } + } +}; From dc19d319421c8be06ff588a7c5d5e06b38de3652 Mon Sep 17 00:00:00 2001 From: Dhruv Arora <98750226+lord-benjamin@users.noreply.github.com> Date: Sat, 29 Oct 2022 18:07:17 +0530 Subject: [PATCH 277/290] Create 1636_Sort_Array_By_Increasing_Frequency.cpp --- 1636_Sort_Array_By_Increasing_Frequency.cpp | 33 +++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 1636_Sort_Array_By_Increasing_Frequency.cpp diff --git a/1636_Sort_Array_By_Increasing_Frequency.cpp b/1636_Sort_Array_By_Increasing_Frequency.cpp new file mode 100644 index 0000000..b7caf11 --- /dev/null +++ b/1636_Sort_Array_By_Increasing_Frequency.cpp @@ -0,0 +1,33 @@ +// https://leetcode.com/problems/sort-array-by-increasing-frequency/ + +class Solution { +public: + bool static compare(pair a,pair b){ + if(a.second == b.second){ + return a>b; + } + else{ + return a.second frequencySort(vector& nums) { + map mp; + for(int i{0}; i> vec; + for(auto val : mp){ + vec.push_back(val); + } + sort(vec.begin(),vec.end(),compare); + vector answer; + for(int i{0}; i0){ + answer.push_back(vec.at(i).first); + vec.at(i).second--; + } + } + return answer; + } + +}; From 2b4700747b8a718e1f0f38bb321cd655da8e26a4 Mon Sep 17 00:00:00 2001 From: Dhruv Arora <98750226+lord-benjamin@users.noreply.github.com> Date: Sat, 29 Oct 2022 18:09:05 +0530 Subject: [PATCH 278/290] Create 27_Remove_Element.cpp --- 27_Remove_Element.cpp | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 27_Remove_Element.cpp diff --git a/27_Remove_Element.cpp b/27_Remove_Element.cpp new file mode 100644 index 0000000..520676f --- /dev/null +++ b/27_Remove_Element.cpp @@ -0,0 +1,14 @@ +// https://leetcode.com/problems/remove-element/ + +class Solution { +public: + int removeElement(vector& nums, int val) { + for(int i{0}; i Date: Sat, 29 Oct 2022 18:10:59 +0530 Subject: [PATCH 279/290] Create 69_Sqrt(x).cpp --- 69_Sqrt(x).cpp | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 69_Sqrt(x).cpp diff --git a/69_Sqrt(x).cpp b/69_Sqrt(x).cpp new file mode 100644 index 0000000..b9db0c4 --- /dev/null +++ b/69_Sqrt(x).cpp @@ -0,0 +1,8 @@ +// https://leetcode.com/problems/sqrtx/ + +class Solution { +public: + int mySqrt(int x) { + return sqrt(x); + } +}; From 5c2f34d8fc6ac7c71f7b2beac73bd8b4ae1bee3a Mon Sep 17 00:00:00 2001 From: Dhruv Arora <98750226+lord-benjamin@users.noreply.github.com> Date: Sat, 29 Oct 2022 18:12:21 +0530 Subject: [PATCH 280/290] Create 66_Plus_One.cpp --- 66_Plus_One.cpp | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 66_Plus_One.cpp diff --git a/66_Plus_One.cpp b/66_Plus_One.cpp new file mode 100644 index 0000000..e9d0cbc --- /dev/null +++ b/66_Plus_One.cpp @@ -0,0 +1,22 @@ +// https://leetcode.com/problems/plus-one/ + +class Solution { +public: + vector plusOne(vector& digits) { + int end{}; + end = digits.size()-1; + int carry_back{1}; + for(int i{end}; i>=0; --i){ + digits.at(i) += carry_back; + carry_back = 0; + if(digits.at(i) == 10){ + digits.at(i) = 0; + carry_back = 1; + } + } + if(carry_back == 1){ + digits.insert(digits.begin(),1); + } + return digits; + } +}; From 717b16a99b168c499d6209bd7e90c89d29ac4c77 Mon Sep 17 00:00:00 2001 From: Dhruv Arora <98750226+lord-benjamin@users.noreply.github.com> Date: Sun, 30 Oct 2022 00:24:59 +0530 Subject: [PATCH 281/290] Create 713_Subarray_Product_Less_Than_K.cpp --- 713_Subarray_Product_Less_Than_K.cpp | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 713_Subarray_Product_Less_Than_K.cpp diff --git a/713_Subarray_Product_Less_Than_K.cpp b/713_Subarray_Product_Less_Than_K.cpp new file mode 100644 index 0000000..0bc2546 --- /dev/null +++ b/713_Subarray_Product_Less_Than_K.cpp @@ -0,0 +1,21 @@ +// https://leetcode.com/problems/subarray-product-less-than-k/ + +class Solution { +public: + int numSubarrayProductLessThanK(vector& nums, int k) { + if(k <= 1){ + return 0; + } + int left{0},right{0},product{1},ans{0}; + while(right= k){ + product /= nums.at(left); + left++; + } + ans += (right-left+1); + right++; + } + return ans; + } +}; From 46d8df48f106b8088ab3b1ead5e8b3fa7445bd0c Mon Sep 17 00:00:00 2001 From: subhraneelhait <116779270+subhraneelhait@users.noreply.github.com> Date: Sun, 30 Oct 2022 10:56:56 +0530 Subject: [PATCH 282/290] Create 46. Permutations.cpp --- 46. Permutations.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 46. Permutations.cpp diff --git a/46. Permutations.cpp b/46. Permutations.cpp new file mode 100644 index 0000000..23736e5 --- /dev/null +++ b/46. Permutations.cpp @@ -0,0 +1,33 @@ +/* +leetcode problem no 46 Permutations + +Input: nums = [1,2,3] +Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] +*/ + +class Solution { +public: + void backtrack(vector>& pers, vector& per, vector& nums){ + if(per.size() == nums.size()){ + pers.push_back(per); + }else{ + for(int e : nums){ + if(find(per.begin(), per.end(), e) != per.end()){ + continue; + } + per.push_back(e); + backtrack(pers, per, nums); + per.pop_back(); + } + } + }; + + vector> permute(vector& nums) { + vector> pers; + vector per; + + backtrack(pers, per, nums); + + return pers; + } +}; From f8e3615c17fb59afab967ed8bdf175bab162d5b1 Mon Sep 17 00:00:00 2001 From: Yash Gadre <98249354+Yash1882@users.noreply.github.com> Date: Mon, 31 Oct 2022 11:35:33 +0530 Subject: [PATCH 283/290] Rotate Image please accept for hacktoberfest --- Rotate image | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Rotate image diff --git a/Rotate image b/Rotate image new file mode 100644 index 0000000..360af80 --- /dev/null +++ b/Rotate image @@ -0,0 +1,23 @@ +class Solution { +public: + void rotate(vector>& matrix) { + + for(int i=0;i<(matrix.size()/2);i++) + { + for(int j=0;j Date: Mon, 31 Oct 2022 14:31:53 +0530 Subject: [PATCH 284/290] Create 0072-edit-distance.cpp Leetcode solution 0072-edit-distance.cpp Leetcode accepted solution --- 0072-edit-distance.cpp | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 0072-edit-distance.cpp diff --git a/0072-edit-distance.cpp b/0072-edit-distance.cpp new file mode 100644 index 0000000..64bb346 --- /dev/null +++ b/0072-edit-distance.cpp @@ -0,0 +1,36 @@ +class Solution { +public: + + int f(string word1, string word2,int i,int j,vector>&dp){ + if(i<0) return j+1; + if(j<0) return i+1; + if(dp[i][j]!=-1) return dp[i][j]; + if(word1[i]==word2[j]){ + return dp[i][j] = 0 + f(word1,word2,i-1,j-1,dp); + } + return dp[i][j] = 1 + min(f(word1,word2,i-1,j,dp),min(f(word1,word2,i-1,j-1,dp),f(word1,word2,i,j-1,dp))); + } + + + int minDistance(string word1, string word2) { + int n= word1.size(); + int m = word2.size(); + vector>dp(word1.size()+1,vector(word2.size()+1,-1)); + for(int i=0;i<=n;i++){ + dp[i][0]=i; + } + for(int j=0;j<=m;j++){ + dp[0][j]=j; + } + for(int i=1;i<=n;i++){ + for(int j=1;j<=m;j++){ + if(word1[i-1]==word2[j-1]){ + dp[i][j] = 0 + dp[i-1][j-1]; + } + else + dp[i][j] = 1 + min(dp[i-1][j],min(dp[i-1][j-1],dp[i][j-1])); + } + } + return dp[n][m]; + } +}; From 19f4d07b77d52ea33726ee84c7fca13fbdfc45dd Mon Sep 17 00:00:00 2001 From: VSNSAINIVAS Date: Mon, 31 Oct 2022 20:15:32 +0530 Subject: [PATCH 285/290] Added beautiful star pattern --- star_pattern.c | 67 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 67 insertions(+) create mode 100644 star_pattern.c diff --git a/star_pattern.c b/star_pattern.c new file mode 100644 index 0000000..2f04999 --- /dev/null +++ b/star_pattern.c @@ -0,0 +1,67 @@ +#include +int main() +{ + int a,b,mod=5,k,i,z,c; + a=1; + printf("\n\n\n"); + while(a<=6) + { + printf("\t\t"); + b=0; + printf(" "); + while(b<6-a) + { + printf(" "); + b=b+1; + } + b=0; + while(b0;z--){ + printf(" "); + } + for(k;k>=0;k--){ + printf("* "); + } + printf("\n"); + i = i+1; + b = b-2; + a = a+1; + } + while(mod>=0){ + printf("\t\t"); + z=mod+3; + while(z>0){ + printf(" "); + z = z-1; + } + printf(" "); + for(k=1;k<=mod;k++){ + printf("* "); + } + for(i=1;i<=2*(a-2*mod);i++){ + printf(" "); + } + for(k=1;k<=mod;k++){ + printf("* "); + } + printf("\n"); + mod=mod-1; + a = a+1; + } + return 0; +} From dc6a93ec5ac319833608329d2dfcb3f51d15470b Mon Sep 17 00:00:00 2001 From: Shruti Ujjwal <93506666+shrutiujjwal24@users.noreply.github.com> Date: Mon, 31 Oct 2022 20:48:52 +0530 Subject: [PATCH 286/290] Create primenumber.cpp --- primenumber.cpp | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 primenumber.cpp diff --git a/primenumber.cpp b/primenumber.cpp new file mode 100644 index 0000000..a65eeea --- /dev/null +++ b/primenumber.cpp @@ -0,0 +1,26 @@ +// A school method based C++ program to check if a +// number is prime +#include +using namespace std; + +bool isPrime(int n) +{ + // Corner case + if (n <= 1) + return false; + + // Check from 2 to n-1 + for (int i = 2; i < n; i++) + if (n % i == 0) + return false; + + return true; +} + +// Driver Program to test above function +int main() +{ + isPrime(11) ? cout << " true\n" : cout << " false\n"; + isPrime(15) ? cout << " true\n" : cout << " false\n"; + return 0; +} From ce75df6f776cbd7d2ce65ebb066e5e66d66e0ae8 Mon Sep 17 00:00:00 2001 From: Ragu999 <116629617+Ragu999@users.noreply.github.com> Date: Mon, 31 Oct 2022 21:02:50 +0530 Subject: [PATCH 287/290] Create Ugly_numbers.java --- Ugly_numbers.java | 53 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 53 insertions(+) create mode 100644 Ugly_numbers.java diff --git a/Ugly_numbers.java b/Ugly_numbers.java new file mode 100644 index 0000000..ac0b3f0 --- /dev/null +++ b/Ugly_numbers.java @@ -0,0 +1,53 @@ +// Java program to find nth ugly number +class GFG { + + /*This function divides a by greatest + divisible power of b*/ + static int maxDivide(int a, int b) + { + while (a % b == 0) + a = a / b; + return a; + } + + /* Function to check if a number + is ugly or not */ + static int isUgly(int no) + { + no = maxDivide(no, 2); + no = maxDivide(no, 3); + no = maxDivide(no, 5); + + return (no == 1) ? 1 : 0; + } + + /* Function to get the nth ugly + number*/ + static int getNthUglyNo(int n) + { + int i = 1; + + // ugly number count + int count = 1; + + // check for all integers + // until count becomes n + while (n > count) { + i++; + if (isUgly(i) == 1) + count++; + } + return i; + } + + /* Driver Code*/ + public static void main(String args[]) + { + int no = getNthUglyNo(150); + + // Function call + System.out.println("150th ugly " + + "no. is " + no); + } +} + From 4436d9b8933767c24f0169a09710d3d719f41efe Mon Sep 17 00:00:00 2001 From: saloni dash Date: Mon, 31 Oct 2022 21:04:31 +0530 Subject: [PATCH 288/290] added prims algo --- prims algo.cpp | 83 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 83 insertions(+) create mode 100644 prims algo.cpp diff --git a/prims algo.cpp b/prims algo.cpp new file mode 100644 index 0000000..d22a98d --- /dev/null +++ b/prims algo.cpp @@ -0,0 +1,83 @@ +#include + +using namespace std; + +// Number of vertices in the graph +#define V 5 + +// A utility function to find the vertex with minimum key value, from +// the set of vertices not yet included in MST +int minKey(int key[], bool mstSet[]) +{ + // Initialize min value + int min = INT_MAX, min_index; + + for (int v = 0; v < V; v++) + if (mstSet[v] == false && key[v] < min) + min = key[v], min_index = v; + + return min_index; +} + +// A utility function to print the constructed MST stored in parent[] +int printMST(int parent[], int n, int graph[V][V]) +{ + cout<<"Edge Weight\n"; + for (int i = 1; i < V; i++) + printf("%d - %d %d \n", parent[i], i, graph[i][parent[i]]); +} + +// Function to construct and print MST for a graph represented using adjacency +// matrix representation +void primMST(int graph[V][V]) +{ + int parent[V]; // Array to store constructed MST + int key[V]; // Key values used to pick minimum weight edge in cut + bool mstSet[V]; // To represent set of vertices not yet included in MST + + // Initialize all keys as INFINITE + for (int i = 0; i < V; i++) + key[i] = INT_MAX, mstSet[i] = false; + + // Always include first 1st vertex in MST. + key[0] = 0; // Make key 0 so that this vertex is picked as first vertex + parent[0] = -1; // First node is always root of MST + + // The MST will have V vertices + for (int count = 0; count < V - 1; count++) + { + // Pick thd minimum key vertex from the set of vertices + // not yet included in MST + int u = minKey(key, mstSet); + + // Add the picked vertex to the MST Set + mstSet[u] = true; + + // Update key value and parent index of the adjacent vertices of + // the picked vertex. Consider only those vertices which are not yet + // included in MST + for (int v = 0; v < V; v++) + + // graph[u][v] is non zero only for adjacent vertices of m + // mstSet[v] is false for vertices not yet included in MST + // Update the key only if graph[u][v] is smaller than key[v] + if (graph[u][v] && mstSet[v] == false && graph[u][v] < key[v]) + parent[v] = u, key[v] = graph[u][v]; + } + + // print the constructed MST + printMST(parent, V, graph); +} + +// driver program to test above function +int main() +{ + + int graph[V][V] = { { 0, 2, 0, 6, 0 }, { 2, 0, 3, 8, 5 }, + { 0, 3, 0, 0, 7 }, { 6, 8, 0, 0, 9 }, { 0, 5, 7, 9, 0 }, }; + + // Print the solution + primMST(graph); + + return 0; +} \ No newline at end of file From f28dae2854d40a5205be95bcdf39d2bad608774c Mon Sep 17 00:00:00 2001 From: siddeshas07 <58839558+siddeshas07@users.noreply.github.com> Date: Mon, 31 Oct 2022 21:12:00 +0530 Subject: [PATCH 289/290] MergeArray MergeArray Leetcode Please accept my pull request it's for octberfest --- MergeArray.java | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 MergeArray.java diff --git a/MergeArray.java b/MergeArray.java new file mode 100644 index 0000000..bc34c7a --- /dev/null +++ b/MergeArray.java @@ -0,0 +1,34 @@ +import java.lang.*; +public class MergeArrayExample2 +{ +public static void main(String[] args) +{ +int firstArray[] = { 11,22,33,44,55,98,76,54,60}; +int secondArray[] = {66,77,88,99,22,67,21,90,80,70}; +int source_arr[], sourcePos, dest_arr[], destPos, len; +source_arr = firstArray; +dest_arr = secondArray; +sourcePos = 2; +destPos = 4; +len = 3; +// Print elements of source +System.out.print("source_array : "); +for (int i = 0; i < firstArray.length; i++) +System.out.print(firstArray[i] + " "); +System.out.println(""); +System.out.println("sourcePos : " + sourcePos); +// Print elements of destination +System.out.print("dest_array : "); +for (int i = 0; i < secondArray.length; i++) +System.out.print(secondArray[i] + " "); +System.out.println(""); +System.out.println("destPos : " + destPos); +System.out.println("len : " + len); +//invoking arraycopy() method +System.arraycopy(source_arr, sourcePos, dest_arr,destPos, len); +// Print elements of destination after +System.out.print("Resultant array : "); +for (int i = 0; i < secondArray.length; i++) +System.out.print(secondArray[i] + " "); +} +} From c8e5de0ac282d7cc53cc5d9a548f23ef1ae13984 Mon Sep 17 00:00:00 2001 From: Black-D3vil007 Date: Thu, 19 Jan 2023 21:10:54 +0530 Subject: [PATCH 290/290] Little Update --- ValidPair | Bin 0 -> 68744 bytes kadaneAlgorithm | Bin 0 -> 16584 bytes 2 files changed, 0 insertions(+), 0 deletions(-) create mode 100755 ValidPair create mode 100755 kadaneAlgorithm diff --git a/ValidPair b/ValidPair new file mode 100755 index 0000000000000000000000000000000000000000..01b925e41b88885747f1916dd02131142004c19b GIT binary patch literal 68744 zcmeHw4}4VBmH$gf02L)#w5k7yiY+L{Bm@lBKS44$fdG*tiWYrLCKEF2B$LieAh@Ws z!Im_n#y_oe%XVpNTiT^ioXv-gDo(?`7Tu z&~|tE`S^tM-Z|&qd+xdCo_p?}_vUtA)x7MiEJIymj4KR!D)@lJlrv#{j?GhUlo=-) zmgK(g{*JuPb?yq$p_Q$!AKJ zOSk;&hC60SJ_QxsDz9474Hq0dU*Z+i(~)lWtdaCR8=SD5>)l68bg^8dE@sJL8VX93H_CEzHV3q8eIyy(=~BAH>{A!3rM@_W5zy=QmH7d+Npsa|OZU zzc4aCB@OL<;L_p$%L6|R0;S`h=fU6aQEr0=|2-c3TRiaRdf=CP$oYr||G6Igk9y$W z^1%PtBmZ?C{F6NR4|(wa#6xe_d*rjgBcIhC`H)=};Lm-n^T;3Br{#|VpUzIEd+?L{ zOUM5OlzT2{?yCcclZ`Ws<#$O+J_&-0AmP{EEuZrkzZm%tzP!hYH%xOybF{^bCjzmA zX&Po_?LxC56br2g#}lDg?ZUZ{XiKOzP#+0NT6)S2HHnfU(@ZqQqN~hEsAWZ>$qdC} z(OC6@pkdyys3shX`<8^oZ8Q@1HCT6qt4YiVhFb(GQ5KHI&H6w*R9e{*PE-{8RtkpV zOH}Ulfd(@Wi9~}Sn8EgdSr1uT%wQl9Y!a-IcxA9AQCu8s3dGDrED%lr;qxs4ZU!@0e20NY7$~mjV)a9%=qe- zpt&lHdd3qC;i#{kG}+#6wuWNyXiFdxPOLUp7KwaH${e!CVu96WOGxQSWW4}+o6vhA z5RO2R)v<7M$c%-W0`VrZH5v&AR~MI>3y~_+z-V7{bF;`D)jho025V8*nWk)!mQ|Em zuaeOBT%m8F)>ufirsSF}6^FJ-tJ@igaL89(6BPoL2BU2WZktd`gVi#NYN+L_=b<62 zMy`SW4YRIgRTzv*Lh-idkP$@N-puJ6!=%bvV0$J8svw(bbAYTxNEt|k+QSK>In*2v zQK7Ko;LT>R>1MMLsx*)Y%@e%vLK@L#(c_9Ba-pYUdJ0PX)pO^XGYX50tE(!nnroI6 zmRff+?AwyUnG(HpDVR$Oi_093C9{pWOP9{Ms?sbjoS{?D;j-~>jQBqX|L0&d&Bmxk z_w;X^F`lVo1k5sy!?>3%{uECZp58zoR{p8_!>dm)z&Dl$;w+>*#Po8MI4K-H(Ll~8 zflg^2yzBEAMsr0RO3!VlhmWI3>O3obj`0$w2ia&Ez7J31jf*+`YVkbQxPqU5`rVrm z5{xkx@^fO^-3Ya^jisEQiUU>rC4vIvJIHaK!jJh7m1Y=87ru|<^6~7i6u){NxKpO1 z*g(YugxRCvQ945%hF7sUk%u+>SsH&H%SrC`G!3u(EyYjgXn5tf z2|roGE5A+n0u7(f<&Fc6UAmwaXm~W3bxqaq+$4flq~R$JQ&*XWr?S;muHj`ICMkXm zPco^iTEnY0Bid38f4pJ_T(03^(AL$Y;U`#F!)Vp;FmUT?*YG?w6124%exk)~80$4W z^#^tJX!w&A5^$r2*T?D28lFv7q}rn4DIQi=uZBNWApy5(_z!CMJ`K-ZMNoHX_%k&A z_ixi{;Exl}e%s%%f4sjd_m{UDhX0PfM0RSx-?4N26Cy!s=F7Jk#(~uNzXO;!*&zNV zq8!-!+f*vmBc7?_9oYM<^-LY^z}_9!Gj+5Bd%tHrQwKY+_siBZb*uw>@3Nk$Lmk-r z3G10U(t*7nx1Om39oQSNp2?vd*n5rjOdaXK-Z|DYb)W-#i>+tsI0yEgV?9%cIk5L+ z>zO*rfxTJQ^F;Cdhj&zcsbir2)-!bo)Zcohj)3}G&(r}>f9shHAN9AM$>33c>zN!S z>aU)m{qu$PD-5B3Jl}XLwTAs%=Xze~diJ@VFLyo9bUk0>dOqLve3t9^RM+!~uIF6W z^WU(%q09d#*YoSH=T}|Nzi~bP%=P>u*YlIE=l^m&|A*`O+xm0y>y@3)-sJCm+28TX zP<5@ZxUcwWfA{6zg_);Ly$75J8w)2+UWZ0Q2kO3j2QdEb+(!t^9!{K!uC!bS|IE)2nD&mpbI8BrjVt{-hR67`p7KBYPGS-=@Nov?Q-h5{Zz?_Y zzqOY?iLPt3U0CPuxcu#Z#;w2e)x-pU*X18ZvgE^mOQn(xFy^On{}p^$HzKW7KBeEg z3Pif8L%PREy5y5c^C;b+B9&-6e`kL(3-+jRCz3qCy$-&f8=p{#Yy6+szn)Tc-nzcC zZCz*G+RpAZ$h^Vdm2>`7LGUGu`~2O$UP?U<9l6W5?h89!o18V!F_<-Npkp|z?fCzs zg7=PxSLyd{qWgVUbon;yTTu7JE>D$;{;s-Yga5)wLZgZE_nl4Z_jf*_xCX%G2OA1Ii`st6p;XG> zb>r~UT03>@Z|b~tlfSdA$JI8;KT?uhO48}uhAi**cRmFxm;t+@9Dn`SRBG=O2nEs> zNy=wZA4p1uuTTqsA-D?~>IHVd-}z%o|1?#Z+y7s2-|u@+H1UO9z6Ys^1*gzL7Tmrp z;0L$JvP~4w;d>D6xn;KR!8Jbu^H$06Ip(;WMCg267Vwn6^B2hrf$3V<+f}!sATQ~a6zO1Ncp?J$eMTgb~XAZw)7G1Vj<%b zkJ0#=Bwk{DDY?f=|I16Q^g%*)=Wb_AcWynGHs9jzwYg_n$SxaM0OU4mOs9d)-FKPG zK)+@i=o+N4siJYt7ws<0_a;!2d#Pp)^F_dt*Lmxq&bHx>TMuQmee@Hz4yRIZfF)D` z7F+0}J9o+|sv+s>tAg+poT(vj{mE)%++%l&M=6iTsJkWaLC3Sb8ob#sddd)*YiJ}^ zbAN)d%Qt-E6Cy4mcS@+vwu4>1gZ_k#Sxh#q#3GWp}gJl{b)!Eh2WlAFL`jX zI@I+P%#+l81ytn7*RB|BjVgvPaWLDTrQ5WUjeQm6`KA~lsI#I7F{};&qbW?KVHrx$ z1-+>eCpC>sLfIJWG#z*BSH46KHHHxek_SP8PSk~NA#NQC5OsqWvqPNR&K%(Bh9 z{FvGUO==eLSCELz_+42IHU6k!LXjK6>d?X{ePNzfuB`KXRT%uHzkAY?)Y(}aD;~b( z4{2ORf4NwEa+I#OL02_bO9EN7sZw66I;;}SBU3vyK~)>m1ip|9XiOox>UwbB%gr`f zR0@%BR~`N=^c51_=kHobB&2A=J(2s9wUV~W-*M|MBk>`iaVssflSti5bN14*E?N<# z`FbeL)#PJg7Tt)MrS85iSQmbSr#1tXoxA*<&-%Mh4HqJ5=Zlo;5#s4uxJL>nC782K zIAu_85P=jj?Dy>vnirY(Cm*8V9zv){by&ztnRrbr2B@%SnGLs34IwVO2LDMz)O%b3 zb%S&r9m&q8-rY%+9O6p;nnWaD=IZZ%dehzC)8>neEIaD)$m&}nE6XSxRs?DKlb;X? z>(F(wJ?#x_tzfe~<55`B&&a*goXTlQ2PGQTGt!cd7YZZu8DU9R5{WG76P6{x3cD@y zdCALsE|^YY2=jS0qxqa69M(wlSw*qGWod?;6{axb`l@sZnUe=nqB}kt0qP0*S#cihNw@9nluMaDP{M-iSPf zg7;mB+y>FDPVA8idLT2QE?4#UydZt%F9}k9+hIWpv^tUky^N>uZA#r^y7W zZ|kxiqxsTxOLb_94BP&GWO+)Il42yJk@ff!MD*pv^G`tZplY89ih`N!X-L& zDf5w>;ObA_eGvUe)E_Dqi3+8k)~2U(>gLo^uPK8Nd#H0Gg4*TpT-aA7yrt-rz~#YP zppI~$$Tx&sDm$OVV;?eiwe>>qEf9P&1mCE8C>iW-LljUz;(d)m zo=#fbA#tgGw9?jIAYfN@zJw5>YvD#zAo=GcCfqyFw>uZY#C^$$5BUbMd{qd#^ejRt zqGN8672P7TkP5#Ci(N?73)E(RH^qYx(oV5orr3IMWa=+S{`_Wk1UomcJmNpqV zR(4vJMuVTj(oO~)${1m3mW%AzUqp89Hjiy^$8=4m28ObcL4R@|Wk%DZZuGfs%a@%b zLS`z)F-hwCy|>OCUibS>tys1%`mKZWyO0RN43jW-9d@cONF5+mwn)qqaV(G6k34535|p?~pWT_j?-35>}O|+A^{->DD=~TS=L^<7Fi*sko!B2yx2L#C!WDKGX;QMiKOz8NLcB%R}jw4#eeSFsgZ*XXbF-y^iLf@Diu>^y+XoY(qJY; z{4=|x(?yKtwE5k?bJ@HjPxxYZChAXl0E1XD!KNB8PzgE}nN{2IVl>?QIqAoSByAYn z!|W@;-Udlz6Mq@%gy)ruNst&^$P8n}`Qo1RBDMg8rK4)XN9L2NX8Q&c%j{i)e%Iq3r(JePD-1H^xrpLJInccb0ejr-pj(;f5~pA^MVw{% zBzC%ohe;oUqUy_EbFNvZD}NL z#l2r{#obM}9XpFeQm*<#*T=!k2#5i4wk;I@}AnHWcECS1hz37L( z23fK`kxUV*EPWD{?%YICRslz;$J}Y8N!Nj3^OvLeG+j&dH8fbB2bspkynU-BRm@y$ zW}-1l_N$qaEgt}+{^aw2Mm@S6-Al|rsb_aj8Y9_g)EOZdhJ%jB^T_Z$^dLGj#(~kg zhVp77Q;;H16K?$+7Blo`Az22N^_KPM9q ze*5QePS$KmldV7$M#<21z>h!2bZs}%>1MzS;1oSP$I(w@Kvb<2sXfTY zIn3%tWUTc9&uCz>@CQPc?;wfW-8l-91;{N@8B%{ulwujz2&KxYdJ)tLd%;=*ZFV5a z!i;y9)FX~~z(>m|(f}!K3%P7D*b0??T0A1|mkSjOJCVmPiSJG!tn>$VBSJ9+mU*Y| zZ|6$4tJ_vNlAuj#MZ8XLUtY~ekL8hHL{4aHdge_BESC?G57|2`9f^>7nVhl@3B!<+ zXwFwe&pYIz6LllRjn+m-lB3N#`r5*x2)R;+9BFWb!mRObWGXCy$ni=PDMv$EkwDO{ z=T8$Ta+pt^ zFdz0*4NmhOr86vYbGuBDbk(2C|AmNqz55K?u_BJtRt>=*u)G)2wVpDag- z{tjO<2MDyZ9~xK7n8MKJ6TOq78(-2jY9I%#-rNd$l&>nwMP2Q#oI_EP>S$H>cOgv`9Bo94>;?yE^XE=ZWtqZ__=ZHFn(Q)W zKaM%K7LTL3igf>`4;gYLZ;&#-Q8XP*tua9rqeqxAqHP7{w+P9_aEi{=?R$$Sve$^X z$vKf714Ze*NYz=Z)x4Le1FDTG%iKn4URcsFxg=UoxX)fsz|eNOU#&DvBgsZKiv<;7O_)U{!qy zimB>u9)KNhB#zGsZtRD4zW5lX%SQ6{UkNWz)%iwM=YJ>XqB8r=qAJr;T<42~i-V)8 zQ}m))kQO;%4M8nf_LyV-|xy6|?QbBVV9FOQf>wkZ2X!MVb@qI@*kE*6`yQrm0jgg~dR?RFTZuI-P= zty^2$C;w8{_Fo{mTidzdU~TVuZlty=2$xRV)aR7NO?LEncPj|16=$F_S?!fR7%bfobjwvnr`Wh&xRtK{0EbtJ{mDg6D(M2UXj&MFQC25p?oW~gTK=Q*PZ-Isv_DQOSN9p+b#J;N z&0k_Jr)fvU(Yq+1(w(7PcLW+|DJ`4(1^4hb2t%Plw@;y-5OYKkZSA2%zm?B}Pzu!$O@yKEney50R=dX}d(A?XAVuT#-q+oTpznuDyZWmVn5_%jtm3Rj1MHny2ur1l+wA4H?917#>PtF!a*}Z`D zr98+)hX-*aD{xBal0P$*-s{uq&Mkz6b*(rz61F!U;|;&1h78`n-q*nU8hBp=?`z`_cido1`bOD^gWf)F2#XxTyWDofYxYeKfVBe<@j5RKk)$$Vipqx=VMy_3~8_; zBC^36rTESnw!lT1c)!-5*Zb*}etL}`3mf9XZQ6^{)1|(lp}rw;u|yjIhH^>3Fup*Q z#B~V?fa^!tTcE3(KdN#58S?pAyv{_|Ut1*n*`S1f?Uxw@{#9o1@oPzP!}!Ci^6ML4 zEk9d4f4Ajw0YCT{-lWF$muvne;PwBME!4f@-zEtyUQ=C3sx!>KpNcmkPTq0hx%3=9 zrNKvV+8yFm0t2T`@b;o%U~?r!5@1O>MG|1!KSdG{ojzmm-++?=e+qadAPz65ZU_7( zAZ4(RATq!zyU2jnrzrz$4~q<*CWs6KA2R5sXJqgsL1ge<0kaJ3LE#!>+%Dia0}C^_ zCK`7MIN5kfz$*=rA2J~Ma2c4n)0HLDr^ZNnYTQ>Pexd}a$wDqvf$D?nc3FNZb-ZzW zExr*|aA|>25HC31m>X>fH56R68i<;6Vg*-4@EN3wDrT(2H;}{?479XF69qwh_bL%8 zz&DXDy>w+Ln25#-B7xY7P^=))6lf`E4z!zbd~Rv#G?{8GY7U!US2!o@j4>ajZxs&U zd2o9w)rb4#k79xc*b0bG4H<)vrBYk){B&O`RR#kdyCaoqhY^40@lP;46Sj z0cq~t4p{%ARB998J%HN*zYh2U;8-jl<)Hi0YSa|KEr1n(&jB_74gszMtbmbk1*`?! z4HyL65BM5j9y;IgSR*Y0Yz15j_&DGiz_I9zn*j3xw*$@td;#!Uz(ar$z%$YNw*g)T zn1j{sWq_9gt^teyZUWp6xE=6UfG+^%U`yc;;AMbk;u|G>fE9pm12zGk4JWZ4&=0r; z@Fu`rfNKDgfL{lkfNz;h!^&qV;N5_=fZG8RfCm8Y1+2o-@PmMN06q`+0N_Eu7XT;W z+b6TIP+tbP9B?V%BCV0UrSL1JajnngGvu8TtbB18xCa2Dl6G7QiIn{ea^!z`OxC6>tL1 zCi(%30Gj|81Fi@BB;XdndjWR=mgDH;e!v*ugnam7!0CX$0IUMs3m5^s{#EQy0B!*6 z1w8)0QE$MhfJ1;A0VjP3{SB}b@D;#Xz!Q>aFTk?^?*+UK@Ik;Hz~=$K3V0B32jCW+G?*+U9@Ik<3fX@To0(cPce!xi>A9n+m0#?6<_6EEKupRJ4 zz>R?4+Luc01bhzg6~J@%qrK0B9RW@O%zr(Vss=0qYz4d*um|u_z+S+ycynj~a0=iM z;4Hwrv(PSpMSzWf)qw4Qt$?2g>;e1^U@zbcfCGTNZ^B*xp99RNVHvw3Wq=a_mjbo| zwgY|=a3kPmz-@pJ0PX=i2sjLQ?jMkTGW;Z98Q@C5rGQ%i+W{W|+z7Y_a2w!jfO`NJ z9YA`(2w;8z+6Ax-@L|BEfO`Pj0fzuL0-p3oqz9Z1xCfBl1RVx60rN3#&;|1sSJo{{ zjI8#&tTQHz8{dQRobXVUQS@*s^6JEpKhPU9gls@6d90yc7y&r=+kw2(9VB9=!2k(_E7r0+NRT9 z&;aP@nzsI~vFX!6e+G164=TMZUbIgYr@u%~-(aVYfc_%Vd$sQd&`ExnxLy9WcKWTL zcfxKi*XaqHz8mxhGo;_o^b7U$^>+FR2!Q)Cq@O+ty=oMCgz4+`^0RLj0tovDed=Qw z>OTsdvdy}sx=QrqabFCTUE-g zr5=O6a(<=p`M~$RY)jtDatz}K(AUM_xAJPV^|=i6r$G1Wk842R20B6(JN-O6{U*@2 zWT0;co%*wvy}XctUVtJ?p$AHT3GQ=F)auz{%TRy`;a2cW0gqM3kJ)rOf71&(`9zC; zvrS(P`cBZ{_HBBdOT`Xdla6cj{IjJ~B%2xp{cX_C*Xhgb@{O?| zz~-ju^yN0a0QBQC*kpMII_Yd9Y>3j|hWngv!}}|ngDqvZ%5n-o>jU3%@cD`Fa~hxQ z9@77#taTY=+0FEH_C#e&LH|i0eKVCYQ!67|Iw{gu9_B-jg2&587lHm0(9_v8)ptG0 zcpP+-`qu_)JWG@m5A^JwpOLnAE^Bwd#7JVD&%Ru*P zw>_XYf}YOqNY0`h#LuADlALo~a?Z2mEWqH~^SE~(rElM?^`IA^oaLZLLI1Q~4{H0> zwvDX=&vW2O*N;h7>c>P6;Xdb^(7dM8?CWeB%7LxtJ&{UXLwwyDU$)=U+YrjS0z4JE zJpXLVl81R|J?QD$m)fNW^jgph_4FY-eKn^~XM>c!74#)Y?==SYfbIvKe6Ur|?75cw zy`U#RU*Mo$Wzh#f-wgUpogT5}8v^|y(7o(CkLKN=FV@p%OQ$UA5Bf0Z>FkQ=)u6ux z`UQIWfL(qo=*CXOtvWp_>D1Oepyz|$q0=k7$85;y$j$z^jg=#)O4 zE((z3Ui85YoPSQPCL@FmFW?g#ywpnJuBO`tyndOG*#zbDH9Mb!$Y%ri(zP4ah1Ps% zt*aLIRvs(}(Mv&p6!hOX=+BD+3V_=HIo9mrxZ*sg9AR)#9<+Yc1DcmRA@y0G(;L!MCp)CSPM1^SRqr#xP^_0kKTmCty$ z-2mtb(7p6F1bQRr>Fki&h1T6#J<^k2n$VBxK^J=IfFXJ4h4Na4yl%u=qL-bm0eu*oc~ z`#?`;sWcOTV-R`W)!#Y^eb0F9Uri=v(#j$zH!?%di|gRah_f8gJKveiP`9 zHbfrEPizLg4fI023@zU11HA)uFBu0peXE}S>J4K$a^&DaddNZI9mvB=4^u#Y9`sus z<7k4qzp%p!&`W-tzMTq?e*@@6pl6a{J$Tl5B1iV&XxXEsZ zBF ze$dfnZTYpi@-EQt%|K6rz7BLR{fx(Ss0;LTzFE{C^iP8BCBGl^wHfG5px*|%moHck zx>x%Zpvr^jt360haZ=8O2&|Of&Avr6GRe3bc?@MJV?XF`gWdpMJH4FDlW(WJjw`S? z^F!R{{15@ADnrGe58L)shM@38@OtTUDd@ikz1mThTx=s*+d)5VAiX|FmI2680J@N6 zQD#|oBCkI1VoBeYd9f|)E1+)!Jzc#?mK;n*4tdBz^eLc^eOAuREuCod@(R!kLHDwa z2GFO2?$!6!fqr%d`u(8iWypUg=qF`J{|e}|q3k7J4ve1O4Diz56wu!SJ)Q3n@ele| z4)Xsg>GFFyb{o)G@TA=i5#-YgzH`85=~0XMHh}&B=;_L#cGwDfALw2_U^nRB1>MVs z?FW4bbgy=xy`+~x_tF#XF%4!&PkT?#fqs=!}Z2Q^``t=#|-w*my(4hv~{xm-^0So`t8PZP&J(K)Zpp*Pw`ip=*A9T1QyL@dv zy#e$qGtjq!e$oA@)U|s0Y`H;1{bM)iLC{f6JO65_A41`n$O(65-ImHWHjcqk5gtEy z-jx{EvT}!W@C}8pXMH}`cyi2}h;ryi3;rfth#YHjZ!qGLUE%XC{R)`=l$HBXw(*l} zNz1$RKHy%<%Ki6jV<+RrUz$6|pl`o&ehQv+C2&o-pUE=5nx&{;JS*$e3(zxrvp)2b ztgM%_&gsZDK1cZ=SCajUr)Ev~NN!%#A1{8AU5epQ9!T;{^(!@dc>+=VY^e1i+$#P}u`zK8J<7ykQlg`rQ}8uW{i&#`v`^{94AZbK$?q`1LOQ<bKh5sAldtCVQ#FY3H<6ak@ zzJEk=Zgk;ejNjzKZ)E&t7yePk-|xb|!uTyN{D~NdsobqD{0zqTy71RC{y`U>evN?g z+2+E3hw^>QHV@Qd%?13;j8}1z zif29mS~@@0De|9WY)epS&MO`Nec(5Y4;bY&PTp^ceDV$V`1^f<5c?6hrSBjU{{`nuyx23u?Rv%^D3$n2Brxcc*uNJ)d#6Z#CFh43j~{avmx{xpjGxH)V?|0_y^KFlET2`}7et&#`EO!dwZoIELyyWMXtH;e+BHMsOM6Z}dx&O(4?oX_7bmRQB}E#Ob4 z6x9+BH!H4(nZK3oMA_9VjE}J*Yni_taV6=^-7g+t{AcD###5R9Rp6Bjj1u5@ASs{u zmrAU%hl?4%ZH^P)#`s=tUzO*7GJZ;d z`0Z?O42%~UU&VSmkMl2`B+LCufkY@fIRgq&GBc|Hw9iO#7F;H=O8#3s__qjtJqLOJ z1n0AY^HKeGGb&E`pU(EC(VmVd2{|5L|kpCN~2VHbFovxRe-|hF_Wc+xSf4&Ig8Od2YL#9_c zk23yuVspjzKRX#;#0^O2W$C&P{hab?;`}d>Xd{fSsPbf#0QUe-{JlKBT*JigGv4h7 z)?l2X`W^>+q3d!9jAxm@k>#gzNOVQe9+dy%Y;Q`2?=ilIGf?{91H9sqImrL_F@GN* zU8)_+&XoD@mph)B&G>hi-!GFH^d2$sCn_X@yQQ&{@$UHKufU&@eX^m}wKy9i>s*-+z0XIN zYL{ZhpTd5iT9S>^(66Z68=ybBY9ufgGrs9kiD+f~Yrv<|+c-F=bog@MDgS=96CU=A zYZ+g3nao)E)s2kbFkRwjbGiMDFRhRW6+e6chD!N=isKNKPk`}{u)Q^KJ`Xc~2>qBY zarO@IWyZVXjlVK}5s#a!CgXgRm#)4P50N}Ca7EEf;#$M_e9i}MOjIvzPJH%47zr9V^jKNX~4OLl>*nSjG4!S^r8u-vvHh zeRnaxJHFb__`mpM{z{&Urpa=ba{t9}Ca!YEyY<$<_~+UGY-RombTpFxz+8z?{pCB1 zp9+6Nm$Luyn1>L*d%XA+@agLHI`h9VN9LpK?Q-aa@^QywO^h#RdxqM@wTe7V_-DD(dtx4X*!i;Q>ouipTluD<7>g6Z%x zfG2t8!GF+oodm{luy4Y<EQ z%M}M7k;i(@Ckq1{$#WCynSoKm_?6s_s*al&?;bDqm&klxyFzBH+R=~kiSn;t#7r*t z*Noo`z0&o435;5dTf~0>=yWN0+JRRxNQ(Ub9>Ql&pvjiw`U2{-L;s|5>)Da0I?iGIeE3ni zLJ}B_jNi(JT*dgO8DE0_LDvlu7;me5csx?&PKLl#ZV}tR!Uq`tS(pF$CgTk@OwP{e zgny)bKF{);#^nYv01@6DpRZxO+du4PyxVS1MnRO%(sG%x^8a%fzm@H3F_(Kj;xpp+ zyZqQP#{a%RGSWIPT^GUc5dSl$%V(~JaV_Jg6iB@4clR^?5SOd;_7dY;T>kklz@LnD zs`4J0Pac;$5#y_BYe|v+F9n|D`4Stx%KuKrCsfMuLG=P{x9(O zTVlxTXN(`_{1-6(dDNfef1CS}(%Tv6&w0@Q#(S8NK>_f@e}EOK{7f0+&t$)JJ@fwy z<1c0V7w=|)_9ggV%4ZMkkuFv4GmLl7uU}{UY0RkjDL$io9)Z2krR3>k{PC=SAxSni zpnodeGD?820Wb8x{3`!p#&1Bo(WTnGXP)Fwy8O@6jK3e_30>&^;u>Q70QwVMACSPP zx?1M*b(bA>Gky&l;7aEIC%@#c#kfS5nh%btl)82IFsJ{RCw8#%wrh z;&i3wt9xb@U>EbB>GD4VjCaR%7c7$be+=UiT^C7U zT*vrR&XWkGhx-`+5Zeixm+>ErKZ*TPBj@uX<4ZY%4>P_1j+*q~jzbOrpRQgfR!jaz zVZU^-T8$Rq)A4^+@iU|1d7bg@b?H;DNuSS!z>}OSSux74E?6S*?scSZGv2*^OE0)n zKKU%alBcwm);~vH)xawrow@>e%4awGL-9@v80zaJ{w?-Dg`B8|@#|dn@GZta#f-mU z{?A=2^Z7aVUp3CY$$0lVz-8A-{#V$3l-+)X@$Pu?AmjVE|4!y|=PZ@^xYyGffv0hE z`CXDRpZn=QGrxO$e}M7sxbf$VpThRQ!=W)2j-B-BUgy7n@udZ_+-8=O0xIJ7u|8EB zeTebydGS?@|6rNSK=H3W}B#B=ZULI1*<5O2$uPJLl>dYZ$+m z2S(NJo(G=ncJ19V0~PPR#{BN}@ad*3_pLJ}ztZh;#@}|C#GlRbd~mtsckhdR6nK@E zStY0m#uCMaQNuI?^LnEs5A_qcIj}4w(&Y&CRQk zM0+y9nQ*XP8;FD(ssrIzVX(E;FmI?yR29!|4TplERpEHZ3`SexiC9}O!K4|1NF*8z zKse;GLLz5{SF}W9A^A{dn&Bvwg2zR(O>;#{n;C3xuPP}v(MUMB z+Q<18fd*X=g)zmbh?$7$sG>kav{fdj+-nlWGoi&$yOc7}l89H$3x`c(#w#4xEbGJ^yIiC7>z{mB}Y$&;v(PNg>%sO;nsvF)6DunJRI~SmxbCBp%#2s z(vxFGVAai@#L^Y9P^%|(W+)@MxWuHkS=|zC4hJHhxfIW64kUt2s!d1b!#6O^`snES z5nt#q`Rb#q4y)Wy2EN&{8i5vJifN6exK#3xXf17#40V_#8PRDH;g+^&o427AGiz%s zw9*W$41_b}TG|+mA>+|iUBry>42Dyza%+jA+q7n=^(CBJV>lL1n9-I<2HqK=SPU*< z)V@*7e2LYq8G2BO%Xgxl-8VfagTLKqa9|Pm4T&;mvsAW_x$}2+!N@WG= z0}Z1vvS_hD%Zd!yF;~1bW1%yxLecy2v03j*%;HuM150~2k)dH#(Ft33@bC?x1S}Q< zg;|3UWhD(EW;_9}XojWBDlU?qzqP(0K8v|$uP_7R8@H-g%t*wF;cc$2T71=S)Aw8adxG(Z43D$#RMIBZy%z`L83rg=kIV>kk7%;-uC zfb*8jS?Du;iz-YLPggIhGktzW`YVt6o6d7{XyGXsd{chOMl|*bBwi6q~h0=8^@q#b!;SWEOfy zL$uip1cRY?+zcaT67dH`R8+YmQ|jE}(Z!SvS! ziC9n?N_DlvPG;J6BFqnlS7fD#`j*s`kf=2Y^4O~au?85^%tRZ4#>)ANVWqyswdN8U z*=EH;&C!)16W$WxXG;)PH^cOmTF!WZZk$|b5XPx&UNg}}H73+i6N;cy6vq=Vh|(q) z3)+|{W#+us0b7hCuB4c=A>@O=CR?EBAOdR! z1HqAtR5|mB7&^Fe?FcLN-=(PmZffPKHa}gYpM|ZcC@>!Kj z!oJ1neHaufUD#sf2Lp?iK%q0t%4po2*PLjK1XjdrMtF0#SG62?!X*g^&1zsLFUnrl z48%?LvgqNqy$L%3LiP8<9Y2&miALhS>UpR^Ss3!u=uY-kesxvlRdbgvHD?r-I-Pxn zPH>o>zj84=Z$r4nY{Se!GzNxZhf{Ft%ID+eS@b_TW{j}4X7`|Qq(O{o1koQufd)DB zRW%p+7Keo=prN7(1dO^OK!8D9Vw#DjSacP58{`PG($!jIxNs|u{FW?`8N#|$PBT`7 z5|vaI1%cFUV8p`0OpLS5SlX#v3S(Ce9Nq%~l8=oaRxndW0mX=%0}Tx^1WVDzBMLaH z5hozVBn$8kTpV`c@RgcdWT&Y@9NkFLj{%4ngssV@J?hGCT7oKw$q@NY%pz$LWYXMRxK+f9R8O1fh}}#n zxfxh+b0FLzG)Tgzp-_vWy@#D*ZK@>a%_`1GGkX*AW*WpxRqP|1bL2$wNW8UcQYnTL zJw1GEpjG0GV z6~5{PL8q(pUJ9~p*wypV?X2KeHwLc>)aaufQrfFdVpKoui5#rVS2Nd|$RXmfCS_^5 zvh!1l>bEr8UN@N-*Jf@bTYX+W4ETK`{chqYH zF!aS(5H%a(Sh2&(StJDCP?Lx*@t6|{N2vvjVV?*Czz_DHiec#iioI^hp#ry{Ah{_G-aVyAk2baik!4a|SPUBoPX^rHbnc zv20w3ZJqXZ6WajsCLR>F;tceeIJ(%YPcr6`R@A%vfD zOCZgLfV4V$uLO>H{t~eOM-yi(!_h(r&=_F|%r@ke>MW2HOMgnY!*&%HWx zm_tgdkF{Bxc1Ssr_VLZOPPEXj+TpGsI|C236Q|7EjD+ihw0sduU`0RNVs*P2v{VQ2 zW@EZY8=28~Wst_(U{e6+e&k+H(C3?x2#0*tHBr}~RFjy|9B!#>#`*xZ58$8V%tmwj zt_`-)##TGXvo|gsyN9#~qm91Uj+64I*ZXM2Y1@4?j=RS!m+(i@ifShIzHey#& zPn^ErLV!l88dtciR=h-1<(_`hU@>z2umnCrTR#-XxM<^4M)HoO#KMx<+#n<8wqgoT zQ(L)jxxiaDqqQ3*&I@73@&{>02^k#j8*>FLWhsa6(hQa`YE10j;pmq*gof&+pILa1 zOxSlOZ#-%sEhc;!TS82%wWhGv4E|>vjEEwvd5zn>kOy%o6FQ=vDv#5VI>q@2xrdM0 zAXcQ?T5L3(myoO@H`!_B5rZPH$>9hG&VyL~%X1M-2BqXXcv%Maj&oy}NLi-@#F9A% z<0XgyXzJmxSX#%P4@<@9Od~QGH6n1eg&d4n4&RZAMtHHKjY2Iu*H&G4N$P*^3f)4r zLPtvxa+Qwf(P^W6+1IsL2V0&nmHB_CNXK64e2==Ia?@!2VL{Z`nu#TEv>m7E&NGQ-;8Kh0SndZpVxRzDTu8zumfrwR(tzaC)u)Pc3?Jlwf6V-Ov;zul#(D6@G?XQY+i41MML zr?jnL9%~UaB@nTS*h96>x;P`uzw2t6W(r5GHn{xsYfEPB!nx|0x7g|$sVO;2R(m;O zaVGs*h&9a5ez#|7Fb-jAgg2Quqfx^;ESzF#O2(Awg@c=XuQ%mLr}om1=%6@;CeIYn zP-;!|9ScUnry|I~$$vV#8^Bu(YRL#gS^D!%*n?9ir$$a0Vab{2j5up+%^9&krVjVW zt$lIIIqi`t6@MTx9lBJ9rueiI>UWHcyl5wF8$(SH;6RU+3et+XbqZRKEM?EO)&=yz zh4u(&-u$knWAA29)@lduQ8G-&)7;B$$56Y$Fc;E`s`BtQ+!vgHbQMRo!J<^D1r`6- z&!y0Iy;%RU!=yAXP+(C^o^JKFp(Ba3>`8}JD#z2>Qq;&Pm`|O6qCLMr3;c?6Q&=3c zM&AoY+jtq#IXvLl%O}5! zV|ElNxgvT!pg%?eUeSo*mUswz@7VMDcw0z}Ul=*y$i3d?5{9g=^|?F*-c)t(f2s)t zPqov$4)AUQ#2K&%xrXjo>(JiC3q~sK7Zt>zE?-4$Fd`>Fcq7*rj93SVvC7%lO0%5B zHJ7M)70{( zMAmr-OSkw@0wn8@4`HNW=rc?5zZ}~oqbq4pnski;s`%Kh@Y9M^2W!?BgQ#RQt`=M6R?F zOWV|JBR5pF)ooq}`g@(9$aL;TzCh^1Tl0K0$3Bxor(AvX*$eUdp$q^W{uakR()!zD z$E8{EPuh=IP$c912@4$6wY+>y0=x3*j##GImd6KPuoR3HV5o5hK4p=>x0r(AI6f)k zvLS5KSMxg!mILFpk~FWF9MK^)b~HG$HB;GzJjtaU*%Iaf>%crv9j$YVk$K66#*3Bq zyRjnR5$CJvgDci2BNo`XtM|@JaWJ_N@2k1jct(iP62cZb?O7e(7CtFmn)$J^d?MRX zyh(~kKHW>LI0Vcex(O5uwd<=`Sbz$(i0|x#8!MN_V^BFzVT_%@KqL?o-}1njJ~U!m z$hXpm*iC%11x8UuuP@VPQJQo4-hu9WWW5wGSnp1G2Y+e^Xm^3B}u*@t*qJx%d7aV$$lhxcFG^^KZKQ(`aiZhZ zP(F8M?*?WlP#)XR;})0wU=Q1Io>;ymo`&%ByVlA%B2zU}Am{2h4WwSH zFR_neAwsr~S{>Ogtp24H?31I1q&cSdzkJC_^aOK7Grnjl-z1b%B>vh7bSa-HdTww{ zP#sorcvCP$eHquV=?w?o%P%g$G|-wG%QrDce>VXi#v5^vSNmEH`yD!Y&7VG^&?kN1 zLlKVUrr)Efi{|i-{@}LwrU-v^OIx1K80_h*6{weMi4ESj#(woq??7JN&EavWV~_IE zrmjm4c|1o2M+_y;;?mI$d|SkAfZjfSw2o}8fLIF5s6MRNs8~7eO63366=nLwL+Imj zu=7@y<6A=3Dhw@clD#^VZWP8>H>0+IiI{{<>P~!1w$&)a2g^f+_yB)lYYd;wj3riU zsQR{Wq~W4)1EcWut&8Y`x`LgKI~#=!t6NZngo&7>ti+4|SRiven4rZ%kpLy&yVgj; zC=`c{3vpYxB8o@4iHCwlAzm@Wqj*KWFcuZxF)a)=@vjs#H6SK=s$n#0ImW{8akqY%HGKwr&s{3^pyKhV!y&`+Uca}N1qCCtv?|PnvXFYurr&n-_i$BNpjGtw4q~E~l6)bS^yVK)m zWQ?~`si=~_m(wfAKc8ZZ<$T=o2Y^2Te=2>F(<@lS&s0a!vr3~V6XQ zUn?mCmx9&&J3DUusrugsUP^xzCBoG=!3n2w#+06Z@UT*M zymy8wSwgowkGayT-!WG3L}zl*RyyiQPOsYEsAej|a+m!U=!tRvBm7YnRr+%Lz7<^x zZm=3w;@$oC*Ffv(2d64s3$>|lJ%*~cx;U^+JsYs;@b0w*YE zsK9w#evv{jRO$KWmnp0+CB8mjVUlG7C bmrJPrSLLc_>h9^%Uq^<4Yq~3e>(Tgs?O_Ac literal 0 HcmV?d00001 diff --git a/kadaneAlgorithm b/kadaneAlgorithm new file mode 100755 index 0000000000000000000000000000000000000000..27f2298e190a95c78726229c7c733c223d7a3429 GIT binary patch literal 16584 zcmeHOeQ;FO6~7w@L=6xW6!3#BRY%1v2?Po%x*;sQ)PRvB6|MHM+1(^>*pGDgttKj% z4pP~M%*1|br=65S7+JFP*K$c*j8k#TUUW9sNksIiR^Y^=)mckaDsdHcvZ zw$s0ycj4{1=XcKUew=sj+jq0~-WO`xROa&uPBX;yg0#^pg#@*sVx7)F1jSl02cJvD zC1MuznG#d>pc1gEbgZmcR%m<%B=HteW*T{sf(1)%AxYwuN`74dOQHKgymBIG-7OF5 zcCci7p*}y6k^J(rAor645=$qKV$)MC&7x<0v3y9!WmMP8Jc5ZgsCk2$$5Ln>OO7YS zgs!!^Jh!ZYjS@>YuS@gXa-*UNmQ)9&mUr#w|59JG=2iM-F~Tid6)aeCeK&(garvT& zZ}T=?U#a`BPsfv`zMW!4+-hG_w;~>`j$6rWPj%1QHPvhC0-01`rECJV%a4o3)aI>i zbUTI!)68Li^@U9a0rV=>y*N@Ac zsDFMp2>t33cr) zSf`b-W9il{4e?Ym)*5b)$CPb)%WYd*Qt?d45+-u?S}TIl31Db=WTzSF+G%!# zt+)UwV@D&)m($Q)Luy3jHa9hHXxP5pTotGjGHF+!B+V>lCuYAkMy>0AyXQH_^R6A6A z#28o~N3-(_Uxnw1j=;R7_oGn=z`**CffxhjlO)zn*$WYx-%}o;IV(RpZ)qR-9nup1 zN2LGi=Sf_7%E(O^2mf({ad2ve;X7=+a>`zS0`}?xD)OTpvfa$5`1P%S5#1Bn$2b8hbPv!GtQ3UI7`Oo3!y93-p{lq_h7mSo?0}nT|#>nkDmdhTE z8vQdbyFwNhnyMWd4vix(hC>rdoFMU@(H}ZtJY)_SwLle@>xDV92)ruT^bG@r6u!l=-As*dxQEi92%t+_;Bc*>!cWa zR@%m!r8e;^sl80E+Wl=Wqpc&Vsc)hQxx=XE#%fj1tEh(-z36grV}A-mQDdueyFSfj zr}pgn)R(>XJG-XxdEBd&C~7|4R5ZB<45-gwZEED6M{Y{iaTxdgM-m$zTMd`N)2052 z%6N{Z&Damn;5$yoCbw(K$Yl}1&{TgFJ}3Icy61PzqTG8k3BBWxoFj717G^2+!%JQS zya;#^@FL(vz>9zv0WShx1iT1%5%~NF_~_S!hNc$s@?ALNT3SZY;%UJ|K2IxR8}iqX z_d~t_c@#1Z`Nt3P`8OcV$$b7($jT4%`RlNtX@|TW@*c>GAZYAs+x`xecR4w1oJ~ImiA!$i+~paF9Kc!ya;#^ z@FL(vz>9zvfiGtScpn?@TjPCdSR%+Yq9yBZX}wZQ-cW~M&18B??|+kP3n092?m}(n zHPRBT^FBFR7g53zNT!pg@+rz3(3{D4k64w?@ZPXv+Rl5|&esj)J#>pyablsCEHq6F z>iuT)Q!%9;B?{|B-dlHp#-Gpt%TL1)Cgr5ave}lR_ z{2C{9ZWoq|Qomf=Ki2w8UGD!|6!v+$3a-&NFsNm-mOHfU*3w1$!Yc2F+}zM`jsJ?a z_H5G5`fF`^5Qz=Ys_CaW5{am**+t z`;hTrRP+2|{BdNaYyTgl|G8qOUwLx9uStA~xY^a7cY#yAi}ZY!e@g(i5JbZHdBO9% zRNStIzYnu%-&a(<&d=%E*#v(f&MWN4XMa<=k?@%kXq}&Es0& z)Gv2D*AqU?{`D5%6n_!ql9k*c@g-t=eK8&bz6^{9^mvnh+k(qI+TUI81Hg6Yiwb(O z1bz^>zsOT5Zm(GiG<(;N3qJ7Gp> z>wX5F(UjR4Pql~RX4FolGiEs3BO<9pcRXgtqJf&}J!mVwWrow~aIYCl+UZ`=kq#$f zW;B~f^n&8hOnBNwt~N%pfs$=E z8%^`J+O_d;x)WY4*>>53mTaP#9L-JJ>bHc<(AJG~*1^Q76EkFJ(Ac<5m>X~1TEC^S zp-|*an>MwCTFut_4NW01V$rZ2#zBaiaPA;#CCzLm7DYMElM6vUT|fs3^udK_CS`V^ z<#dRG!U~G(bVGrKlL+c;Ljj?3R2Ay%gUe8S0HR>56EbpO;tU6O7-5!&EtHo&4T152 zPN|a?=wT8ag5Rn{xTnzyZM(76Y*|VFQBr#*!)|9D^PuA##pUv$kYe=n4wy`H7Nz8Q zlW9(w6jdYwncjpQZilqfN_KJ1O5$uww+JLtb}Z1D%m%vCsqR?X?sY)zSqrD3tf+?S zH#An$Y?JO?;Y^nZM0=B{LP_46diX?1Tf_jn90*To&I}> z-m~#lfbVFP+~*qkJzJZlFXu^q6&JnRGQZUMJ@Tc*@3Tr1Vhu7*zWW>>{jTCn{5{JU zy&pOG{C>vL&yHHU`L_Vap1l;epVtp8uh2aG8hu9l!?4rZf%&|?V7Zopi$ratEcc(^ z^DSWXO38d)udw9x30!2-#jz^BjU2uEGoRo0S@ODx+s}S1cY{xB3D$W%!E%SLiDS&| z*RU8shGNQmUf;0f^$pk0eD42GG=GCGkk?Brd3{BE;<)*b0;8C4`Gxlo{XW9$NVv%4 zzW+Z1>g4-1kL3nsnr_=DQOvYClmGLPjmF8-)CuzZzo zjEm33KIh`|dnHR=r?bC1elKc%p&GyT)RNXs&gAC*8Aggf^DF(zn`Ns~3!iTOUtw|b zclebn%d5%gNIZTRqIJt$TzXkoSRe7ZTaGjPGoR%LFwArCc|EqTS~1wK6#p|AXzX(R zyk6mR)EpR^f0Vd9ZWo<%r7jlu`tK8iE67`jZY2tz%x5_ZWG7z)wQG%%Tn`t(Jl5&A zVZylnU{G1AG=C8l?npsLp0e|G{o1`?W&ZL4qB2~ZQ}Wnxx(0QDeR{xL4CDE@xc&V6 kq4CLWck+koly;TN$n~->Ezevo()9PQDUT&Cf=d