diff --git a/LICENSE.md b/LICENSE.md new file mode 100644 index 00000000..0ac5d05a --- /dev/null +++ b/LICENSE.md @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + +Copyright (C) 2007 Free Software Foundation, Inc. +Everyone is permitted to copy and distribute verbatim copies +of this license document, but changing it is not allowed. + + Preamble + +The GNU General Public License is a free, copyleft license for +software and other kinds of works. + +The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + +When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + +To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + +For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + +Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + +For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + +Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + +Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + +The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + +0. Definitions. + +"This License" refers to version 3 of the GNU General Public License. + +"Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + +"The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + +To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + +A "covered work" means either the unmodified Program or a work based +on the Program. + +To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + +To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + +An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + +1. Source Code. + +The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + +A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + +The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + +The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + +The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + +The Corresponding Source for a work in source code form is that +same work. + +2. Basic Permissions. + +All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + +You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + +Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + +3. Protecting Users' Legal Rights From Anti-Circumvention Law. + +No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + +When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + +4. Conveying Verbatim Copies. + +You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + +You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + +5. Conveying Modified Source Versions. + +You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + +A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + +6. Conveying Non-Source Forms. + +You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + +A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + +A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + +"Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + +If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + +The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + +Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + +7. Additional Terms. + +"Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + +When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + +Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + +All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + +If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + +Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + +8. Termination. + +You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + +However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + +Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + +Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + +9. Acceptance Not Required for Having Copies. + +You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + +10. Automatic Licensing of Downstream Recipients. + +Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + +An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + +You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + +11. Patents. + +A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + +A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + +Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + +In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + +If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + +If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + +A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + +Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + +12. No Surrender of Others' Freedom. + +If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + +13. Use with the GNU Affero General Public License. + +Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + +14. Revised Versions of this License. + +The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + +If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + +Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + +15. Disclaimer of Warranty. + +THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + +16. Limitation of Liability. + +IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + +17. Interpretation of Sections 15 and 16. + +If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + +If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + +To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + +If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and`show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + +You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + +The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/src/components/Table/filters.js b/src/components/Table/filters.js new file mode 100644 index 00000000..8be4b586 --- /dev/null +++ b/src/components/Table/filters.js @@ -0,0 +1,63 @@ +import React from 'react'; + +function CreateDropDownListHelper(options, filterValue, setFilter) { + return ( + + ); +} + +export function DefaultColumnFilter({ + column: { filterValue, preFilteredRows, setFilter, id }, +}) { + const count = preFilteredRows.length; + + return ( + { + setFilter(e.target.value || ''); + }} + placeholder={`Search ${count} questions`} + /> + ); +} + +export function SelectDifficultyColumnFilter({ + column: { filterValue, setFilter }, +}) { + const options = ['Easy', 'Medium', 'Hard']; + + return CreateDropDownListHelper(options, filterValue, setFilter); +} + +export function SelectColumnFilter({ + column: { filterValue, setFilter, preFilteredRows, id }, +}) { + const options = React.useMemo(() => { + const set = new Set(); + + preFilteredRows.forEach(row => { + const values = String(row.values[id]).split(','); + + values.forEach(value => { + set.add(value); + }); + }); + + return [...set.values()].sort(); + }, [id, preFilteredRows]); + + return CreateDropDownListHelper(options, filterValue, setFilter); +} diff --git a/src/components/Table/index.js b/src/components/Table/index.js index e6921f48..fa32432d 100644 --- a/src/components/Table/index.js +++ b/src/components/Table/index.js @@ -8,31 +8,31 @@ import { } from 'reactstrap'; import ReactTooltip from 'react-tooltip'; import { useTable, useFilters, useSortBy } from 'react-table'; -import { FaQuestionCircle } from 'react-icons/fa'; +import { FaQuestionCircle, FaLock } from 'react-icons/fa'; +import { + DefaultColumnFilter, + SelectDifficultyColumnFilter, + SelectColumnFilter, +} from './filters'; import { Event } from '../Shared/Tracking'; -import questionList from '../../data'; +import questions from '../../data'; import './styles.scss'; const images = require.context('../../icons', true); -const sortByObject = { Easy: 0, Medium: 1, Hard: 2 }; -questionList.sort( - (a, b) => sortByObject[a.difficulty] - sortByObject[b.difficulty], -); - const Table = () => { const [checked, setChecked] = useState( JSON.parse(localStorage.getItem('checked')) || - new Array(questionList.length).fill(false), + new Array(questions.length).fill(false), ); useEffect(() => { window.localStorage.setItem('checked', JSON.stringify(checked)); }, [checked]); - const data = React.useMemo(() => questionList, []); + const data = React.useMemo(() => questions, []); const defaultColumn = React.useMemo( () => ({ @@ -67,6 +67,22 @@ const Table = () => { ); }, }, + { + id: 'Premium', + Cell: cellInfo => { + return ( + + {cellInfo.row.original.premium ? ( + + + + ) : ( + '' + )} + + ); + }, + }, { Header: 'Name', accessor: 'name', @@ -107,7 +123,7 @@ const Table = () => { {cellInfo.row.original.difficulty} ), - Filter: SelectColumnFilter, + Filter: SelectDifficultyColumnFilter, }, { Header: () => { @@ -136,7 +152,7 @@ const Table = () => { return {companies}; }, - disableFilters: true, + Filter: SelectColumnFilter, }, ], }, @@ -145,56 +161,6 @@ const Table = () => { [], ); - function DefaultColumnFilter({ - column: { filterValue, preFilteredRows, setFilter }, - }) { - const count = preFilteredRows.length; - - return ( - { - setFilter(e.target.value || undefined); // Set undefined to remove the filter entirely - }} - placeholder={`Search ${count} questions...`} - /> - ); - } - - function SelectColumnFilter({ - column: { filterValue, setFilter, preFilteredRows, id }, - }) { - const options = React.useMemo(() => { - const options = new Set(); - - preFilteredRows.forEach(row => { - options.add(row.values[id]); - }); - - if (id === 'difficulty') { - return [...options.values()]; - } - - return [...options.values()].sort(); - }, [id, preFilteredRows]); - - return ( - - ); - } - const { getTableProps, getTableBodyProps, @@ -217,14 +183,7 @@ const Table = () => { return ( - + {headerGroups.map(headerGroup => ( diff --git a/src/components/Table/styles.scss b/src/components/Table/styles.scss index efd8c23a..a25a9306 100644 --- a/src/components/Table/styles.scss +++ b/src/components/Table/styles.scss @@ -3,8 +3,16 @@ justify-content: center; } - thead > tr:first-child { - display: none; + thead { + > tr:first-child { + display: none; + } + + > tr th { + background: white; + position: sticky; + top: 0; + } } .nav-link { diff --git a/src/data/index.js b/src/data/index.js index edff96d3..54962342 100644 --- a/src/data/index.js +++ b/src/data/index.js @@ -1,10 +1,11 @@ -export default [ +const questions = [ { id: 0, name: 'Contains Duplicate', url: 'https://leetcode.com/problems/contains-duplicate/', pattern: 'Arrays', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Apple'], }, { @@ -13,6 +14,7 @@ export default [ url: 'https://leetcode.com/problems/missing-number/', pattern: 'Arrays', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Microsoft', 'Apple'], }, { @@ -22,6 +24,7 @@ export default [ 'https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/', pattern: 'Arrays', difficulty: 'Easy', + premium: false, companies: ['Microsoft', 'Apple'], }, { @@ -30,6 +33,7 @@ export default [ url: 'https://leetcode.com/problems/single-number/', pattern: 'Arrays', difficulty: 'Easy', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -46,6 +50,7 @@ export default [ url: 'https://leetcode.com/problems/product-of-array-except-self/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -67,6 +72,7 @@ export default [ url: 'https://leetcode.com/problems/find-the-duplicate-number/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Google', 'Microsoft', 'Facebook', 'Apple'], }, { @@ -75,6 +81,7 @@ export default [ url: 'https://leetcode.com/problems/find-all-duplicates-in-an-array/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Facebook', 'Apple'], }, { @@ -83,6 +90,7 @@ export default [ url: 'https://leetcode.com/problems/set-matrix-zeroes/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Microsoft', 'Oracle'], }, { @@ -91,6 +99,7 @@ export default [ url: 'https://leetcode.com/problems/spiral-matrix/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -107,6 +116,7 @@ export default [ url: 'https://leetcode.com/problems/rotate-image/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Apple', 'Facebook'], }, { @@ -115,6 +125,7 @@ export default [ url: 'https://leetcode.com/problems/word-search/', pattern: 'Arrays', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -134,6 +145,7 @@ export default [ url: 'https://leetcode.com/problems/first-missing-positive/', pattern: 'Arrays', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -151,6 +163,7 @@ export default [ url: 'https://leetcode.com/problems/longest-consecutive-sequence/', pattern: 'Arrays', difficulty: 'Hard', + premium: false, companies: [ 'Google', 'Microsoft', @@ -168,6 +181,7 @@ export default [ url: 'https://leetcode.com/problems/letter-case-permutation/', pattern: 'Backtracking', difficulty: 'Easy', + premium: false, companies: ['Amazon'], }, { @@ -176,6 +190,7 @@ export default [ url: 'https://leetcode.com/problems/subsets/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -191,6 +206,7 @@ export default [ url: 'https://leetcode.com/problems/subsets-ii/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Bloomberg'], }, { @@ -199,6 +215,7 @@ export default [ url: 'https://leetcode.com/problems/permutations/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: [ 'Microsoft', 'Amazon', @@ -218,6 +235,7 @@ export default [ url: 'https://leetcode.com/problems/permutations-ii/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Bloomberg'], }, { @@ -226,6 +244,7 @@ export default [ url: 'https://leetcode.com/problems/combinations/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Google', 'Amazon'], }, { @@ -234,6 +253,7 @@ export default [ url: 'https://leetcode.com/problems/combination-sum/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Microsoft', 'Airbnb', 'Uber'], }, { @@ -242,6 +262,7 @@ export default [ url: 'https://leetcode.com/problems/combination-sum-ii/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Google', 'Microsoft', 'Amazon'], }, { @@ -250,6 +271,7 @@ export default [ url: 'https://leetcode.com/problems/combination-sum-iii/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Amazon'], }, { @@ -258,6 +280,7 @@ export default [ url: 'https://leetcode.com/problems/generate-parentheses/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -272,8 +295,9 @@ export default [ id: 23, name: 'Target Sum', url: 'https://leetcode.com/problems/target-sum/', - pattern: 'Backtracking', + pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Facebook'], }, { @@ -282,6 +306,7 @@ export default [ url: 'https://leetcode.com/problems/palindrome-partitioning/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: ['Amazon'], }, { @@ -290,6 +315,7 @@ export default [ url: 'https://leetcode.com/problems/letter-combinations-of-a-phone-number/', pattern: 'Backtracking', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -309,6 +335,7 @@ export default [ url: 'https://leetcode.com/problems/generalized-abbreviation/', pattern: 'Backtracking', difficulty: 'Medium', + premium: true, companies: ['Google'], }, { @@ -317,6 +344,7 @@ export default [ url: 'https://leetcode.com/problems/sudoku-solver/', pattern: 'Backtracking', difficulty: 'Hard', + premium: false, companies: ['Microsoft', 'Amazon', 'Apple', 'Oracle'], }, { @@ -325,6 +353,7 @@ export default [ url: 'https://leetcode.com/problems/n-queens/', pattern: 'Backtracking', difficulty: 'Hard', + premium: false, companies: ['Apple', 'Oracle', 'Amazon'], }, { @@ -333,6 +362,7 @@ export default [ url: 'https://leetcode.com/problems/climbing-stairs/', pattern: 'Dynamic Programming', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Google', @@ -350,6 +380,7 @@ export default [ url: 'https://leetcode.com/problems/house-robber/', pattern: 'Dynamic Programming', difficulty: 'Easy', + premium: false, companies: ['Google', 'Apple', 'Adobe', 'Microsoft', 'Amazon'], }, { @@ -358,6 +389,7 @@ export default [ url: 'https://leetcode.com/problems/best-time-to-buy-and-sell-stock/', pattern: 'Dynamic Programming', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Facebook', @@ -378,6 +410,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-subarray/', pattern: 'Dynamic Programming', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Apple', @@ -398,6 +431,7 @@ export default [ url: 'https://leetcode.com/problems/range-sum-query-immutable/', pattern: 'Dynamic Programming', difficulty: 'Easy', + premium: false, companies: ['Google', 'Facebook'], }, { @@ -406,6 +440,7 @@ export default [ url: 'https://leetcode.com/problems/house-robber-ii/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -414,6 +449,7 @@ export default [ url: 'https://leetcode.com/problems/coin-change/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -432,6 +468,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-product-subarray/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'LinkedIn', @@ -447,6 +484,7 @@ export default [ url: 'https://leetcode.com/problems/longest-increasing-subsequence/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Atlassian', 'Amazon', @@ -463,6 +501,7 @@ export default [ url: 'https://leetcode.com/problems/longest-palindromic-substring/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -481,6 +520,7 @@ export default [ url: 'https://leetcode.com/problems/word-break/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -500,6 +540,7 @@ export default [ url: 'https://leetcode.com/problems/combination-sum-iv/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -508,6 +549,7 @@ export default [ url: 'https://leetcode.com/problems/decode-ways/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Facebook', @@ -525,6 +567,7 @@ export default [ url: 'https://leetcode.com/problems/unique-paths/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Microsoft', @@ -542,6 +585,7 @@ export default [ url: 'https://leetcode.com/problems/jump-game/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Adobe', 'Google', 'Bloomberg', 'Oracle'], }, { @@ -550,6 +594,7 @@ export default [ url: 'https://leetcode.com/problems/palindromic-substrings/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Apple', 'Twitter', 'Google', 'Citadel'], }, { @@ -559,6 +604,7 @@ export default [ 'https://leetcode.com/problems/number-of-longest-increasing-subsequence/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon'], }, { @@ -567,6 +613,7 @@ export default [ url: 'https://leetcode.com/problems/partition-equal-subset-sum/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Facebook'], }, { @@ -575,6 +622,7 @@ export default [ url: 'https://leetcode.com/problems/partition-to-k-equal-sum-subsets/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['LinkedIn', 'Amazon', 'Facebook'], }, { @@ -584,6 +632,7 @@ export default [ 'https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Google', 'Amazon', 'Apple'], }, { @@ -592,6 +641,7 @@ export default [ url: 'https://leetcode.com/problems/counting-bits/', pattern: 'Dynamic Programming', difficulty: 'Medium', + premium: false, companies: ['Facebook'], }, { @@ -600,6 +650,7 @@ export default [ url: 'https://leetcode.com/problems/linked-list-cycle/', pattern: 'Fast & Slow Pointers', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Apple', 'Microsoft', 'Goldman Sachs'], }, { @@ -608,6 +659,7 @@ export default [ url: 'https://leetcode.com/problems/middle-of-the-linked-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Apple', 'Oracle'], }, { @@ -616,6 +668,7 @@ export default [ url: 'https://leetcode.com/problems/palindrome-linked-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Microsoft', 'Apple', 'Snapchat', 'Bloomberg'], }, { @@ -624,6 +677,7 @@ export default [ url: 'https://leetcode.com/problems/remove-linked-list-elements/', pattern: 'Fast & Slow Pointers', difficulty: 'Easy', + premium: false, companies: ['Bloomberg', 'Google', 'Capital One'], }, { @@ -632,6 +686,7 @@ export default [ url: 'https://leetcode.com/problems/remove-duplicates-from-sorted-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Apple', 'Microsoft'], }, { @@ -640,6 +695,7 @@ export default [ url: 'https://leetcode.com/problems/linked-list-cycle-ii/', pattern: 'Fast & Slow Pointers', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Apple', 'Adobe'], }, { @@ -648,6 +704,7 @@ export default [ url: 'https://leetcode.com/problems/add-two-numbers/', pattern: 'Fast & Slow Pointers', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Google', @@ -666,6 +723,7 @@ export default [ url: 'https://leetcode.com/problems/remove-nth-node-from-end-of-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft'], }, { @@ -674,6 +732,7 @@ export default [ url: 'https://leetcode.com/problems/sort-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Amazon', 'Facebook'], }, { @@ -682,6 +741,7 @@ export default [ url: 'https://leetcode.com/problems/reorder-list/', pattern: 'Fast & Slow Pointers', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Microsoft'], }, { @@ -690,6 +750,7 @@ export default [ url: 'https://leetcode.com/problems/clone-graph/', pattern: 'Graphs', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft'], }, { @@ -698,6 +759,7 @@ export default [ url: 'https://leetcode.com/problems/pacific-atlantic-water-flow/', pattern: 'Graphs', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Google', 'Amazon'], }, { @@ -706,6 +768,7 @@ export default [ url: 'https://leetcode.com/problems/number-of-islands/', pattern: 'Graphs', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Bloomberg', @@ -724,6 +787,7 @@ export default [ url: 'https://leetcode.com/problems/graph-valid-tree/', pattern: 'Graphs', difficulty: 'Medium', + premium: true, companies: ['Amazon', 'LinkedIn'], }, { @@ -733,6 +797,7 @@ export default [ 'https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/', pattern: 'Graphs', difficulty: 'Medium', + premium: true, companies: ['Facebook', 'Amazon'], }, { @@ -741,6 +806,7 @@ export default [ url: 'https://leetcode.com/problems/reverse-linked-list/', pattern: 'In-place reversal of a linked list', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -758,6 +824,7 @@ export default [ url: 'https://leetcode.com/problems/reverse-linked-list-ii/', pattern: 'In-place reversal of a linked list', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft', 'Oracle'], }, { @@ -766,6 +833,7 @@ export default [ url: 'https://leetcode.com/problems/rotate-list/', pattern: 'In-place reversal of a linked list', difficulty: 'Medium', + premium: false, companies: ['LinkedIn', 'Amazon', 'Microsoft'], }, { @@ -774,6 +842,7 @@ export default [ url: 'https://leetcode.com/problems/swap-nodes-in-pairs/', pattern: 'In-place reversal of a linked list', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Facebook', 'Apple', 'Amazon'], }, { @@ -782,6 +851,7 @@ export default [ url: 'https://leetcode.com/problems/odd-even-linked-list/', pattern: 'In-place reversal of a linked list', difficulty: 'Medium', + premium: false, companies: ['Capital One', 'Facebook', 'Google', 'Microsoft', 'Bloomberg'], }, { @@ -790,6 +860,7 @@ export default [ url: 'https://leetcode.com/problems/reverse-nodes-in-k-group/', pattern: 'In-place reversal of a linked list', difficulty: 'Hard', + premium: false, companies: ['Microsoft', 'Amazon', 'Facebook', 'Apple', 'Adobe'], }, { @@ -798,6 +869,7 @@ export default [ url: 'https://leetcode.com/problems/merge-two-sorted-lists/', pattern: 'K-Way Merge', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -818,6 +890,7 @@ export default [ 'https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/', pattern: 'K-Way Merge', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft', 'Google'], }, { @@ -826,6 +899,7 @@ export default [ url: 'https://leetcode.com/problems/find-k-pairs-with-smallest-sums/', pattern: 'K-Way Merge', difficulty: 'Medium', + premium: false, companies: ['LinkedIn', 'Amazon', 'Facebook'], }, { @@ -834,6 +908,7 @@ export default [ url: 'https://leetcode.com/problems/merge-k-sorted-lists/', pattern: 'K-Way Merge', difficulty: 'Hard', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -853,6 +928,7 @@ export default [ 'https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/', pattern: 'K-Way Merge', difficulty: 'Hard', + premium: false, companies: ['Google', 'Amazon', 'Snapchat'], }, { @@ -861,6 +937,7 @@ export default [ url: 'https://leetcode.com/problems/meeting-rooms', pattern: 'Merge Intervals', difficulty: 'Easy', + premium: true, companies: ['Microsoft'], }, { @@ -869,6 +946,7 @@ export default [ url: 'https://leetcode.com/problems/merge-intervals/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -891,6 +969,7 @@ export default [ url: 'https://leetcode.com/problems/interval-list-intersections/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Uber', @@ -907,6 +986,7 @@ export default [ url: 'https://leetcode.com/problems/non-overlapping-intervals/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: false, companies: ['Facebook'], }, { @@ -915,6 +995,7 @@ export default [ url: 'https://leetcode.com/problems/meeting-rooms-ii/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: true, companies: [ 'Amazon', 'Bloomberg', @@ -933,6 +1014,7 @@ export default [ url: 'https://leetcode.com/problems/task-scheduler/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Microsoft', 'Amazon', 'Uber', 'Oracle'], }, { @@ -942,6 +1024,7 @@ export default [ 'https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/', pattern: 'Merge Intervals', difficulty: 'Medium', + premium: false, companies: ['Facebook'], }, { @@ -950,6 +1033,7 @@ export default [ url: 'https://leetcode.com/problems/insert-interval/', pattern: 'Merge Intervals', difficulty: 'Hard', + premium: false, companies: ['Google', 'Facebook', 'Twitter', 'Uber', 'LinkedIn', 'Amazon'], }, { @@ -958,6 +1042,7 @@ export default [ url: 'https://leetcode.com/problems/employee-free-time/', pattern: 'Merge Intervals', difficulty: 'Hard', + premium: true, companies: [ 'Pinterest', 'Amazon', @@ -973,6 +1058,7 @@ export default [ url: 'https://leetcode.com/problems/binary-search/', pattern: 'Modified Binary Search', difficulty: 'Easy', + premium: false, companies: ['Microsoft'], }, { @@ -982,6 +1068,7 @@ export default [ 'https://leetcode.com/problems/find-smallest-letter-greater-than-target/', pattern: 'Modified Binary Search', difficulty: 'Easy', + premium: false, companies: ['LinkedIn'], }, { @@ -990,6 +1077,7 @@ export default [ url: 'https://leetcode.com/problems/peak-index-in-a-mountain-array/', pattern: 'Modified Binary Search', difficulty: 'Easy', + premium: false, companies: ['Facebook', 'Amazon', 'Google', 'Uber'], }, { @@ -998,6 +1086,7 @@ export default [ url: 'https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Google', 'Goldman Sachs', 'Apple'], }, { @@ -1006,6 +1095,7 @@ export default [ url: 'https://leetcode.com/problems/find-peak-element/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Google', 'Apple'], }, { @@ -1014,6 +1104,7 @@ export default [ url: 'https://leetcode.com/problems/search-in-rotated-sorted-array/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1032,6 +1123,7 @@ export default [ url: 'https://leetcode.com/problems/search-in-rotated-sorted-array-ii/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Amazon'], }, { @@ -1040,6 +1132,7 @@ export default [ url: 'https://leetcode.com/problems/search-a-2d-matrix/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Facebook', 'Uber', 'Apple'], }, { @@ -1048,6 +1141,7 @@ export default [ url: 'https://leetcode.com/problems/search-a-2d-matrix-ii/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft'], }, { @@ -1056,6 +1150,7 @@ export default [ url: 'https://leetcode.com/problems/find-k-closest-elements/', pattern: 'Modified Binary Search', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Bloomberg', 'Apple'], }, { @@ -1064,6 +1159,7 @@ export default [ url: 'https://leetcode.com/problems/count-of-range-sum/', pattern: 'Modified Binary Search', difficulty: 'Hard', + premium: false, companies: ['Google'], }, { @@ -1072,6 +1168,7 @@ export default [ url: 'https://leetcode.com/problems/minimum-size-subarray-sum/', pattern: 'Sliding Window', difficulty: 'Medium', + premium: false, companies: ['Goldman Sachs', 'Google', 'Amazon', 'Facebook', 'Oracle'], }, { @@ -1080,6 +1177,7 @@ export default [ url: 'https://leetcode.com/problems/fruit-into-baskets/', pattern: 'Sliding Window', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -1088,6 +1186,7 @@ export default [ url: 'https://leetcode.com/problems/permutation-in-string/', pattern: 'Sliding Window', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Microsoft', 'Google'], }, { @@ -1097,6 +1196,7 @@ export default [ 'https://leetcode.com/problems/longest-repeating-character-replacement/', pattern: 'Sliding Window', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -1105,6 +1205,7 @@ export default [ url: 'https://leetcode.com/problems/sliding-window-maximum/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -1123,6 +1224,7 @@ export default [ 'https://leetcode.com/problems/longest-substring-without-repeating-characters/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Facebook', @@ -1142,6 +1244,7 @@ export default [ 'https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: ['Amazon'], }, { @@ -1151,6 +1254,7 @@ export default [ 'https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: ['Twitch'], }, { @@ -1159,6 +1263,7 @@ export default [ url: 'https://leetcode.com/problems/minimum-window-substring/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1180,6 +1285,7 @@ export default [ 'https://leetcode.com/problems/substring-with-concatenation-of-all-words/', pattern: 'Sliding Window', difficulty: 'Hard', + premium: false, companies: ['Amazon', 'Microsoft', 'Google', 'Facebook'], }, { @@ -1188,6 +1294,7 @@ export default [ url: 'https://leetcode.com/problems/kth-smallest-element-in-a-bst/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Oracle', 'Facebook', 'Apple', 'Bloomberg'], }, { @@ -1196,6 +1303,7 @@ export default [ url: 'https://leetcode.com/problems/k-closest-points-to-origin/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Asana', 'Oracle', 'Apple'], }, { @@ -1204,6 +1312,7 @@ export default [ url: 'https://leetcode.com/problems/top-k-frequent-elements/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Oracle', 'Google', 'Yelp', 'Apple'], }, { @@ -1212,6 +1321,7 @@ export default [ url: 'https://leetcode.com/problems/sort-characters-by-frequency/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Bloomberg', 'Uber'], }, { @@ -1220,6 +1330,7 @@ export default [ url: 'https://leetcode.com/problems/kth-largest-element-in-an-array/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1240,6 +1351,7 @@ export default [ url: 'https://leetcode.com/problems/reorganize-string/', pattern: "Top 'K' Elements", difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1255,6 +1367,7 @@ export default [ url: 'https://leetcode.com/problems/rearrange-string-k-distance-apart', pattern: "Top 'K' Elements", difficulty: 'Hard', + premium: true, companies: ['Google'], }, { @@ -1263,6 +1376,7 @@ export default [ url: 'https://leetcode.com/problems/course-schedule-iii/', pattern: "Top 'K' Elements", difficulty: 'Hard', + premium: false, companies: ['Microsoft'], }, { @@ -1271,6 +1385,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-frequency-stack/', pattern: "Top 'K' Elements", difficulty: 'Hard', + premium: false, companies: ['Amazon', 'Apple'], }, { @@ -1279,6 +1394,7 @@ export default [ url: 'https://leetcode.com/problems/course-schedule/', pattern: 'Topological Sort', difficulty: 'Medium', + premium: false, companies: ['Microsoft', 'Amazon', 'Facebook', 'Oracle', 'Google', 'Apple'], }, { @@ -1287,6 +1403,7 @@ export default [ url: 'https://leetcode.com/problems/course-schedule-ii/', pattern: 'Topological Sort', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Google', @@ -1305,6 +1422,7 @@ export default [ url: 'https://leetcode.com/problems/minimum-height-trees/', pattern: 'Topological Sort', difficulty: 'Medium', + premium: false, companies: ['Google', 'Amazon'], }, { @@ -1313,6 +1431,7 @@ export default [ url: 'https://leetcode.com/problems/alien-dictionary', pattern: 'Topological Sort', difficulty: 'Hard', + premium: true, companies: [ 'Facebook', 'Amazon', @@ -1331,6 +1450,7 @@ export default [ url: 'https://leetcode.com/problems/sequence-reconstruction', pattern: 'Topological Sort', difficulty: 'Hard', + premium: true, companies: ['Google'], }, { @@ -1339,6 +1459,7 @@ export default [ url: 'https://leetcode.com/problems/binary-tree-level-order-traversal-ii/', pattern: 'BFS', difficulty: 'Easy', + premium: false, companies: ['Apple'], }, { @@ -1347,6 +1468,7 @@ export default [ url: 'https://leetcode.com/problems/average-of-levels-in-binary-tree/', pattern: 'BFS', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Facebook'], }, { @@ -1355,6 +1477,7 @@ export default [ url: 'https://leetcode.com/problems/minimum-depth-of-binary-tree/', pattern: 'BFS', difficulty: 'Easy', + premium: false, companies: ['Facebook'], }, { @@ -1363,6 +1486,7 @@ export default [ url: 'https://leetcode.com/problems/binary-tree-level-order-traversal/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -1379,6 +1503,7 @@ export default [ 'https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -1396,6 +1521,7 @@ export default [ 'https://leetcode.com/problems/populating-next-right-pointers-in-each-node/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: [ 'Microsoft', 'Amazon', @@ -1412,6 +1538,7 @@ export default [ 'https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Bloomberg', 'Facebook', 'Google'], }, { @@ -1420,6 +1547,7 @@ export default [ url: 'https://leetcode.com/problems/binary-tree-right-side-view/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Microsoft', 'Bloomberg'], }, { @@ -1428,6 +1556,7 @@ export default [ url: 'https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/', pattern: 'BFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft', 'Uber'], }, { @@ -1436,6 +1565,7 @@ export default [ url: 'https://leetcode.com/problems/boundary-of-binary-tree', pattern: 'BFS', difficulty: 'Medium', + premium: true, companies: ['Amazon', 'Microsoft', 'Apple', 'Oracle'], }, { @@ -1444,6 +1574,7 @@ export default [ url: 'https://leetcode.com/problems/same-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Amazon'], }, { @@ -1452,6 +1583,7 @@ export default [ url: 'https://leetcode.com/problems/path-sum/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Facebook', 'Bloomberg'], }, { @@ -1460,6 +1592,7 @@ export default [ url: 'https://leetcode.com/problems/diameter-of-binary-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Facebook', 'Amazon', 'Microsoft', 'Oracle', 'Google', 'Adobe'], }, { @@ -1468,6 +1601,7 @@ export default [ url: 'https://leetcode.com/problems/merge-two-binary-trees/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Adobe', 'Amazon'], }, { @@ -1476,6 +1610,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-depth-of-binary-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Microsoft', 'Google', 'Goldman Sachs'], }, { @@ -1485,6 +1620,7 @@ export default [ 'https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Facebook', 'Microsoft', 'LinkedIn'], }, { @@ -1493,6 +1629,7 @@ export default [ url: 'https://leetcode.com/problems/subtree-of-another-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Amazon'], }, { @@ -1501,6 +1638,7 @@ export default [ url: 'https://leetcode.com/problems/invert-binary-tree/', pattern: 'DFS', difficulty: 'Easy', + premium: false, companies: ['Google', 'Microsoft', 'Amazon'], }, { @@ -1509,6 +1647,7 @@ export default [ url: 'https://leetcode.com/problems/path-sum-ii/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Quora'], }, { @@ -1517,6 +1656,7 @@ export default [ url: 'https://leetcode.com/problems/path-sum-iii/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft'], }, { @@ -1526,6 +1666,7 @@ export default [ 'https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1542,6 +1683,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-binary-tree/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -1550,6 +1692,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-width-of-binary-tree/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Facebook', 'Amazon', 'Google', 'Microsoft'], }, { @@ -1559,6 +1702,7 @@ export default [ 'https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Google', 'Facebook', 'Bloomberg'], }, { @@ -1567,6 +1711,7 @@ export default [ url: 'https://leetcode.com/problems/validate-binary-search-tree/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1586,6 +1731,7 @@ export default [ url: 'https://leetcode.com/problems/kth-smallest-element-in-a-bst/', pattern: 'DFS', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Oracle', 'Facebook', 'Apple', 'Bloomberg'], }, { @@ -1594,6 +1740,7 @@ export default [ url: 'https://leetcode.com/problems/implement-trie-prefix-tree/', pattern: 'Trie', difficulty: 'Medium', + premium: false, companies: ['Amazon', 'Microsoft', 'Google', 'Facebook'], }, { @@ -1602,6 +1749,7 @@ export default [ url: 'https://leetcode.com/problems/binary-tree-maximum-path-sum/', pattern: 'DFS', difficulty: 'Hard', + premium: false, companies: ['Facebook', 'Microsoft', 'Amazon', 'Google', 'Uber', 'Apple'], }, { @@ -1610,6 +1758,7 @@ export default [ url: 'https://leetcode.com/problems/serialize-and-deserialize-binary-tree/', pattern: 'DFS', difficulty: 'Hard', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1628,6 +1777,7 @@ export default [ url: 'https://leetcode.com/problems/word-search-ii/', pattern: 'Trie', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -1644,6 +1794,7 @@ export default [ url: 'https://leetcode.com/problems/find-median-from-data-stream/', pattern: 'Two Heaps', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Google', @@ -1660,6 +1811,7 @@ export default [ url: 'https://leetcode.com/problems/sliding-window-median/', pattern: 'Two Heaps', difficulty: 'Hard', + premium: false, companies: ['Amazon', 'Facebook', 'Google'], }, { @@ -1668,6 +1820,7 @@ export default [ url: 'https://leetcode.com/problems/two-sum/', pattern: 'Two Pointers', difficulty: 'Easy', + premium: false, companies: [ 'Amazon', 'Google', @@ -1686,6 +1839,7 @@ export default [ url: 'https://leetcode.com/problems/remove-duplicates-from-sorted-list/', pattern: 'Two Pointers', difficulty: 'Easy', + premium: false, companies: ['Amazon', 'Apple', 'Microsoft'], }, { @@ -1694,6 +1848,7 @@ export default [ url: 'https://leetcode.com/problems/squares-of-a-sorted-array/', pattern: 'Two Pointers', difficulty: 'Easy', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1712,6 +1867,7 @@ export default [ url: 'https://leetcode.com/problems/backspace-string-compare', pattern: 'Two Pointers', difficulty: 'Easy', + premium: false, companies: ['Google', 'Facebook', 'Amazon', 'Microsoft', 'Oracle'], }, { @@ -1720,6 +1876,7 @@ export default [ url: 'https://leetcode.com/problems/3sum/', pattern: 'Two Pointers', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Facebook', @@ -1738,6 +1895,7 @@ export default [ url: 'https://leetcode.com/problems/3sum-closest/', pattern: 'Two Pointers', difficulty: 'Medium', + premium: false, companies: ['Google', 'Facebook', 'Amazon', 'Apple', 'Microsoft'], }, { @@ -1746,6 +1904,7 @@ export default [ url: 'https://leetcode.com/problems/subarray-product-less-than-k/', pattern: 'Two Pointers', difficulty: 'Medium', + premium: false, companies: ['Akuna Capital', 'Google'], }, { @@ -1754,6 +1913,7 @@ export default [ url: 'https://leetcode.com/problems/sort-colors/', pattern: 'Two Pointers', difficulty: 'Medium', + premium: false, companies: [ 'Amazon', 'Microsoft', @@ -1770,6 +1930,7 @@ export default [ url: 'https://leetcode.com/problems/minimum-window-substring/', pattern: 'Two Pointers', difficulty: 'Hard', + premium: false, companies: [ 'Facebook', 'Amazon', @@ -1789,6 +1950,7 @@ export default [ url: 'https://leetcode.com/problems/trapping-rain-water/', pattern: 'Two Pointers', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Goldman Sachs', @@ -1809,6 +1971,7 @@ export default [ url: 'https://leetcode.com/problems/container-with-most-water/', pattern: 'Two Pointers', difficulty: 'Hard', + premium: false, companies: [ 'Amazon', 'Goldman Sachs', @@ -1826,6 +1989,7 @@ export default [ url: 'https://leetcode.com/problems/longest-word-in-dictionary/', pattern: 'Trie', difficulty: 'Easy', + premium: false, companies: ['Goldman Sachs', 'Google'], }, { @@ -1834,6 +1998,7 @@ export default [ url: 'https://leetcode.com/problems/index-pairs-of-a-string/', pattern: 'Trie', difficulty: 'Easy', + premium: true, companies: ['Amazon'], }, { @@ -1842,6 +2007,7 @@ export default [ url: 'https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array', pattern: 'Trie', difficulty: 'Medium', + premium: false, companies: ['Google'], }, { @@ -1850,6 +2016,7 @@ export default [ url: 'https://leetcode.com/problems/concatenated-words/', pattern: 'Trie', difficulty: 'Hard', + premium: false, companies: ['Amazon', 'Apple', 'Facebook'], }, { @@ -1858,6 +2025,7 @@ export default [ url: 'https://leetcode.com/problems/prefix-and-suffix-search/', pattern: 'Trie', difficulty: 'Hard', + premium: false, companies: ['Facebook', 'Google', 'Uber'], }, { @@ -1866,6 +2034,7 @@ export default [ url: 'https://leetcode.com/problems/palindrome-pairs/', pattern: 'Trie', difficulty: 'Hard', + premium: false, companies: ['Airbnb', 'Amazon', 'Facebook', 'Google', 'Square'], }, { @@ -1874,6 +2043,7 @@ export default [ url: 'https://leetcode.com/problems/design-search-autocomplete-system/', pattern: 'Trie', difficulty: 'Hard', + premium: true, companies: ['Amazon', 'Google', 'Lyft', 'Microsoft', 'Uber'], }, { @@ -1882,6 +2052,13 @@ export default [ url: 'https://leetcode.com/problems/word-squares/', pattern: 'Trie', difficulty: 'Hard', + premium: true, companies: ['Oracle'], }, ]; + +const sortBy = { Easy: 0, Medium: 1, Hard: 2 }; + +export default questions.sort( + (a, b) => sortBy[a.difficulty] - sortBy[b.difficulty], +);