{"id":21047295,"url":"https://github.com/dancastillo/leetcode","last_synced_at":"2025-09-04T16:45:15.719Z","repository":{"id":95812121,"uuid":"395159461","full_name":"dancastillo/leetcode","owner":"dancastillo","description":"Solutions for different problems on leetcode.com written in JavaScript","archived":false,"fork":false,"pushed_at":"2024-03-09T19:05:37.000Z","size":100,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-13T22:27:45.799Z","etag":null,"topics":["javascript","leetcode","nodejs"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dancastillo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"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":"2021-08-12T01:25:39.000Z","updated_at":"2022-12-23T23:38:08.000Z","dependencies_parsed_at":"2023-11-24T18:29:58.126Z","dependency_job_id":"1db58f13-adfb-4b34-a0b8-c730542c48bd","html_url":"https://github.com/dancastillo/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dancastillo/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dancastillo%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dancastillo%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dancastillo%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dancastillo%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dancastillo","download_url":"https://codeload.github.com/dancastillo/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dancastillo%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273641173,"owners_count":25142243,"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","status":"online","status_checked_at":"2025-09-04T02:00:08.968Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["javascript","leetcode","nodejs"],"created_at":"2024-11-19T14:36:20.734Z","updated_at":"2025-09-04T16:45:15.670Z","avatar_url":"https://github.com/dancastillo.png","language":"JavaScript","readme":"LeetCode\n========\nLeetcode problems solved in JavaScript by [dancastillo](https://leetcode.com/dancastillo)\n\n\n| # | Title | Solution | Difficulty | Data Structure/Strategy |\n|---| ----- | -------- | ---------- |---------------|\n|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [JavaScript](./problems/twoSum.js)|Easy|\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [JavaScript](./problems/addTwoNumbers.js)|Medium|\n|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[JavaScript](./problems/longestSubstringWithoutRepeatingCharacters.js)|Medium|\n|5|[Longest Palindromic String](https://leetcode.com/problems/longest-palindromic-substring/)|[JavaScript](./problems/longestPalindromicString.js)|Medium|\n|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[JavaScript](./problems/containerWithMostWater.js)|Medium|Array|\n|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)[JavaScript](./problems/romanToInteger.js)|Easy|\n|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[JavaScript](./problems/longestCommonPrefix.js)|Easy||\n|15|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[JavaScript](./problems/3sumClosest.js)|Medium|Array|\n|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[JavaScript](./problems/letterCombinationsOfAPhoneNumber.js)|Medium||\n|18|[4Sum](https://leetcode.com/problems/4sum/)|[JavaScript](./problems/4sum.js)|Medium|Array|\n|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[JavaScript](./problems/removeNthNodeFromEndOfList.js)|Medium|\n|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)|[JavaScript](./problems/validParenthesis.js)|Easy|\n|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists//)|[JavaScript](./problems/mergeTwoSortedLists.js)|Easy|\n|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[JavaScript](./problems/generateParentheses.js)|Medium||\n|26|[Remove Duplicates from Sorted Array ](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[JavaScript](./problems/removeDuplicatesFromSortedArray.js)|Easy|\n|27|[Remove Element](https://leetcode.com/problems/remove-element/)|[JavaScript](./problems/removeElement.js)|Easy|\n|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[JavaScript](./problems/strStr.js)|Easy|\n|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[JavaScript](./problems/searchInRotatedSortedArray.js)|Medium|BST|\n|34|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)|[JavaScript](./problems/findFirstAndLastPositionOfElementInSortedArray.js)|Medium|BST|\n|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[JavaScript](./problems/searchInsert.js)|Easy|\n|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)|[JavaScript](./problems/validSudoku.js)|Medium|Hash Map|\n|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[JavaScript](./problems/combinationSum.js)|Medium|Backtrack|\n|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)|[JavaScript](./problems/jumpGameII.js)|Medium||\n|46|[Permutations](https://leetcode.com/problems/permutations/)|[JavaScript](./problems/permutations.js)|Medium|\n|48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[JavaScript](./problems/rotateImage.js)|Medium|Array|\n|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)|[JavaScript](./problems/groupAnagrams.js)|Medium|Hash Map|\n|52|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[JavaScript](./problems/maximumSubarray.js)|Easy|\n|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)|[JavaScript](./problems/lengthOfLastWord.js)|Easy|\n|66|[Plus One](https://leetcode.com/problems/plus-one/)|[JavaScript](./problems/plusOne.js)|Easy|\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[JavaScript](./problems/climbingStairs.js)|Easy|\n|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[JavaScript](./problems/removeDuplicatesFromSortedList.js)|Easy|Linked List|\n|88|[ Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[JavaScript](./problems/mergeSortedArray.js)|Easy|\n|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/submissions/)|[JavaScript](./problems/symmetricTree.js)|Easy|\n|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[JavaScript](./problems/maximumDepthOfBinaryTree.js)|Easy|BST|\n|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[JavaScript](./problems/convertSortedArrayToBinarySearchTree.js)|Easy|BST|\n|109|[Conver Sorted Array to BST](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|[JavaScript](./problems/convertSortedArrayToBst.js)|Easy|BST|\n|118|[Pascals Triangle](https://leetcode.com/problems/pascals-triangle)|[JavaScript](./problems/pascalsTriangle.js)|Easy|DP|\n|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|[JavaScript](./problems/validPalindrome.js)|Easy||\n|169|[Majority Element](https://leetcode.com/problems/majority-element/)|[JavaScript](./problems/majority-element.js)|Easy||\n|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)|[JavaScript](./problems/rotate-array.js)|Medium||\n|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|[JavaScript](./problems/isomorphicStrings.js)|Easy|Hashmap|\n|383|[Ransom Note](https://leetcode.com/problems/ransom-note/)|[JavaScript](./problems/ransomNote.js)|Easy|HashMap|\n|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)|[JavaScript](./problems/isSubsequence.js)|Easy|Two Pointers|\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdancastillo%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdancastillo%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdancastillo%2Fleetcode/lists"}