-
Notifications
You must be signed in to change notification settings - Fork 1
/
Questions.html
1247 lines (1172 loc) · 80.4 KB
/
Questions.html
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><head>
<title>Questions</title>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link rel="stylesheet" href="file:///c:\Users\Ayush Verma\.vscode\extensions\shd101wyy.markdown-preview-enhanced-0.5.3\node_modules\@shd101wyy\mume\dependencies\katex\katex.min.css">
<style>
/**
* prism.js Github theme based on GitHub's theme.
* @author Sam Clarke
*/
code[class*="language-"],
pre[class*="language-"] {
color: #333;
background: none;
font-family: Consolas, "Liberation Mono", Menlo, Courier, monospace;
text-align: left;
white-space: pre;
word-spacing: normal;
word-break: normal;
word-wrap: normal;
line-height: 1.4;
-moz-tab-size: 8;
-o-tab-size: 8;
tab-size: 8;
-webkit-hyphens: none;
-moz-hyphens: none;
-ms-hyphens: none;
hyphens: none;
}
/* Code blocks */
pre[class*="language-"] {
padding: .8em;
overflow: auto;
/* border: 1px solid #ddd; */
border-radius: 3px;
/* background: #fff; */
background: #f5f5f5;
}
/* Inline code */
:not(pre) > code[class*="language-"] {
padding: .1em;
border-radius: .3em;
white-space: normal;
background: #f5f5f5;
}
.token.comment,
.token.blockquote {
color: #969896;
}
.token.cdata {
color: #183691;
}
.token.doctype,
.token.punctuation,
.token.variable,
.token.macro.property {
color: #333;
}
.token.operator,
.token.important,
.token.keyword,
.token.rule,
.token.builtin {
color: #a71d5d;
}
.token.string,
.token.url,
.token.regex,
.token.attr-value {
color: #183691;
}
.token.property,
.token.number,
.token.boolean,
.token.entity,
.token.atrule,
.token.constant,
.token.symbol,
.token.command,
.token.code {
color: #0086b3;
}
.token.tag,
.token.selector,
.token.prolog {
color: #63a35c;
}
.token.function,
.token.namespace,
.token.pseudo-element,
.token.class,
.token.class-name,
.token.pseudo-class,
.token.id,
.token.url-reference .token.variable,
.token.attr-name {
color: #795da3;
}
.token.entity {
cursor: help;
}
.token.title,
.token.title .token.punctuation {
font-weight: bold;
color: #1d3e81;
}
.token.list {
color: #ed6a43;
}
.token.inserted {
background-color: #eaffea;
color: #55a532;
}
.token.deleted {
background-color: #ffecec;
color: #bd2c00;
}
.token.bold {
font-weight: bold;
}
.token.italic {
font-style: italic;
}
/* JSON */
.language-json .token.property {
color: #183691;
}
.language-markup .token.tag .token.punctuation {
color: #333;
}
/* CSS */
code.language-css,
.language-css .token.function {
color: #0086b3;
}
/* YAML */
.language-yaml .token.atrule {
color: #63a35c;
}
code.language-yaml {
color: #183691;
}
/* Ruby */
.language-ruby .token.function {
color: #333;
}
/* Markdown */
.language-markdown .token.url {
color: #795da3;
}
/* Makefile */
.language-makefile .token.symbol {
color: #795da3;
}
.language-makefile .token.variable {
color: #183691;
}
.language-makefile .token.builtin {
color: #0086b3;
}
/* Bash */
.language-bash .token.keyword {
color: #0086b3;
}
/* highlight */
pre[data-line] {
position: relative;
padding: 1em 0 1em 3em;
}
pre[data-line] .line-highlight-wrapper {
position: absolute;
top: 0;
left: 0;
background-color: transparent;
display: block;
width: 100%;
}
pre[data-line] .line-highlight {
position: absolute;
left: 0;
right: 0;
padding: inherit 0;
margin-top: 1em;
background: hsla(24, 20%, 50%,.08);
background: linear-gradient(to right, hsla(24, 20%, 50%,.1) 70%, hsla(24, 20%, 50%,0));
pointer-events: none;
line-height: inherit;
white-space: pre;
}
pre[data-line] .line-highlight:before,
pre[data-line] .line-highlight[data-end]:after {
content: attr(data-start);
position: absolute;
top: .4em;
left: .6em;
min-width: 1em;
padding: 0 .5em;
background-color: hsla(24, 20%, 50%,.4);
color: hsl(24, 20%, 95%);
font: bold 65%/1.5 sans-serif;
text-align: center;
vertical-align: .3em;
border-radius: 999px;
text-shadow: none;
box-shadow: 0 1px white;
}
pre[data-line] .line-highlight[data-end]:after {
content: attr(data-end);
top: auto;
bottom: .4em;
}html body{font-family:"Helvetica Neue",Helvetica,"Segoe UI",Arial,freesans,sans-serif;font-size:16px;line-height:1.6;color:#333;background-color:#fff;overflow:initial;box-sizing:border-box;word-wrap:break-word}html body>:first-child{margin-top:0}html body h1,html body h2,html body h3,html body h4,html body h5,html body h6{line-height:1.2;margin-top:1em;margin-bottom:16px;color:#000}html body h1{font-size:2.25em;font-weight:300;padding-bottom:.3em}html body h2{font-size:1.75em;font-weight:400;padding-bottom:.3em}html body h3{font-size:1.5em;font-weight:500}html body h4{font-size:1.25em;font-weight:600}html body h5{font-size:1.1em;font-weight:600}html body h6{font-size:1em;font-weight:600}html body h1,html body h2,html body h3,html body h4,html body h5{font-weight:600}html body h5{font-size:1em}html body h6{color:#5c5c5c}html body strong{color:#000}html body del{color:#5c5c5c}html body a:not([href]){color:inherit;text-decoration:none}html body a{color:#08c;text-decoration:none}html body a:hover{color:#00a3f5;text-decoration:none}html body img{max-width:100%}html body>p{margin-top:0;margin-bottom:16px;word-wrap:break-word}html body>ul,html body>ol{margin-bottom:16px}html body ul,html body ol{padding-left:2em}html body ul.no-list,html body ol.no-list{padding:0;list-style-type:none}html body ul ul,html body ul ol,html body ol ol,html body ol ul{margin-top:0;margin-bottom:0}html body li{margin-bottom:0}html body li.task-list-item{list-style:none}html body li>p{margin-top:0;margin-bottom:0}html body .task-list-item-checkbox{margin:0 .2em .25em -1.8em;vertical-align:middle}html body .task-list-item-checkbox:hover{cursor:pointer}html body blockquote{margin:16px 0;font-size:inherit;padding:0 15px;color:#5c5c5c;border-left:4px solid #d6d6d6}html body blockquote>:first-child{margin-top:0}html body blockquote>:last-child{margin-bottom:0}html body hr{height:4px;margin:32px 0;background-color:#d6d6d6;border:0 none}html body table{margin:10px 0 15px 0;border-collapse:collapse;border-spacing:0;display:block;width:100%;overflow:auto;word-break:normal;word-break:keep-all}html body table th{font-weight:bold;color:#000}html body table td,html body table th{border:1px solid #d6d6d6;padding:6px 13px}html body dl{padding:0}html body dl dt{padding:0;margin-top:16px;font-size:1em;font-style:italic;font-weight:bold}html body dl dd{padding:0 16px;margin-bottom:16px}html body code{font-family:Menlo,Monaco,Consolas,'Courier New',monospace;font-size:.85em !important;color:#000;background-color:#f0f0f0;border-radius:3px;padding:.2em 0}html body code::before,html body code::after{letter-spacing:-0.2em;content:"\00a0"}html body pre>code{padding:0;margin:0;font-size:.85em !important;word-break:normal;white-space:pre;background:transparent;border:0}html body .highlight{margin-bottom:16px}html body .highlight pre,html body pre{padding:1em;overflow:auto;font-size:.85em !important;line-height:1.45;border:#d6d6d6;border-radius:3px}html body .highlight pre{margin-bottom:0;word-break:normal}html body pre code,html body pre tt{display:inline;max-width:initial;padding:0;margin:0;overflow:initial;line-height:inherit;word-wrap:normal;background-color:transparent;border:0}html body pre code:before,html body pre tt:before,html body pre code:after,html body pre tt:after{content:normal}html body p,html body blockquote,html body ul,html body ol,html body dl,html body pre{margin-top:0;margin-bottom:16px}html body kbd{color:#000;border:1px solid #d6d6d6;border-bottom:2px solid #c7c7c7;padding:2px 4px;background-color:#f0f0f0;border-radius:3px}@media print{html body{background-color:#fff}html body h1,html body h2,html body h3,html body h4,html body h5,html body h6{color:#000;page-break-after:avoid}html body blockquote{color:#5c5c5c}html body pre{page-break-inside:avoid}html body table{display:table}html body img{display:block;max-width:100%;max-height:100%}html body pre,html body code{word-wrap:break-word;white-space:pre}}.markdown-preview{width:100%;height:100%;box-sizing:border-box}.markdown-preview .pagebreak,.markdown-preview .newpage{page-break-before:always}.markdown-preview pre.line-numbers{position:relative;padding-left:3.8em;counter-reset:linenumber}.markdown-preview pre.line-numbers>code{position:relative}.markdown-preview pre.line-numbers .line-numbers-rows{position:absolute;pointer-events:none;top:1em;font-size:100%;left:0;width:3em;letter-spacing:-1px;border-right:1px solid #999;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.markdown-preview pre.line-numbers .line-numbers-rows>span{pointer-events:none;display:block;counter-increment:linenumber}.markdown-preview pre.line-numbers .line-numbers-rows>span:before{content:counter(linenumber);color:#999;display:block;padding-right:.8em;text-align:right}.markdown-preview .mathjax-exps .MathJax_Display{text-align:center !important}.markdown-preview:not([for="preview"]) .code-chunk .btn-group{display:none}.markdown-preview:not([for="preview"]) .code-chunk .status{display:none}.markdown-preview:not([for="preview"]) .code-chunk .output-div{margin-bottom:16px}.scrollbar-style::-webkit-scrollbar{width:8px}.scrollbar-style::-webkit-scrollbar-track{border-radius:10px;background-color:transparent}.scrollbar-style::-webkit-scrollbar-thumb{border-radius:5px;background-color:rgba(150,150,150,0.66);border:4px solid rgba(150,150,150,0.66);background-clip:content-box}html body[for="html-export"]:not([data-presentation-mode]){position:relative;width:100%;height:100%;top:0;left:0;margin:0;padding:0;overflow:auto}html body[for="html-export"]:not([data-presentation-mode]) .markdown-preview{position:relative;top:0}@media screen and (min-width:914px){html body[for="html-export"]:not([data-presentation-mode]) .markdown-preview{padding:2em calc(50% - 457px + 2em)}}@media screen and (max-width:914px){html body[for="html-export"]:not([data-presentation-mode]) .markdown-preview{padding:2em}}@media screen and (max-width:450px){html body[for="html-export"]:not([data-presentation-mode]) .markdown-preview{font-size:14px !important;padding:1em}}@media print{html body[for="html-export"]:not([data-presentation-mode]) #sidebar-toc-btn{display:none}}html body[for="html-export"]:not([data-presentation-mode]) #sidebar-toc-btn{position:fixed;bottom:8px;left:8px;font-size:28px;cursor:pointer;color:inherit;z-index:99;width:32px;text-align:center;opacity:.4}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] #sidebar-toc-btn{opacity:1}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc{position:fixed;top:0;left:0;width:300px;height:100%;padding:32px 0 48px 0;font-size:14px;box-shadow:0 0 4px rgba(150,150,150,0.33);box-sizing:border-box;overflow:auto;background-color:inherit}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc::-webkit-scrollbar{width:8px}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc::-webkit-scrollbar-track{border-radius:10px;background-color:transparent}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc::-webkit-scrollbar-thumb{border-radius:5px;background-color:rgba(150,150,150,0.66);border:4px solid rgba(150,150,150,0.66);background-clip:content-box}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc a{text-decoration:none}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc ul{padding:0 1.6em;margin-top:.8em}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc li{margin-bottom:.8em}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .md-sidebar-toc ul{list-style-type:none}html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .markdown-preview{left:300px;width:calc(100% - 300px);padding:2em calc(50% - 457px - 150px);margin:0;box-sizing:border-box}@media screen and (max-width:1274px){html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .markdown-preview{padding:2em}}@media screen and (max-width:450px){html body[for="html-export"]:not([data-presentation-mode])[html-show-sidebar-toc] .markdown-preview{width:100%}}html body[for="html-export"]:not([data-presentation-mode]):not([html-show-sidebar-toc]) .markdown-preview{left:50%;transform:translateX(-50%)}html body[for="html-export"]:not([data-presentation-mode]):not([html-show-sidebar-toc]) .md-sidebar-toc{display:none}
/* Please visit the URL below for more information: */
/* https://shd101wyy.github.io/markdown-preview-enhanced/#/customize-css */
</style>
</head>
<body for="html-export">
<div class="mume markdown-preview ">
<h2 class="mume-header" id="array">Array</h2>
<p>Q1. Reverse the array <a href="https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q2. Find the maximum and minimum element in an array <a href="https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q3. Find the "Kth" max and min element of an array <a href="https://practice.geeksforgeeks.org/problems/kth-smallest-element/0">LINK</a></p>
<blockquote>
<p>done look again</p>
</blockquote>
<hr>
<p>Q4. Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo <a href="https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0">LINK</a></p>
<blockquote>
<p>Very Very important</p>
</blockquote>
<hr>
<p>Q5. Move all the negative elements to one side of the array <a href="https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q6. Find the Union and Intersection of the two sorted arrays. <a href="https://practice.geeksforgeeks.org/problems/union-of-two-arrays/0">LINK</a></p>
<blockquote>
<p>done. Revise.</p>
</blockquote>
<hr>
<p>Q7. Write a program to cyclically rotate an array by one. <a href="https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one/0">LINK</a></p>
<blockquote>
<p>done. Cyclically rotate by k elements. Look the reverse function again. Very imortant.</p>
</blockquote>
<hr>
<p>Q8. find Largest sum contiguous Subarray [V. IMP] <a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0">LINK</a></p>
<blockquote>
<p>Done. Kadane's Algo</p>
</blockquote>
<hr>
<p>Q9. Minimise the maximum difference between heights [V.IMP] <a href="https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1">LINK</a></p>
<hr>
<p>Q10. Minimum no. of Jumps to reach end of an array <a href="https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0">LINK</a></p>
<hr>
<p>Q11. find duplicate in an array of N+1 Integers <a href="https://leetcode.com/problems/find-the-duplicate-number/">LINK</a></p>
<blockquote>
<p>Done. Floyd's algo. and simple approach.</p>
</blockquote>
<hr>
<p>Q12. Merge 2 sorted arrays without using Extra space. <a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1">LINK</a></p>
<hr>
<p>Q13. Kadane's Algo [V.V.V.V.V IMP] <a href="https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0">LINK</a></p>
<blockquote>
<p>done.</p>
</blockquote>
<hr>
<p>Q14. Merge Intervals <a href="https://leetcode.com/problems/merge-intervals/">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q15. Next Permutation <a href="https://leetcode.com/problems/next-permutation/">LINK</a></p>
<blockquote>
<p>done. vvvimportant <a href="https://www.youtube.com/watch?v=quAS1iydq7U">LINK_TO_VIDEO</a></p>
</blockquote>
<hr>
<p>Q16. Count Inversion <a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0">LINK</a></p>
<hr>
<p>Q17. Best time to buy and Sell stock <a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q18. find all pairs on integer array whose sum is equal to given number <a href="https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1">LINK</a></p>
<hr>
<p>Q19. find common elements In 3 sorted arrays <a href="https://practice.geeksforgeeks.org/problems/common-elements1132/1">LINK</a></p>
<blockquote>
<p>done</p>
</blockquote>
<hr>
<p>Q20. Rearrange the array in alternating positive and negative items with O(1) extra space <a href="https://www.geeksforgeeks.org/rearrange-array-alternating-positive-negative-items-o1-extra-space/">LINK</a></p>
<hr>
<p>Q21. Find if there is any subarray with sum equal to 0 <a href="https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0">LINK</a></p>
<hr>
<p>Q22. Find factorial of a large number <a href="https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers/0">LINK</a></p>
<hr>
<p>Q23. find maximum product subarray <a href="https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1">LINK</a></p>
<hr>
<p>Q24. Find longest coinsecutive subsequence <a href="https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0">LINK</a></p>
<hr>
<p>Q25. Given an array of size n and a number k, fin all elements that appear more than " n/k " times. <a href="https://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/">LINK</a></p>
<hr>
<p>Q26. Maximum profit by buying and selling a share atmost twice <a href="https://www.geeksforgeeks.org/maximum-profit-by-buying-and-selling-a-share-at-most-twice/">LINK</a></p>
<hr>
<p>Q27. Find whether an array is a subset of another array <a href="https://practice.geeksforgeeks.org/problems/array-subset-of-another-array/0">LINK</a></p>
<hr>
<p>Q28. Find the triplet that sum to a given value <a href="https://practice.geeksforgeeks.org/problems/triplet-sum-in-array/0">LINK</a></p>
<hr>
<p>Q29. Trapping Rain water problem <a href="https://practice.geeksforgeeks.org/problems/trapping-rain-water/0">LINK</a></p>
<hr>
<p>Q30. Chocolate Distribution problem <a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0">LINK</a></p>
<hr>
<p>Q31. Smallest Subarray with sum greater than a given value <a href="https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x/0">LINK</a></p>
<hr>
<p>Q32. Three way partitioning of an array around a given value <a href="https://practice.geeksforgeeks.org/problems/three-way-partitioning/1">LINK</a></p>
<hr>
<p>Q33. Minimum swaps required bring elements less equal K together <a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0">LINK</a></p>
<hr>
<p>Q34. Minimum no. of operations required to make an array palindrome <a href="https://practice.geeksforgeeks.org/problems/palindromic-array/0">LINK</a></p>
<hr>
<p>Q35. Median of 2 sorted arrays of equal size <a href="https://practice.geeksforgeeks.org/problems/find-the-median0527/1">LINK</a></p>
<hr>
<p>Q36. Median of 2 sorted arrays of different size <a href="https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/">LINK</a></p>
<hr>
<h2 class="mume-header" id="matrix">Matrix</h2>
<p>Q39. Spiral traversal on a Matrix <a href="https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0">LINK</a></p>
<hr>
<p>Q40. Search an element in a matriix <a href="https://leetcode.com/problems/search-a-2d-matrix/">LINK</a></p>
<hr>
<p>Q41. Find median in a row wise sorted matrix <a href="https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1">LINK</a></p>
<hr>
<p>Q42. Find row with maximum no. of 1's <a href="https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1">LINK</a></p>
<hr>
<p>Q43. Print elements in sorted order using row-column wise sorted matrix <a href="https://practice.geeksforgeeks.org/problems/sorted-matrix/0">LINK</a></p>
<hr>
<p>Q44. Maximum size rectangle <a href="https://practice.geeksforgeeks.org/problems/max-rectangle/1">LINK</a></p>
<hr>
<p>Q45. Find a specific pair in matrix <a href="https://www.geeksforgeeks.org/find-a-specific-pair-in-matrix/">LINK</a></p>
<hr>
<p>Q46. Rotate matrix by 90 degrees <a href="https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/">LINK</a></p>
<hr>
<p>Q47. Kth smallest element in a row-cpumn wise sorted matrix <a href="https://practice.geeksforgeeks.org/problems/kth-element-in-matrix/1">LINK</a></p>
<hr>
<p>Q48. Common elements in all rows of a given matrix <a href="https://www.geeksforgeeks.org/common-elements-in-all-rows-of-a-given-matrix/">LINK</a></p>
<hr>
<h2 class="mume-header" id="string">String</h2>
<p>Q51. Reverse a String <a href="https://leetcode.com/problems/reverse-string/">LINK</a></p>
<hr>
<p>Q52. Check whether a String is Palindrome or not <a href="https://practice.geeksforgeeks.org/problems/palindrome-string0817/1">LINK</a></p>
<hr>
<p>Q53. Find Duplicate characters in a string <a href="https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/">LINK</a></p>
<hr>
<p>Q54. Why strings are immutable in Java? <a href="https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/">LINK</a></p>
<hr>
<p>Q55. Write a Code to check whether one string is a rotation of another <a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/">LINK</a></p>
<hr>
<p>Q56. Write a Program to check whether a string is a valid shuffle of two strings or not <a href="https://www.programiz.com/java-programming/examples/check-valid-shuffle-of-strings">LINK</a></p>
<hr>
<p>Q57. Count and Say problem <a href="https://leetcode.com/problems/count-and-say/">LINK</a></p>
<hr>
<p>Q58. Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] <a href="https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string/0">LINK</a></p>
<hr>
<p>Q59. Find Longest Recurring Subsequence in String <a href="https://practice.geeksforgeeks.org/problems/longest-repeating-subsequence/0">LINK</a></p>
<hr>
<p>Q60. Print all Subsequences of a string. <a href="https://www.geeksforgeeks.org/print-subsequences-string/">LINK</a></p>
<hr>
<p>Q61. Print all the permutations of the given string <a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0">LINK</a></p>
<hr>
<p>Q62. Split the Binary string into two substring with equal 0�s and 1�s <a href="https://www.geeksforgeeks.org/split-the-binary-string-into-substrings-with-equal-number-of-0s-and-1s/">LINK</a></p>
<hr>
<p>Q63. Word Wrap Problem [VERY IMP]. <a href="https://practice.geeksforgeeks.org/problems/word-wrap/0">LINK</a></p>
<hr>
<p>Q64. EDIT Distance [Very Imp] <a href="https://practice.geeksforgeeks.org/problems/edit-distance3702/1">LINK</a></p>
<hr>
<p>Q65. Find next greater number with same set of digits. [Very Very IMP] <a href="https://practice.geeksforgeeks.org/problems/next-permutation/0">LINK</a></p>
<hr>
<p>Q66. Balanced Parenthesis problem.[Imp] <a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0">LINK</a></p>
<hr>
<p>Q67. Word break Problem[ Very Imp] <a href="https://practice.geeksforgeeks.org/problems/word-break/0">LINK</a></p>
<hr>
<p>Q68. Rabin Karp Algo <a href="https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/">LINK</a></p>
<hr>
<p>Q69. KMP Algo <a href="https://practice.geeksforgeeks.org/problems/longest-prefix-suffix2527/1">LINK</a></p>
<hr>
<p>Q70. Convert a Sentence into its equivalent mobile numeric keypad sequence. <a href="https://www.geeksforgeeks.org/convert-sentence-equivalent-mobile-numeric-keypad-sequence/">LINK</a></p>
<hr>
<p>Q71. Minimum number of bracket reversals needed to make an expression balanced. <a href="https://practice.geeksforgeeks.org/problems/count-the-reversals/0">LINK</a></p>
<hr>
<p>Q72. Count All Palindromic Subsequence in a given String. <a href="https://practice.geeksforgeeks.org/problems/count-palindromic-subsequences/1">LINK</a></p>
<hr>
<p>Q73. Count of number of given string in 2D character array <a href="https://www.geeksforgeeks.org/find-count-number-given-string-present-2d-character-array/">LINK</a></p>
<hr>
<p>Q74. Search a Word in a 2D Grid of characters. <a href="https://practice.geeksforgeeks.org/problems/find-the-string-in-grid/0">LINK</a></p>
<hr>
<p>Q75. Boyer Moore Algorithm for Pattern Searching. <a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/">LINK</a></p>
<hr>
<p>Q76. Converting Roman Numerals to Decimal <a href="https://practice.geeksforgeeks.org/problems/roman-number-to-integer/0">LINK</a></p>
<hr>
<p>Q77. Longest Common Prefix <a href="https://leetcode.com/problems/longest-common-prefix/">LINK</a></p>
<hr>
<p>Q78. Number of flips to make binary string alternate <a href="https://practice.geeksforgeeks.org/problems/min-number-of-flips/0">LINK</a></p>
<hr>
<p>Q79. Find the first repeated word in string. <a href="https://practice.geeksforgeeks.org/problems/second-most-repeated-string-in-a-sequence/0">LINK</a></p>
<hr>
<p>Q80. Minimum number of swaps for bracket balancing. <a href="https://practice.geeksforgeeks.org/problems/minimum-swaps-for-bracket-balancing/0">LINK</a></p>
<hr>
<p>Q81. Find the longest common subsequence between two strings. <a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0">LINK</a></p>
<hr>
<p>Q82. Program to generate all possible valid IP addresses from given string. <a href="https://www.geeksforgeeks.org/program-generate-possible-valid-ip-addresses-given-string/">LINK</a></p>
<hr>
<p>Q83. Write a program tofind the smallest window that contains all characters of string itself. <a href="https://practice.geeksforgeeks.org/problems/smallest-distant-window/0">LINK</a></p>
<hr>
<p>Q84. Rearrange characters in a string such that no two adjacent are same <a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0">LINK</a></p>
<hr>
<p>Q85. Minimum characters to be added at front to make string palindrome <a href="https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/">LINK</a></p>
<hr>
<p>Q86. Given a sequence of words, print all anagrams together <a href="https://practice.geeksforgeeks.org/problems/k-anagrams-1/0">LINK</a></p>
<hr>
<p>Q87. Find the smallest window in a string containing all characters of another string <a href="https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0">LINK</a></p>
<hr>
<p>Q88. Recursively remove all adjacent duplicates <a href="https://practice.geeksforgeeks.org/problems/consecutive-elements/0">LINK</a></p>
<hr>
<p>Q89. String matching where one string contains wildcard characters <a href="https://practice.geeksforgeeks.org/problems/wildcard-string-matching/0">LINK</a></p>
<hr>
<p>Q90. Function to find Number of customers who could not get a computer <a href="https://www.geeksforgeeks.org/function-to-find-number-of-customers-who-could-not-get-a-computer/">LINK</a></p>
<hr>
<p>Q91. Transform One String to Another using Minimum Number of Given Operation <a href="https://www.geeksforgeeks.org/transform-one-string-to-another-using-minimum-number-of-given-operation/">LINK</a></p>
<hr>
<p>Q92. Check if two given strings are isomorphic to each other <a href="https://practice.geeksforgeeks.org/problems/isomorphic-strings/0">LINK</a></p>
<hr>
<p>Q93. Recursively print all sentences that can be formed from list of word lists <a href="https://www.geeksforgeeks.org/recursively-print-all-sentences-that-can-be-formed-from-list-of-word-lists/">LINK</a></p>
<hr>
<h2 class="mume-header" id="searching-sorting">Searching & Sorting</h2>
<p>Q96. Find first and last positions of an element in a sorted array <a href="https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0">LINK</a></p>
<hr>
<p>Q97. Find a Fixed Point (Value equal to index) in a given array <a href="https://practice.geeksforgeeks.org/problems/value-equal-to-index-value1330/1">LINK</a></p>
<hr>
<p>Q98. Search in a rotated sorted array <a href="https://leetcode.com/problems/search-in-rotated-sorted-array/">LINK</a></p>
<hr>
<p>Q99. square root of an integer <a href="https://practice.geeksforgeeks.org/problems/count-squares3649/1">LINK</a></p>
<hr>
<p>Q100. Maximum and minimum of an array using minimum number of comparisons <a href="https://practice.geeksforgeeks.org/problems/middle-of-three2926/1">LINK</a></p>
<hr>
<p>Q101. Optimum location of point to minimize total distance <a href="https://www.geeksforgeeks.org/optimum-location-point-minimize-total-distance/">LINK</a></p>
<hr>
<p>Q102. Find the repeating and the missing <a href="https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1">LINK</a></p>
<hr>
<p>Q103. find majority element <a href="https://practice.geeksforgeeks.org/problems/majority-element/0">LINK</a></p>
<hr>
<p>Q104. Searching in an array where adjacent differ by at most k <a href="https://www.geeksforgeeks.org/searching-array-adjacent-differ-k/">LINK</a></p>
<hr>
<p>Q105. find a pair with a given difference <a href="https://practice.geeksforgeeks.org/problems/find-pair-given-difference/0">LINK</a></p>
<hr>
<p>Q106. find four elements that sum to a given value <a href="https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers/0">LINK</a></p>
<hr>
<p>Q107. maximum sum such that no 2 elements are adjacent <a href="https://practice.geeksforgeeks.org/problems/stickler-theif/0">LINK</a></p>
<hr>
<p>Q108. Count triplet with sum smaller than a given value <a href="https://practice.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1">LINK</a></p>
<hr>
<p>Q109. merge 2 sorted arrays <a href="https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1">LINK</a></p>
<hr>
<p>Q110. print all subarrays with 0 sum <a href="https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0">LINK</a></p>
<hr>
<p>Q111. Product array Puzzle <a href="https://practice.geeksforgeeks.org/problems/product-array-puzzle/0">LINK</a></p>
<hr>
<p>Q112. Sort array according to count of set bits <a href="https://practice.geeksforgeeks.org/problems/sort-by-set-bit-count/0">LINK</a></p>
<hr>
<p>Q113. minimum no. of swaps required to sort the array <a href="https://practice.geeksforgeeks.org/problems/minimum-swaps/1">LINK</a></p>
<hr>
<p>Q114. Bishu and Soldiers <a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/bishu-and-soldiers/">LINK</a></p>
<hr>
<p>Q115. Rasta and Kheshtak <a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/rasta-and-kheshtak/">LINK</a></p>
<hr>
<p>Q116. Kth smallest number again <a href="https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/kth-smallest-number-again-2/">LINK</a></p>
<hr>
<p>Q117. Find pivot element in a sorted array <a href="http://theoryofprogramming.com/2017/12/16/find-pivot-element-sorted-rotated-array/">LINK</a></p>
<hr>
<p>Q118. K-th Element of Two Sorted Arrays <a href="https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array/0">LINK</a></p>
<hr>
<p>Q119. Aggressive cows <a href="https://www.spoj.com/problems/AGGRCOW/">LINK</a></p>
<hr>
<p>Q120. Book Allocation Problem <a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0">LINK</a></p>
<hr>
<p>Q121. EKOSPOJ: <a href="https://www.spoj.com/problems/EKO/">LINK</a></p>
<hr>
<p>Q122. Job Scheduling Algo <a href="https://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/">LINK</a></p>
<hr>
<p>Q123. Missing Number in AP <a href="https://practice.geeksforgeeks.org/problems/arithmetic-number/0">LINK</a></p>
<hr>
<p>Q124. Smallest number with atleastn trailing zeroes infactorial <a href="https://practice.geeksforgeeks.org/problems/smallest-factorial-number5929/1">LINK</a></p>
<hr>
<p>Q125. Painters Partition Problem: <a href="https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages/0">LINK</a></p>
<hr>
<p>Q126. ROTI-Prata SPOJ <a href="https://www.spoj.com/problems/PRATA/">LINK</a></p>
<hr>
<p>Q127. DoubleHelix SPOJ <a href="https://www.spoj.com/problems/ANARC05B/">LINK</a></p>
<hr>
<p>Q128. Subset Sums <a href="https://www.spoj.com/problems/SUBSUMS/">LINK</a></p>
<hr>
<p>Q129. Findthe inversion count <a href="https://practice.geeksforgeeks.org/problems/inversion-of-array/0">LINK</a></p>
<hr>
<p>Q130. Implement Merge-sort in-place <a href="https://www.geeksforgeeks.org/in-place-merge-sort/">LINK</a></p>
<hr>
<p>Q131. Partitioning and Sorting Arrays with Many Repeated Entries <a href="https://www.baeldung.com/java-sorting-arrays-with-repeated-entries">LINK</a></p>
<hr>
<h2 class="mume-header" id="linkedlist">LinkedList</h2>
<p>Q134. Write a Program to reverse the Linked List. (Both Iterative and recursive) <a href="https://www.geeksforgeeks.org/reverse-a-linked-list/">LINK</a></p>
<hr>
<p>Q135. Reverse a Linked List in group of Given Size. [Very Imp] <a href="https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1">LINK</a></p>
<hr>
<p>Q136. Write a program to Detect loop in a linked list. <a href="https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1">LINK</a></p>
<hr>
<p>Q137. Write a program to Delete loop in a linked list. <a href="https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1">LINK</a></p>
<hr>
<p>Q138. Find the starting point of the loop.� <a href="https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/">LINK</a></p>
<hr>
<p>Q139. Remove Duplicates in a sorted Linked List. <a href="https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1">LINK</a></p>
<hr>
<p>Q140. Remove Duplicates in a Un-sorted Linked List. <a href="https://practice.geeksforgeeks.org/problems/remove-duplicates-from-an-unsorted-linked-list/1">LINK</a></p>
<hr>
<p>Q141. Write a Program to Move the last element to Front in a Linked List. <a href="https://www.geeksforgeeks.org/move-last-element-to-front-of-a-given-linked-list/">LINK</a></p>
<hr>
<p>Q142. Add �1� to a number represented as a Linked List. <a href="https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1">LINK</a></p>
<hr>
<p>Q143. Add two numbers represented by linked lists. <a href="https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1">LINK</a></p>
<hr>
<p>Q144. Intersection of two Sorted Linked List. <a href="https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1">LINK</a></p>
<hr>
<p>Q145. Intersection Point of two Linked Lists. <a href="https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1">LINK</a></p>
<hr>
<p>Q146. Merge Sort For Linked lists.[Very Important] <a href="https://practice.geeksforgeeks.org/problems/sort-a-linked-list/1">LINK</a></p>
<hr>
<p>Q147. Quicksort for Linked Lists.[Very Important] <a href="https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1">LINK</a></p>
<hr>
<p>Q148. Find the middle Element of a linked list. <a href="https://leetcode.com/problems/middle-of-the-linked-list/">LINK</a></p>
<hr>
<p>Q149. Check if a linked list is a circular linked list. <a href="https://practice.geeksforgeeks.org/problems/circular-linked-list/1">LINK</a></p>
<hr>
<p>Q150. Split a Circular linked list into two halves. <a href="https://practice.geeksforgeeks.org/problems/split-a-circular-linked-list-into-two-halves/1">LINK</a></p>
<hr>
<p>Q151. Write a Program to check whether the Singly Linked list is a palindrome or not. <a href="https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1">LINK</a></p>
<hr>
<p>Q152. Deletion from a Circular Linked List. <a href="https://www.geeksforgeeks.org/deletion-circular-linked-list/">LINK</a></p>
<hr>
<p>Q153. Reverse a Doubly Linked list. <a href="https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1">LINK</a></p>
<hr>
<p>Q154. Find pairs with a given sum in a DLL. <a href="https://www.geeksforgeeks.org/find-pairs-given-sum-doubly-linked-list/">LINK</a></p>
<hr>
<p>Q155. Count triplets in a sorted DLL whose sum is equal to given value �X�. <a href="https://www.geeksforgeeks.org/count-triplets-sorted-doubly-linked-list-whose-sum-equal-given-value-x/">LINK</a></p>
<hr>
<p>Q156. Sort a �k�sorted Doubly Linked list.[Very IMP] <a href="https://www.geeksforgeeks.org/sort-k-sorted-doubly-linked-list/">LINK</a></p>
<hr>
<p>Q157. Rotate DoublyLinked list by N nodes. <a href="https://www.geeksforgeeks.org/rotate-doubly-linked-list-n-nodes/">LINK</a></p>
<hr>
<p>Q158. Rotate a Doubly Linked list in group of Given Size.[Very IMP] <a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/">LINK</a></p>
<hr>
<p>Q159. Can we reverse a linked list in less than O(n) ? <a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/">LINK</a></p>
<hr>
<p>Q160. Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ? <a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/">LINK</a></p>
<hr>
<p>Q161. Flatten a Linked List <a href="https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1">LINK</a></p>
<hr>
<p>Q162. Sort a LL of 0's, 1's and 2's <a href="https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1">LINK</a></p>
<hr>
<p>Q163. Clone a linked list with next and random pointer <a href="https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1">LINK</a></p>
<hr>
<p>Q164. Merge K sorted Linked list <a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1">LINK</a></p>
<hr>
<p>Q165. Multiply 2 no. represented by LL <a href="https://practice.geeksforgeeks.org/problems/multiply-two-linked-lists/1">LINK</a></p>
<hr>
<p>Q166. Delete nodes which have a greater value on right side <a href="https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1">LINK</a></p>
<hr>
<p>Q167. Segregate even and odd nodes in a Linked List <a href="https://practice.geeksforgeeks.org/problems/segregate-even-and-odd-nodes-in-a-linked-list/0">LINK</a></p>
<hr>
<p>Q168. Program for n�th node from the end of a Linked List <a href="https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1">LINK</a></p>
<hr>
<p>Q169. Find the first non-repeating character from a stream of characters <a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0">LINK</a></p>
<hr>
<h2 class="mume-header" id="binary-trees">Binary Trees</h2>
<p>Q172. level order traversal <a href="https://practice.geeksforgeeks.org/problems/level-order-traversal/1">LINK</a></p>
<hr>
<p>Q173. Reverse Level Order traversal <a href="https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1">LINK</a></p>
<hr>
<p>Q174. Height of a tree <a href="https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q175. Diameter of a tree <a href="https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q176. Mirror of a tree <a href="https://www.geeksforgeeks.org/create-a-mirror-tree-from-the-given-binary-tree/">LINK</a></p>
<hr>
<p>Q177. Inorder Traversal of a tree both using recursion and Iteration <a href="https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/">LINK</a></p>
<hr>
<p>Q178. Preorder Traversal of a tree both using recursion and Iteration <a href="https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/">LINK</a></p>
<hr>
<p>Q179. Postorder Traversal of a tree both using recursion and Iteration <a href="https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/">LINK</a></p>
<hr>
<p>Q180. Left View of a tree <a href="https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q181. Right View of Tree <a href="https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q182. Top View of a tree <a href="https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q183. Bottom View of a tree <a href="https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q184. Zig-Zag traversal of a binary tree <a href="https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1">LINK</a></p>
<hr>
<p>Q185. Check if a tree is balanced or not <a href="https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1">LINK</a></p>
<hr>
<p>Q186. Diagnol Traversal of a Binary tree <a href="https://www.geeksforgeeks.org/diagonal-traversal-of-binary-tree/">LINK</a></p>
<hr>
<p>Q187. Boundary traversal of a Binary tree <a href="https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1">LINK</a></p>
<hr>
<p>Q188. Construct Binary Tree from String with Bracket Representation <a href="https://www.geeksforgeeks.org/construct-binary-tree-string-bracket-representation/">LINK</a></p>
<hr>
<p>Q189. Convert Binary tree into Doubly Linked List <a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1">LINK</a></p>
<hr>
<p>Q190. Convert Binary tree into Sum tree <a href="https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1">LINK</a></p>
<hr>
<p>Q191. Construct Binary tree from Inorder and preorder traversal <a href="https://practice.geeksforgeeks.org/problems/construct-tree-1/1">LINK</a></p>
<hr>
<p>Q192. Find minimum swaps required to convert a Binary tree into BST <a href="https://www.geeksforgeeks.org/minimum-swap-required-convert-binary-tree-binary-search-tree/">LINK</a></p>
<hr>
<p>Q193. Check if Binary tree is Sum tree or not <a href="https://practice.geeksforgeeks.org/problems/sum-tree/1">LINK</a></p>
<hr>
<p>Q194. Check if all leaf nodes are at same level or not <a href="https://practice.geeksforgeeks.org/problems/leaf-at-same-level/1">LINK</a></p>
<hr>
<p>Q195. Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ] <a href="https://practice.geeksforgeeks.org/problems/duplicate-subtree-in-binary-tree/1">LINK</a></p>
<hr>
<p>Q196. Check if 2 trees are mirror or not <a href="https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0">LINK</a></p>
<hr>
<p>Q197. Sum of Nodes on the Longest path from root to leaf node <a href="https://practice.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1">LINK</a></p>
<hr>
<p>Q198. Check if given graph is tree or not. [ IMP ] <a href="https://www.geeksforgeeks.org/check-given-graph-tree/">LINK</a></p>
<hr>
<p>Q199. Find Largest subtree sum in a tree <a href="https://www.geeksforgeeks.org/find-largest-subtree-sum-tree/">LINK</a></p>
<hr>
<p>Q200. Maximum Sum of nodes in Binary tree such that no two are adjacent <a href="https://www.geeksforgeeks.org/maximum-sum-nodes-binary-tree-no-two-adjacent/">LINK</a></p>
<hr>
<p>Q201. Print all "K" Sum paths in a Binary tree <a href="https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/">LINK</a></p>
<hr>
<p>Q202. Find LCA in a Binary tree <a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1">LINK</a></p>
<hr>
<p>Q203. Find distance between 2 nodes in a Binary tree <a href="https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1">LINK</a></p>
<hr>
<p>Q204. Kth Ancestor of node in a Binary tree <a href="https://www.geeksforgeeks.org/kth-ancestor-node-binary-tree-set-2/">LINK</a></p>
<hr>
<p>Q205. Find all Duplicate subtrees in a Binary tree [ IMP ] <a href="https://practice.geeksforgeeks.org/problems/duplicate-subtrees/1">LINK</a></p>
<hr>
<p>Q206. Tree Isomorphism Problem <a href="https://practice.geeksforgeeks.org/problems/check-if-tree-is-isomorphic/1">LINK</a></p>
<hr>
<h2 class="mume-header" id="binary-search-trees">Binary Search Trees</h2>
<p>Q209. Fina a value in a BST <a href="https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/">LINK</a></p>
<hr>
<p>Q210. Deletion of a node in a BST <a href="https://leetcode.com/problems/delete-node-in-a-bst/">LINK</a></p>
<hr>
<p>Q211. Find min and max value in a BST <a href="https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1">LINK</a></p>
<hr>
<p>Q212. Find inorder successor and inorder predecessor in a BST <a href="https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1">LINK</a></p>
<hr>
<p>Q213. Check if a tree is a BST or not <a href="https://practice.geeksforgeeks.org/problems/check-for-bst/1">LINK</a></p>
<hr>
<p>Q214. Populate Inorder successor of all nodes <a href="https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-all-nodes/1">LINK</a></p>
<hr>
<p>Q215. Find LCA of 2 nodes in a BST <a href="https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1">LINK</a></p>
<hr>
<p>Q216. Construct BST from preorder traversal <a href="https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/">LINK</a></p>
<hr>
<p>Q217. Convert Binary tree into BST <a href="https://practice.geeksforgeeks.org/problems/binary-tree-to-bst/1">LINK</a></p>
<hr>
<p>Q218. Convert a normal BST into a Balanced BST <a href="https://www.geeksforgeeks.org/convert-normal-bst-balanced-bst/">LINK</a></p>
<hr>
<p>Q219. Merge two BST [ V.V.V>IMP ] <a href="https://www.geeksforgeeks.org/merge-two-balanced-binary-search-trees/">LINK</a></p>
<hr>
<p>Q220. Find Kth largest element in a BST <a href="https://practice.geeksforgeeks.org/problems/kth-largest-element-in-bst/1">LINK</a></p>
<hr>
<p>Q221. Find Kth smallest element in a BST <a href="https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1">LINK</a></p>
<hr>
<p>Q222. Count pairs from 2 BST whose sum is equal to given value "X" <a href="https://practice.geeksforgeeks.org/problems/brothers-from-different-root/1">LINK</a></p>
<hr>
<p>Q223. Find the median of BST in O(n) time and O(1) space <a href="https://www.geeksforgeeks.org/find-median-bst-time-o1-space/">LINK</a></p>
<hr>
<p>Q224. Count BST ndoes that lie in a given range <a href="https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1">LINK</a></p>
<hr>
<p>Q225. Replace every element with the least greater element on its right <a href="https://www.geeksforgeeks.org/replace-every-element-with-the-least-greater-element-on-its-right/">LINK</a></p>
<hr>
<p>Q226. Given "n" appointments, find the conflicting appointments <a href="https://www.geeksforgeeks.org/given-n-appointments-find-conflicting-appointments/">LINK</a></p>
<hr>
<p>Q227. Check preorder is valid or not <a href="https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0">LINK</a></p>
<hr>
<p>Q228. Check whether BST contains Dead end <a href="https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1">LINK</a></p>
<hr>
<p>Q229. Largest BST in a Binary Tree [ V.V.V.V.V IMP ] <a href="https://practice.geeksforgeeks.org/problems/largest-bst/1">LINK</a></p>
<hr>
<p>Q230. Flatten BST to sorted list <a href="https://www.geeksforgeeks.org/flatten-bst-to-sorted-list-increasing-order/">LINK</a></p>
<hr>
<h2 class="mume-header" id="greedy">Greedy</h2>
<p>Q233. Activity Selection Problem <a href="https://practice.geeksforgeeks.org/problems/n-meetings-in-one-room/0">LINK</a></p>
<hr>
<p>Q234. Job SequencingProblem <a href="https://practice.geeksforgeeks.org/problems/job-sequencing-problem/0">LINK</a></p>
<hr>
<p>Q235. Huffman Coding <a href="https://practice.geeksforgeeks.org/problems/huffman-encoding/0">LINK</a></p>
<hr>
<p>Q236. Water Connection Problem <a href="https://practice.geeksforgeeks.org/problems/water-connection-problem/0">LINK</a></p>
<hr>
<p>Q237. Fractional Knapsack Problem <a href="https://practice.geeksforgeeks.org/problems/fractional-knapsack/0">LINK</a></p>
<hr>
<p>Q238. Greedy Algorithm to find Minimum number of Coins <a href="https://practice.geeksforgeeks.org/problems/coin-piles/0">LINK</a></p>
<hr>
<p>Q239. Maximum trains for which stoppage can be provided <a href="https://www.geeksforgeeks.org/maximum-trains-stoppage-can-provided/">LINK</a></p>
<hr>
<p>Q240. Minimum Platforms Problem <a href="https://practice.geeksforgeeks.org/problems/minimum-platforms/0">LINK</a></p>
<hr>
<p>Q241. Buy Maximum Stocks if i stocks can be bought on i-th day <a href="https://www.geeksforgeeks.org/buy-maximum-stocks-stocks-can-bought-th-day/">LINK</a></p>
<hr>
<p>Q242. Find the minimum and maximum amount to buy all N candies <a href="https://practice.geeksforgeeks.org/problems/shop-in-candy-store/0">LINK</a></p>
<hr>
<p>Q243. Minimize Cash Flow among a given set of friends who have borrowed money from each other <a href="https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/">LINK</a></p>
<hr>
<p>Q244. Minimum Cost to cut a board into squares <a href="https://www.geeksforgeeks.org/minimum-cost-cut-board-squares/">LINK</a></p>
<hr>
<p>Q245. Check if it is possible to survive on Island <a href="https://www.geeksforgeeks.org/survival/">LINK</a></p>
<hr>
<p>Q246. Find maximum meetings in one room <a href="https://www.geeksforgeeks.org/find-maximum-meetings-in-one-room/">LINK</a></p>
<hr>
<p>Q247. Maximum product subset of an array <a href="https://www.geeksforgeeks.org/maximum-product-subset-array/">LINK</a></p>
<hr>
<p>Q248. Maximize array sum after K negations <a href="https://practice.geeksforgeeks.org/problems/maximize-sum-after-k-negations/0">LINK</a></p>
<hr>
<p>Q249. Maximize the sum of arr[i]*i <a href="https://practice.geeksforgeeks.org/problems/maximize-arrii-of-an-array/0">LINK</a></p>
<hr>
<p>Q250. Maximum sum of absolute difference of an array <a href="https://www.geeksforgeeks.org/maximum-sum-absolute-difference-array/">LINK</a></p>
<hr>
<p>Q251. Maximize sum of consecutive differences in a circular array <a href="https://practice.geeksforgeeks.org/problems/swap-and-maximize/0">LINK</a></p>
<hr>
<p>Q252. Minimum sum of absolute difference of pairs of two arrays <a href="https://www.geeksforgeeks.org/minimum-sum-absolute-difference-pairs-two-arrays/">LINK</a></p>
<hr>
<p>Q253. Program for Shortest Job First (or SJF) CPU Scheduling <a href="https://www.geeksforgeeks.org/program-for-shortest-job-first-or-sjf-cpu-scheduling-set-1-non-preemptive/">LINK</a></p>
<hr>
<p>Q254. Program for Least Recently Used (LRU) Page Replacement algorithm <a href="https://practice.geeksforgeeks.org/problems/page-faults-in-lru/0">LINK</a></p>
<hr>
<p>Q255. Smallest subset with sum greater than all other elements <a href="https://www.geeksforgeeks.org/smallest-subset-sum-greater-elements/">LINK</a></p>
<hr>
<p>Q256. Chocolate Distribution Problem <a href="https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0">LINK</a></p>
<hr>
<p>Q257. DEFKIN -Defense of a Kingdom <a href="https://www.spoj.com/problems/DEFKIN/">LINK</a></p>
<hr>
<p>Q258. DIEHARD -DIE HARD <a href="https://www.spoj.com/problems/DIEHARD/">LINK</a></p>
<hr>
<p>Q259. GERGOVIA -Wine trading in Gergovia <a href="https://www.spoj.com/problems/GERGOVIA/">LINK</a></p>
<hr>
<p>Q260. Picking Up Chicks <a href="https://www.spoj.com/problems/GCJ101BB/">LINK</a></p>
<hr>
<p>Q261. CHOCOLA �Chocolate <a href="https://www.spoj.com/problems/CHOCOLA/">LINK</a></p>
<hr>
<p>Q262. ARRANGE -Arranging Amplifiers <a href="https://www.spoj.com/problems/ARRANGE/">LINK</a></p>
<hr>
<p>Q263. K Centers Problem <a href="https://www.geeksforgeeks.org/k-centers-problem-set-1-greedy-approximate-algorithm/">LINK</a></p>
<hr>
<p>Q264. Minimum Cost of ropes <a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0">LINK</a></p>
<hr>
<p>Q265. Find smallest number with given number of digits and sum of digits <a href="https://practice.geeksforgeeks.org/problems/smallest-number5829/1">LINK</a></p>
<hr>
<p>Q266. Rearrange characters in a string such that no two adjacent are same <a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0">LINK</a></p>
<hr>
<p>Q267. Find maximum sum possible equal sum of three stacks <a href="https://www.geeksforgeeks.org/find-maximum-sum-possible-equal-sum-three-stacks/">LINK</a></p>
<hr>
<h2 class="mume-header" id="backtracking">BackTracking</h2>
<p>Q270. Rat in a maze Problem <a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1">LINK</a></p>
<hr>
<p>Q271. Printing all solutions in N-Queen Problem <a href="https://www.geeksforgeeks.org/printing-solutions-n-queen-problem/">LINK</a></p>
<hr>
<p>Q272. Word Break Problem using Backtracking <a href="https://practice.geeksforgeeks.org/problems/word-break-part-2/0">LINK</a></p>
<hr>
<p>Q273. Remove Invalid Parentheses <a href="https://leetcode.com/problems/remove-invalid-parentheses/">LINK</a></p>
<hr>
<p>Q274. Sudoku Solver <a href="https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0">LINK</a></p>
<hr>
<p>Q275. m Coloring Problem <a href="https://practice.geeksforgeeks.org/problems/m-coloring-problem/0">LINK</a></p>
<hr>
<p>Q276. Print all palindromic partitions of a string <a href="https://www.geeksforgeeks.org/given-a-string-print-all-possible-palindromic-partition/">LINK</a></p>
<hr>
<p>Q277. Subset Sum Problem <a href="https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1">LINK</a></p>
<hr>
<p>Q278. The Knight�s tour problem <a href="https://www.geeksforgeeks.org/the-knights-tour-problem-backtracking-1/">LINK</a></p>
<hr>
<p>Q279. Tug of War <a href="https://www.geeksforgeeks.org/tug-of-war/">LINK</a></p>
<hr>
<p>Q280. Find shortest safe route in a path with landmines <a href="https://www.geeksforgeeks.org/find-shortest-safe-route-in-a-path-with-landmines/">LINK</a></p>
<hr>
<p>Q281. Combinational Sum <a href="https://practice.geeksforgeeks.org/problems/combination-sum/0">LINK</a></p>
<hr>
<p>Q282. Find Maximum number possible by doing at-most K swaps <a href="https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps/0">LINK</a></p>
<hr>
<p>Q283. Print all permutations of a string <a href="https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string/0">LINK</a></p>
<hr>
<p>Q284. Find if there is a path of more than k length from a source <a href="https://www.geeksforgeeks.org/find-if-there-is-a-path-of-more-than-k-length-from-a-source/">LINK</a></p>
<hr>
<p>Q285. Longest Possible Route in a Matrix with Hurdles <a href="https://www.geeksforgeeks.org/longest-possible-route-in-a-matrix-with-hurdles/">LINK</a></p>
<hr>
<p>Q286. Print all possible paths from top left to bottom right of a mXn matrix <a href="https://www.geeksforgeeks.org/print-all-possible-paths-from-top-left-to-bottom-right-of-a-mxn-matrix/">LINK</a></p>
<hr>
<p>Q287. Partition of a set intoK subsets with equal sum <a href="https://practice.geeksforgeeks.org/problems/partition-array-to-k-subsets/1">LINK</a></p>
<hr>
<p>Q288. Find the K-th Permutation Sequence of first N natural numbers <a href="https://www.geeksforgeeks.org/find-the-k-th-permutation-sequence-of-first-n-natural-numbers/">LINK</a></p>
<hr>
<h2 class="mume-header" id="stacks-queues">Stacks & Queues</h2>
<p>Q291. Implement Stack from Scratch <a href="https://www.tutorialspoint.com/javaexamples/data_stack.htm">LINK</a></p>
<hr>
<p>Q292. Implement Queue from Scratch <a href="https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/">LINK</a></p>
<hr>
<p>Q293. Implement 2 stack in an array <a href="https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1">LINK</a></p>
<hr>
<p>Q294. find the middle element of a stack <a href="https://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/">LINK</a></p>
<hr>
<p>Q295. Implement "N" stacks in an Array <a href="https://www.geeksforgeeks.org/efficiently-implement-k-stacks-single-array/">LINK</a></p>
<hr>
<p>Q296. Check the expression has valid or Balanced parenthesis or not. <a href="https://practice.geeksforgeeks.org/problems/parenthesis-checker/0">LINK</a></p>
<hr>
<p>Q297. Reverse a String using Stack <a href="https://practice.geeksforgeeks.org/problems/reverse-a-string-using-stack/1">LINK</a></p>
<hr>
<p>Q298. Design a Stack that supports getMin() in O(1) time and O(1) extra space. <a href="https://practice.geeksforgeeks.org/problems/special-stack/1">LINK</a></p>
<hr>
<p>Q299. Find the next Greater element <a href="https://practice.geeksforgeeks.org/problems/next-larger-element/0">LINK</a></p>
<hr>
<p>Q300. The celebrity Problem <a href="https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1">LINK</a></p>
<hr>
<p>Q301. Arithmetic Expression evaluation <a href="https://www.geeksforgeeks.org/arithmetic-expression-evalution/">LINK</a></p>
<hr>
<p>Q302. Evaluation of Postfix expression <a href="https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0">LINK</a></p>
<hr>
<p>Q303. Implement a method to insert an element at its bottom without using any other data structure. <a href="https://stackoverflow.com/questions/45130465/inserting-at-the-end-of-stack">LINK</a></p>
<hr>
<p>Q304. Reverse a stack using recursion <a href="https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/">LINK</a></p>
<hr>
<p>Q305. Sort a Stack using recursion <a href="https://practice.geeksforgeeks.org/problems/sort-a-stack/1">LINK</a></p>
<hr>
<p>Q306. Merge Overlapping Intervals <a href="https://practice.geeksforgeeks.org/problems/overlapping-intervals/0">LINK</a></p>
<hr>
<p>Q307. Largest rectangular Area in Histogram <a href="https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram/0">LINK</a></p>
<hr>
<p>Q308. Length of the Longest Valid Substring <a href="https://practice.geeksforgeeks.org/problems/valid-substring0624/1">LINK</a></p>
<hr>
<p>Q309. Expression contains redundant bracket or not <a href="https://www.geeksforgeeks.org/expression-contains-redundant-bracket-not/">LINK</a></p>
<hr>
<p>Q310. Implement Stack using Queue <a href="https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1">LINK</a></p>
<hr>
<p>Q311. Implement Stack using Deque <a href="https://www.geeksforgeeks.org/implement-stack-queue-using-deque/">LINK</a></p>
<hr>
<p>Q312. Stack Permutations (Check if an array is stack permutation of other) <a href="https://www.geeksforgeeks.org/stack-permutations-check-if-an-array-is-stack-permutation-of-other/">LINK</a></p>
<hr>
<p>Q313. Implement Queue using Stack <a href="https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1">LINK</a></p>
<hr>
<p>Q314. Implement "n" queue in an array <a href="https://www.geeksforgeeks.org/efficiently-implement-k-queues-single-array/">LINK</a></p>
<hr>
<p>Q315. Implement a Circular queue <a href="https://www.geeksforgeeks.org/circular-queue-set-1-introduction-array-implementation/">LINK</a></p>
<hr>
<p>Q316. LRU Cache Implementationa <a href="https://practice.geeksforgeeks.org/problems/lru-cache/1">LINK</a></p>
<hr>
<p>Q317. Reverse a Queue using recursion <a href="https://practice.geeksforgeeks.org/problems/queue-reversal/1">LINK</a></p>
<hr>
<p>Q318. Reverse the first �K� elements of a queue <a href="https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1">LINK</a></p>
<hr>
<p>Q319. Interleave the first half of the queue with second half <a href="https://www.geeksforgeeks.org/interleave-first-half-queue-second-half/">LINK</a></p>
<hr>
<p>Q320. Find the first circular tour that visits all Petrol Pumps <a href="https://practice.geeksforgeeks.org/problems/circular-tour/1">LINK</a></p>
<hr>
<p>Q321. Minimum time required to rot all oranges <a href="https://practice.geeksforgeeks.org/problems/rotten-oranges/0">LINK</a></p>
<hr>
<p>Q322. Distance of nearest cell having 1 in a binary matrix <a href="https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1/0">LINK</a></p>
<hr>
<p>Q323. First negative integer in every window of size �k� <a href="https://practice.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k/0">LINK</a></p>
<hr>
<p>Q324. Check if all levels of two trees are anagrams or not. <a href="https://www.geeksforgeeks.org/check-if-all-levels-of-two-trees-are-anagrams-or-not/">LINK</a></p>
<hr>
<p>Q325. Sum of minimum and maximum elements of all subarrays of size �k�. <a href="https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/">LINK</a></p>
<hr>
<p>Q326. Minimum sum of squares of character counts in a given string after removing �k� characters. <a href="https://practice.geeksforgeeks.org/problems/game-with-string/0">LINK</a></p>
<hr>
<p>Q327. Queue based approach or first non-repeating character in a stream. <a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0">LINK</a></p>
<hr>
<p>Q328. Next Smaller Element <a href="https://www.geeksforgeeks.org/next-smaller-element/">LINK</a></p>
<hr>
<h2 class="mume-header" id="heap">Heap</h2>
<p>Q331. Implement a Maxheap/MinHeap using arrays and recursion. <a href="https://www.geeksforgeeks.org/building-heap-from-array/">LINK</a></p>
<hr>
<p>Q332. Sort an Array using heap. (HeapSort) <a href="https://www.geeksforgeeks.org/heap-sort/">LINK</a></p>
<hr>
<p>Q333. Maximum of all subarrays of size k. <a href="https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/">LINK</a></p>
<hr>
<p>Q334. �k� largest element in an array <a href="https://practice.geeksforgeeks.org/problems/k-largest-elements4206/1">LINK</a></p>
<hr>
<p>Q335. Kth smallest and largest element in an unsorted array <a href="https://www.geeksforgeeks.org/kth-smallestlargest-element-unsorted-array/">LINK</a></p>
<hr>
<p>Q336. Merge �K� sorted arrays. [ IMP ] <a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1">LINK</a></p>
<hr>
<p>Q337. Merge 2 Binary Max Heaps <a href="https://practice.geeksforgeeks.org/problems/merge-two-binary-max-heap/0">LINK</a></p>
<hr>
<p>Q338. Kth largest sum continuous subarrays <a href="https://www.geeksforgeeks.org/k-th-largest-sum-contiguous-subarray/">LINK</a></p>
<hr>
<p>Q339. Leetcode- reorganize strings <a href="https://leetcode.com/problems/reorganize-string/">LINK</a></p>
<hr>
<p>Q340. Merge �K� Sorted Linked Lists [V.IMP] <a href="https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1">LINK</a></p>
<hr>
<p>Q341. Smallest range in �K� Lists <a href="https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1">LINK</a></p>
<hr>
<p>Q342. Median in a stream of Integers <a href="https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0">LINK</a></p>
<hr>
<p>Q343. Check if a Binary Tree is Heap <a href="https://practice.geeksforgeeks.org/problems/is-binary-tree-heap/1">LINK</a></p>
<hr>
<p>Q344. Connect �n� ropes with minimum cost <a href="https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0">LINK</a></p>
<hr>
<p>Q345. Convert BST to Min Heap <a href="https://www.geeksforgeeks.org/convert-bst-min-heap/">LINK</a></p>
<hr>
<p>Q346. Convert min heap to max heap <a href="https://www.geeksforgeeks.org/convert-min-heap-to-max-heap/">LINK</a></p>
<hr>
<p>Q347. Rearrange characters in a string such that no two adjacent are same. <a href="https://practice.geeksforgeeks.org/problems/rearrange-characters/0">LINK</a></p>
<hr>
<p>Q348. Minimum sum of two numbers formed from digits of an array <a href="https://practice.geeksforgeeks.org/problems/minimum-sum4058/1">LINK</a></p>
<hr>
<h2 class="mume-header" id="graph">Graph</h2>
<p>Q351. Create a Graph, print it <a href="https://1drv.ms/t/s!AqTOHFO77CqEiRua06v1PATyiFg5">LINK</a></p>
<hr>
<p>Q352. Implement BFS algorithm <a href="https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1">LINK</a></p>
<hr>
<p>Q353. Implement DFS Algo <a href="https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/">LINK</a></p>
<hr>
<p>Q354. Detect Cycle in Directed Graph using BFS/DFS Algo <a href="https://www.geeksforgeeks.org/detect-cycle-in-a-graph/">LINK</a></p>
<hr>
<p>Q355. Detect Cycle in UnDirected Graph using BFS/DFS Algo <a href="https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1">LINK</a></p>
<hr>
<p>Q356. Search in a Maze <a href="https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1">LINK</a></p>
<hr>
<p>Q357. Minimum Step by Knight <a href="https://practice.geeksforgeeks.org/problems/steps-by-knight/0">LINK</a></p>