├── LICENSE ├── README.md └── TopLeetCodeProblems.md /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Coding Interview Questions 2 | 3 | > Click :star: if you like the project. Pull Request are highly appreciated. Follow me [@OmBharatiya](https://twitter.com/ombharatiya) for technical updates. 4 | 5 | --- 6 | 7 | ### Interview Questions 8 | 9 | ### Table of Contents 10 | | SNo. | **Contents** | 11 | | --- | --------- | 12 | | 1. | [FAANG Must Do Problems](#faang-must-do-problems) | 13 | | 2. | [Amazon](#amazon) | 14 | | 3. | [Microsoft](#microsoft) | 15 | | 4. | [Facebook](#facebook) | 16 | | 5. | [Google Top 50](#google-top-50) | 17 | | 6. | [Google](#google) | 18 | | 7. | [LinkedIn](#linkedin) | 19 | | 8. | [Flipkart](#flipkart) | 20 | | 9. | [Netflix](#netflix) | 21 | 22 | 23 | 1. ### FAANG Must Do Problems 24 | | No. | Questions | 25 | | --- | --------- | 26 | |1 | [Two Sum](https://leetcode.com/problems/two-sum) | 27 | |2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | 28 | |3 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | 29 | |4 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | 30 | |5 | [3Sum](https://leetcode.com/problems/3sum) | 31 | |6 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | 32 | |7 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | 33 | |8 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | 34 | |9 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 35 | |10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | 36 | |11 | [Combination Sum](https://leetcode.com/problems/combination-sum) | 37 | |12 | [Rotate Image](https://leetcode.com/problems/rotate-image) | 38 | |13 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | 39 | |14 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | 40 | |15 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | 41 | |16 | [Jump Game](https://leetcode.com/problems/jump-game) | 42 | |17 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | 43 | |18 | [Insert Interval](https://leetcode.com/problems/insert-interval) | 44 | |19 | [Unique Paths](https://leetcode.com/problems/unique-paths) | 45 | |20 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | 46 | |21 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | 47 | |22 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | 48 | |23 | [Word Search](https://leetcode.com/problems/word-search) | 49 | |24 | [Decode Ways](https://leetcode.com/problems/decode-ways) | 50 | |25 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | 51 | |26 | [Same Tree](https://leetcode.com/problems/same-tree) | 52 | |27 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | 53 | |28 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | 54 | |29 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | 55 | |30 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | 56 | |31 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | 57 | |32 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | 58 | |33 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | 59 | |34 | [Clone Graph](https://leetcode.com/problems/clone-graph) | 60 | |35 | [Word Break](https://leetcode.com/problems/word-break) | 61 | |36 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | 62 | |37 | [Reorder List](https://leetcode.com/problems/reorder-list) | 63 | |38 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | 64 | |39 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | 65 | |40 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | 66 | |41 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | 67 | |42 | [House Robber](https://leetcode.com/problems/house-robber) | 68 | |43 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 69 | |44 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | 70 | |45 | [Course Schedule](https://leetcode.com/problems/course-schedule) | 71 | |46 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | 72 | |47 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | 73 | |48 | [Word Search II](https://leetcode.com/problems/word-search-ii) | 74 | |49 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | 75 | |50 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | 76 | |51 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | 77 | |52 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | 78 | |53 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | 79 | |54 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | 80 | |55 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | 81 | |56 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | 82 | |57 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | 83 | |58 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) | 84 | |59 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) | 85 | |60 | [Missing Number](https://leetcode.com/problems/missing-number) | 86 | |61 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | 87 | |62 | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | 88 | |63 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | 89 | |64 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | 90 | |65 | [Coin Change](https://leetcode.com/problems/coin-change) | 91 | |66 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) | 92 | |67 | [Counting Bits](https://leetcode.com/problems/counting-bits) | 93 | |68 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | 94 | |69 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | 95 | |70 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | 96 | |71 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | 97 | |72 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | 98 | |73 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | 99 | |74 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | 100 | |75 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | 101 | |76 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence) | 102 | |77 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | 103 | 104 | 2. ### Amazon 105 | | No. | Questions | 106 | | --- | --------- | 107 | |1 | [Two Sum](https://leetcode.com/problems/two-sum) | 108 | |2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | 109 | |3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | 110 | |4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 111 | |5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | 112 | |6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | 113 | |7 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | 114 | |8 | [3Sum](https://leetcode.com/problems/3sum) | 115 | |9 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | 116 | |10 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | 117 | |11 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | 118 | |12 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | 119 | |13 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 120 | |14 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | 121 | |15 | [Permutations](https://leetcode.com/problems/permutations) | 122 | |16 | [Rotate Image](https://leetcode.com/problems/rotate-image) | 123 | |17 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | 124 | |18 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | 125 | |19 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | 126 | |20 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | 127 | |21 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | 128 | |22 | [Edit Distance](https://leetcode.com/problems/edit-distance) | 129 | |23 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | 130 | |24 | [Sort Colors](https://leetcode.com/problems/sort-colors) | 131 | |25 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | 132 | |26 | [Subsets](https://leetcode.com/problems/subsets) | 133 | |27 | [Gray Code](https://leetcode.com/problems/gray-code) | 134 | |28 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | 135 | |29 | [Same Tree](https://leetcode.com/problems/same-tree) | 136 | |30 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | 137 | |31 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | 138 | |32 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | 139 | |33 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | 140 | |34 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii) | 141 | |35 | [Word Ladder](https://leetcode.com/problems/word-ladder) | 142 | |36 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | 143 | |37 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | 144 | |38 | [Word Break](https://leetcode.com/problems/word-break) | 145 | |39 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | 146 | |40 | [LRU Cache](https://leetcode.com/problems/lru-cache) | 147 | |41 | [Sort List](https://leetcode.com/problems/sort-list) | 148 | |42 | [Min Stack](https://leetcode.com/problems/min-stack) | 149 | |43 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | 150 | |44 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | 151 | |45 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | 152 | |46 | [Rotate Array](https://leetcode.com/problems/rotate-array) | 153 | |47 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | 154 | |48 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 155 | |49 | [Happy Number](https://leetcode.com/problems/happy-number) | 156 | |50 | [Count Primes](https://leetcode.com/problems/count-primes) | 157 | |51 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | 158 | |52 | [Word Search II](https://leetcode.com/problems/word-search-ii) | 159 | |53 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | 160 | |54 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | 161 | |55 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | 162 | |56 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | 163 | |57 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | 164 | |58 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | 165 | |59 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | 166 | |60 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | 167 | |61 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | 168 | |62 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | 169 | |63 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | 170 | |64 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | 171 | |65 | [Design Twitter](https://leetcode.com/problems/design-twitter) | 172 | |66 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | 173 | |67 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | 174 | |68 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | 175 | |69 | [Rotate Function](https://leetcode.com/problems/rotate-function) | 176 | |70 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | 177 | |71 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | 178 | |72 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | 179 | |73 | [String Compression](https://leetcode.com/problems/string-compression) | 180 | |74 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | 181 | |75 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | 182 | |76 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | 183 | |77 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | 184 | |78 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | 185 | |79 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | 186 | |80 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | 187 | |81 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | 188 | |82 | [Minesweeper](https://leetcode.com/problems/minesweeper) | 189 | |83 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | 190 | |84 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | 191 | |85 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | 192 | |86 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | 193 | |87 | [01 Matrix](https://leetcode.com/problems/01-matrix) | 194 | |88 | [Optimal Division](https://leetcode.com/problems/optimal-division) | 195 | |89 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | 196 | |90 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | 197 | |91 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | 198 | |92 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | 199 | |93 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | 200 | |94 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | 201 | |95 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | 202 | |96 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | 203 | |97 | [Image Smoother](https://leetcode.com/problems/image-smoother) | 204 | |98 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | 205 | |99 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | 206 | |100 | [Baseball Game](https://leetcode.com/problems/baseball-game) | 207 | |101 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | 208 | |102 | [Accounts Merge](https://leetcode.com/problems/accounts-merge) | 209 | |103 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | 210 | |104 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | 211 | |105 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | 212 | |106 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | 213 | |107 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | 214 | |108 | [Partition Labels](https://leetcode.com/problems/partition-labels) | 215 | |109 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | 216 | |110 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | 217 | |111 | [Most Common Word](https://leetcode.com/problems/most-common-word) | 218 | |112 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | 219 | |113 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | 220 | |114 | [Reorder Data in Log Files](https://leetcode.com/problems/reorder-data-in-log-files) | 221 | |115 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days) | 222 | |116 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin) | 223 | |117 | [Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers) | 224 | |118 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges) | 225 | |119 | [Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree) | 226 | |120 | [Distant Barcodes](https://leetcode.com/problems/distant-barcodes) | 227 | |121 | [Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent) | 228 | |122 | [Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum) | 229 | |123 | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network) | 230 | |124 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system) | 231 | |125 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero) | 232 | |126 | [Stone Game III](https://leetcode.com/problems/stone-game-iii) | 233 | 234 | 3. ### Microsoft 235 | | No. | Questions | 236 | | --- | --------- | 237 | |1 | [Two Sum](https://leetcode.com/problems/two-sum) | 238 | |2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | 239 | |3 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 240 | |4 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | 241 | |5 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | 242 | |6 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | 243 | |7 | [3Sum](https://leetcode.com/problems/3sum) | 244 | |8 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | 245 | |9 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | 246 | |10 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 247 | |11 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | 248 | |12 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | 249 | |13 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | 250 | |14 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | 251 | |15 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | 252 | |16 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | 253 | |17 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | 254 | |18 | [Jump Game](https://leetcode.com/problems/jump-game) | 255 | |19 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | 256 | |20 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | 257 | |21 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | 258 | |22 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | 259 | |23 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | 260 | |24 | [LRU Cache](https://leetcode.com/problems/lru-cache) | 261 | |25 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | 262 | |26 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | 263 | |27 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | 264 | |28 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | 265 | |29 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | 266 | |30 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | 267 | |31 | [Rotate Array](https://leetcode.com/problems/rotate-array) | 268 | |32 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | 269 | |33 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 270 | |34 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | 271 | |35 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | 272 | |36 | [Word Search II](https://leetcode.com/problems/word-search-ii) | 273 | |37 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | 274 | |38 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | 275 | |39 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | 276 | |40 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | 277 | |41 | [Add Digits](https://leetcode.com/problems/add-digits) | 278 | |42 | [Missing Number](https://leetcode.com/problems/missing-number) | 279 | |43 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | 280 | |44 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | 281 | |45 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | 282 | |46 | [String Compression](https://leetcode.com/problems/string-compression) | 283 | |47 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | 284 | |48 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | 285 | |49 | [Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters) | 286 | |50 | [Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero) | 287 | |51 | [Jump Game III](https://leetcode.com/problems/jump-game-iii) | 288 | |52 | [Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation) | 289 | |53 | [Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii) | 290 | 291 | 3. ### Facebook 292 | | No. | Questions | 293 | | --- | --------- | 294 | |1 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | 295 | |2 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | 296 | |3 | [3Sum](https://leetcode.com/problems/3sum) | 297 | |4 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | 298 | |5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | 299 | |6 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 300 | |7 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | 301 | |8 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | 302 | |9 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | 303 | |10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | 304 | |11 | [Count and Say](https://leetcode.com/problems/count-and-say) | 305 | |12 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | 306 | |13 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | 307 | |14 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | 308 | |15 | [Insert Interval](https://leetcode.com/problems/insert-interval) | 309 | |16 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | 310 | |17 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | 311 | |18 | [Clone Graph](https://leetcode.com/problems/clone-graph) | 312 | |19 | [Word Break](https://leetcode.com/problems/word-break) | 313 | |20 | [LRU Cache](https://leetcode.com/problems/lru-cache) | 314 | |21 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | 315 | |22 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 316 | |23 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | 317 | |24 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | 318 | |25 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | 319 | |26 | [Maximal Square](https://leetcode.com/problems/maximal-square) | 320 | |27 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | 321 | |28 | [H-Index](https://leetcode.com/problems/h-index) | 322 | |29 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | 323 | |30 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | 324 | |31 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | 325 | |32 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | 326 | |33 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | 327 | |34 | [Target Sum](https://leetcode.com/problems/target-sum) | 328 | |35 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | 329 | |36 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | 330 | |37 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | 331 | |38 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | 332 | |39 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | 333 | |40 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | 334 | |41 | [Valid Number](https://leetcode.com/problems/valid-number) | 335 | |42 | [Plus One](https://leetcode.com/problems/plus-one) | 336 | |43 | [Add Binary](https://leetcode.com/problems/add-binary) | 337 | |44 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | 338 | |45 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | 339 | |46 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | 340 | |47 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge) | 341 | |48 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | 342 | |49 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary) | 343 | |50 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin) | 344 | |51 | [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections) | 345 | |52 | [Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii) | 346 | |53 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses) | 347 | |54 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | 348 | |55 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | 349 | |56 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | 350 | |57 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | 351 | |58 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | 352 | |59 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | 353 | |60 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | 354 | |61 | [Simplify Path](https://leetcode.com/problems/simplify-path) | 355 | |62 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | 356 | |63 | [Course Schedule](https://leetcode.com/problems/course-schedule) | 357 | |64 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | 358 | |65 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | 359 | |66 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | 360 | |67 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | 361 | |68 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | 362 | |69 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | 363 | |70 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | 364 | |71 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | 365 | |72 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | 366 | |73 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 367 | |74 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | 368 | |75 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | 369 | |76 | [Add Strings](https://leetcode.com/problems/add-strings) | 370 | |77 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | 371 | |78 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | 372 | |79 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | 373 | |80 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | 374 | 375 | 4. ### Google Top 50 376 | | No. | Questions | 377 | | --- | --------- | 378 | |1 | [Two Sum](https://leetcode.com/problems/two-sum) | 379 | |2 | [Insert Interval](https://leetcode.com/problems/insert-interval) | 380 | |3 | [Text Justification](https://leetcode.com/problems/text-justification) | 381 | |4 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | 382 | |5 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | 383 | |6 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | 384 | |7 | [Maximal Square](https://leetcode.com/problems/maximal-square) | 385 | |8 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | 386 | |9 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | 387 | |10 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | 388 | |11 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 389 | |12 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | 390 | |13 | [Decode String](https://leetcode.com/problems/decode-string) | 391 | |14 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | 392 | |15 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | 393 | |16 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | 394 | |17 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | 395 | |18 | [24 Game](https://leetcode.com/problems/24-game) | 396 | |19 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | 397 | |20 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | 398 | |21 | [Expressive Words](https://leetcode.com/problems/expressive-words) | 399 | |22 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | 400 | |23 | [Guess the Word](https://leetcode.com/problems/guess-the-word) | 401 | |24 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | 402 | |25 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | 403 | |26 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | 404 | |27 | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | 405 | |28 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | 406 | |29 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences) | 407 | |30 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees) | 408 | |31 | [Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row) | 409 | |32 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain) | 410 | |33 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest) | 411 | |34 | [Snapshot Array](https://leetcode.com/problems/snapshot-array) | 412 | |35 | [Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers) | 413 | |36 | [Minimum Distance to Type a Word Using Two Fingers](https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers) | 414 | |37 | [Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees) | 415 | 416 | 5. ### Google 417 | | No. | Questions | 418 | | --- | --------- | 419 | |1 | [Two Sum](https://leetcode.com/problems/two-sum) | 420 | |2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 421 | |3 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | 422 | |4 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | 423 | |5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | 424 | |6 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | 425 | |7 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 426 | |8 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | 427 | |9 | [Next Permutation](https://leetcode.com/problems/next-permutation) | 428 | |10 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | 429 | |11 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | 430 | |12 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | 431 | |13 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | 432 | |14 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | 433 | |15 | [Insert Interval](https://leetcode.com/problems/insert-interval) | 434 | |16 | [Plus One](https://leetcode.com/problems/plus-one) | 435 | |17 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | 436 | |18 | [Same Tree](https://leetcode.com/problems/same-tree) | 437 | |19 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | 438 | |20 | [Word Ladder](https://leetcode.com/problems/word-ladder) | 439 | |21 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | 440 | |22 | [Clone Graph](https://leetcode.com/problems/clone-graph) | 441 | |23 | [Word Break](https://leetcode.com/problems/word-break) | 442 | |24 | [Word Break II](https://leetcode.com/problems/word-break-ii) | 443 | |25 | [LRU Cache](https://leetcode.com/problems/lru-cache) | 444 | |26 | [Min Stack](https://leetcode.com/problems/min-stack) | 445 | |27 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | 446 | |28 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | 447 | |29 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | 448 | |30 | [House Robber](https://leetcode.com/problems/house-robber) | 449 | |31 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 450 | |32 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | 451 | |33 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | 452 | |34 | [Word Search II](https://leetcode.com/problems/word-search-ii) | 453 | |35 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | 454 | |36 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | 455 | |37 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | 456 | |38 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | 457 | |39 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | 458 | |40 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | 459 | |41 | [Power of Two](https://leetcode.com/problems/power-of-two) | 460 | |42 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | 461 | |43 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | 462 | |44 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | 463 | |45 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | 464 | |46 | [H-Index](https://leetcode.com/problems/h-index) | 465 | |47 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | 466 | |48 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | 467 | |49 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | 468 | |50 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | 469 | |51 | [Game of Life](https://leetcode.com/problems/game-of-life) | 470 | |52 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | 471 | |53 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | 472 | |54 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | 473 | |55 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | 474 | |56 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | 475 | |57 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | 476 | |58 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | 477 | |59 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number) | 478 | |60 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | 479 | |61 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | 480 | |62 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | 481 | |63 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | 482 | |64 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | 483 | |65 | [Power of Three](https://leetcode.com/problems/power-of-three) | 484 | |66 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | 485 | |67 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 486 | |68 | [Patching Array](https://leetcode.com/problems/patching-array) | 487 | |69 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | 488 | |70 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | 489 | |71 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs) | 490 | |72 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | 491 | |73 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | 492 | |74 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes) | 493 | |75 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | 494 | |76 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k) | 495 | |77 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | 496 | |78 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | 497 | |79 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | 498 | |80 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | 499 | |81 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | 500 | |82 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | 501 | |83 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | 502 | |84 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | 503 | |85 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | 504 | |86 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | 505 | |87 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | 506 | |88 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | 507 | |89 | [Decode String](https://leetcode.com/problems/decode-string) | 508 | |90 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | 509 | |91 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | 510 | |92 | [Nth Digit](https://leetcode.com/problems/nth-digit) | 511 | |93 | [Binary Watch](https://leetcode.com/problems/binary-watch) | 512 | |94 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | 513 | |95 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | 514 | |96 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | 515 | |97 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | 516 | |98 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | 517 | |99 | [Add Strings](https://leetcode.com/problems/add-strings) | 518 | |100 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | 519 | |101 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | 520 | |102 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | 521 | |103 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | 522 | |104 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | 523 | |105 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | 524 | |106 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | 525 | |107 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | 526 | |108 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | 527 | |109 | [Heaters](https://leetcode.com/problems/heaters) | 528 | |110 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median) | 529 | |111 | [Magical String](https://leetcode.com/problems/magical-string) | 530 | |112 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | 531 | |113 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | 532 | |114 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | 533 | |115 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | 534 | |116 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | 535 | |117 | [Target Sum](https://leetcode.com/problems/target-sum) | 536 | |118 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | 537 | |119 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | 538 | |120 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | 539 | |121 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | 540 | |122 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | 541 | |123 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | 542 | |124 | [Detect Capital](https://leetcode.com/problems/detect-capital) | 543 | |125 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | 544 | |126 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | 545 | |127 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | 546 | |128 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | 547 | |129 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | 548 | |130 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | 549 | |131 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | 550 | |132 | [01 Matrix](https://leetcode.com/problems/01-matrix) | 551 | |133 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | 552 | |134 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | 553 | |135 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | 554 | |136 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | 555 | |137 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | 556 | |138 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | 557 | |139 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | 558 | |140 | [Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists) | 559 | |141 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | 560 | |142 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | 561 | |143 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | 562 | |144 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | 563 | |145 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | 564 | |146 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | 565 | |147 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | 566 | |148 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | 567 | |149 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | 568 | |150 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | 569 | |151 | [24 Game](https://leetcode.com/problems/24-game) | 570 | |152 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | 571 | |153 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | 572 | |154 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | 573 | |155 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | 574 | |156 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | 575 | |157 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | 576 | |158 | [Number of Atoms](https://leetcode.com/problems/number-of-atoms) | 577 | |159 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | 578 | |160 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | 579 | |161 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | 580 | |162 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | 581 | |163 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | 582 | |164 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | 583 | |165 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | 584 | |166 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | 585 | |167 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | 586 | |168 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | 587 | |169 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | 588 | |170 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | 589 | |171 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | 590 | |172 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | 591 | |173 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | 592 | |174 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees) | 593 | |175 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets) | 594 | |176 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | 595 | |177 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | 596 | |178 | [Knight Dialer](https://leetcode.com/problems/knight-dialer) | 597 | |179 | [Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle) | 598 | |180 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin) | 599 | |181 | [Odd Even Jump](https://leetcode.com/problems/odd-even-jump) | 600 | |182 | [Shortest Way to Form String](https://leetcode.com/problems/shortest-way-to-form-string) | 601 | |183 | [Campus Bikes](https://leetcode.com/problems/campus-bikes) | 602 | |184 | [Confusing Number II](https://leetcode.com/problems/confusing-number-ii) | 603 | |185 | [Video Stitching](https://leetcode.com/problems/video-stitching) | 604 | |186 | [Stream of Characters](https://leetcode.com/problems/stream-of-characters) | 605 | |187 | [Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree) | 606 | |188 | [String Transforms Into Another String](https://leetcode.com/problems/string-transforms-into-another-string) | 607 | |189 | [Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target) | 608 | |190 | [Divide Chocolate](https://leetcode.com/problems/divide-chocolate) | 609 | |191 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest) | 610 | |192 | [Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character) | 611 | |193 | [Tiling a Rectangle with the Fewest Squares](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares) | 612 | |194 | [Count Number of Nice Subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays) | 613 | 614 | 6. ### LinkedIn 615 | | No. | Questions | 616 | | --- | --------- | 617 | |1 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | 618 | |2 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | 619 | |3 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | 620 | |4 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | 621 | |5 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | 622 | |6 | [Max Stack](https://leetcode.com/problems/max-stack) | 623 | |7 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | 624 | |8 | [All O'one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | 625 | |9 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | 626 | |10 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | 627 | |11 | [Paint House](https://leetcode.com/problems/paint-house) | 628 | |12 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | 629 | |13 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | 630 | |14 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | 631 | |15 | [Text Justification](https://leetcode.com/problems/text-justification) | 632 | |16 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | 633 | |17 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | 634 | |18 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | 635 | |19 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | 636 | |20 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | 637 | |21 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | 638 | |22 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | 639 | |23 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | 640 | |24 | [Valid Number](https://leetcode.com/problems/valid-number) | 641 | |25 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | 642 | 643 | 7. ### Flipkart 644 | | No. | Questions | 645 | | --- | --------- | 646 | |1 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | 647 | 648 | 8. ### Netflix 649 | | No. | Questions | 650 | | --- | --------- | 651 | |1 | [LRU Cache](https://leetcode.com/problems/lru-cache) | 652 | |2 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | 653 | -------------------------------------------------------------------------------- /TopLeetCodeProblems.md: -------------------------------------------------------------------------------- 1 | # Top 75 LeetCode Questions to Crack The Coding Interviews 2 | 3 | 4 | > Click :star: if you like the project. Pull Request are highly appreciated. 5 | 6 | --- 7 | 8 | ## Array 9 | 10 | - [ ] [Two Sum](https://leetcode.com/problems/two-sum/) 11 | - [ ] [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) 12 | - [ ] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) 13 | - [ ] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) 14 | - [ ] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) 15 | - [ ] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) 16 | - [ ] [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) 17 | - [ ] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) 18 | - [ ] [3Sum](https://leetcode.com/problems/3sum/) 19 | - [ ] [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) 20 | 21 | --- 22 | 23 | ## Binary 24 | 25 | - [ ] [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) 26 | - [ ] [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) 27 | - [ ] [Counting Bits](https://leetcode.com/problems/counting-bits/) 28 | - [ ] [Missing Number](https://leetcode.com/problems/missing-number/) 29 | - [ ] [Reverse Bits](https://leetcode.com/problems/reverse-bits/) 30 | 31 | --- 32 | 33 | ## Interval 34 | 35 | - [ ] [Insert Interval](https://leetcode.com/problems/insert-interval/) 36 | - [ ] [Merge Intervals](https://leetcode.com/problems/merge-intervals/) 37 | - [ ] [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) 38 | - [ ] [Meeting Rooms (Leetcode Premium)](https://leetcode.com/problems/meeting-rooms/) 39 | - [ ] [Meeting Rooms II (Leetcode Premium)](https://leetcode.com/problems/meeting-rooms-ii/) 40 | 41 | --- 42 | 43 | ## Linked List 44 | 45 | - [ ] [Reverse a Linked List](https://leetcode.com/problems/reverse-linked-list/) 46 | - [ ] [Detect Cycle in a Linked List](https://leetcode.com/problems/linked-list-cycle/) 47 | - [ ] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) 48 | - [ ] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) 49 | - [ ] [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) 50 | - [ ] [Reorder List](https://leetcode.com/problems/reorder-list/) 51 | 52 | --- 53 | 54 | ## Matrix 55 | 56 | - [ ] [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) 57 | - [ ] [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) 58 | - [ ] [Rotate Image](https://leetcode.com/problems/rotate-image/) 59 | - [ ] [Word Search](https://leetcode.com/problems/word-search/) 60 | 61 | --- 62 | 63 | ## String 64 | 65 | - [ ] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) 66 | - [ ] [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) 67 | - [ ] [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) 68 | - [ ] [Valid Anagram](https://leetcode.com/problems/valid-anagram/) 69 | - [ ] [Group Anagrams](https://leetcode.com/problems/group-anagrams/) 70 | - [ ] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) 71 | - [ ] [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) 72 | - [ ] [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) 73 | - [ ] [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) 74 | - [ ] [Encode and Decode Strings (Leetcode Premium)](https://leetcode.com/problems/encode-and-decode-strings/) 75 | 76 | --- 77 | 78 | ## Tree 79 | - [ ] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) 80 | - [ ] [Same Tree](https://leetcode.com/problems/same-tree/) 81 | - [ ] [Invert/Flip Binary Tree](https://leetcode.com/problems/invert-binary-tree/) 82 | - [ ] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) 83 | - [ ] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) 84 | - [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) 85 | - [ ] [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) 86 | - [ ] [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) 87 | - [ ] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) 88 | - [ ] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) 89 | - [ ] [Lowest Common Ancestor of BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) 90 | - [ ] [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) 91 | - [ ] [Add and Search Word](https://leetcode.com/problems/add-and-search-word-data-structure-design/) 92 | - [ ] [Word Search II](https://leetcode.com/problems/word-search-ii/) 93 | 94 | --- 95 | 96 | ## Dynamic Programming 97 | 98 | - [ ] [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) 99 | - [ ] [Coin Change](https://leetcode.com/problems/coin-change/) 100 | - [ ] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) 101 | - [ ] [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) 102 | - [ ] [Word Break Problem](https://leetcode.com/problems/word-break/) 103 | - [ ] [Combination Sum](https://leetcode.com/problems/combination-sum-iv/) 104 | - [ ] [House Robber](https://leetcode.com/problems/house-robber/) 105 | - [ ] [House Robber II](https://leetcode.com/problems/house-robber-ii/) 106 | - [ ] [Decode Ways](https://leetcode.com/problems/decode-ways/) 107 | - [ ] [Unique Paths](https://leetcode.com/problems/unique-paths/) 108 | - [ ] [Jump Game](https://leetcode.com/problems/jump-game/) 109 | 110 | --- 111 | 112 | ## Graph 113 | 114 | - [ ] [Clone Graph](https://leetcode.com/problems/clone-graph/) 115 | - [ ] [Course Schedule](https://leetcode.com/problems/course-schedule/) 116 | - [ ] [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) 117 | - [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands/) 118 | - [ ] [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) 119 | - [ ] [Alien Dictionary (Leetcode Premium)](https://leetcode.com/problems/alien-dictionary/) 120 | - [ ] [Graph Valid Tree (Leetcode Premium)](https://leetcode.com/problems/graph-valid-tree/) 121 | - [ ] [Number of Connected Components in an Undirected Graph (Leetcode Premium)](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) 122 | 123 | --- 124 | 125 | ## Heap 126 | 127 | - [ ] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) 128 | - [ ] [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) 129 | - [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) 130 | 131 | ## Credit: 132 | [Blind - Curated List of Top 75 LeetCode Questions to Save Your Time](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) 133 | 134 | ## Important Links: 135 | 136 | - [FAANG Coding Interview Question](https://github.com/ombharatiya/FAANG-Coding-Interview-Questions) 137 | 138 | - [Data Structures and Sorting Cheat Sheet](https://docs.google.com/document/d/1PMoL1xJ9xa6ywQQ8HCc1oxLf2TUCiCaKaatlKYv6RZw/mobilebasic) 139 | 140 | - [14 Patterns to Ace Any Coding Interview Question](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed) 141 | 142 | - [A to Z Learning Resources for Students by Deepak](https://github.com/ombharatiya/A-to-Z-Resources-for-Students) 143 | 144 | - [Competitive Programmer’s Handbook](https://cses.fi/book/book.pdf) 145 | 146 | - [Low Level Design Primer](https://github.com/prasadgujar/low-level-design-primer/blob/master/solutions.md) 147 | 148 | ## About The Author: 149 | 150 | - [Om Bharatiya](https://twitter.com/ombharatiya) 151 | --------------------------------------------------------------------------------