Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/dancastillo/leetcode

Solutions for different problems on leetcode.com written in JavaScript
https://github.com/dancastillo/leetcode

javascript leetcode nodejs

Last synced: about 1 month ago
JSON representation

Solutions for different problems on leetcode.com written in JavaScript

Awesome Lists containing this project

README 

        
LeetCode

========

Leetcode problems solved in JavaScript by [dancastillo](https://leetcode.com/dancastillo)



| # | Title | Solution | Difficulty | Data Structure/Strategy |

|---| ----- | -------- | ---------- |---------------|

|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [JavaScript](./problems/twoSum.js)|Easy|

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [JavaScript](./problems/addTwoNumbers.js)|Medium|

|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[JavaScript](./problems/longestSubstringWithoutRepeatingCharacters.js)|Medium|

|5|[Longest Palindromic String](https://leetcode.com/problems/longest-palindromic-substring/)|[JavaScript](./problems/longestPalindromicString.js)|Medium|

|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[JavaScript](./problems/containerWithMostWater.js)|Medium|Array|

|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)[JavaScript](./problems/romanToInteger.js)|Easy|

|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[JavaScript](./problems/longestCommonPrefix.js)|Easy||

|15|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[JavaScript](./problems/3sumClosest.js)|Medium|Array|

|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[JavaScript](./problems/letterCombinationsOfAPhoneNumber.js)|Medium||

|18|[4Sum](https://leetcode.com/problems/4sum/)|[JavaScript](./problems/4sum.js)|Medium|Array|

|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[JavaScript](./problems/removeNthNodeFromEndOfList.js)|Medium|

|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)|[JavaScript](./problems/validParenthesis.js)|Easy|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists//)|[JavaScript](./problems/mergeTwoSortedLists.js)|Easy|

|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[JavaScript](./problems/generateParentheses.js)|Medium||

|26|[Remove Duplicates from Sorted Array ](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[JavaScript](./problems/removeDuplicatesFromSortedArray.js)|Easy|

|27|[Remove Element](https://leetcode.com/problems/remove-element/)|[JavaScript](./problems/removeElement.js)|Easy|

|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[JavaScript](./problems/strStr.js)|Easy|

|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[JavaScript](./problems/searchInRotatedSortedArray.js)|Medium|BST|

|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|

|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[JavaScript](./problems/searchInsert.js)|Easy|

|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)|[JavaScript](./problems/validSudoku.js)|Medium|Hash Map|

|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[JavaScript](./problems/combinationSum.js)|Medium|Backtrack|

|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)|[JavaScript](./problems/jumpGameII.js)|Medium||

|46|[Permutations](https://leetcode.com/problems/permutations/)|[JavaScript](./problems/permutations.js)|Medium|

|48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[JavaScript](./problems/rotateImage.js)|Medium|Array|

|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)|[JavaScript](./problems/groupAnagrams.js)|Medium|Hash Map|

|52|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[JavaScript](./problems/maximumSubarray.js)|Easy|

|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)|[JavaScript](./problems/lengthOfLastWord.js)|Easy|

|66|[Plus One](https://leetcode.com/problems/plus-one/)|[JavaScript](./problems/plusOne.js)|Easy|

|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[JavaScript](./problems/climbingStairs.js)|Easy|

|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)|[JavaScript](./problems/removeDuplicatesFromSortedList.js)|Easy|Linked List|

|88|[ Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[JavaScript](./problems/mergeSortedArray.js)|Easy|

|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/submissions/)|[JavaScript](./problems/symmetricTree.js)|Easy|

|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[JavaScript](./problems/maximumDepthOfBinaryTree.js)|Easy|BST|

|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|

|109|[Conver Sorted Array to BST](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|[JavaScript](./problems/convertSortedArrayToBst.js)|Easy|BST|

|118|[Pascals Triangle](https://leetcode.com/problems/pascals-triangle)|[JavaScript](./problems/pascalsTriangle.js)|Easy|DP|

|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|[JavaScript](./problems/validPalindrome.js)|Easy||

|169|[Majority Element](https://leetcode.com/problems/majority-element/)|[JavaScript](./problems/majority-element.js)|Easy||

|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)|[JavaScript](./problems/rotate-array.js)|Medium||

|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|[JavaScript](./problems/isomorphicStrings.js)|Easy|Hashmap|

|383|[Ransom Note](https://leetcode.com/problems/ransom-note/)|[JavaScript](./problems/ransomNote.js)|Easy|HashMap|

|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)|[JavaScript](./problems/isSubsequence.js)|Easy|Two Pointers|