├── .gitignore ├── LICENSE.md ├── README.md └── exercises ├── LC100_isSameTree ├── index.js └── test.js ├── LC102_levelOrder ├── index.js └── test.js ├── LC104_maxDepth ├── index.js └── test.js ├── LC11_maxArea ├── index.js └── test.js ├── LC121_maxProfit ├── index.js └── test.js ├── LC125_isPalindrome ├── index.js └── test.js ├── LC141_hasCycle ├── index.js └── test.js ├── LC152_maxProduct ├── index.js └── test.js ├── LC153_findMin ├── index.js └── test.js ├── LC15_threeSum ├── index.js └── test.js ├── LC17_letterCombinations ├── index.js └── test.js ├── LC198_rob ├── index.js └── test.js ├── LC19_removeNthFromEnd ├── index.js └── test.js ├── LC1_TwoSum ├── index.js └── test.js ├── LC200_numIslands ├── index.js └── test.js ├── LC206_reverseList ├── index.js └── test.js ├── LC20_isValid ├── index.js └── test.js ├── LC217_containsDuplicate ├── index.js └── test.js ├── LC21_mergeTwoLists ├── index.js └── test.js ├── LC226_invertTree ├── index.js └── test.js ├── LC235_lowestCommonAncestor ├── index.js └── test.js ├── LC238_productExceptSelf ├── index.js └── test.js ├── LC242_isAnagram ├── index.js └── test.js ├── LC252_canAttendMeetings ├── index.js └── test.js ├── LC2_addTwoNumbers ├── index.js └── test.js ├── LC300_lengthOfLIS ├── index.js └── test.js ├── LC322_coinChange ├── index.js └── test.js ├── LC33_search ├── index.js └── test.js ├── LC3_lengthOfLongestSubstring ├── index.js └── test.js ├── LC435_eraseOverlapIntervals ├── index.js └── test.js ├── LC49_groupAnagrams ├── index.js └── test.js ├── LC53_maxSubArray ├── index.js └── test.js ├── LC54_spiralOrder ├── index.js └── test.js ├── LC55_canJump ├── index.js └── test.js ├── LC56_merge ├── index.js └── test.js ├── LC5_longestPalindrome ├── index.js └── test.js ├── LC62_uniquePaths ├── index.js └── test.js ├── LC70_climbStairs ├── index.js └── test.js ├── LC73_setZeroes ├── index.js └── test.js ├── LC79_exist ├── index.js └── test.js ├── LC7_reverse ├── index.js └── test.js ├── LC98_isValidBST ├── index.js └── test.js ├── LC9_isPalindrome ├── index.js └── test.js └── package.json /.gitignore: -------------------------------------------------------------------------------- 1 | # OS Generated files 2 | .DS_Store 3 | ._* 4 | .Spotlight-V100 5 | .Trashes 6 | Icon? 7 | ehthumbs.db 8 | Thumbs.db 9 | 10 | # Visual Studio Code 11 | .vscode 12 | 13 | # Node.js 14 | node_modules/ 15 | dist/ 16 | npm-debug.log 17 | yarn-error.log 18 | 19 | # Other 20 | scratch.js -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | ### GNU GENERAL PUBLIC LICENSE 2 | 3 | Version 3, 29 June 2007 4 | 5 | Copyright (C) 2007 Free Software Foundation, Inc. 6 | 7 | 8 | Everyone is permitted to copy and distribute verbatim copies of this 9 | license document, but changing it is not allowed. 10 | 11 | ### Preamble 12 | 13 | The GNU General Public License is a free, copyleft license for 14 | software and other kinds of works. 15 | 16 | The licenses for most software and other practical works are designed 17 | to take away your freedom to share and change the works. By contrast, 18 | the GNU General Public License is intended to guarantee your freedom 19 | to share and change all versions of a program--to make sure it remains 20 | free software for all its users. We, the Free Software Foundation, use 21 | the GNU General Public License for most of our software; it applies 22 | also to any other work released this way by its authors. You can apply 23 | it to your programs, too. 24 | 25 | When we speak of free software, we are referring to freedom, not 26 | price. Our General Public Licenses are designed to make sure that you 27 | have the freedom to distribute copies of free software (and charge for 28 | them if you wish), that you receive source code or can get it if you 29 | want it, that you can change the software or use pieces of it in new 30 | free programs, and that you know you can do these things. 31 | 32 | To protect your rights, we need to prevent others from denying you 33 | these rights or asking you to surrender the rights. Therefore, you 34 | have certain responsibilities if you distribute copies of the 35 | software, or if you modify it: responsibilities to respect the freedom 36 | of others. 37 | 38 | For example, if you distribute copies of such a program, whether 39 | gratis or for a fee, you must pass on to the recipients the same 40 | freedoms that you received. You must make sure that they, too, receive 41 | or can get the source code. And you must show them these terms so they 42 | know their rights. 43 | 44 | Developers that use the GNU GPL protect your rights with two steps: 45 | (1) assert copyright on the software, and (2) offer you this License 46 | giving you legal permission to copy, distribute and/or modify it. 47 | 48 | For the developers' and authors' protection, the GPL clearly explains 49 | that there is no warranty for this free software. For both users' and 50 | authors' sake, the GPL requires that modified versions be marked as 51 | changed, so that their problems will not be attributed erroneously to 52 | authors of previous versions. 53 | 54 | Some devices are designed to deny users access to install or run 55 | modified versions of the software inside them, although the 56 | manufacturer can do so. This is fundamentally incompatible with the 57 | aim of protecting users' freedom to change the software. The 58 | systematic pattern of such abuse occurs in the area of products for 59 | individuals to use, which is precisely where it is most unacceptable. 60 | Therefore, we have designed this version of the GPL to prohibit the 61 | practice for those products. If such problems arise substantially in 62 | other domains, we stand ready to extend this provision to those 63 | domains in future versions of the GPL, as needed to protect the 64 | freedom of users. 65 | 66 | Finally, every program is threatened constantly by software patents. 67 | States should not allow patents to restrict development and use of 68 | software on general-purpose computers, but in those that do, we wish 69 | to avoid the special danger that patents applied to a free program 70 | could make it effectively proprietary. To prevent this, the GPL 71 | assures that patents cannot be used to render the program non-free. 72 | 73 | The precise terms and conditions for copying, distribution and 74 | modification follow. 75 | 76 | ### TERMS AND CONDITIONS 77 | 78 | #### 0. Definitions. 79 | 80 | "This License" refers to version 3 of the GNU General Public License. 81 | 82 | "Copyright" also means copyright-like laws that apply to other kinds 83 | of works, such as semiconductor masks. 84 | 85 | "The Program" refers to any copyrightable work licensed under this 86 | License. Each licensee is addressed as "you". "Licensees" and 87 | "recipients" may be individuals or organizations. 88 | 89 | To "modify" a work means to copy from or adapt all or part of the work 90 | in a fashion requiring copyright permission, other than the making of 91 | an exact copy. The resulting work is called a "modified version" of 92 | the earlier work or a work "based on" the earlier work. 93 | 94 | A "covered work" means either the unmodified Program or a work based 95 | on the Program. 96 | 97 | To "propagate" a work means to do anything with it that, without 98 | permission, would make you directly or secondarily liable for 99 | infringement under applicable copyright law, except executing it on a 100 | computer or modifying a private copy. Propagation includes copying, 101 | distribution (with or without modification), making available to the 102 | public, and in some countries other activities as well. 103 | 104 | To "convey" a work means any kind of propagation that enables other 105 | parties to make or receive copies. Mere interaction with a user 106 | through a computer network, with no transfer of a copy, is not 107 | conveying. 108 | 109 | An interactive user interface displays "Appropriate Legal Notices" to 110 | the extent that it includes a convenient and prominently visible 111 | feature that (1) displays an appropriate copyright notice, and (2) 112 | tells the user that there is no warranty for the work (except to the 113 | extent that warranties are provided), that licensees may convey the 114 | work under this License, and how to view a copy of this License. If 115 | the interface presents a list of user commands or options, such as a 116 | menu, a prominent item in the list meets this criterion. 117 | 118 | #### 1. Source Code. 119 | 120 | The "source code" for a work means the preferred form of the work for 121 | making modifications to it. "Object code" means any non-source form of 122 | a work. 123 | 124 | A "Standard Interface" means an interface that either is an official 125 | standard defined by a recognized standards body, or, in the case of 126 | interfaces specified for a particular programming language, one that 127 | is widely used among developers working in that language. 128 | 129 | The "System Libraries" of an executable work include anything, other 130 | than the work as a whole, that (a) is included in the normal form of 131 | packaging a Major Component, but which is not part of that Major 132 | Component, and (b) serves only to enable use of the work with that 133 | Major Component, or to implement a Standard Interface for which an 134 | implementation is available to the public in source code form. A 135 | "Major Component", in this context, means a major essential component 136 | (kernel, window system, and so on) of the specific operating system 137 | (if any) on which the executable work runs, or a compiler used to 138 | produce the work, or an object code interpreter used to run it. 139 | 140 | The "Corresponding Source" for a work in object code form means all 141 | the source code needed to generate, install, and (for an executable 142 | work) run the object code and to modify the work, including scripts to 143 | control those activities. However, it does not include the work's 144 | System Libraries, or general-purpose tools or generally available free 145 | programs which are used unmodified in performing those activities but 146 | which are not part of the work. For example, Corresponding Source 147 | includes interface definition files associated with source files for 148 | the work, and the source code for shared libraries and dynamically 149 | linked subprograms that the work is specifically designed to require, 150 | such as by intimate data communication or control flow between those 151 | subprograms and other parts of the work. 152 | 153 | The Corresponding Source need not include anything that users can 154 | regenerate automatically from other parts of the Corresponding Source. 155 | 156 | The Corresponding Source for a work in source code form is that same 157 | work. 158 | 159 | #### 2. Basic Permissions. 160 | 161 | All rights granted under this License are granted for the term of 162 | copyright on the Program, and are irrevocable provided the stated 163 | conditions are met. This License explicitly affirms your unlimited 164 | permission to run the unmodified Program. The output from running a 165 | covered work is covered by this License only if the output, given its 166 | content, constitutes a covered work. This License acknowledges your 167 | rights of fair use or other equivalent, as provided by copyright law. 168 | 169 | You may make, run and propagate covered works that you do not convey, 170 | without conditions so long as your license otherwise remains in force. 171 | You may convey covered works to others for the sole purpose of having 172 | them make modifications exclusively for you, or provide you with 173 | facilities for running those works, provided that you comply with the 174 | terms of this License in conveying all material for which you do not 175 | control copyright. Those thus making or running the covered works for 176 | you must do so exclusively on your behalf, under your direction and 177 | control, on terms that prohibit them from making any copies of your 178 | copyrighted material outside their relationship with you. 179 | 180 | Conveying under any other circumstances is permitted solely under the 181 | conditions stated below. Sublicensing is not allowed; section 10 makes 182 | it unnecessary. 183 | 184 | #### 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 185 | 186 | No covered work shall be deemed part of an effective technological 187 | measure under any applicable law fulfilling obligations under article 188 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 189 | similar laws prohibiting or restricting circumvention of such 190 | measures. 191 | 192 | When you convey a covered work, you waive any legal power to forbid 193 | circumvention of technological measures to the extent such 194 | circumvention is effected by exercising rights under this License with 195 | respect to the covered work, and you disclaim any intention to limit 196 | operation or modification of the work as a means of enforcing, against 197 | the work's users, your or third parties' legal rights to forbid 198 | circumvention of technological measures. 199 | 200 | #### 4. Conveying Verbatim Copies. 201 | 202 | You may convey verbatim copies of the Program's source code as you 203 | receive it, in any medium, provided that you conspicuously and 204 | appropriately publish on each copy an appropriate copyright notice; 205 | keep intact all notices stating that this License and any 206 | non-permissive terms added in accord with section 7 apply to the code; 207 | keep intact all notices of the absence of any warranty; and give all 208 | recipients a copy of this License along with the Program. 209 | 210 | You may charge any price or no price for each copy that you convey, 211 | and you may offer support or warranty protection for a fee. 212 | 213 | #### 5. Conveying Modified Source Versions. 214 | 215 | You may convey a work based on the Program, or the modifications to 216 | produce it from the Program, in the form of source code under the 217 | terms of section 4, provided that you also meet all of these 218 | conditions: 219 | 220 | - a) The work must carry prominent notices stating that you modified 221 | it, and giving a relevant date. 222 | - b) The work must carry prominent notices stating that it is 223 | released under this License and any conditions added under 224 | section 7. This requirement modifies the requirement in section 4 225 | to "keep intact all notices". 226 | - c) You must license the entire work, as a whole, under this 227 | License to anyone who comes into possession of a copy. This 228 | License will therefore apply, along with any applicable section 7 229 | additional terms, to the whole of the work, and all its parts, 230 | regardless of how they are packaged. This License gives no 231 | permission to license the work in any other way, but it does not 232 | invalidate such permission if you have separately received it. 233 | - d) If the work has interactive user interfaces, each must display 234 | Appropriate Legal Notices; however, if the Program has interactive 235 | interfaces that do not display Appropriate Legal Notices, your 236 | work need not make them do so. 237 | 238 | A compilation of a covered work with other separate and independent 239 | works, which are not by their nature extensions of the covered work, 240 | and which are not combined with it such as to form a larger program, 241 | in or on a volume of a storage or distribution medium, is called an 242 | "aggregate" if the compilation and its resulting copyright are not 243 | used to limit the access or legal rights of the compilation's users 244 | beyond what the individual works permit. Inclusion of a covered work 245 | in an aggregate does not cause this License to apply to the other 246 | parts of the aggregate. 247 | 248 | #### 6. Conveying Non-Source Forms. 249 | 250 | You may convey a covered work in object code form under the terms of 251 | sections 4 and 5, provided that you also convey the machine-readable 252 | Corresponding Source under the terms of this License, in one of these 253 | ways: 254 | 255 | - a) Convey the object code in, or embodied in, a physical product 256 | (including a physical distribution medium), accompanied by the 257 | Corresponding Source fixed on a durable physical medium 258 | customarily used for software interchange. 259 | - b) Convey the object code in, or embodied in, a physical product 260 | (including a physical distribution medium), accompanied by a 261 | written offer, valid for at least three years and valid for as 262 | long as you offer spare parts or customer support for that product 263 | model, to give anyone who possesses the object code either (1) a 264 | copy of the Corresponding Source for all the software in the 265 | product that is covered by this License, on a durable physical 266 | medium customarily used for software interchange, for a price no 267 | more than your reasonable cost of physically performing this 268 | conveying of source, or (2) access to copy the Corresponding 269 | Source from a network server at no charge. 270 | - c) Convey individual copies of the object code with a copy of the 271 | written offer to provide the Corresponding Source. This 272 | alternative is allowed only occasionally and noncommercially, and 273 | only if you received the object code with such an offer, in accord 274 | with subsection 6b. 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 | - e) Convey the object code using peer-to-peer transmission, 288 | provided you inform other peers where the object code and 289 | Corresponding Source of the work are being offered to the general 290 | public at no charge under subsection 6d. 291 | 292 | A separable portion of the object code, whose source code is excluded 293 | from the Corresponding Source as a System Library, need not be 294 | included in conveying the object code work. 295 | 296 | A "User Product" is either (1) a "consumer product", which means any 297 | tangible personal property which is normally used for personal, 298 | family, or household purposes, or (2) anything designed or sold for 299 | incorporation into a dwelling. In determining whether a product is a 300 | consumer product, doubtful cases shall be resolved in favor of 301 | coverage. For a particular product received by a particular user, 302 | "normally used" refers to a typical or common use of that class of 303 | product, regardless of the status of the particular user or of the way 304 | in which the particular user actually uses, or expects or is expected 305 | to use, the product. A product is a consumer product regardless of 306 | whether the product has substantial commercial, industrial or 307 | non-consumer uses, unless such uses represent the only significant 308 | 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 312 | install and execute modified versions of a covered work in that User 313 | Product from a modified version of its Corresponding Source. The 314 | information must suffice to ensure that the continued functioning of 315 | the modified object code is in no case prevented or interfered with 316 | solely because 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 331 | updates for a work that has been modified or installed by the 332 | recipient, or for the User Product in which it has been modified or 333 | installed. Access to a network may be denied when the modification 334 | itself materially and adversely affects the operation of the network 335 | or violates the rules and protocols for communication across the 336 | network. 337 | 338 | Corresponding Source conveyed, and Installation Information provided, 339 | in accord with this section must be in a format that is publicly 340 | documented (and with an implementation available to the public in 341 | source code form), and must require no special password or key for 342 | unpacking, reading or copying. 343 | 344 | #### 7. Additional Terms. 345 | 346 | "Additional permissions" are terms that supplement the terms of this 347 | License by making exceptions from one or more of its conditions. 348 | Additional permissions that are applicable to the entire Program shall 349 | be treated as though they were included in this License, to the extent 350 | that they are valid under applicable law. If additional permissions 351 | apply only to part of the Program, that part may be used separately 352 | under those permissions, but the entire Program remains governed by 353 | this License without regard to the additional permissions. 354 | 355 | When you convey a copy of a covered work, you may at your option 356 | remove any additional permissions from that copy, or from any part of 357 | it. (Additional permissions may be written to require their own 358 | removal in certain cases when you modify the work.) You may place 359 | additional permissions on material, added by you to a covered work, 360 | for which you have or can give appropriate copyright permission. 361 | 362 | Notwithstanding any other provision of this License, for material you 363 | add to a covered work, you may (if authorized by the copyright holders 364 | of that material) supplement the terms of this License with terms: 365 | 366 | - a) Disclaiming warranty or limiting liability differently from the 367 | terms of sections 15 and 16 of this License; or 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 | - c) Prohibiting misrepresentation of the origin of that material, 372 | or requiring that modified versions of such material be marked in 373 | reasonable ways as different from the original version; or 374 | - d) Limiting the use for publicity purposes of names of licensors 375 | or authors of the material; or 376 | - e) Declining to grant rights under trademark law for use of some 377 | trade names, trademarks, or service marks; or 378 | - f) Requiring indemnification of licensors and authors of that 379 | material by anyone who conveys the material (or modified versions 380 | of it) with contractual assumptions of liability to the recipient, 381 | for any liability that these contractual assumptions directly 382 | impose on those licensors and authors. 383 | 384 | All other non-permissive additional terms are considered "further 385 | restrictions" within the meaning of section 10. If the Program as you 386 | received it, or any part of it, contains a notice stating that it is 387 | governed by this License along with a term that is a further 388 | restriction, you may remove that term. If a license document contains 389 | a further restriction but permits relicensing or conveying under this 390 | License, you may add to a covered work material governed by the terms 391 | of that license document, provided that the further restriction does 392 | not survive such relicensing or conveying. 393 | 394 | If you add terms to a covered work in accord with this section, you 395 | must place, in the relevant source files, a statement of the 396 | additional terms that apply to those files, or a notice indicating 397 | where to find the applicable terms. 398 | 399 | Additional terms, permissive or non-permissive, may be stated in the 400 | form of a separately written license, or stated as exceptions; the 401 | above requirements apply either way. 402 | 403 | #### 8. Termination. 404 | 405 | You may not propagate or modify a covered work except as expressly 406 | provided under this License. Any attempt otherwise to propagate or 407 | modify it is void, and will automatically terminate your rights under 408 | this License (including any patent licenses granted under the third 409 | paragraph of section 11). 410 | 411 | However, if you cease all violation of this License, then your license 412 | from a particular copyright holder is reinstated (a) provisionally, 413 | unless and until the copyright holder explicitly and finally 414 | terminates your license, and (b) permanently, if the copyright holder 415 | fails to notify you of the violation by some reasonable means prior to 416 | 60 days after the cessation. 417 | 418 | Moreover, your license from a particular copyright holder is 419 | reinstated permanently if the copyright holder notifies you of the 420 | violation by some reasonable means, this is the first time you have 421 | received notice of violation of this License (for any work) from that 422 | copyright holder, and you cure the violation prior to 30 days after 423 | your receipt of the notice. 424 | 425 | Termination of your rights under this section does not terminate the 426 | licenses of parties who have received copies or rights from you under 427 | this License. If your rights have been terminated and not permanently 428 | reinstated, you do not qualify to receive new licenses for the same 429 | material under section 10. 430 | 431 | #### 9. Acceptance Not Required for Having Copies. 432 | 433 | You are not required to accept this License in order to receive or run 434 | a copy of the Program. Ancillary propagation of a covered work 435 | occurring solely as a consequence of using peer-to-peer transmission 436 | to receive a copy likewise does not require acceptance. However, 437 | nothing other than this License grants you permission to propagate or 438 | modify any covered work. These actions infringe copyright if you do 439 | not accept this License. Therefore, by modifying or propagating a 440 | covered work, you indicate your acceptance of this License to do so. 441 | 442 | #### 10. Automatic Licensing of Downstream Recipients. 443 | 444 | Each time you convey a covered work, the recipient automatically 445 | receives a license from the original licensors, to run, modify and 446 | propagate that work, subject to this License. You are not responsible 447 | for enforcing compliance by third parties with this License. 448 | 449 | An "entity transaction" is a transaction transferring control of an 450 | organization, or substantially all assets of one, or subdividing an 451 | organization, or merging organizations. If propagation of a covered 452 | work results from an entity transaction, each party to that 453 | transaction who receives a copy of the work also receives whatever 454 | licenses to the work the party's predecessor in interest had or could 455 | give under the previous paragraph, plus a right to possession of the 456 | Corresponding Source of the work from the predecessor in interest, if 457 | the predecessor has it or can get it with reasonable efforts. 458 | 459 | You may not impose any further restrictions on the exercise of the 460 | rights granted or affirmed under this License. For example, you may 461 | not impose a license fee, royalty, or other charge for exercise of 462 | rights granted under this License, and you may not initiate litigation 463 | (including a cross-claim or counterclaim in a lawsuit) alleging that 464 | any patent claim is infringed by making, using, selling, offering for 465 | sale, or importing the Program or any portion of it. 466 | 467 | #### 11. Patents. 468 | 469 | A "contributor" is a copyright holder who authorizes use under this 470 | License of the Program or a work on which the Program is based. The 471 | work thus licensed is called the contributor's "contributor version". 472 | 473 | A contributor's "essential patent claims" are all patent claims owned 474 | or controlled by the contributor, whether already acquired or 475 | hereafter acquired, that would be infringed by some manner, permitted 476 | by this License, of making, using, or selling its contributor version, 477 | but do not include claims that would be infringed only as a 478 | consequence of further modification of the contributor version. For 479 | purposes of this definition, "control" includes the right to grant 480 | patent sublicenses in a manner consistent with the requirements of 481 | this License. 482 | 483 | Each contributor grants you a non-exclusive, worldwide, royalty-free 484 | patent license under the contributor's essential patent claims, to 485 | make, use, sell, offer for sale, import and otherwise run, modify and 486 | propagate the contents of its contributor version. 487 | 488 | In the following three paragraphs, a "patent license" is any express 489 | agreement or commitment, however denominated, not to enforce a patent 490 | (such as an express permission to practice a patent or covenant not to 491 | sue for patent infringement). To "grant" such a patent license to a 492 | party means to make such an agreement or commitment not to enforce a 493 | patent against the party. 494 | 495 | If you convey a covered work, knowingly relying on a patent license, 496 | and the Corresponding Source of the work is not available for anyone 497 | to copy, free of charge and under the terms of this License, through a 498 | publicly available network server or other readily accessible means, 499 | then you must either (1) cause the Corresponding Source to be so 500 | available, or (2) arrange to deprive yourself of the benefit of the 501 | patent license for this particular work, or (3) arrange, in a manner 502 | consistent with the requirements of this License, to extend the patent 503 | license to downstream recipients. "Knowingly relying" means you have 504 | actual knowledge that, but for the patent license, your conveying the 505 | covered work in a country, or your recipient's use of the covered work 506 | in a country, would infringe one or more identifiable patents in that 507 | country that you have reason to believe are valid. 508 | 509 | If, pursuant to or in connection with a single transaction or 510 | arrangement, you convey, or propagate by procuring conveyance of, a 511 | covered work, and grant a patent license to some of the parties 512 | receiving the covered work authorizing them to use, propagate, modify 513 | or convey a specific copy of the covered work, then the patent license 514 | you grant is automatically extended to all recipients of the covered 515 | work and works based on it. 516 | 517 | A patent license is "discriminatory" if it does not include within the 518 | scope of its coverage, prohibits the exercise of, or is conditioned on 519 | the non-exercise of one or more of the rights that are specifically 520 | granted under this License. You may not convey a covered work if you 521 | are a party to an arrangement with a third party that is in the 522 | business of distributing software, under which you make payment to the 523 | third party based on the extent of your activity of conveying the 524 | work, and under which the third party grants, to any of the parties 525 | who would receive the covered work from you, a discriminatory patent 526 | license (a) in connection with copies of the covered work conveyed by 527 | you (or copies made from those copies), or (b) primarily for and in 528 | connection with specific products or compilations that contain the 529 | covered work, unless you entered into that arrangement, or that patent 530 | license was granted, prior to 28 March 2007. 531 | 532 | Nothing in this License shall be construed as excluding or limiting 533 | any implied license or other defenses to infringement that may 534 | otherwise be available to you under applicable patent law. 535 | 536 | #### 12. No Surrender of Others' Freedom. 537 | 538 | If conditions are imposed on you (whether by court order, agreement or 539 | otherwise) that contradict the conditions of this License, they do not 540 | excuse you from the conditions of this License. If you cannot convey a 541 | covered work so as to satisfy simultaneously your obligations under 542 | this License and any other pertinent obligations, then as a 543 | consequence you may not convey it at all. For example, if you agree to 544 | terms that obligate you to collect a royalty for further conveying 545 | from those to whom you convey the Program, the only way you could 546 | satisfy both those terms and this License would be to refrain entirely 547 | from conveying the Program. 548 | 549 | #### 13. Use with the GNU Affero General Public License. 550 | 551 | Notwithstanding any other provision of this License, you have 552 | permission to link or combine any covered work with a work licensed 553 | under version 3 of the GNU Affero General Public License into a single 554 | combined work, and to convey the resulting work. The terms of this 555 | License will continue to apply to the part which is the covered work, 556 | but the special requirements of the GNU Affero General Public License, 557 | section 13, concerning interaction through a network will apply to the 558 | combination as such. 559 | 560 | #### 14. Revised Versions of this License. 561 | 562 | The Free Software Foundation may publish revised and/or new versions 563 | of the GNU General Public License from time to time. Such new versions 564 | will be similar in spirit to the present version, but may differ in 565 | detail to address new problems or concerns. 566 | 567 | Each version is given a distinguishing version number. If the Program 568 | specifies that a certain numbered version of the GNU General Public 569 | License "or any later version" applies to it, you have the option of 570 | following the terms and conditions either of that numbered version or 571 | of any later version published by the Free Software Foundation. If the 572 | Program does not specify a version number of the GNU General Public 573 | License, you may choose any version ever published by the Free 574 | Software Foundation. 575 | 576 | If the Program specifies that a proxy can decide which future versions 577 | of the GNU General Public License can be used, that proxy's public 578 | statement of acceptance of a version permanently authorizes you to 579 | choose that version for the Program. 580 | 581 | Later license versions may give you additional or different 582 | permissions. However, no additional obligations are imposed on any 583 | author or copyright holder as a result of your choosing to follow a 584 | later version. 585 | 586 | #### 15. Disclaimer of Warranty. 587 | 588 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 589 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 590 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT 591 | WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT 592 | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 593 | A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND 594 | PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE 595 | DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR 596 | CORRECTION. 597 | 598 | #### 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR 602 | CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 603 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES 604 | ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT 605 | NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR 606 | LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM 607 | TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER 608 | PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 609 | 610 | #### 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | ### How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these 626 | terms. 627 | 628 | To do so, attach the following notices to the program. It is safest to 629 | attach them to the start of each source file to most effectively state 630 | the exclusion of warranty; and each file should have at least the 631 | "copyright" line and a pointer to where the full notice is found. 632 | 633 | 634 | Copyright (C) 635 | 636 | This program is free software: you can redistribute it and/or modify 637 | it under the terms of the GNU General Public License as published by 638 | the Free Software Foundation, either version 3 of the License, or 639 | (at your option) any later version. 640 | 641 | This program is distributed in the hope that it will be useful, 642 | but WITHOUT ANY WARRANTY; without even the implied warranty of 643 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 644 | GNU General Public License for more details. 645 | 646 | You should have received a copy of the GNU General Public License 647 | along with this program. If not, see . 648 | 649 | Also add information on how to contact you by electronic and paper 650 | 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 661 | appropriate parts of the General Public License. Of course, your 662 | program's commands might be different; for a GUI interface, you would 663 | use an "about box". 664 | 665 | You should also get your employer (if you work as a programmer) or 666 | school, if any, to sign a "copyright disclaimer" for the program, if 667 | necessary. For more information on this, and how to apply and follow 668 | the GNU GPL, see . 669 | 670 | The GNU General Public License does not permit incorporating your 671 | program into proprietary programs. If your program is a subroutine 672 | library, you may consider it more useful to permit linking proprietary 673 | applications with the library. If this is what you want to do, use the 674 | GNU Lesser General Public License instead of this License. But first, 675 | please read . -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # JavaScript & LeetCode: The Interview Bootcamp (Classic Edition) 2 | 3 | 4 | 5 | This is the course code for the classic edition of [JavaScript & LeetCode: The Interview Bootcamp](https://www.udemy.com/course/ultimate-javascript-leetcode-interview-bootcamp/?referralCode=6B683FD41E9DEDE9FF4C). 6 | 7 | ## Prerequisites 8 | * [Node.js/npm](https://nodejs.org/en/) 9 | * [jest](https://www.npmjs.com/package/jest) 10 | 11 | ## Example 12 | Run tests for [LC102_levelOrder](exercises/LC102_levelOrder) 13 | 14 | 1) `cd` into the [exercises](exercises) folder 15 | 2) Then run: 16 | ```bash 17 | jest --watch LC102_levelOrder 18 | ``` 19 | 20 | ## Note 21 | I have created an [updated edition](https://kaeducation.thinkific.com/courses/javascript-leetcode-the-complete-interview-bootcamp) of this course with additional problems, revamped explanations, brand new tips & tricks, and much, much, more. 22 | 23 | I am continuing to offer the [original (classic) edition](https://www.udemy.com/course/ultimate-javascript-leetcode-interview-bootcamp/?referralCode=6B683FD41E9DEDE9FF4C) of this course at a substantial discount on Udemy, so that students with lower incomes can still access my content. 24 | 25 | As a **special bonus** to my existing students: if you purchase **both** the [updated edition](https://kaeducation.thinkific.com/courses/javascript-leetcode-the-complete-interview-bootcamp) **AND** the original (classic) Udemy edition, then I will refund you (up to USD $30) for the cost of the Udemy edition. Once you're enrolled in the [updated edition](https://kaeducation.thinkific.com/courses/javascript-leetcode-the-complete-interview-bootcamp) of Javascript & LeetCode: The Interview Bootcamp, send me an email (kevin {`at`} kaeducation.com) with your name and a copy/screenshot of your reciept on Udemy. This offer is valid for 60 days from the date of your purchase of the [updated edition](https://kaeducation.thinkific.com/courses/javascript-leetcode-the-complete-interview-bootcamp) of Javascript & LeetCode: The Interview Bootcamp. 26 | 27 | Happy Learning! -------------------------------------------------------------------------------- /exercises/LC100_isSameTree/index.js: -------------------------------------------------------------------------------- 1 | function isSameTree(p, q) {} 2 | 3 | module.exports = isSameTree; 4 | -------------------------------------------------------------------------------- /exercises/LC100_isSameTree/test.js: -------------------------------------------------------------------------------- 1 | const isSameTree = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.val = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.val) { 24 | return; 25 | } 26 | if (value < current.val) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | } 44 | 45 | test("returns true for same trees", () => { 46 | const BST = new BinarySearchTree(); 47 | BST.insert(8); 48 | BST.insert(3); 49 | BST.insert(10); 50 | BST.insert(1); 51 | BST.insert(6); 52 | BST.insert(14); 53 | // 8 54 | // / \ 55 | // 3 10 56 | // / \ \ 57 | // 1 6 14 58 | 59 | const BST2 = new BinarySearchTree(); 60 | BST2.insert(8); 61 | BST2.insert(3); 62 | BST2.insert(10); 63 | BST2.insert(1); 64 | BST2.insert(6); 65 | BST2.insert(14); 66 | expect(isSameTree(BST.root, BST2.root)).toEqual(true); 67 | }); 68 | 69 | test("returns false for different trees", () => { 70 | const BST = new BinarySearchTree(); 71 | BST.insert(8); 72 | BST.insert(3); 73 | BST.insert(10); 74 | BST.insert(1); 75 | BST.insert(6); 76 | BST.insert(14); 77 | // 8 78 | // / \ 79 | // 3 10 80 | // / \ \ 81 | // 1 6 14 82 | 83 | const BST2 = new BinarySearchTree(); 84 | BST2.insert(8); 85 | BST2.insert(3); 86 | BST2.insert(10); 87 | BST2.insert(1); 88 | BST2.insert(6); 89 | BST2.insert(144); 90 | expect(isSameTree(BST.root, BST2.root)).toEqual(false); 91 | }); 92 | -------------------------------------------------------------------------------- /exercises/LC102_levelOrder/index.js: -------------------------------------------------------------------------------- 1 | function levelOrder(root) {} 2 | 3 | module.exports = levelOrder; 4 | -------------------------------------------------------------------------------- /exercises/LC102_levelOrder/test.js: -------------------------------------------------------------------------------- 1 | const levelOrder = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.val = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.val) { 24 | return; 25 | } 26 | if (value < current.val) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | } 44 | 45 | test("Works.", () => { 46 | const BST = new BinarySearchTree(); 47 | BST.insert(8); 48 | BST.insert(3); 49 | BST.insert(10); 50 | BST.insert(1); 51 | BST.insert(6); 52 | BST.insert(14); 53 | // 8 54 | // / \ 55 | // 3 10 56 | // / \ \ 57 | // 1 6 14 58 | expect(levelOrder(BST.root)).toEqual([[8], [3, 10], [1, 6, 14]]); 59 | }); 60 | -------------------------------------------------------------------------------- /exercises/LC104_maxDepth/index.js: -------------------------------------------------------------------------------- 1 | function maxDepth(root) {} 2 | 3 | module.exports = maxDepth; 4 | -------------------------------------------------------------------------------- /exercises/LC104_maxDepth/test.js: -------------------------------------------------------------------------------- 1 | const maxDepth = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.value = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.value) { 24 | return; 25 | } 26 | if (value < current.value) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | } 44 | 45 | test("Works for Binary Trees of with 1, 2, and 3 levels.", () => { 46 | const BST = new BinarySearchTree(); 47 | BST.insert(8); 48 | expect(maxDepth(BST.root)).toEqual(1); 49 | BST.insert(3); 50 | BST.insert(10); 51 | expect(maxDepth(BST.root)).toEqual(2); 52 | BST.insert(14); 53 | // 8 54 | // / \ 55 | // 3 10 56 | // / \ \ 57 | // 14 58 | expect(maxDepth(BST.root)).toEqual(3); 59 | }); 60 | 61 | test("Works for Binary Tree with 0 levels", () => { 62 | const BST = new BinarySearchTree(); 63 | expect(maxDepth(BST.root)).toEqual(0); 64 | }); 65 | -------------------------------------------------------------------------------- /exercises/LC11_maxArea/index.js: -------------------------------------------------------------------------------- 1 | function maxArea(height) {} 2 | 3 | module.exports = maxArea; 4 | -------------------------------------------------------------------------------- /exercises/LC11_maxArea/test.js: -------------------------------------------------------------------------------- 1 | const maxArea = require("./index"); 2 | 3 | test("works", () => { 4 | expect(maxArea([1, 8, 6, 2, 5, 4, 8, 3, 7])).toEqual(49); 5 | expect(maxArea([2, 3, 4, 5, 18, 17, 6])).toEqual(17); 6 | }); 7 | -------------------------------------------------------------------------------- /exercises/LC121_maxProfit/index.js: -------------------------------------------------------------------------------- 1 | var maxProfit = function(prices) {}; 2 | 3 | module.exports = maxProfit; 4 | -------------------------------------------------------------------------------- /exercises/LC121_maxProfit/test.js: -------------------------------------------------------------------------------- 1 | const maxProfit = require("./index"); 2 | 3 | test("maxProfit([7, 1, 5, 3, 6, 4]) --> 5;", () => { 4 | expect(maxProfit([7, 1, 5, 3, 6, 4])).toEqual(5); 5 | }); 6 | 7 | test("expect(maxProfit([7, 6, 4, 3, 1])) --> 0;", () => { 8 | expect(maxProfit([7, 6, 4, 3, 1])).toEqual(0); 9 | }); 10 | -------------------------------------------------------------------------------- /exercises/LC125_isPalindrome/index.js: -------------------------------------------------------------------------------- 1 | function isPalindrome(s) {} 2 | 3 | module.exports = isPalindrome; 4 | -------------------------------------------------------------------------------- /exercises/LC125_isPalindrome/test.js: -------------------------------------------------------------------------------- 1 | const isPalindrome = require("./index"); 2 | 3 | test("'A man, a plan, a canal: Panama' returns true", () => { 4 | expect(isPalindrome("A man, a plan, a canal: Panama")).toEqual(true); 5 | }); 6 | 7 | test("'love' returns false", () => { 8 | expect(isPalindrome("love")).toEqual(false); 9 | }); 10 | 11 | test("'' returns true", () => { 12 | expect(isPalindrome("")).toEqual(true); 13 | }); 14 | 15 | test("'_a__' returns true", () => { 16 | expect(isPalindrome("_a__")).toEqual(true); 17 | }); 18 | -------------------------------------------------------------------------------- /exercises/LC141_hasCycle/index.js: -------------------------------------------------------------------------------- 1 | function hasCycle(head) {} 2 | 3 | module.exports = hasCycle; 4 | -------------------------------------------------------------------------------- /exercises/LC141_hasCycle/test.js: -------------------------------------------------------------------------------- 1 | const hasCycle = require("./index"); 2 | 3 | class Node { 4 | constructor(data, next = null) { 5 | this.data = data; 6 | this.next = next; 7 | } 8 | } 9 | 10 | class LinkedList { 11 | constructor() { 12 | this.head = null; 13 | this.length = 0; 14 | } 15 | unshift(data) { 16 | this.head = new Node(data, this.head); 17 | this.length++; 18 | } 19 | getFirst() { 20 | return this.head; 21 | } 22 | getLast() { 23 | let node = this.head; 24 | while (node && node.next) { 25 | node = node.next; 26 | } 27 | return node; 28 | } 29 | shift() { 30 | if (this.head) { 31 | this.length--; 32 | } 33 | const originalHead = this.head; 34 | this.head = this.head ? this.head.next : null; 35 | return originalHead; 36 | } 37 | push(data) { 38 | if (!this.head) { 39 | return this.unshift(data); 40 | } 41 | this.getLast().next = new Node(data); 42 | this.length++; 43 | } 44 | get(index) { 45 | if (index >= this.length || index < 0) { 46 | return null; 47 | } 48 | let node = this.head; 49 | let counter = 0; 50 | while (index !== counter) { 51 | node = node.next; 52 | counter++; 53 | } 54 | return node; 55 | } 56 | } 57 | 58 | test("returns false on an empty list.", () => { 59 | const l = new LinkedList(); 60 | expect(hasCycle(l)).toEqual(false); 61 | }); 62 | 63 | test("returns true for circular linked lists", () => { 64 | const l = new LinkedList(); 65 | l.push("a"); 66 | l.push("b"); 67 | l.push("c"); 68 | l.getLast().next = l.getFirst(); 69 | 70 | expect(hasCycle(l.head)).toEqual(true); 71 | }); 72 | 73 | test("returns true for circular linked lists that does not point to head.", () => { 74 | const l = new LinkedList(); 75 | l.push("a"); 76 | l.push("b"); 77 | l.push("c"); 78 | l.getLast().next = l.get(1); 79 | 80 | expect(hasCycle(l.head)).toEqual(true); 81 | }); 82 | 83 | test("returns false for non-circular linked lists", () => { 84 | const l = new LinkedList(); 85 | l.push("a"); 86 | l.push("b"); 87 | l.push("c"); 88 | 89 | expect(hasCycle(l)).toEqual(false); 90 | }); 91 | -------------------------------------------------------------------------------- /exercises/LC152_maxProduct/index.js: -------------------------------------------------------------------------------- 1 | function maxProduct(nums) {} 2 | 3 | module.exports = maxProduct; 4 | -------------------------------------------------------------------------------- /exercises/LC152_maxProduct/test.js: -------------------------------------------------------------------------------- 1 | const maxProduct = require("./index"); 2 | 3 | test("[-2, 3, -4] --> 24", () => { 4 | expect(maxProduct([-2, 3, -4])).toEqual(24); 5 | }); 6 | 7 | test("[-4, -3, -2] --> 12", () => { 8 | expect(maxProduct([-2, -3, -4])).toEqual(12); 9 | }); 10 | 11 | test("[-2, -3, 7] --> 42", () => { 12 | expect(maxProduct([-2, -3, 7])).toEqual(42); 13 | }); 14 | 15 | test("[2, 3, -2, 4] --> 6", () => { 16 | expect(maxProduct([2, 3, -2, 4])).toEqual(6); 17 | }); 18 | 19 | test("[-1,-2,-9,-6] --> 108", () => { 20 | expect(maxProduct([-1, -2, -9, -6])).toEqual(108); 21 | }); 22 | 23 | test("[1,2,-1,-2,2,1,-2,1,4,-5,4] --> 1280", () => { 24 | expect(maxProduct([1, 2, -1, -2, 2, 1, -2, 1, 4, -5, 4])).toEqual(1280); 25 | }); 26 | 27 | test("[0, 2] --> 2", () => { 28 | expect(maxProduct([0, 2])).toEqual(2); 29 | }); 30 | 31 | test("[-2] --> -2", () => { 32 | expect(maxProduct([-2])).toEqual(-2); 33 | }); 34 | -------------------------------------------------------------------------------- /exercises/LC153_findMin/index.js: -------------------------------------------------------------------------------- 1 | function findMin(nums) {} 2 | 3 | module.exports = findMin; 4 | -------------------------------------------------------------------------------- /exercises/LC153_findMin/test.js: -------------------------------------------------------------------------------- 1 | const findMin = require("./index"); 2 | 3 | test("[1] returns 1", () => { 4 | expect(findMin([1])).toEqual(1); 5 | }); 6 | 7 | test("[1, 2] returns 1", () => { 8 | expect(findMin([1, 2])).toEqual(1); 9 | }); 10 | 11 | test("[4,5,6,7,0,1,2] returns 0", () => { 12 | expect(findMin([4, 5, 6, 7, 0, 1, 2])).toEqual(0); 13 | }); 14 | 15 | test("[5, 1, 2, 3, 4] returns 1", () => { 16 | expect(findMin([5, 1, 2, 3, 4])).toEqual(1); 17 | }); 18 | 19 | test("[2,3,4,5,6,1] returns 1", () => { 20 | expect(findMin([2, 3, 4, 5, 6, 1])).toEqual(1); 21 | }); 22 | -------------------------------------------------------------------------------- /exercises/LC15_threeSum/index.js: -------------------------------------------------------------------------------- 1 | const threeSum = nums => {}; 2 | 3 | module.exports = threeSum; 4 | -------------------------------------------------------------------------------- /exercises/LC15_threeSum/test.js: -------------------------------------------------------------------------------- 1 | const threeSum = require("./index"); 2 | 3 | test("threeSum([2, 0, 1, -1]) returns [[-1, 0, 1]]", () => { 4 | expect(threeSum([2, 0, 1, -1])[0].sort((a, b) => a - b)).toEqual([-1, 0, 1]); 5 | }); 6 | 7 | describe("No duplicate results returned", () => { 8 | test("threeSum([0, 0, 0, 0]) returns [[0,0,0]]", () => { 9 | expect(threeSum([0, 0, 0, 0])).toEqual([[0, 0, 0]]); 10 | }); 11 | 12 | test("threeSum([-1, 0, 1, 2, -1, -4]) returns [ [-1, 0, 1], [-1, -1, 2] ]", () => { 13 | expect(threeSum([-1, 0, 1, 2, -1, -4]).length).toEqual(2); 14 | 15 | const intial = threeSum([-1, 0, 1, 2, -1, -4]); 16 | const res = [...intial[0], ...intial[1]].sort((a, b) => a - b); 17 | expect(res).toEqual([-1, -1, -1, 0, 1, 2]); 18 | }); 19 | }); 20 | -------------------------------------------------------------------------------- /exercises/LC17_letterCombinations/index.js: -------------------------------------------------------------------------------- 1 | var letterCombinations = function(digits) { 2 | const hashMap = { 3 | "2": ["a", "b", "c"], 4 | "3": ["d", "e", "f"], 5 | "4": ["g", "h", "i"], 6 | "5": ["j", "k", "l"], 7 | "6": ["m", "n", "o"], 8 | "7": ["p", "q", "r", "s"], 9 | "8": ["t", "u", "v"], 10 | "9": ["w", "x", "y", "z"] 11 | }; 12 | }; 13 | 14 | module.exports = letterCombinations; 15 | -------------------------------------------------------------------------------- /exercises/LC17_letterCombinations/test.js: -------------------------------------------------------------------------------- 1 | const letterCombinations = require("./index"); 2 | 3 | test("letterCombinations('23') returns ['ad','ae','af','bd','be','bf','cd','ce','cf']", () => { 4 | expect(letterCombinations("23").sort()).toEqual([ 5 | "ad", 6 | "ae", 7 | "af", 8 | "bd", 9 | "be", 10 | "bf", 11 | "cd", 12 | "ce", 13 | "cf" 14 | ]); 15 | }); 16 | 17 | test("letterCombinations('234') returns correct results.", () => { 18 | expect(letterCombinations("234").sort()).toEqual([ 19 | "adg", 20 | "adh", 21 | "adi", 22 | "aeg", 23 | "aeh", 24 | "aei", 25 | "afg", 26 | "afh", 27 | "afi", 28 | "bdg", 29 | "bdh", 30 | "bdi", 31 | "beg", 32 | "beh", 33 | "bei", 34 | "bfg", 35 | "bfh", 36 | "bfi", 37 | "cdg", 38 | "cdh", 39 | "cdi", 40 | "ceg", 41 | "ceh", 42 | "cei", 43 | "cfg", 44 | "cfh", 45 | "cfi" 46 | ]); 47 | }); 48 | -------------------------------------------------------------------------------- /exercises/LC198_rob/index.js: -------------------------------------------------------------------------------- 1 | function rob(nums) {} 2 | 3 | module.exports = rob; 4 | -------------------------------------------------------------------------------- /exercises/LC198_rob/test.js: -------------------------------------------------------------------------------- 1 | const rob = require("./index"); 2 | 3 | test("rob([1,2,3,1]) returns 4", () => { 4 | expect(rob([1, 2, 3, 1])).toEqual(4); 5 | }); 6 | 7 | test("rob([2,1,1,2]) returns 4", () => { 8 | expect(rob([2, 1, 1, 2])).toEqual(4); 9 | }); 10 | 11 | test("rob([]) returns 0", () => { 12 | expect(rob([])).toEqual(0); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC19_removeNthFromEnd/index.js: -------------------------------------------------------------------------------- 1 | function removeNthFromEnd(head, n) {} 2 | 3 | module.exports = removeNthFromEnd; 4 | -------------------------------------------------------------------------------- /exercises/LC19_removeNthFromEnd/test.js: -------------------------------------------------------------------------------- 1 | const removeNthFromEnd = require("./index"); 2 | 3 | class ListNode { 4 | constructor(val, next = null) { 5 | this.val = val; 6 | this.next = next; 7 | } 8 | } 9 | 10 | const convertLLToArr = ll => { 11 | let arr = []; 12 | while (ll) { 13 | arr.push(ll.val); 14 | ll = ll.next; 15 | } 16 | return arr; 17 | }; 18 | 19 | const convertIntToLL = int => { 20 | let list = null; 21 | int.split("").forEach(digit => { 22 | const head = new ListNode(Number(digit), list); 23 | list = head; 24 | }); 25 | return list; 26 | }; 27 | 28 | test("removeNthFromEnd([5,4,3,2,1], 2) becomes [5,4,3,1]", () => { 29 | const startingLL = convertIntToLL("12345"); 30 | expect(convertLLToArr(removeNthFromEnd(startingLL, 2))).toEqual([5, 4, 3, 1]); 31 | }); 32 | 33 | test("removeNthFromEnd([1], 1) becomes []", () => { 34 | expect(removeNthFromEnd({ val: "meow", next: null }, 1)).toEqual(null); 35 | }); 36 | -------------------------------------------------------------------------------- /exercises/LC1_TwoSum/index.js: -------------------------------------------------------------------------------- 1 | // Given an array of integers, return an array of indices of the two numbers 2 | // that add up to the target. 3 | // You may assume that each input would have exactly one solution, and 4 | // you may not use the same element twice. 5 | // --- Examples 6 | // twoSum([2,7,11,15], 9) --> [0,1] 7 | // twoSum([3,5,4], 9) --> [1,2] 8 | 9 | function twoSum(arr, target) {} 10 | 11 | module.exports = twoSum; 12 | -------------------------------------------------------------------------------- /exercises/LC1_TwoSum/test.js: -------------------------------------------------------------------------------- 1 | const twoSum = require("./index"); 2 | 3 | test("twoSum([2,7,11,15], 9) returns [0,1]", () => { 4 | expect(twoSum([2, 7, 11, 15], 9).sort((a, b) => (a < b ? -1 : 1))).toEqual([ 5 | 0, 6 | 1 7 | ]); 8 | }); 9 | 10 | test("twoSum([3, 2, 4], 6) returns [1,2]", () => { 11 | expect(twoSum([3, 2, 4], 6).sort((a, b) => (a < b ? -1 : 1))).toEqual([1, 2]); 12 | }); 13 | -------------------------------------------------------------------------------- /exercises/LC200_numIslands/index.js: -------------------------------------------------------------------------------- 1 | function numIslands(grid) {} 2 | 3 | module.exports = numIslands; 4 | -------------------------------------------------------------------------------- /exercises/LC200_numIslands/test.js: -------------------------------------------------------------------------------- 1 | const numIslands = require("./index"); 2 | 3 | test("returns 0 islands correctly.", () => { 4 | expect( 5 | numIslands([ 6 | ["0", "0", "0", "0", "0"], 7 | ["0", "0", "0", "0", "0"], 8 | ["0", "0", "0", "0", "0"] 9 | ]) 10 | ).toEqual(0); 11 | }); 12 | 13 | test("returns 1 island correctly.", () => { 14 | expect( 15 | numIslands([ 16 | ["1", "1", "1", "1", "0"], 17 | ["1", "1", "0", "1", "0"], 18 | ["1", "1", "0", "0", "0"], 19 | ["0", "0", "0", "0", "0"], 20 | ["0", "0", "0", "0", "0"] 21 | ]) 22 | ).toEqual(1); 23 | }); 24 | 25 | test("returns 3 islands correctly.", () => { 26 | expect( 27 | numIslands([ 28 | ["1", "1", "0", "0", "0"], 29 | ["1", "1", "0", "0", "0"], 30 | ["0", "0", "1", "0", "0"], 31 | ["0", "0", "0", "1", "1"] 32 | ]) 33 | ).toEqual(3); 34 | }); 35 | -------------------------------------------------------------------------------- /exercises/LC206_reverseList/index.js: -------------------------------------------------------------------------------- 1 | const reverseList = head => {}; 2 | 3 | module.exports = reverseList; 4 | -------------------------------------------------------------------------------- /exercises/LC206_reverseList/test.js: -------------------------------------------------------------------------------- 1 | const reverseList = require("./index"); 2 | 3 | test("reverses the list", () => { 4 | const head = { val: "A", next: null }; 5 | const bNode = { val: "B", next: null }; 6 | head.next = bNode; 7 | 8 | expect(reverseList(head)).toEqual(bNode); 9 | expect(bNode.next).toEqual(head); 10 | expect(head.next).toEqual(null); 11 | }); 12 | -------------------------------------------------------------------------------- /exercises/LC20_isValid/index.js: -------------------------------------------------------------------------------- 1 | const isValid = s => {}; 2 | 3 | module.exports = isValid; 4 | -------------------------------------------------------------------------------- /exercises/LC20_isValid/test.js: -------------------------------------------------------------------------------- 1 | const isValid = require("./index"); 2 | 3 | test("'(', ')', '{', '}', '[', ']' should return false", () => { 4 | expect(isValid("(")).toEqual(false); 5 | expect(isValid(")")).toEqual(false); 6 | expect(isValid("{")).toEqual(false); 7 | expect(isValid("}")).toEqual(false); 8 | expect(isValid("[")).toEqual(false); 9 | expect(isValid("]")).toEqual(false); 10 | }); 11 | 12 | test("'(]', '([)]' should return false", () => { 13 | expect(isValid("(]")).toEqual(false); 14 | expect(isValid("([)]")).toEqual(false); 15 | }); 16 | 17 | test("'()', '()[]{}', '{[]}' should return true", () => { 18 | expect(isValid("()")).toEqual(true); 19 | expect(isValid("()[]{}")).toEqual(true); 20 | expect(isValid("{[]}")).toEqual(true); 21 | }); 22 | -------------------------------------------------------------------------------- /exercises/LC217_containsDuplicate/index.js: -------------------------------------------------------------------------------- 1 | const containsDuplicate = nums => {}; 2 | 3 | module.exports = containsDuplicate; 4 | -------------------------------------------------------------------------------- /exercises/LC217_containsDuplicate/test.js: -------------------------------------------------------------------------------- 1 | const containsDuplicate = require("./index"); 2 | 3 | test("returns true for Arrays with duplicate values", () => { 4 | expect(containsDuplicate([1, 2, 3, 1])).toEqual(true); 5 | expect(containsDuplicate([1, 1, 1, 3, 3, 4, 3, 2, 4, 2])).toEqual(true); 6 | }); 7 | 8 | test("returns false for Arrays with NO duplicate values", () => { 9 | expect(containsDuplicate([1, 2, 3, 4])).toEqual(false); 10 | }); 11 | -------------------------------------------------------------------------------- /exercises/LC21_mergeTwoLists/index.js: -------------------------------------------------------------------------------- 1 | function mergeTwoLists(l1, l2) {} 2 | 3 | module.exports = mergeTwoLists; 4 | -------------------------------------------------------------------------------- /exercises/LC21_mergeTwoLists/test.js: -------------------------------------------------------------------------------- 1 | const mergeTwoLists = require("./index"); 2 | 3 | class Node { 4 | constructor(val, next = null) { 5 | this.val = val; 6 | this.next = next; 7 | } 8 | } 9 | 10 | class LinkedList { 11 | constructor() { 12 | this.head = null; 13 | this.length = 0; 14 | } 15 | unshift(data) { 16 | this.head = new Node(data, this.head); 17 | this.length++; 18 | } 19 | getLast() { 20 | let node = this.head; 21 | while (node && node.next) { 22 | node = node.next; 23 | } 24 | return node; 25 | } 26 | push(data) { 27 | if (!this.head) { 28 | return this.unshift(data); 29 | } 30 | this.getLast().next = new Node(data); 31 | this.length++; 32 | } 33 | } 34 | 35 | const convertLLToArr = head => { 36 | let arr = []; 37 | while (head) { 38 | arr.push(head.val); 39 | head = head.next; 40 | } 41 | return arr; 42 | }; 43 | 44 | test("[1,3], [2,4,6,8] returns head of [1,2,3,4,6,8]", () => { 45 | const odds = new LinkedList(); 46 | odds.push(1); 47 | odds.push(3); 48 | 49 | const evens = new LinkedList(); 50 | evens.push(2); 51 | evens.push(4); 52 | evens.push(6); 53 | evens.push(8); 54 | 55 | const resList = convertLLToArr(mergeTwoLists(odds.head, evens.head)); 56 | 57 | expect(resList).toEqual([1, 2, 3, 4, 6, 8]); 58 | }); 59 | 60 | test("[1,3], [] returns head of [1,3]", () => { 61 | const odds = new LinkedList(); 62 | odds.push(1); 63 | odds.push(3); 64 | 65 | const evens = new LinkedList(); 66 | 67 | const resList = convertLLToArr(mergeTwoLists(odds.head, evens.head)); 68 | 69 | expect(resList).toEqual([1, 3]); 70 | }); 71 | 72 | test("[], [] returns head of []", () => { 73 | expect(mergeTwoLists(null, null)).toEqual(null); 74 | }); 75 | -------------------------------------------------------------------------------- /exercises/LC226_invertTree/index.js: -------------------------------------------------------------------------------- 1 | function invertTree(root) {} 2 | 3 | module.exports = invertTree; 4 | -------------------------------------------------------------------------------- /exercises/LC226_invertTree/test.js: -------------------------------------------------------------------------------- 1 | const invertTree = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.val = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.val) { 24 | return; 25 | } 26 | if (value < current.val) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | } 44 | 45 | test("Inverts tree", () => { 46 | const BST = new BinarySearchTree(); 47 | BST.insert(8); 48 | BST.insert(3); 49 | BST.insert(10); 50 | BST.insert(1); 51 | BST.insert(6); 52 | BST.insert(14); 53 | // 8 54 | // / \ 55 | // 3 10 56 | // / \ \ 57 | // 1 6 14 58 | invertTree(BST.root); 59 | 60 | expect(BST.root.val).toEqual(8); 61 | 62 | expect(BST.root.left.val).toEqual(10); 63 | expect(BST.root.right.val).toEqual(3); 64 | 65 | expect(BST.root.left.left.val).toEqual(14); 66 | expect(BST.root.right.right.val).toEqual(1); 67 | }); 68 | 69 | test("Inverts empty tree", () => { 70 | const BST = new BinarySearchTree(); 71 | invertTree(BST.root); 72 | 73 | expect(BST.root).toEqual(null); 74 | }); 75 | 76 | test("Inverts tree with only one node", () => { 77 | const BST = new BinarySearchTree(); 78 | BST.insert(8); 79 | invertTree(BST.root); 80 | 81 | expect(BST.root.val).toEqual(8); 82 | }); 83 | -------------------------------------------------------------------------------- /exercises/LC235_lowestCommonAncestor/index.js: -------------------------------------------------------------------------------- 1 | function lowestCommonAncestor(root, p, q) {} 2 | 3 | module.exports = lowestCommonAncestor; 4 | -------------------------------------------------------------------------------- /exercises/LC235_lowestCommonAncestor/test.js: -------------------------------------------------------------------------------- 1 | const lowestCommonAncestor = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.val = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.val) { 24 | return; 25 | } 26 | if (value < current.val) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | find(value) { 44 | let current = this.root; 45 | while (current) { 46 | if (value === current.val) { 47 | return current; 48 | } 49 | current = value < current.val ? current.left : current.right; 50 | } 51 | return false; 52 | } 53 | } 54 | 55 | test("Returns lowest common ancestor.", () => { 56 | const BST = new BinarySearchTree(); 57 | BST.insert(8); 58 | BST.insert(3); 59 | BST.insert(10); 60 | BST.insert(1); 61 | BST.insert(6); 62 | BST.insert(14); 63 | // 8 64 | // / \ 65 | // 3 10 66 | // / \ \ 67 | // 1 6 14 68 | const node3 = BST.find(3); 69 | const node10 = BST.find(10); 70 | const node14 = BST.find(14); 71 | 72 | expect(lowestCommonAncestor(BST.root, node3, node10)).toEqual(BST.root); 73 | expect(lowestCommonAncestor(BST.root, node10, node14)).toEqual(node10); 74 | }); 75 | -------------------------------------------------------------------------------- /exercises/LC238_productExceptSelf/index.js: -------------------------------------------------------------------------------- 1 | const productExceptSelf = nums => {}; 2 | 3 | module.exports = productExceptSelf; 4 | -------------------------------------------------------------------------------- /exercises/LC238_productExceptSelf/test.js: -------------------------------------------------------------------------------- 1 | const productExceptSelf = require("./index"); 2 | 3 | test("productExceptSelf([1,2,3,4]) returns [24, 12, 8, 6]", () => { 4 | expect(productExceptSelf([1, 2, 3, 4])).toEqual([24, 12, 8, 6]); 5 | }); 6 | 7 | test("productExceptSelf([] returns [])", () => { 8 | expect(productExceptSelf([])).toEqual([]); 9 | }); 10 | -------------------------------------------------------------------------------- /exercises/LC242_isAnagram/index.js: -------------------------------------------------------------------------------- 1 | function isAnagram(s, t) {} 2 | 3 | module.exports = isAnagram; 4 | -------------------------------------------------------------------------------- /exercises/LC242_isAnagram/test.js: -------------------------------------------------------------------------------- 1 | const isAnagram = require("./index"); 2 | 3 | test("isAnagram('anagram', 'nagaram') returns true", () => { 4 | expect(isAnagram("anagram", "nagaram")).toEqual(true); 5 | }); 6 | 7 | test("isAnagram('rat', 'car') returns false", () => { 8 | expect(isAnagram("rat", "car")).toEqual(false); 9 | }); 10 | 11 | test("isAnagram('', '') returns true", () => { 12 | expect(isAnagram("", "")).toEqual(true); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC252_canAttendMeetings/index.js: -------------------------------------------------------------------------------- 1 | // Given an array of meeting time intervals consisting of start and end 2 | // times [s1, e1], [s2, e2], ... , determine if a person could attend all meetings. 3 | // --------------------------- 4 | // canAttendMeetings([[0, 30], [5, 10], [15, 20]]) --> false 5 | // canAttendMeetings([[7, 10], [2, 4]]) --> true 6 | 7 | const canAttendMeetings = intervals => {}; 8 | 9 | module.exports = canAttendMeetings; 10 | -------------------------------------------------------------------------------- /exercises/LC252_canAttendMeetings/test.js: -------------------------------------------------------------------------------- 1 | const canAttendMeetings = require("./index"); 2 | 3 | test("returns true for working schedule.", () => { 4 | expect(canAttendMeetings([[7, 10], [2, 4]])).toEqual(true); 5 | }); 6 | 7 | test("returns true for empty schedule.", () => { 8 | expect(canAttendMeetings([])).toEqual(true); 9 | }); 10 | 11 | test("returns false for invalid schedule.", () => { 12 | expect(canAttendMeetings([[0, 30], [5, 10], [15, 20]])).toEqual(false); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC2_addTwoNumbers/index.js: -------------------------------------------------------------------------------- 1 | // You are given two non-empty linked lists representing two non-negative 2 | // integers. The digits are stored in reverse order and each of their nodes 3 | // contain a single digit. Add the two numbers and return it as a linked list. 4 | // --- Example 5 | // Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) 6 | // Output: 7 -> 0 -> 8 7 | // Explanation: 342 + 465 = 807. 8 | 9 | class ListNode { 10 | constructor(val, next = null) { 11 | this.val = val; 12 | this.next = next; 13 | } 14 | } 15 | 16 | function addTwoNumbers(l1, l2) {} 17 | 18 | module.exports = addTwoNumbers; 19 | -------------------------------------------------------------------------------- /exercises/LC2_addTwoNumbers/test.js: -------------------------------------------------------------------------------- 1 | const addTwoNumbers = require("./index"); 2 | 3 | class ListNode { 4 | constructor(val, next = null) { 5 | this.val = val; 6 | this.next = next; 7 | } 8 | } 9 | 10 | const convertLLToArr = ll => { 11 | let arr = []; 12 | while (ll) { 13 | arr.push(ll.val); 14 | ll = ll.next; 15 | } 16 | return arr; 17 | }; 18 | 19 | const convertIntToLL = int => { 20 | let list = null; 21 | int.split("").forEach(digit => { 22 | const head = new ListNode(Number(digit), list); 23 | list = head; 24 | }); 25 | return list; 26 | }; 27 | 28 | test("(2 -> 4 -> 3) + (5 -> 6 -> 4) = (7 -> 0 -> 8)", () => { 29 | // 342 30 | const l1 = new ListNode(2); 31 | l1.next = new ListNode(4); 32 | l1.next.next = new ListNode(3); 33 | 34 | // 465 35 | const l2 = new ListNode(5); 36 | l2.next = new ListNode(6); 37 | l2.next.next = new ListNode(4); 38 | 39 | // 342 + 465 = 807 40 | expect(convertLLToArr(addTwoNumbers(l1, l2))).toEqual([7, 0, 8]); 41 | }); 42 | 43 | test("(9) + (6) = (5 -> 1)", () => { 44 | // 342 45 | const l1 = new ListNode(9); 46 | 47 | // 465 48 | const l2 = new ListNode(6); 49 | 50 | // 342 + 465 = 807 51 | expect(convertLLToArr(addTwoNumbers(l1, l2))).toEqual([5, 1]); 52 | }); 53 | 54 | test("works for 10000000000000000000000001 + 465", () => { 55 | const l1 = convertIntToLL("10000000000000000000000001"); 56 | const l2 = convertIntToLL("465"); 57 | 58 | expect(convertLLToArr(addTwoNumbers(l1, l2))).toEqual([ 59 | 6, 60 | 6, 61 | 4, 62 | 0, 63 | 0, 64 | 0, 65 | 0, 66 | 0, 67 | 0, 68 | 0, 69 | 0, 70 | 0, 71 | 0, 72 | 0, 73 | 0, 74 | 0, 75 | 0, 76 | 0, 77 | 0, 78 | 0, 79 | 0, 80 | 0, 81 | 0, 82 | 0, 83 | 0, 84 | 1 85 | ]); 86 | }); 87 | -------------------------------------------------------------------------------- /exercises/LC300_lengthOfLIS/index.js: -------------------------------------------------------------------------------- 1 | function lengthOfLIS(nums) {} 2 | 3 | module.exports = lengthOfLIS; 4 | -------------------------------------------------------------------------------- /exercises/LC300_lengthOfLIS/test.js: -------------------------------------------------------------------------------- 1 | const lengthOfLIS = require("./index"); 2 | 3 | test("lengthOfLIS([10,9,2,5,3,7,101,4]) returns 4 since LIS is [2,3,7,101]", () => { 4 | expect(lengthOfLIS([10, 9, 2, 5, 3, 7, 101, 4])).toEqual(4); 5 | }); 6 | 7 | test("lengthOfLIS([0]) returns 1", () => { 8 | expect(lengthOfLIS([0])).toEqual(1); 9 | }); 10 | 11 | test("lengthOfLIS([]) returns 0", () => { 12 | expect(lengthOfLIS([])).toEqual(0); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC322_coinChange/index.js: -------------------------------------------------------------------------------- 1 | function coinChange(coins, amount) {} 2 | 3 | module.exports = coinChange; 4 | -------------------------------------------------------------------------------- /exercises/LC322_coinChange/test.js: -------------------------------------------------------------------------------- 1 | const coinChange = require("./index"); 2 | 3 | test("[1, 2, 5], 11 should return 3 for 5 + 5 + 1", () => { 4 | expect(coinChange([1, 2, 5], 11)).toEqual(3); 5 | }); 6 | 7 | test("[2, 5, 10, 1], 27 should return 4 for 10 + 10 + 5 + 2", () => { 8 | expect(coinChange([2, 5, 10, 1], 27)).toEqual(4); 9 | }); 10 | 11 | test("[2], 3 should return -1 since change is not possible", () => { 12 | expect(coinChange([2], 3)).toEqual(-1); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC33_search/index.js: -------------------------------------------------------------------------------- 1 | function search(nums, target) {} 2 | 3 | module.exports = search; 4 | -------------------------------------------------------------------------------- /exercises/LC33_search/test.js: -------------------------------------------------------------------------------- 1 | const search = require("./index"); 2 | 3 | test("search([1], 1) returns 0", () => { 4 | expect(search([1], 1)).toEqual(0); 5 | }); 6 | 7 | test("search([1, 3], 3) returns 1", () => { 8 | expect(search([1, 3], 3)).toEqual(1); 9 | }); 10 | 11 | test("search([3, 1], 3) returns 0", () => { 12 | expect(search([3, 1], 3)).toEqual(0); 13 | }); 14 | 15 | test("search([4,5,1,2,3], 1) returns 2", () => { 16 | expect(search([4, 5, 1, 2, 3], 1)).toEqual(2); 17 | }); 18 | 19 | test("search([7,8,1,2,3,4,5,6], 2) returns 3", () => { 20 | expect(search([7, 8, 1, 2, 3, 4, 5, 6], 2)).toEqual(3); 21 | }); 22 | 23 | test("search([4,5,6,7,0,1,2], 0) returns 4", () => { 24 | expect(search([4, 5, 6, 7, 0, 1, 2], 0)).toEqual(4); 25 | }); 26 | -------------------------------------------------------------------------------- /exercises/LC3_lengthOfLongestSubstring/index.js: -------------------------------------------------------------------------------- 1 | // Given a string, return the length of the longest substring without 2 | // repeating characters. 3 | // --- Example 4 | // lengthOfLongestSubstring("abcabcbb") --> 3 since length of "abc" 5 | // lengthOfLongestSubstring("bbbbb") --> 1 since length of "b" 6 | 7 | function lengthOfLongestSubstring(s) {} 8 | 9 | module.exports = lengthOfLongestSubstring; 10 | -------------------------------------------------------------------------------- /exercises/LC3_lengthOfLongestSubstring/test.js: -------------------------------------------------------------------------------- 1 | const lengthOfLongestSubstring = require("./index"); 2 | 3 | test("'abcabcbb' returns 3", () => { 4 | expect(lengthOfLongestSubstring("abcabcbb")).toEqual(3); 5 | }); 6 | 7 | test("'pwwkew' returns 3", () => { 8 | expect(lengthOfLongestSubstring("pwwkew")).toEqual(3); 9 | }); 10 | 11 | test("'dvdf' returns 3", () => { 12 | expect(lengthOfLongestSubstring("dvdf")).toEqual(3); 13 | }); 14 | 15 | test("'bbb' returns 1", () => { 16 | expect(lengthOfLongestSubstring("bbb")).toEqual(1); 17 | }); 18 | -------------------------------------------------------------------------------- /exercises/LC435_eraseOverlapIntervals/index.js: -------------------------------------------------------------------------------- 1 | const eraseOverlapIntervals = intervals => {}; 2 | 3 | module.exports = eraseOverlapIntervals; 4 | -------------------------------------------------------------------------------- /exercises/LC435_eraseOverlapIntervals/test.js: -------------------------------------------------------------------------------- 1 | const eraseOverlapIntervals = require("./index"); 2 | 3 | test("eraseOverlapIntervals([]) and eraseOverlapIntervals([[1,2]]) return 0", () => { 4 | expect(eraseOverlapIntervals([[1, 2]])).toEqual(0); 5 | expect(eraseOverlapIntervals([])).toEqual(0); 6 | }); 7 | 8 | test("eraseOverlapIntervals([[0,2],[1,3],[2,4],[3,5],[4,6]] ) returns 2", () => { 9 | expect( 10 | eraseOverlapIntervals([[0, 2], [1, 3], [2, 4], [3, 5], [4, 6]]) 11 | ).toEqual(2); 12 | }); 13 | 14 | test("eraseOverlapIntervals([[1, 100], [1, 2], [3, 4], [2, 3]] ) returns 1", () => { 15 | expect(eraseOverlapIntervals([[1, 100], [1, 2], [3, 4], [2, 3]])).toEqual(1); 16 | }); 17 | -------------------------------------------------------------------------------- /exercises/LC49_groupAnagrams/index.js: -------------------------------------------------------------------------------- 1 | function groupAnagrams(strs) {} 2 | 3 | module.exports = groupAnagrams; 4 | -------------------------------------------------------------------------------- /exercises/LC49_groupAnagrams/test.js: -------------------------------------------------------------------------------- 1 | const groupAnagrams = require("./index"); 2 | 3 | test("['eat', 'tea', 'tan', 'ate', 'nat', 'bat'] returns 3 groups of Anagrams", () => { 4 | let res = groupAnagrams(["eat", "tea", "tan", "ate", "nat", "bat"]).sort( 5 | (a, b) => b.length - a.length 6 | ); 7 | 8 | res.forEach(subArr => subArr.sort()); 9 | 10 | expect(res.length).toEqual(3); 11 | 12 | const subArr1 = res[0]; 13 | expect(subArr1).toEqual(["ate", "eat", "tea"]); 14 | const subArr2 = res[1]; 15 | expect(subArr2).toEqual(["nat", "tan"]); 16 | const subArr3 = res[2]; 17 | expect(subArr3).toEqual(["bat"]); 18 | }); 19 | -------------------------------------------------------------------------------- /exercises/LC53_maxSubArray/index.js: -------------------------------------------------------------------------------- 1 | function maxSubArray(nums) {} 2 | 3 | module.exports = maxSubArray; 4 | -------------------------------------------------------------------------------- /exercises/LC53_maxSubArray/test.js: -------------------------------------------------------------------------------- 1 | const maxSubArray = require("./index"); 2 | 3 | test("[-2,1,-3,4,-1,2,1,-5,4] returns 6 for [4,-1,2,1]", () => { 4 | expect(maxSubArray([-2, 1, -3, 4, -1, 2, 1, -5, 4])).toEqual(6); 5 | }); 6 | -------------------------------------------------------------------------------- /exercises/LC54_spiralOrder/index.js: -------------------------------------------------------------------------------- 1 | function spiralOrder(matrix) {} 2 | 3 | module.exports = spiralOrder; 4 | -------------------------------------------------------------------------------- /exercises/LC54_spiralOrder/test.js: -------------------------------------------------------------------------------- 1 | const spiralOrder = require("./index"); 2 | 3 | test("[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] returns [1,2,3,6,9,8,7,4,5]", () => { 4 | expect(spiralOrder([[1, 2, 3], [4, 5, 6], [7, 8, 9]])).toEqual([ 5 | 1, 6 | 2, 7 | 3, 8 | 6, 9 | 9, 10 | 8, 11 | 7, 12 | 4, 13 | 5 14 | ]); 15 | }); 16 | 17 | test("[[1,2,3,4],[5,6,7,8],[9,10,11,12]] returns [1,2,3,4,8,12,11,10,9,5,6,7]", () => { 18 | expect(spiralOrder([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]])).toEqual([ 19 | 1, 20 | 2, 21 | 3, 22 | 4, 23 | 8, 24 | 12, 25 | 11, 26 | 10, 27 | 9, 28 | 5, 29 | 6, 30 | 7 31 | ]); 32 | }); 33 | 34 | test("[[7],[9],[6]] returns [7,9,6]", () => { 35 | expect(spiralOrder([[7], [9], [6]])).toEqual([7, 9, 6]); 36 | }); 37 | -------------------------------------------------------------------------------- /exercises/LC55_canJump/index.js: -------------------------------------------------------------------------------- 1 | function canJump(nums) {} 2 | 3 | module.exports = canJump; 4 | -------------------------------------------------------------------------------- /exercises/LC55_canJump/test.js: -------------------------------------------------------------------------------- 1 | const canJump = require("./index"); 2 | 3 | test("[2, 3, 1, 1, 4] returns true", () => { 4 | expect(canJump([2, 3, 1, 1, 4])).toEqual(true); 5 | }); 6 | 7 | test("[3] returns true", () => { 8 | expect(canJump([3])).toEqual(true); 9 | }); 10 | 11 | test("[3,2,1,0,4] returns false", () => { 12 | expect(canJump([3, 2, 1, 0, 4])).toEqual(false); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC56_merge/index.js: -------------------------------------------------------------------------------- 1 | const merge = intervals => {}; 2 | 3 | module.exports = merge; 4 | -------------------------------------------------------------------------------- /exercises/LC56_merge/test.js: -------------------------------------------------------------------------------- 1 | const merge = require("./index"); 2 | 3 | test("merge([[1, 4], [2, 3]]) --> [1, 4]", () => { 4 | expect(merge([[1, 4], [2, 3]])).toEqual([[1, 4]]); 5 | }); 6 | 7 | test("merge([[1, 4], [4, 5]]) --> [1, 5]", () => { 8 | expect(merge([[1, 4], [4, 5]])).toEqual([[1, 5]]); 9 | }); 10 | 11 | test("merge([[1,3],[2,6],[8,10],[15,18]]) --> [[1,6],[8,10],[15,18]]", () => { 12 | expect(merge([[1, 3], [2, 6], [8, 10], [15, 18]])).toEqual([ 13 | [1, 6], 14 | [8, 10], 15 | [15, 18] 16 | ]); 17 | }); 18 | -------------------------------------------------------------------------------- /exercises/LC5_longestPalindrome/index.js: -------------------------------------------------------------------------------- 1 | //Given a string s, find the longest palindromic substring in s 2 | // --- Example 3 | // longestPalindrome("cbbd") --> "bb" 4 | // longestPalindrome("abba") --> "abba" 5 | // longestPalindrome("a") --> "a" 6 | 7 | function longestPalindrome(s) {} 8 | 9 | module.exports = longestPalindrome; 10 | -------------------------------------------------------------------------------- /exercises/LC5_longestPalindrome/test.js: -------------------------------------------------------------------------------- 1 | const longestPalindrome = require("./index"); 2 | 3 | test("'cbbd' returns 'bb'", () => { 4 | expect(longestPalindrome("cbbd")).toEqual("bb"); 5 | }); 6 | 7 | test("'abba' returns 'abba'", () => { 8 | expect(longestPalindrome("abba")).toEqual("abba"); 9 | }); 10 | 11 | test("'abacdfgdcaba' returns 'aba'", () => { 12 | expect(longestPalindrome("abacdfgdcaba")).toEqual("aba"); 13 | }); 14 | 15 | test("'a' returns 'a'", () => { 16 | expect(longestPalindrome("a")).toEqual("a"); 17 | }); 18 | -------------------------------------------------------------------------------- /exercises/LC62_uniquePaths/index.js: -------------------------------------------------------------------------------- 1 | function uniquePaths(m, n) {} 2 | 3 | module.exports = uniquePaths; 4 | -------------------------------------------------------------------------------- /exercises/LC62_uniquePaths/test.js: -------------------------------------------------------------------------------- 1 | const uniquePaths = require("./index"); 2 | 3 | test("uniquePaths(1, 1) --> 1", () => { 4 | expect(uniquePaths(1, 1)).toEqual(1); 5 | }); 6 | 7 | test("uniquePaths(7, 3) --> 28", () => { 8 | expect(uniquePaths(7, 3)).toEqual(28); 9 | }); 10 | 11 | test("uniquePaths(6, 3) --> 21", () => { 12 | expect(uniquePaths(6, 3)).toEqual(21); 13 | }); 14 | -------------------------------------------------------------------------------- /exercises/LC70_climbStairs/index.js: -------------------------------------------------------------------------------- 1 | const climbStairs = n => {}; 2 | 3 | module.exports = climbStairs; 4 | -------------------------------------------------------------------------------- /exercises/LC70_climbStairs/test.js: -------------------------------------------------------------------------------- 1 | const climbStairs = require("./index"); 2 | 3 | test("Returns 1 way to climb 1 stair", () => { 4 | expect(climbStairs(1)).toEqual(1); 5 | }); 6 | 7 | test("Returns 2 ways to climb 2 stairs", () => { 8 | expect(climbStairs(2)).toEqual(2); 9 | }); 10 | 11 | test("Returns 3 ways to climb 3 stairs", () => { 12 | expect(climbStairs(3)).toEqual(3); 13 | }); 14 | 15 | test("Returns 5 ways to climb 4 stairs", () => { 16 | expect(climbStairs(4)).toEqual(5); 17 | }); 18 | -------------------------------------------------------------------------------- /exercises/LC73_setZeroes/index.js: -------------------------------------------------------------------------------- 1 | function setZeroes(matrix) {} 2 | 3 | module.exports = setZeroes; 4 | -------------------------------------------------------------------------------- /exercises/LC73_setZeroes/test.js: -------------------------------------------------------------------------------- 1 | const setZeroes = require("./index"); 2 | 3 | test("modifies input matrix.", () => { 4 | const inputMatrix = [[0, 1, 2, 0], [3, 4, 5, 2], [1, 3, 1, 5]]; 5 | setZeroes(inputMatrix); 6 | expect(inputMatrix).toEqual([[0, 0, 0, 0], [0, 4, 5, 0], [0, 3, 1, 0]]); 7 | }); 8 | 9 | test("works", () => { 10 | let inputMatrix = [[0, 1, 2, 0], [3, 4, 5, 2], [1, 3, 1, 5]]; 11 | setZeroes(inputMatrix); 12 | expect(inputMatrix).toEqual([[0, 0, 0, 0], [0, 4, 5, 0], [0, 3, 1, 0]]); 13 | 14 | inputMatrix = [[1, 1, 1], [1, 0, 1], [1, 1, 1]]; 15 | setZeroes(inputMatrix); 16 | expect(inputMatrix).toEqual([[1, 0, 1], [0, 0, 0], [1, 0, 1]]); 17 | }); 18 | 19 | test("one-row matrix", () => { 20 | let inputMatrix = [[1, 0]]; 21 | setZeroes(inputMatrix); 22 | expect(inputMatrix).toEqual([[0, 0]]); 23 | }); 24 | 25 | test("one-column matrix", () => { 26 | inputMatrix = [[0], [1]]; 27 | setZeroes(inputMatrix); 28 | expect(inputMatrix).toEqual([[0], [0]]); 29 | }); 30 | -------------------------------------------------------------------------------- /exercises/LC79_exist/index.js: -------------------------------------------------------------------------------- 1 | function exist(board, word) {} 2 | 3 | module.exports = exist; 4 | -------------------------------------------------------------------------------- /exercises/LC79_exist/test.js: -------------------------------------------------------------------------------- 1 | const exist = require("./index"); 2 | 3 | test("returns true correctly.", () => { 4 | expect( 5 | exist( 6 | [["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], 7 | "CESEEC" 8 | ) 9 | ).toEqual(true); 10 | expect( 11 | exist([["C", "A", "A"], ["A", "A", "A"], ["B", "C", "D"]], "AAB") 12 | ).toEqual(true); 13 | }); 14 | 15 | test("returns false correctly.", () => { 16 | expect( 17 | exist( 18 | ["A", "B", "C", "E"], 19 | ["S", "F", "C", "S"], 20 | ["A", "D", "E", "E"], 21 | "ABCB" 22 | ) 23 | ).toEqual(false); 24 | 25 | expect(exist([["a"]], "Ab")).toEqual(false); 26 | }); 27 | -------------------------------------------------------------------------------- /exercises/LC7_reverse/index.js: -------------------------------------------------------------------------------- 1 | // Given a 32-bit signed integer, reverse digits of an integer. 2 | // For an int overflow, your code should just return 0. 3 | // ------------------------- 4 | // reverse(123) --> 321 5 | // reverse(120) --> 21 6 | // reverse(-123) --> -321 7 | // reverse(2147483649) --> 0 8 | // reverse(-2147483649) --> 0 9 | 10 | function reverse(x) {} 11 | 12 | module.exports = reverse; 13 | -------------------------------------------------------------------------------- /exercises/LC7_reverse/test.js: -------------------------------------------------------------------------------- 1 | const reverse = require("./index"); 2 | 3 | test("reverse(123) returns 321", () => { 4 | expect(reverse(123)).toEqual(321); 5 | }); 6 | 7 | test("reverse(120) returns 21", () => { 8 | expect(reverse(120)).toEqual(21); 9 | }); 10 | 11 | test("reverse(-123) returns -321", () => { 12 | expect(reverse(-123)).toEqual(-321); 13 | }); 14 | 15 | test("returns 0 on int overflow for positive number", () => { 16 | expect(reverse(2147483649)).toEqual(0); 17 | }); 18 | 19 | test("returns 0 on int overflow for negative number", () => { 20 | expect(reverse(-2147483649)).toEqual(0); 21 | }); 22 | -------------------------------------------------------------------------------- /exercises/LC98_isValidBST/index.js: -------------------------------------------------------------------------------- 1 | function isValidBST(root) {} 2 | 3 | module.exports = isValidBST; 4 | -------------------------------------------------------------------------------- /exercises/LC98_isValidBST/test.js: -------------------------------------------------------------------------------- 1 | const isValidBST = require("./index"); 2 | 3 | class Node { 4 | constructor(value) { 5 | this.val = value; 6 | this.left = null; 7 | this.right = null; 8 | } 9 | } 10 | 11 | class BinarySearchTree { 12 | constructor() { 13 | this.root = null; 14 | } 15 | insert(value) { 16 | let newNode = new Node(value); 17 | if (!this.root) { 18 | this.root = newNode; 19 | return; 20 | } 21 | let current = this.root; 22 | while (true) { 23 | if (value === current.val) { 24 | return; 25 | } 26 | if (value < current.val) { 27 | if (!current.left) { 28 | current.left = newNode; 29 | return; 30 | } else { 31 | current = current.left; 32 | } 33 | } else { 34 | if (!current.right) { 35 | current.right = newNode; 36 | return; 37 | } else { 38 | current = current.right; 39 | } 40 | } 41 | } 42 | } 43 | } 44 | 45 | test("Returns true for valid BST.", () => { 46 | const BST = new BinarySearchTree(); 47 | BST.insert(8); 48 | BST.insert(3); 49 | BST.insert(10); 50 | BST.insert(1); 51 | BST.insert(6); 52 | BST.insert(14); 53 | // 8 54 | // / \ 55 | // 3 10 56 | // / \ \ 57 | // 1 6 14 58 | expect(isValidBST(BST.root)).toEqual(true); 59 | }); 60 | 61 | test("Returns true for empty BST.", () => { 62 | const BST = new BinarySearchTree(); 63 | expect(isValidBST(BST.root)).toEqual(true); 64 | }); 65 | 66 | test("Returns false for invalid BST.", () => { 67 | const BST = new BinarySearchTree(); 68 | BST.insert(8); 69 | BST.insert(3); 70 | BST.insert(10); 71 | BST.root.right.left = new Node(6); 72 | // 8 73 | // / \ 74 | // 3 10 75 | // / 76 | // 6 77 | expect(isValidBST(BST.root)).toEqual(false); 78 | }); 79 | -------------------------------------------------------------------------------- /exercises/LC9_isPalindrome/index.js: -------------------------------------------------------------------------------- 1 | // Determine whether an integer is a palindrome. An integer is 2 | // a palindrome when it reads the same backward as forward. 3 | // Solve this WITHOUT converting the integer to a string. 4 | // ------------------------------------------------------------- 5 | // function isPalindrome(121) --> true 6 | // function isPalindrome(-121) --> false 7 | // function isPalindrome(10) --> false 8 | 9 | function isPalindrome(x) {} 10 | 11 | module.exports = isPalindrome; 12 | -------------------------------------------------------------------------------- /exercises/LC9_isPalindrome/test.js: -------------------------------------------------------------------------------- 1 | const isPalindrome = require("./index"); 2 | 3 | test("works for positive numbers", () => { 4 | expect(isPalindrome(121)).toEqual(true); 5 | expect(isPalindrome(42)).toEqual(false); 6 | }); 7 | 8 | test("works for negative numbers", () => { 9 | expect(isPalindrome(-42)).toEqual(false); 10 | }); 11 | -------------------------------------------------------------------------------- /exercises/package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "dev", 3 | "version": "1.0.0", 4 | "description": "", 5 | "main": "index.js", 6 | "scripts": { 7 | "test": "echo \"Error: no test specified\" && exit 1" 8 | }, 9 | "jest": { 10 | "testEnvironment": "node" 11 | }, 12 | "author": "", 13 | "license": "ISC", 14 | "dependencies": {} 15 | } 16 | --------------------------------------------------------------------------------