{"id":15626060,"url":"https://github.com/ignacio-chiazzo/algorithms-leetcode-javascript","last_synced_at":"2025-04-14T08:17:25.989Z","repository":{"id":40396473,"uuid":"152999013","full_name":"ignacio-chiazzo/Algorithms-Leetcode-Javascript","owner":"ignacio-chiazzo","description":"Algorithms resolution in Javascript. Leetcode - Geeksforgeeks - Careercup","archived":false,"fork":false,"pushed_at":"2024-10-22T17:46:29.000Z","size":347,"stargazers_count":667,"open_issues_count":8,"forks_count":95,"subscribers_count":10,"default_branch":"master","last_synced_at":"2025-04-14T08:17:19.727Z","etag":null,"topics":["algorithms","algortithms","coding-interviews","computer-science","data-structures","hackoctoberfest","hackoctoberfest2022","hacktoberfest","hacktoberfest-accepted","interview","interview-preparation","interview-questions","javascript","leetcode","leetcode-javascript","leetcode-solutions","problem-solving","problemsolving","programming-interviews","study-plan"],"latest_commit_sha":null,"homepage":"https://ignacio-chiazzo.github.io/Algorithms-Leetcode-Javascript/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ignacio-chiazzo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-10-14T17:16:01.000Z","updated_at":"2025-04-13T17:37:27.000Z","dependencies_parsed_at":"2023-02-08T04:01:20.437Z","dependency_job_id":"5182586a-b0fb-4a1f-9291-e6e95a18893b","html_url":"https://github.com/ignacio-chiazzo/Algorithms-Leetcode-Javascript","commit_stats":{"total_commits":215,"total_committers":21,"mean_commits":"10.238095238095237","dds":0.2837209302325582,"last_synced_commit":"48aaef08435b5a8a977840bc5ab5efc4b660cc8c"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ignacio-chiazzo%2FAlgorithms-Leetcode-Javascript","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ignacio-chiazzo%2FAlgorithms-Leetcode-Javascript/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ignacio-chiazzo%2FAlgorithms-Leetcode-Javascript/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ignacio-chiazzo%2FAlgorithms-Leetcode-Javascript/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ignacio-chiazzo","download_url":"https://codeload.github.com/ignacio-chiazzo/Algorithms-Leetcode-Javascript/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248843999,"owners_count":21170499,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algortithms","coding-interviews","computer-science","data-structures","hackoctoberfest","hackoctoberfest2022","hacktoberfest","hacktoberfest-accepted","interview","interview-preparation","interview-questions","javascript","leetcode","leetcode-javascript","leetcode-solutions","problem-solving","problemsolving","programming-interviews","study-plan"],"created_at":"2024-10-03T10:09:53.540Z","updated_at":"2025-04-14T08:17:25.961Z","avatar_url":"https://github.com/ignacio-chiazzo.png","language":"JavaScript","readme":"# Algorithms-Javascript\n\nSolutions of algorithm problems using Javascript.  https://ignacio-chiazzo.github.io/Algorithms-Leetcode-Javascript/\n\n### Structure\nThe solutions are located under `/LeetcodeProblems`. Each problem has a test file located under `/LeetcodeProblemsTest`.\n\n### Run Tests\n\n**Unit tests:** To run all the test run `node Test.js` in the console. To run a specific problem in your console run  `node Test.js \u003cproblem_file_path\u003e` (e.g. `node Test.js ./LeetcodeProblemsTests/Algorithms/easy/2Sum_Test.js`).\n\n**Linter:** This repository uses [`es-lint`](https://eslint.org/docs/latest/user-guide/command-line-interface). To run all the tests you would need to install the packages by running `npm install` followed by `npx eslint LeetcodeProblems LeetcodeProblemsTests` which will run the eslint in all problems and tests. You can also use the [flag `--fix`](https://eslint.org/docs/latest/user-guide/command-line-interface#fixing-problems) which will automatically fix some of the errors.\n\n### Leetcode Problems\n\n| Name                                                                                                                                                           | Level  | Link                                                                                                                | \n|----------------------------------------------------------------------------------------------------------------------------------------------------------------|--------|---------------------------------------------------------------------------------------------------------------------|\n| [Edit Distance ](/LeetcodeProblems/Algorithms/hard/Edit_Distance.js)                                                                                           | Hard   | https://leetcode.com/problems/edit-distance/                                                                        |\n| [First Missing Positive ](/LeetcodeProblems/Algorithms/hard/First_Missing_Positive.js)                   | Hard   | https://leetcode.com/problems/first-missing-positive/                                                                        |\n| [Remove Invalid Parentheses ](/LeetcodeProblems/Algorithms/hard/Remove_Invalid_Parentheses.js)                                                                 | Hard   | https://leetcode.com/problems/remove-invalid-parentheses/                                                           |\n| [Longest Consecutive Sequence ](/LeetcodeProblems/Algorithms/hard/Longest_Consecutive_Sequence.js)                                                             | Hard   | https://leetcode.com/problems/longest-consecutive-sequence/                                                         |\n| [Minimum Window Substring ](/LeetcodeProblems/Algorithms/hard/Minimum_Window_Substring.js)                                                                     | Hard   | https://leetcode.com/problems/minimum-window-substring/                                                             |\n| [Regular Expression Matching ](/LeetcodeProblems/Algorithms/hard/Regular_Expression_Matching.js)                                                               | Hard   | https://leetcode.com/problems/regular-expression-matching/                                                          |\n| [NQueens ](/LeetcodeProblems/Algorithms/hard/NQueens.js)                                                                                                       | Hard   | https://leetcode.com/problems/n-queens/                                                                             |\n| [merge k sorted lists ](/LeetcodeProblems/Algorithms/hard/merge_k_sorted_lists.js)                                                                             | Hard   | https://leetcode.com/problems/merge-k-sorted-lists/                                                                 |\n| [Set Matrix Zeroes](/LeetcodeProblems/Algorithms/hard/Set_Matrix_Zeroes.js)                                                                                    | Hard   | https://leetcode.com/problems/set-matrix-zeroes/                                                                    |\n| [Subarray Sum Equals K ](/LeetcodeProblems/Algorithms/medium/Subarray_Sum_Equals_K.js)                                                                         | Medium | https://leetcode.com/problems/subarray-sum-equals-k/                                                                | \n| [3Sum Closest](/LeetcodeProblems/Algorithms/medium/3SumClosest.js)                                                                                             | Medium | https://leetcode.com/problems/3sum-closest/                                                                         | \n| [3Sum ](/LeetcodeProblems/Algorithms/medium/3Sum.js)                                                                                                           | Medium | https://leetcode.com/problems/3sum/                                                                                 | \n| [NumberOfIslands ](/LeetcodeProblems/Algorithms/medium/Number_of_Islands.js)                                                                                   | Medium | https://leetcode.com/problems/number-of-islands/                                                                    | \n| [Swap Nodes in Pairs](/LeetcodeProblems/Algorithms/medium/Swap_Nodes_in_Pairs.js)                                                                              | Medium | https://leetcode.com/problems/swap-nodes-in-pairs/                                                                  | \n| [Add Two Numbers ](/LeetcodeProblems/Algorithms/medium/Add_Two_Numbers.js)                                                                                     | Medium | https://leetcode.com/problems/add-two-numbers/                                                                      |\n| [Clone Graph ](/LeetcodeProblems/Algorithms/medium/Clone_Graph.js)                                                                                             | Medium | https://leetcode.com/problems/clone-graph/                                                                          |\n| [Coin Change ](/LeetcodeProblems/Algorithms/medium/Coin_Change.js)                                                                                             | Medium | https://leetcode.com/problems/coin-change/                                                                          |\n| [Container With Most Water](/LeetcodeProblems/Algorithms/medium/Container_With_Most_Water.js)                                                                  | Medium | https://leetcode.com/problems/container-with-most-water/                                                            |\n| [Design Circular Deque ](/LeetcodeProblems/Algorithms/medium/Design_Circular_Deque.js)                                                                         | Medium | https://leetcode.com/problems/design-circular-deque/                                                                \n| [Escape The Ghosts](/LeetcodeProblems/Algorithms/medium/Escape_The_Ghosts.js)                                                                                  | Medium | https://leetcode.com/problems/escape-the-ghosts/                                                                    |\n| [Find All Anagrams in a String](/LeetcodeProblems/Algorithms/medium/Find_Anagrams.js)                                                                          | Medium | https://leetcode.com/problems/find-all-anagrams-in-a-string/                                                        |\n| [Generate Parenthesis ](/LeetcodeProblems/Algorithms/medium/Generate_Parenthesis.js)                                                                           | Medium | https://leetcode.com/problems/generate-parentheses                                                                  | \n| [Group Anagrams ](/LeetcodeProblems/Algorithms/medium/Group_Anagrams.js)                                                                                       | Medium | https://leetcode.com/problems/group-anagrams/                                                                       \n| [Kth Largest Element in an Array ](/LeetcodeProblems/Algorithms/medium/Kth_Largest_Element_in_an_Array.js)                                                     | Medium | https://leetcode.com/problems/kth-largest-element-in-an-array/                                                      |\n| [Linked List Cycle II ](/LeetcodeProblems/Algorithms/medium/Linked_List_Cycle_II.js)                                                                           | Medium | https://leetcode.com/problems/linked-list-cycle-ii/                                                                 |\n| [Longest Palindromic Substring ](/LeetcodeProblems/Algorithms/medium/Longest_Palindromic_Substring.js)                                                         | Medium | https://leetcode.com/problems/longest-palindromic-substring/                                                        |\n| [Longest Substring Without Reapeating Characters](/LeetcodeProblems/Algorithms/medium/Longest_Substring.js)                                                    | Medium | https://leetcode.com/problems/longest-substring-without-repeating-characters                                        |\n| [Max Area Of Island ](/LeetcodeProblems/Algorithms/medium/Max_Area_Of_Island.js)                                                                               | Medium | https://leetcode.com/problems/max-area-of-island/                                                                   |\n| [Max Consecutive Ones III ](/LeetcodeProblems/Algorithms/medium/Max_Consecutive_Ones_III.js)                                                                   | Medium | https://leetcode.com/problems/max-consecutive-ones-iii                                                              |\n| [Maximal Square ](/LeetcodeProblems/Algorithms/medium/Maximal_Square.js)                                                                                       | Medium | https://leetcode.com/problems/maximal-square/                                                                       |\n| [Minimum Add to Make Parentheses Valid ](/LeetcodeProblems/Algorithms/medium/Minimum_Add_To_Make_Parentheses_Valid.js)                                         | Medium | https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/                                                |\n| [Minimum Size Subarray](/LeetcodeProblems/Algorithms/medium/Minimum_Size_Subarray.js)                                                                          | Medium | https://leetcode.com/problems/minimum-size-subarray-sum                                                             |\n| [Permutations ](/LeetcodeProblems/Algorithms/medium/Permutations.js)                                                                                           | Medium | https://leetcode.com/problems/permutations/                                                                         |\n| [Permutations II ](/LeetcodeProblems/Algorithms/medium/Permutations_II.js)                                                                                     | Medium | https://leetcode.com/problems/permutations-ii/                                                                      |\n| [Permutation in String](/LeetcodeProblems/Algorithms/medium/Permutations_In_String.js)                                                                         | Medium | https://leetcode.com/problems/permutation-in-string/                                                                |\n| [Permutations Without Duplicates ](/LeetcodeProblems/Algorithms/medium/Permutations_Without_Duplicates.js)                                                     | Medium | https://leetcode.com/problems/permutations/                                                                         |\n| [Restore IP Addresses ](/LeetcodeProblems/Algorithms/medium/Restore_IP_Addresses.js)                                                                           | Medium | https://leetcode.com/problems/restore-ip-addresses/                                                                 |\n| [SearchIng Rotated Sorted Array ](/LeetcodeProblems/Algorithms/medium/SearchIng_Rotated_Sorted_Array.js)                                                       | Medium | https://leetcode.com/problems/search-in-rotated-sorted-array/                                                       |\n| [Search a 2D Matrix ](/LeetcodeProblems/Algorithms/medium/Search_a_2D_Matrix.js)                                                                               | Medium | https://leetcode.com/problems/search-a-2d-matrix/                                                                   |\n| [Search a 2D Matrix II ](/LeetcodeProblems/Algorithms/medium/Search_a_2D_Matrix_II.js)                                                                         | Medium | https://leetcode.com/problems/search-a-2d-matrix/                                                                   |\n| [Simplify Path ](/LeetcodeProblems/Algorithms/medium/Simplify_Path.js)                                                                                         | Medium | https://leetcode.com/problems/simplify-path/                                                                        |\n| [Spiral Matrix ](/LeetcodeProblems/Algorithms/medium/Spiral_Matrix.js)                                                                                         | Medium | https://leetcode.com/problems/spiral-matrix/                                                                        |\n| [Subsets ](/LeetcodeProblems/Algorithms/medium/Subsets.js)                                                                                                     | Medium | https://leetcode.com/problems/subsets/                                                                              |\n| [Unique Binary Search Trees ](/LeetcodeProblems/Algorithms/medium/Unique_Binary_Search_Trees.js)                                                               | Medium | https://leetcode.com/problems/unique-binary-search-trees/                                                           |\n| [Unique Paths ](/LeetcodeProblems/Algorithms/medium/Unique_Paths.js)                                                                                           | Medium | https://leetcode.com/problems/unique-paths/                                                                         |\n| [Verify Preorder Serialization of a Binary Tree ](/LeetcodeProblems/Algorithms/medium/Verify_Preorder_Serialization_of_a_Binary_Tree.js)                       | Medium | https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/                                       |\n| [Construct Binary Tree from Preorder and Inorder Traversal ](/LeetcodeProblems/Algorithms/medium/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js) | Medium | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/                            | \n| [Lowest Common Ancestor of a Binary Tree ](/LeetcodeProblems/Algorithms/medium/Lowest_Common_Ancestor_of_a_Binary_Tree.js)                                     | Medium | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/                                              |\n| [Maximum Sum of an Hourglass](/LeetcodeProblems/Algorithms/medium/Maximise_Hour_Glass_Sum.js)                                                                  | Medium | https://leetcode.com/problems/maximum-sum-of-an-hourglass/                                                          |\n| [Next Permutation](/LeetcodeProblems/Algorithms/medium/Next_Permutation.js)                                                                                    | Medium | https://leetcode.com/problems/next-permutation/                                                                     |\n| [Time Needed to Rearrange a Binary String](/LeetcodeProblems/Algorithms/medium/Time_Needed_Rearrange_Binary_String.js)                                         | Medium | https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/                                             |\n| [Find Subarrays With Equal Sum ](/LeetcodeProblems/Algorithms/medium/Find_Subarrays_With_Equal_Sums.js)                                                        | Medium | https://leetcode.com/problems/find-subarrays-with-equal-sum/                                                        | \n| [Reverse Integer](/LeetcodeProblems/Algorithms/medium/Reverse_Integer.js)                                                                                      | Medium | https://leetcode.com/problems/reverse-integer/                                                                      |\n| [Minimize Maximum Pair Sum in Array ](/LeetcodeProblems/Algorithms/medium/Minimize_Maximum_Pair_Sum_In_Array.js)                                               | Medium | https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/                                                   |\n| [Top K Frequent Elements ](/LeetcodeProblems/Algorithms/medium/Top_K_Frequent_Elements.js)                                                                     | Medium | https://leetcode.com/problems/top-k-frequent-elements/                                                              |\n| [Gas Station](/LeetcodeProblems/Algorithms/medium/GasStation/index.js)                                                                                         | Medium | https://leetcode.com/problems/gas-station/description/                                                              |\n| [K Closest Points to Origin](/LeetcodeProblems/Algorithms/medium/K_Closest_Points_to_Origin.js/)                                                               | Medium | https://leetcode.com/problems/k-closest-points-to-origin/                                                           \n| [BestTimeToBuy](LeetcodeProblems/Algorithms/easy/Best_Time_To_Buy_And_Sell_Stock_II.js)                                                                        | Medium | https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii                                                    |\n| [Best Time to Buy and Sell Stock](/LeetcodeProblems/Algorithms/easy/Best_Time_to_buy_and_sell_stock.js)                                                        | Easy   | https://leetcode.com/problems/best-time-to-buy-and-sell-stock/\n| [Flood Fill ](/LeetcodeProblems/Algorithms/easy/Flood_Fill.js)                                                                                                 | Easy   | https://leetcode.com/problems/flood-fill/                                                                           |\n| [Implement stack using queues ](/LeetcodeProblems/Algorithms/easy/Implement_stack_using_queues.js)                                                             | Easy   | https://leetcode.com/problems/implement-stack-using-queues/                                                         |\n| [Number of Segments in a String ](/LeetcodeProblems/Algorithms/easy/Number_of_Segments_in_a_String.js)                                                         | Easy   | https://leetcode.com/problems/number-of-segments-in-a-string/                                                       |\n| [Maximun Subarray ](/LeetcodeProblems/Algorithms/easy/Maximun_Subarray.js)                                                                                     | Easy   | https://leetcode.com/problems/maximum-subarray                                                                      |\n| [Min Stack ](/LeetcodeProblems/Algorithms/easy/Min_Stack.js)                                                                                                   | Easy   | https://leetcode.com/problems/min-stack/                                                                            |  \n| [Reverse String II ](/LeetcodeProblems/Algorithms/easy/Reverse_String_II.js)                                                                                   | Easy   | https://leetcode.com/problems/reverse-string-ii/                                                                    | \n| [Same Tree ](/LeetcodeProblems/Algorithms/easy/Same_Tree.js)                                                                                                   | Easy   | https://leetcode.com/problems/same-tree/                                                                            |\n| [Sum Of Square Numbers ](/LeetcodeProblems/Algorithms/easy/Sum_Of_Square_Numbers.js)                                                                           | Easy   | https://leetcode.com/problems/sum-of-square-numbers/                                                                |\n| [Symmetric Tree ](/LeetcodeProblems/Algorithms/easy/Symmetric_Tree.js)                                                                                         | Easy   | https://leetcode.com/problems/symmetric-tree/                                                                       |\n| [Valid Parentheses ](/LeetcodeProblems/Algorithms/easy/Valid_Parentheses.js)                                                                                   | Easy   | https://leetcode.com/problems/valid-parentheses/                                                                    |\n| [Backspace String Compare ](/LeetcodeProblems/Algorithms/easy/Backspace_String_Compare.js)                                                                     | Easy   | https://leetcode.com/problems/backspace-string-compare/                                                             |\n| [Binary Gap ](/LeetcodeProblems/Algorithms/easy/Binary_Gap.js)                                                                                                 | Easy   | https://leetcode.com/problems/binary-gap/                                                                           |\n| [Majority Element](/LeetcodeProblems/Algorithms/easy/Majority_Element.js)                                                                                      | Easy   | https://leetcode.com/problems/majority-element/                                                                     |\n| [Lexographically Smallest String After A Swap](/LeetcodeProblems/Algorithms/medium/Kth_Largest_Element_in_an_Array.js)                                         | Easy   | https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/                                       |\n| [Longest Common Prefix](/LeetcodeProblems/Algorithms/easy/Longest_Common_Prefix.js)                                                                            | Easy   | https://leetcode.com/problems/longest-common-prefix/                                                                |\n| [Two Sum](/LeetcodeProblems/Algorithms/easy/2Sum.js)                                                                                                           | Easy   | https://leetcode.com/problems/two-sum/                                                                              |\n| [Tic Tac Toe ](/LeetcodeProblems/Algorithms/easy/Tic_Tac_Toe.js)                                                                                               | Easy   |                                                                                                                     |\n| [Permutations With Duplicates ](/LeetcodeProblems/Algorithms/easy/Permutations_With_Duplicates.js)                                                             | Easy   |                                                                                                                     |\n| [Deletion Distance](/LeetcodeProblems/Algorithms/easy/Deletion_Distance.js)                                                                                    | Easy   |                                                                                                                     |\n| [Award Budget Cuts](/LeetcodeProblems/Algorithms/easy/Award_Budget_Cuts.js)                                                                                    | Easy   |                                                                                                                     |\n| [Happy Number](/LeetcodeProblems/Algorithms/easy/Happy_Number.js)                                                                                              | Easy   | https://leetcode.com/problems/happy-number/                                                                         |\n| [Shuffle String](/LeetcodeProblems/Algorithms/easy/Shuffle_String.js)                                                                                          | Easy   | https://leetcode.com/problems/shuffle-string/                                                                       |\n| [Reverse bit to make number equal](/LeetcodeProblems/Algorithms/easy/Bit_Reverse_To_Make_Numbers_Equal.js.js)                                                  | Easy   | https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/                                     |\n\n### Sorting Algorithms\n| Algoritmhs |\n|      -     |\n| [Heap Sort](/SortingAlgorithms/heapSort.js)  |\n| [Quick Sort](/SortingAlgorithms/QuickSort.js) |\n\n### Databases\n| Problems | Level | Link |\n|-|-|-|\n| [Trips and Users](/LeetcodeProblems/Databases/hard/Trips_and_Users.sql) | Hard | https://leetcode.com/problems/trips-and-users/ |\n| [Human Traffic of Stadium](/LeetcodeProblems/Databases/hard/Human_Traffic_of_Stadium.sql) | Hard | https://leetcode.com/problems/human-traffic-of-stadium |\n| [Rank Scores](/LeetcodeProblems/Databases/medium/Rank_Scores.sql) | Medium | https://leetcode.com/problems/rank-scores |\n| [Consecutive Numbers](/LeetcodeProblems/Databases/medium/Consecutive_Numbers.sql) | Medium | https://leetcode.com/problems/consecutive-numbers |\n| [Department Highest Salary](/LeetcodeProblems/Databases/medium/Department_Highest_Salary.sql) | Medium | https://leetcode.com/problems/department-highest-salary |\n| [Exchange Seats](/LeetcodeProblems/Databases/medium/Exchange_Seats.sql) | Medium | https://leetcode.com/problems/exchange-seats |\n| [Nth Highest Salary](/LeetcodeProblems/Databases/medium/nth_Highest_Salary.sql) | Medium | https://leetcode.com/problems/nth-highest-salary |\n| [Combine Two Tables](/LeetcodeProblems/Databases/easy/Combine_Two_Tables.sql) | Easy   | https://leetcode.com/problems/combine-two-tables |\n| [Second Highest Salary](/LeetcodeProblems/Databases/easy/Second_highest_salary.sql)| Easy   | https://leetcode.com/problems/second-highest-salary |\n| [Customers Who Never Order](/LeetcodeProblems/Databases/easy/Customers_Who_Never_Order.sql)| Easy |  https://leetcode.com/problems/customers-who-never-order |\n| [Reformat Department Table](/LeetcodeProblems/Databases/easy/Reformat_Department_Table.sql) | Easy | https://leetcode.com/problems/reformat-department-table |\n| [Employees Earning More Than Their Managers](/LeetcodeProblems/Databases/easy/Employees_Earning_More_Than_Their_Managers.sql) | Easy | https://leetcode.com/problems/employees-earning-more-than-their-managers/ |\n| [Delete Duplicate Emails](LeetcodeProblems/Databases/easy/Delete_Duplicate_Emails.sql) | Easy | https://leetcode.com/problems/delete-duplicate-emails |\n| [Rising Temperature](LeetcodeProblems/Databases/easy/Rising_Temperature.sql) | Easy | https://leetcode.com/problems/rising-temperature |\n\n### UtilsClasses\n\nOther languages provides built-in classes (e.g Linked List, Tree, etc). This module contains util classes to use in your problems. \n\n### Contributions\n\nI'd be pleased to accept contributions. I'd be happy to discuss problems and solutions over a Pull Request or an Issue.\n\nEach problem should have:\n\n1) A description of the problem at the top of the file.\n2) A test file with some test cases. The test file must export a `test()` function which should run all the tests of the file.\n3) An entry of the problem in the list of solutions within the README file.\n\nPR Example: https://github.com/ignacio-chiazzo/Algorithms-Leetcode-Javascript/pull/39\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fignacio-chiazzo%2Falgorithms-leetcode-javascript","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fignacio-chiazzo%2Falgorithms-leetcode-javascript","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fignacio-chiazzo%2Falgorithms-leetcode-javascript/lists"}