-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
2591 lines (2230 loc) · 121 KB
/
index.html
File metadata and controls
2591 lines (2230 loc) · 121 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html lang="en-US" oncontextmenu="return false">
<head>
<title>DSAwithPrinceSingh</title>
<link rel="icon" type="image/x-icon" href="./photo.jpg">
<link rel="stylesheet" id="wp-block-library-css"
href="https://www.lexalytics.com/wp-includes/css/dist/block-library/style.min.css?ver=6.0.3" type="text/css"
media="all" />
<style id="global-styles-inline-css" type="text/css"></style>
<link rel="stylesheet" id="wd_s-css"
href="https://www.lexalytics.com/wp-content/themes/wd_s/build/index.css?ver=0c4cbca560ded1aeeb10beb9a609f609"
type="text/css" media="all" />
<link rel="stylesheet" href="./style.css" />
<link href='https://unpkg.com/boxicons@2.0.9/css/boxicons.min.css' rel='stylesheet'>
</head>
<body
class="page-template-default page page-id-2597 page-child parent-pageid-2342 wp-embed-responsive site-wrapper page-machine-learning group-blog no-js">
<!-- <a class="skip-link screen-reader-text" href="#main">Skip to content</a> -->
<div class="site-main">
<div class="movingContent">
<p><b>✨ Completing This Entire Journey Transforms You InTo A DSA
Virtuoso! But Here's The Kicker – Success Depends
On Your Dedication And Hard Work. 💪</b></p>
</div>
<main id="main" class="content-container">
<article id="post-2597" class="post-2597 page type-page status-publish hentry">
<div class="entry-content">
<div id="section-block_627ed6b337646" class="block-section relative overflow-hidden 0 head4Div">
<div class="bg-white py-100 bg-cover centerbg- bg-no-repeat StartingDiv">
<!-- backup-> <div class="relative container-narrow StartingDiv"></div> -->
<div class="StartingDiv">
<div class="companyLogo">
<img class="companyLogo1" src="https://1000logos.net/wp-content/uploads/2021/10/logo-Meta.png" alt>
<img class="companyLogo2"
src="https://upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Amazon_icon.svg/2500px-Amazon_icon.svg.png"
alt>
<img class="companyLogo3"
src="https://cdn.freebiesupply.com/images/large/2x/apple-logo-transparent.png" alt>
<img class="companyLogo4" src="https://cdn-icons-png.flaticon.com/512/732/732228.png" alt>
<img class="companyLogo5"
src="https://cdn1.iconfinder.com/data/icons/google-s-logo/150/Google_Icons-09-512.png" alt>
</div>
<h5 class="has-text-align-center">
<mark style="background-color: rgba(0, 0, 0, 0)" class="has-inline-color has-nebula-color">
Jb Tak Fodega Nhi 🎯 Tb Tk Chodega Nhi 📚 (MAANG)
</mark>
</h5>
<!-- website title -->
<h1 class="titleHead">
<!-- Data Structure And Algorithms (DSA) -->
DSAwithPrinceSingh
</h1>
<div class="intro">
<p><b>DSAwithPrinceSingh</b> Contains Very Handily Crafted
and Picked Top Coding Interview Questions
from different Topics of <b>Data Structures &
Algorithms</b>.
These Questions are one of the Most
Asked Coding Interview Questions in Coding Interviews of
Companies <b style="color: #ff070798;">Meta, Amazon,
Apple, Netflix,
Google (MAANG)</b> and cover almost all of
the concepts related to <b>Data Structure & Algorithms
(DSA)</b>.
</p>
<b>Key Highlights of DSAwithPrinceSingh</b>
<li>Cover all concepts in limited time that are needed for a
DSA interview.</li>
<li>In-depth Approch brute, better, optimal solutions.</li>
<li>Well structured My Notes Documentation for quick
revision.</li>
<li>Solution in C++, Java, Python Code. <b>Mainly in
Python</b></li>
<li>Google Docs Code Editor
("Give the Real Fill of the Big Tech Companies")</li>
</div>
<div class="totalProblemMainBox">
<div class="totalCount">
<div class="totalName">
Total Problems @DSAwithPrinceSingh
</div>
<div class="totalCount">
450+ (<span id="esColor">Easy</span>, <span id="meColor">Medium</span>,
<span id="hrColor">Hard</span>)
</div>
</div>
<div class="problemSplit">
<div class="prPart1">
<div class="pName1">Easy</div>
<div class="pCount1">100+</div>
</div>
<div class="prPart2">
<div class="pName2">Medium</div>
<div class="pCount2">250+</div>
</div>
<div class="prPart3">
<div class="pName3">Hard</div>
<div class="pCount3">100+</div>
</div>
</div>
</div>
<br>
<div class="aboutMe">
<div class="introIMGwalaDiv">
<div class="abutImg"><img src="./OrgImg.jpg" alt class="myImg"></div>
<!-- <div class="abutImg"><img src="https://raw.githubusercontent.com/PrinceSinghhub/PrinceSinghhub/master/MyLCGoldBedge.gif" alt="" class="myImg"></div> -->
</div>
<div class="abutDiss">
<li>I'm a Passionate for <b>Problem Solving</b> and
<b>MERN
Stack Developer</b> from
India 🦁
</li>
<li><b>Junior SDE @CloudConduction & Cracked Remote Job As A Fresher 💯</b></li>
<li>Problem Solving Enthusiast 🧠 with <b>HardCore DSA
Lover ❤️</b> || <b>@DSAwithPrinceSingh</b>
</li>
<li>3.5⭐ LeetCoder || Max(1876) Rating <b>Knight 👑</b>
Top 5% 🌍 || Global Rank Under 13K</li>
<li>Longest Coding Streak <b>700DaysOfCode Streak 🔥</b>
and <b>75DaysHardPlacementChallenge</b>
</li>
<li>6⭐ Problem Solver || Institute 1st🥇 Rank GFG ||
Global 13th🥇 Rank InterviewBit</li>
<li>Max(1854) Rating Master 🌞 on CodeStudio || Amateur🥇
on HackerEarth</li>
<li><b>5000+ Problems Solved</b> on Data Structure &
Algorithms (DSA)🚀 on Diverse Coding Platforms</li>
<li>Top <b>5% Coder globally 🌍</b>, <b>Securing 2 & 3
Digit Global Ranks</b> on Diverse Coding
Platforms.</li>
<li> <b>DSA & DEV Mentor</b> Guiding Thousands of Students
& Profissional Both and Recognized as a
<b>Top 1% Mentor</b> With <b>39K+ @LinkedIn & 7M+ 🔥
Views || 250+ @GitHub & 16K+ 🔥 Views</b>
</li>
</div>
</div>
<br>
<div class="dsa">
<div class="dsaProfile"><a href="https://leetcode.com/PrinceSingh1/"><img src="./dsaProfileImg/lc.png"
alt></a></div>
<div class="dsaProfile"><a href="https://leetcode.com/PrinceSingh2/"><img src="./dsaProfileImg/lc.png"
alt></a></div>
<div class="dsaProfile"><a href="https://auth.geeksforgeeks.org/user/itsprince/practice"><img
src="./dsaProfileImg/gfg.png" alt></a></div>
<div class="dsaProfile"><a
href="https://www.codingninjas.com/codestudio/profile/b7191958-3dea-4d59-a909-70a6bd5400c8"><img
src="./dsaProfileImg/cn.png" alt></a></div>
<div class="dsaProfile"><a href="https://www.interviewbit.com/profile/princesingh2002"><img
src="./dsaProfileImg/ib.png" alt></a></div>
<div class="dsaProfile"><a href="https://www.hackerrank.com/dsawithprince?hr_r=1"><img
src="./dsaProfileImg/hr.png" alt></a></div>
<div class="dsaProfile"><a href="https://www.hackerearth.com/@prince1033"><img
src="./dsaProfileImg/he.png" alt></a></div>
<div class="dsaProfile"><a href="https://www.codechef.com/users/princesingh001"><img
src="./dsaProfileImg/cc.png" alt></a></div>
<div class="dsaProfile"><a href="https://codeforces.com/profile/thisisPrinceSingh"><img
src="./dsaProfileImg/cf.png" alt></a></div>
<div class="dsaProfile"><a href="https://workat.tech/profile/itsprincesingh"><img
src="./dsaProfileImg/wk.png" alt></a></div>
<div class="dsaProfile"><a href="https://www.linkedin.com/in/prince-singh-314a65187/"><img
src="./dsaProfileImg/lin.png" alt></a></div>
<div class="dsaProfile"><a href="https://github.com/PrinceSinghhub"><img src="./dsaProfileImg/gh.png"
alt></a></div>
<div class="dsaProfile"><a href="https://twitter.com/NowPrinceSingh"><img src="./dsaProfileImg/tw.png"
alt></a></div>
<div class="dsaProfile"><a href="https://stackoverflow.com/users/16512708/prince-singh"><img
src="./dsaProfileImg/st.png" alt></a></div>
<div class="dsaProfile"><a href="https://topmate.io/itsprincesingh"><img
src="./dsaProfileImg/topm.png" alt></a></div>
<div class="dsaProfile"><a href="https://hashnode.com/@itsPrinceSingh"><img
src="./dsaProfileImg/hn.png" alt></a></div>
<div class="dsaProfile"><a
href="https://drive.google.com/file/d/1-8CblCEvdAQDmPOME9FhAuEfNSWtsBFd/view"><img
src="./dsaProfileImg/Resume.jpeg" alt></a></div>
</div>
<div class="psStatement">
<p>
<b>🌟 Problem Diversity</b>: Our problem library consists
of a balanced mix of <b>20% Easy, 60%
Medium, and 20% Hard Problems</b>. This approach ensures
that you're well-rounded in your DSA
knowledge and can tackle a wide range of interview
questions.
</p>
</div>
<br><br><br>
<div class="allBTNGroups">
<button class="maineasyQst" role="button"><b>😊 Easy
Problems</b></button>
<button class="mainmediumQst" role="button"><b>😟 Medium
Problems</b></button>
<button class="mainhardQst" role="button"><b>😢 Hard
Problems</b></button>
</div>
<div class="QuestionBar">
<div role="easyprogressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 20"></div>
<div role="mediumprogressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 60"></div>
<div role="hardprogressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 20"></div>
</div>
<div class="whyDSA">
<h4 style="color: #ff070798;">🧠 Why Data Structure &
Algorithms is So Important? 🚀</h4>
</div>
<p>
DSA <b>(Data Structure & Algorithms)</b> is Crucial Because
it Improves Efficiency, <b>Problem Solving
Skills</b>, Code Reusability, Scalability, Interview
Performance, Code Optimization, and Serves as a
Foundation for Advanced Topics. It forms the bedrock of
Computer Science and Software Development,
Enabling Developers to Build Robust and Efficient
Applications.
</p>
<div class="bannerVideo">
<div class="abutImg"><video id="myVideo" autoplay loop muted>
<source src="./videos/BannerVideo2.mp4" type="video/mp4">
</video></div>
<div class="abutImg"><video id="myVideo" autoplay loop muted>
<source src="./videos/BannerVideo1.mp4" type="video/mp4">
</video></div>
</div>
<br>
<div class="mainBar">
<div class="nameTag">
<h4>@DSAwithPrinceSingh Overall Completion Status</h4>
</div>
<div class="statusBarHai">
<div class="circular-progress">
<span class="progress-value">0%</span>
</div>
</div>
</div>
<br>
<p>
🌟 Excited to unveil my meticulously crafted treasure trove!
<span class="bigKrnaHai">🚀 Mastered ALL
the Concepts and Topics</span> with a Laser Sharp focus on
<span class="bigKrnaHai">Pattern
Recognition!</span> 🧠💡
</p>
<p><b style="color: #ff070798;">🚀 Don't be afraid... 😔
Because DSA is here! 🧠✨ Mai Hu Na Ho Jayiga!
😊</b> Embark on the coding adventure with confidence!
💻🌟 Let's conquer the challenges together!
💪🚀</p>
<!-- DSA zONE -->
<div class="container">
<div class="secHeader1">
<div class="tagSec">
<p>Most Advanced & Hot Topics 🔥 (MAANG)</p>
</div>
</div>
<div class="bannerImg">
<p class="aboutBannerDiss">If we Target the <b>Big 4
Companies</b> Includeing the <b>(MAANG)</b>
then its Mendotiory You
have a Strong Grip on the <b>Recursion & Backtracking &
Trees & Dynamic Programming & Graph,</b>
becouse big Product Based Company or Startup want to
check your <b>Complex Algorithm Abality</b>
and How you deal with the <b>Very Complex and Toufgh
Probelms.</b> <br><br>
This Portion is Not for the Directly for the
<b>Biggener</b>
its Containg <b>Highly Advanced</b>
and <b>Complex Aglorithem</b> Do not Jump Directly on
this Part. <br><br>
This Portion Conatins Approx <b>200+ Algorithms and
Highley Advaced Problems</b> that Direclty
asked in the <b>(MAANG)</b> after this Part of the
Completeion you are ready for the Interview.
</p>
<div class="bannerVideo">
<div class="abutImg"><video id="myVideo" autoplay loop muted>
<source src="./videos/Banner1-2.mp4" type="video/mp4">
</video>
</div>
<div class="abutImg"><video id="myVideo" autoplay loop muted>
<source src="./videos/Banner1.mp4" type="video/mp4">
</video>
</div>
</div>
<br>
<div class="moreAboutPart1">
I've handpicked and crafted a treasure trove of
<b>🔥HIGHLY
ADVANCED🔥 and 🌐COMPLEX🌐
Algorithms</b>. These are the kind of challenges that
the <b>BIG 4️⃣ Companies</b> LOVE throwing
your way in coding interviews!
<br><br>
<li>🧠 Dive into the world of Dynamic Programming with
my collection of 50+ Handily Crafted and
Picked Top Coding Interview Questions on Dynamic
Programming! 💡</li> <br>
<li>🔄 Get ready to tackle Recursion & Backtracking like
a pro! I've curated 20+ Handily Crafted
and Picked Top Coding Interview Questions on Recursion
& Backtracking to sharpen your coding
skills! 🔄
</li> <br>
<li>🌳 Branch out into the fascinating realm of Trees!
🌳 I've compiled a comprehensive list of
50+ Handily Crafted and Picked Top Coding Interview
Questions on Trees that will push your
boundaries and make you a tree ninja! 🎋</li> <br>
<li>🔗 Ready to map out your success in graph-related
problems? 🗺️ Dive into my collection of 50+
Handily Crafted and Picked Top Coding Interview
Questions on Graphs - the secret sauce for
conquering those challenging interviews! 📈</li>
<br><br>
<div class="DPtotalProblemMainBox">
<div class="totalCount">
<div class="totalName">
Total Problems 170+
</div>
<div class="totalCount">
(<span id="esColor">Easy</span>, <span id="meColor">Medium</span>, <span
id="hrColor">Hard</span>)
</div>
</div>
<div class="problemSplit">
<div class="prPart1">
<div class="pName1">Easy</div>
<div class="pCount1">20+</div>
</div>
<div class="prPart2">
<div class="pName2">Medium</div>
<div class="pCount2">100+</div>
</div>
<div class="prPart3">
<div class="pName3">Hard</div>
<div class="pCount3">50+</div>
</div>
</div>
</div>
</div>
</div>
<!-- Recursion and Backtracking -->
<div class="item">
<div class="title" id="AdvancedTitle"><b>🎯 Recursion &
Backtracking</b></div>
<div class="content">
<p>
<b>Recursion:</b> A Function calling itself again and
again directly or indirectly is called
Recursion, and the function which it calls is called a
recursive function, it is used in divide
and conquer algorithms/techniques.
<br><br>
<b>Base cases:</b>
The base case is also called a stopping condition for
recursive calls. It is very important to
have a base case for every recursive code. Without
base cases the recursive calls will be made
again and again many times till the Stack space
allocated is filled with these recursive calls
which will result in Stack overflow error, here memory
gets wasted, to overcome the stack
overflow error base cases plays an important role.
</p>
<br>
<div class="statusBar">
<h4 class="QuestionStatus">
Completion Status:
</h4>
<div role="progressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 100"></div>
<h4 class="InterviewImp">
Importance:
</h4>
<div role="progressbar1" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 90"></div>
</div>
<div class="RecursionMainDiv">
<b>Top Classical Problems Based on Recursion 👇</b>
<br><br>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./recursionPlayList/L1.html">Introduction
of Recursion</a></li>
<li class="prbmName"><a href="./recursionPlayList/L2.html">Problems on
Recursion</a></li>
<li class="prbmName"><a href="./recursionPlayList/L3.html">Parameterized
and Functional
Recursion
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L4.html">Problems on
Functional Recursion
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L5.html">Multiple
Recursion Calls
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L6.html">Recursion
on Subsequences
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L7.html">All Kind of
Patterns in Recursion
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L8.html">Cobination
Sum I</a></li>
<li class="prbmName"><a href="./recursionPlayList/L9.html">Combination
Sum II
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L10.html">Combination
Sum III
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L11.html">Combination
Sum IV
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L11.html">Combination
Sum IV
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L12.html">Subsets I
or Subsets Sum I
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L13.html">Subsets II
or Subsets Sum II
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L14.html">Permutations
I
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L15.html">Permutations
II
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L16.html">N-Queens I
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L17.html">N-Queens
II
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L18.html">Sudoku
Solver
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L19.html">M-Coloring
Problem
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L20.html">Palindrome
Partitioning </a></li>
<li class="prbmName"><a href="./recursionPlayList/L21.html">Permutation
Sequence or Kth
Permutation Sequence
</a></li>
<li class="prbmName"><a href="./recursionPlayList/L22.html">Rat in a
Maze Problem - I
</a></li>
<li class="prbmName"><a href="#">Letter
Combinations of a Phone Number Comming
Soon....
</a></li>
</ol>
</div>
</div>
</div>
<!-- BT and BST -->
<div class="item">
<div class="title" id="AdvancedTitle"><b>🎯 Binary Tree
& Binary Seach Tree</b></div>
<div class="content">
<h5>Binary Tree & Binary Seach Tree
</h5>
<p>Lorem ipsum dolor sit amet consectetur, adipisicing
elit. Quibusdam impedit praesentium aliquid
consequatur reprehenderit error exercitationem
ratione nemo labore itaque.
</p>
<br>
<div class="statusBar">
<h4 class="QuestionStatus">
Completion Status:
</h4>
<div role="progressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 0"></div>
<h4 class="InterviewImp">
Importance:
</h4>
<div role="progressbar1" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 100"></div>
</div>
<div class="btandbstMainDiv">
<b>Top Classical Problems Based on Binary Tree &
Binary Seach Tree 👇</b> <br><br>
<li><a href>L1. Introduction to Trees Types of
Trees</a></li>
<li><a href>L2. Binary Tree Representation in
C++</a></li>
<li><a href>L3. Binary Tree Representation in
Java</a></li>
<li><a href>L4. Binary Tree Traversals in Binary
Tree BFS DFS</a></li>
<li><a href>L5. Preorder Traversal of Binary Tree
</a></li>
<li><a href>L6. Inorder Traversal of Binary Tree
</a></li>
<li><a href>L7. Postorder Traversal of Binary Tree
</a></li>
<li><a href>L8. Level Order Traversal of Binary Tree
BFS</a></li>
<li><a href>L9. Iterative Preorder Traversal in
Binary Tree</a></li>
<li><a href>L10. Iterative Inorder Traversal in
Binary Tree</a></li>
<li><a href>L11. Iterative Postorder Traversal using
2 Stack</a></li>
<li><a href>L12. Iterative Postorder Traversal using
1 Stack</a></li>
<li><a href>L13. Preorder Inorder Postorder
Traversals in One Traversal</a></li>
<li><a href>L14. Maximum Depth in Binary Tree Height
of Binary Tree</a></li>
<li><a href>L15. Check for Balanced Binary
Tree</a></li>
<li><a href>L16. Diameter of Binary Tree</a></li>
<li><a href>L17. Maximum Path Sum in Binary
Tree</a></li>
<li><a href>L18. Check it two trees are Identical or
Not</a></li>
<li><a href>L19. Zig-Zag or Spiral Traversal in
Binary Tree</a></li>
<li><a href>L20. Boundary Traversal in Binary
Tree</a></li>
<li><a href>L21. Vertical Order Traversal of Binary
Tree</a></li>
<li><a href>L22. Top View of Binary Tree</a></li>
<li><a href>L23. Bottom View of Binary Tree</a></li>
<li><a href>L24. RightLeft View of Binary
Tree</a></li>
<li><a href>L25. Check for Symmetrical Binary
Trees</a></li>
<li><a href>L26. Print Root to Node Path in Binary
Tree </a></li>
<li><a href>L27. Lowest Common Ancestor in Binary
Tree LCA</a></li>
<li><a href>L28. Maximum Width of Binary
Tree</a></li>
<li><a href>L29. Children Sum Property in Binary
Tree O(N) </a></li>
<li><a href>L30. Print all the Nodes at a distance
of K in Binary Tree</a></li>
<li><a href>L31. Minimum time taken to BURN the
Binary Tree from a Node</a></li>
<li><a href>L32. Count total Nodes in a COMPLETE
Binary Tree </a></li>
<li><a href>L33. Requirements needed to construct a
Unique Binary Tree</a></li>
<li><a href>L34. Construct a Binary Tree from
Preorder and Inorder Traversal</a></li>
<li><a href>L35. Construct the Binary Tree from
Postorder and Inorder Traversal </a></li>
<li><a href>L36. Serialize and De-serialize
Binary</a></li>
<li><a href>L37. Morris Traversal Preorder Inorder
PostOrder</a></li>
<li><a href>L38. Flatten a Binary Tree to Linked
List</a></li>
<li><a href>L39. Introduction to Binary Search Tree
BST</a></li>
<li><a href>L40. Search in a Binary Search Tree
BST</a></li>
<li><a href>L41. Ceil in a Binary Search Tree
BST</a></li>
<li><a href>L42. Floor in a Binary Search Tree
BST</a></li>
<li><a href>L43. Insert a given Node in Binary
Search Tree BST</a></li>
<li><a href>L44. Delete a Node in Binary Search Tree
BST</a></li>
<li><a href>L45. K-th SmallestLargest Element in
BST</a></li>
<li><a href>L46. Check if a tree is a BST or BT
Validate a BST</a></li>
<li><a href>L47. LCA in Binary Search Tree</a></li>
<li><a href>L48. Construct a BST from a preorder
traversal 3 Methods</a></li>
<li><a href>L49. Inorder SuccessorPredecessor in BST
3 Methods</a></li>
<li><a href>L50. Binary Search Tree Iterator
BST</a></li>
<li><a href>L51. Two Sum In BST Check if there
exists a pair with Sum K</a></li>
<li><a href>L52. Recover BST Correct BST with two
nodes swapped</a></li>
<li><a href>L53. Largest BST in Binary Tree</a></li>
</div>
</div>
</div>
<!-- dp -->
<div class="item">
<div class="title" id="AdvancedTitle"><b>🎯 Dynamic
Programming</b></div>
<div class="content">
<p>
<h5>Dynamic Programming Introduction</h5>
<b>Problem Statement: Introduction To Dynamic
Programming</b> <br><br>
In this article, we will be going to understand the
concept of dynamic programming. <br><br>
Dynamic Programming can be described as storing
answers to various sub-problems to be used later
whenever required to solve the main problem.
<br><br>
The two common dynamic programming approaches are:
<br><br>
<li><b>Memoization:</b> Known as the “top-down”
dynamic programming, usually the problem is solved
in the direction of the main problem to the base
cases.</li>
<li><b>Tabulation:</b> Known as the “bottom-up ”
dynamic programming, usually the problem is
solved in the direction of solving the base cases
to the main problem</li>
<li><b>Space Optimization:</b> if Possible So Space
Optimization also Do in this <b>DP Series</b>
For Every Problems</li> <br>
<b>Note:</b> The base case does not always mean
smaller input. It depends upon the implementation
of the algorithm.
</p>
<br>
<div class="statusBar">
<h4 class="QuestionStatus">
Completion Status:
</h4>
<div role="progressbar" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 40"></div>
<h4 class="InterviewImp">
Importance:
</h4>
<div role="progressbar1" aria-valuenow="67" aria-valuemin="0" aria-valuemax="100"
style="--value: 100"></div>
</div>
<div class="DPtotalProblemMainBox">
<div class="totalCount">
<div class="totalName">
Total Problems 58
</div>
<div class="totalCount">
(<span id="esColor">Easy</span>, <span id="meColor">Medium</span>, <span
id="hrColor">Hard</span>)
</div>
</div>
<div class="problemSplit">
<div class="prPart1">
<div class="pName1">Easy</div>
<div class="pCount1">10+</div>
</div>
<div class="prPart2">
<div class="pName2">Medium</div>
<div class="pCount2">30+</div>
</div>
<div class="prPart3">
<div class="pName3">Hard</div>
<div class="pCount3">20+</div>
</div>
</div>
</div>
<div class="DPmainDiv">
<b>Top Classical Problems Based on Dynamic
Programming 👇</b> <br><br>
<b>Introduction of Dynamic Programming</b>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L1.html">DP1 Phebonachi
Number</a></li>
</ol>
</p>
<br>
<b>1D Dynamic Programming</b>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L2.html">DP2 Climbing
Stairs</a></li>
<li class="prbmName"><a href="./dpPlaylist/L3.html">DP3 Frog Jump
I</a></li>
<li class="prbmName"><a href="./dpPlaylist/L4.html">DP4 Frog Jump
with K Distance</a></li>
<li class="prbmName"><a href="./dpPlaylist/L5.html">DP5 Maximum Sum
of Non-Adjacent Elements
or House Robber I (DP on
Subsequences)</a></li>
<li class="prbmName"><a href="./dpPlaylist/L6.html">DP6 House Robber
II (DP on
Subsequences)</a></li>
</ol>
</p>
<br>
<b>2D/3D DP And DP On Grids</b>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L7.html">DP7 Ninja's
Training or Vacation Atcoder
2D DP 🧠🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L8.html">DP8 Grid Unique
Paths I</li>
<li class="prbmName"><a href>DP9 Unique Paths
2 DP on Grid with Maze Obstacles</a></li>
<li class="prbmName"><a href>DP10 Minimum Path
Sum in Grid</a></li>
<li class="prbmName"><a href>DP11 Triangle
Fixed Starting Point and Variable Ending
Point
</a></li>
<li class="prbmName"><a href>DP12 Minimum
Maximum Falling Path Sum Variable Starting
and
Ending Points</a></li>
<li class="prbmName"><a href>DP13 Cherry
Pickup II 3D DP Made Easy</a></li>
</ol>
</p>
<br>
<b>DP On Subsequences</b>
<p><b>what a Subsequence/Subset?</b> <br>
A subset/subsequence is a contiguous or
non-contiguous part of an array, where elements
appear in the same order as the original array.
</p>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L14.html">DP14 Subset
Sum Equals to Target 🧠🔥</a>
</li>
<li class="prbmName"><a href="./dpPlaylist/L15.html">DP15
Partition Equal Subset</a></li>
<li class="prbmName"><a href="./dpPlaylist/L16.html">Dp16
Partition A Set Into Two Subsets
With Minimum
Absolute Sum Difference 🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L17.html">DP17 Counts
Subsets with Sum K</a></li>
<li class="prbmName"><a href="./dpPlaylist/L18.html">DP18 Count
Partitions With Given
Difference</a></li>
<li class="prbmName"><a href="./dpPlaylist/L19.html">DP19 0/1
Knapsack Problem 🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L20.html">DP20 Minimum
Coins I "Infinite Supplies
Pattern"</a></li>
<li class="prbmName"><a href="./dpPlaylist/L21.html">DP21 Target
Sum</a></li>
<li class="prbmName"><a href="./dpPlaylist/L22.html">DP22 Coin
Change II "Infinite Supplies
Pattern"</a></li>
<li class="prbmName"><a href="./dpPlaylist/L23.html">DP23
Unbounded Knapsack</a></li>
<li class="prbmName"><a href="./dpPlaylist/L24.html">DP24 Rod
Cutting</a></li>
</ol>
</p>
<br>
<p><b>DP On Strings <br>
What is Subsequence?</b><br>
A subsequence of a string is a list of
characters of the string where some characters
are
deleted ( or not deleted at all) and they should
be in the same order in the subsequence as
in the original string.
</p>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L25.html">DP25 Longest
Common Subsequence 🧠🔥</a>
</li>
<li class="prbmName"><a href="./dpPlaylist/L26.html">DP26 Print
Longest Common Subsequence</a>
</li>
<li class="prbmName"><a href="./dpPlaylist/L27.html">DP27 Longest
Common Substring 🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L28.html">DP28 Longest
Palindromic Subsequence</a>
</li>
<li class="prbmName"><a href="./dpPlaylist/L29.html">DP29 Minimum
insertions to make string
Palindrome</a></li>
<li class="prbmName"><a href="./dpPlaylist/L30.html">DP30 Minimum
Insertions & Deletions to
Convert String A to String B</a></li>
<li class="prbmName"><a href="./dpPlaylist/L31.html">DP31 Shortest
Common Supersequence</a>
</li>
<li class="prbmName"><a href="./dpPlaylist/L32.html">DP32 Distinct
Subsequences 🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L33.html">DP33 Edit
Distance 🔥</a></li>
<li class="prbmName"><a href="./dpPlaylist/L34.html">DP34 Wildcard
Matching 🔥</a></li>
</ol>
</p>
<br>
<p><b>DP on Stocks<br>
What is DP on Stocks? </b><br>
This Portion we Solved the Problems on the DP on
Stocks and Try to Create the Pattern on
Stockes that help to Solved the Any Problems
Based on the Stocks. and Try to Figure Out the
Different-Different Pattern on Stocks.
<br><br>
<b>Important Point's</b>
<li>Dp on Stocks its Very Imporatnt to
understand the Concept of the <b>Space
Optimization</b>
</li>
<li style="color: #ff070798;">Becouse Recruter
expect from you to you must know the concept
on
the
<b>Space Optimization</b>
</li>
<b>
<li style="color: #ff070798;">We can not
Escape the Space Optimization Part of the Dp
on
Stocks
</li>
</b>
</p>
<p>
<ol class="problemList">
<li class="prbmName"><a href="./dpPlaylist/L35.html">DP35 Best Time
to Buy and Sell Stock I</a></li>
<li class="prbmName"><a href="./dpPlaylist/L36.html">DP36 Best Time
to
Buy and Sell Stock II</a></li>
<li class="prbmName"><a href="./dpPlaylist/L37.html">DP37 Best Time
to
Buy and Sell Stock III</a></li>
<li class="prbmName"><a href="./dpPlaylist/L38.html">DP38 Best Time to
Buy and Sell Stock IV</a></li>
<li class="prbmName"><a href="./dpPlaylist/L39.html">DP39 Buy and Sell
Stocks With Cooldown</a></li>
<li class="prbmName"><a href="./dpPlaylist/L40.html">DP40 Buy and Sell
Stocks With Transaction Fees</a></li>
</ol>
</p>
<br>
<p>
<b>DP on Longest Increasing Subsequence (LIS)<br>
What is DP on Longest Increasing Subsequence? </b><br>
This Portion we Solved the Problems on the DP on
Longest Increasing Subsequence and Try to Create the Pattern on
Longest Increasing Subsequence that help to Solved the Any Problems
Based on the Longest Increasing Subsequence. and Try to Figure Out the
Different-Different Pattern on LIS.
</p>
<p>
<li><a href>DP 41. Longest Increasing Subsequence
Memoization</a></li>
<li><a href>DP 42. Printing Longest Increasing
Subsequence Tabulation Algorithm</a></li>
<li><a href>DP 43. Longest Increasing Subsequence
Binary Search Intuition</a></li>
<li><a href>DP 44. Largest Divisible Subset
Longest Increasing Subsequence</a></li>
<li><a href>DP 45. Longest String Chain Longest
Increasing Subsequence LIS</a></li>
<li><a href>DP 46. Longest Bitonic Subsequence
LIS</a></li>
<li><a href>DP 47. Number of Longest Increasing
Subsequences</a></li>
</p>
<br>
<p>
<b>DP on Matrix Chain Multiplication (MCM)<br>
What is DP on Matrix Chain Multiplication? </b><br>
This Portion we Solved the Problems on the DP on
Matrix Chain Multiplication and Try to Create the Pattern on
Matrix Chain Multiplication that help to Solved the Any Problems
Based on the Matrix Chain Multiplication. and Try to Figure Out the
Different-Different Pattern on MCM.
</p>
<p>
<li><a href>DP 48. Matrix Chain Multiplication MCM
Partition DP Starts 🔥</a></li>
<li><a href>DP 49. Matrix Chain Multiplication
Bottom-Up Tabulation</a></li>