|
1 |
| -# Algorithms-Javascript |
| 1 | +# Algorithms-Javascript |
| 2 | + |
| 3 | + |
| 4 | + |
| 5 | +### Leetcode Problems |
| 6 | + |
| 7 | +| Name | Level | Link | |
| 8 | +| - | - | - | |
| 9 | +| [3Sum ](/LeetcodeProblems/3Sum.js) | Medium | https://leetcode.com/problems/3sum/ | |
| 10 | +| [Add Two Numbers ](/LeetcodeProblems/Add_Two_Numbers.js) | Medium | https://leetcode.com/problems/add-two-numbers/ | |
| 11 | +| [Backspace String Compare ](/LeetcodeProblems/Backspace_String_Compare.js) | Easy | https://leetcode.com/problems/backspace-string-compare/ | |
| 12 | +| [Binary Gap ](/LeetcodeProblems/Binary_Gap.js) | Easy | https://leetcode.com/problems/binary-gap/ | |
| 13 | +| [Clone Graph ](/LeetcodeProblems/Clone_Graph.js) | Medium | https://leetcode.com/problems/clone-graph/ | |
| 14 | +| [Coin Change ](/LeetcodeProblems/Coin_Change.js) | Medium | https://leetcode.com/problems/coin-change/ | |
| 15 | +| [Construct Binary Tree from Preorder and Inorder Traversal ](/LeetcodeProblems/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js) | Medium | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ | |
| 16 | +| [Design Circular Deque ](/LeetcodeProblems/Design_Circular_Deque.js) | Medium | https://leetcode.com/problems/design-circular-deque/ |
| 17 | +| [Edit Distance ](/LeetcodeProblems/Edit_Distance.js) | Hard | https://leetcode.com/problems/edit-distance/ | |
| 18 | +| [Escape The Ghosts ](/LeetcodeProblems/Escape_The_Ghosts.js) | Medium | https://leetcode.com/problems/escape-the-ghosts/ | |
| 19 | +| [Flood Fill ](/LeetcodeProblems/Flood_Fill.js) | Easy | https://leetcode.com/problems/flood-fill/ | |
| 20 | +| [Generate Parenthesis ](/LeetcodeProblems/Generate_Parenthesis.js) | Medium | https://leetcode.com/problems/generate-parentheses | |
| 21 | +| [Group Anagrams ](/LeetcodeProblems/Group_Anagrams.js) | Medium | https://leetcode.com/problems/group-anagrams/ |
| 22 | +| [Implement stack using queues ](/LeetcodeProblems/Implement_stack_using_queues.js) | Easy | https://leetcode.com/problems/implement-stack-using-queues/ | |
| 23 | +| [Kth Largest Element in an Array ](/LeetcodeProblems/Kth_Largest_Element_in_an_Array.js) | Medium | https://leetcode.com/problems/kth-largest-element-in-an-array/ | |
| 24 | +| [Linked List Cycle II ](/LeetcodeProblems/Linked_List_Cycle_II.js) | Medium | https://leetcode.com/problems/linked-list-cycle-ii/ | |
| 25 | +| [Longest Consecutive Sequence ](/LeetcodeProblems/Longest_Consecutive_Sequence.js) | Hard | https://leetcode.com/problems/longest-consecutive-sequence/ | |
| 26 | +| [Longest Palindromic Substring ](/LeetcodeProblems/Longest_Palindromic_Substring.js) | Medium | https://leetcode.com/problems/longest-palindromic-substring/ | |
| 27 | +| [Lowest Common Ancestor of a Binary Tree ](/LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js) | Medium | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ | |
| 28 | +| [Maximal Square ](/LeetcodeProblems/Maximal_Square.js) | Medium | https://leetcode.com/problems/maximal-square/ | |
| 29 | +| [Maximun Subarray ](/LeetcodeProblems/Maximun_Subarray.js) | Easy | https://leetcode.com/problems/maximum-subarray | |
| 30 | +| [Min Stack ](/LeetcodeProblems/Min_Stack.js) | Easy | https://leetcode.com/problems/min-stack/ | |
| 31 | +| [Minimum Window Substring ](/LeetcodeProblems/Minimum_Window_Substring.js) | Hard | https://leetcode.com/problems/minimum-window-substring/ | |
| 32 | +| [NQueens ](/LeetcodeProblems/NQueens.js) | Hard | https://leetcode.com/problems/n-queens/ | |
| 33 | +| [Number of Segments in a String ](/LeetcodeProblems/Number_of_Segments_in_a_String.js) | Easy | https://leetcode.com/problems/number-of-segments-in-a-string/ | |
| 34 | +| [Permutations ](/LeetcodeProblems/Permutations.js) | Medium | https://leetcode.com/problems/permutations/ | |
| 35 | +| [Permutations II ](/LeetcodeProblems/Permutations_II.js) | Medium | https://leetcode.com/problems/permutations-ii/ | |
| 36 | +| [Permutations Without Duplicates ](/LeetcodeProblems/Permutations_Without_Duplicates.js) | Medium | https://leetcode.com/problems/permutations/ | |
| 37 | +| [Regular Expression Matching ](/LeetcodeProblems/Regular_Expression_Matching.js) | Hard | https://leetcode.com/problems/regular-expression-matching/ | |
| 38 | +| [Restore IP Addresses ](/LeetcodeProblems/Restore_IP_Addresses.js) | Medium | https://leetcode.com/problems/restore-ip-addresses/ | |
| 39 | +| [Reverse String II ](/LeetcodeProblems/Reverse_String_II.js) | Easy | https://leetcode.com/problems/reverse-string-ii/ | |
| 40 | +| [Same Tree ](/LeetcodeProblems/Same_Tree.js) | Easy | https://leetcode.com/problems/same-tree/ | |
| 41 | +| [SearchIng Rotated Sorted Array ](/LeetcodeProblems/SearchIng_Rotated_Sorted_Array.js) | Medium | https://leetcode.com/problems/search-in-rotated-sorted-array/ | |
| 42 | +| [Search a 2D Matrix ](/LeetcodeProblems/Search_a_2D_Matrix.js) | Medium | https://leetcode.com/problems/search-a-2d-matrix/ | |
| 43 | +| [Search a 2D Matrix II ](/LeetcodeProblems/Search_a_2D_Matrix_II.js) | Medium | https://leetcode.com/problems/search-a-2d-matrix/ | |
| 44 | +| [Simplify Path ](/LeetcodeProblems/Simplify_Path.js) | Medium | https://leetcode.com/problems/simplify-path/ | |
| 45 | +| [Spiral Matrix ](/LeetcodeProblems/Spiral_Matrix.js) | Medium | https://leetcode.com/problems/spiral-matrix/ | |
| 46 | +| [Subsets ](/LeetcodeProblems/Subsets.js) | Medium | https://leetcode.com/problems/subsets/ | |
| 47 | +| [Sum Of Square Numbers ](/LeetcodeProblems/Sum_Of_Square_Numbers.js) | Easy | https://leetcode.com/problems/sum-of-square-numbers/ | |
| 48 | +| [Symmetric Tree ](/LeetcodeProblems/Symmetric_Tree.js) | Easy | https://leetcode.com/problems/symmetric-tree/ | |
| 49 | +| [Unique Binary Search Trees ](/LeetcodeProblems/Unique_Binary_Search_Trees.js) | Medium | https://leetcode.com/problems/unique-binary-search-trees/ | |
| 50 | +| [Unique Paths ](/LeetcodeProblems/Unique_Paths.js) | Medium | https://leetcode.com/problems/unique-paths/ | |
| 51 | +| [Valid Parentheses ](/LeetcodeProblems/Valid_Parentheses.js) | Easy | https://leetcode.com/problems/valid-parentheses/ | |
| 52 | +| [Verify Preorder Serialization of a Binary Tree ](/LeetcodeProblems/Verify_Preorder_Serialization_of_a_Binary_Tree.js) | Medium | https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/ | |
| 53 | +| [merge k sorted lists ](/LeetcodeProblems/merge_k_sorted_lists.js) | Hard | https://leetcode.com/problems/merge-k-sorted-lists/ | |
| 54 | +| [Tic Tac Toe ](/LeetcodeProblems/Tic_Tac_Toe.js) | | | |
| 55 | +| [Permutations With Duplicates ](/LeetcodeProblems/Permutations_With_Duplicates.js) | | | |
| 56 | +| [Deleteion Distance](/LeetcodeProblems/Deletion_Distance.js) | | | |
| 57 | + |
| 58 | + |
| 59 | + |
| 60 | +### Sorting Algorithms |
| 61 | +| Algoritmhs | |
| 62 | +| - | |
| 63 | +| [Heap Sort](/SortingAlgorithms/heapSort.js) | |
0 commit comments