https://github.com/sakr2000/problem-solving
problem solving with JavaScript
https://github.com/sakr2000/problem-solving
Last synced: 4 months ago
JSON representation
problem solving with JavaScript
- Host: GitHub
- URL: https://github.com/sakr2000/problem-solving
- Owner: sakr2000
- Created: 2023-10-25T12:51:06.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-11-22T22:52:18.000Z (about 1 year ago)
- Last Synced: 2025-03-22T14:43:46.313Z (9 months ago)
- Language: JavaScript
- Homepage:
- Size: 23.4 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Problem solving with JavaScript
This repo is to keep track of the problems i solve using JS in various sites.
### Profile Links :
- [LeetCode](https://leetcode.com/sakr83117/)
- [CodeWars](https://www.codewars.com/users/Sakr2000)
## Problems
### Easy :
| Index | Site | Problem Title | Problem Link | Solution |
| :---: | :------: | :----------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------: |
| 1 | CodeWars | Create Phone number | [Problem](https://www.codewars.com/kata/525f50e3b73515a6db000b83) | [Solution](problems/Create-Phone-Number.js) |
| 2 | CodeWars | Sum without highest and lowest number | [Problem](https://www.codewars.com/kata/576b93db1129fcf2200001e6) | [Solution](problems/Sum-without-highest-and-lowest.js) |
| 3 | CodeWars | You're a square! | [Problem](https://www.codewars.com/kata/54c27a33fb7da0db0100040e) | [Solution](problems/you_are_a_square.js) |
| 4 | CodeWars | Sum of positive | [Problem](https://www.codewars.com/kata/5715eaedb436cf5606000381) | [Solution](problems/sumOfPositives.js) |
| 5 | LeetCode | Counter II | [Problem](https://leetcode.com/problems/counter-ii/?envType=study-plan-v2&envId=30-days-of-javascript) | [Solution](problems/counterII.js) |
| 6 | LeetCode | Filter Elements from Array | [Problem](https://leetcode.com/problems/filter-elements-from-array/description/?envType=study-plan-v2&envId=30-days-of-javascript) | [Solution](problems/2634.FilterElementsfromArray.js) |
| 7 | LeetCode | Array Reduce Transformation | [Problem](https://leetcode.com/problems/array-reduce-transformation/?envType=study-plan-v2&envId=30-days-of-javascript) | [Solution](problems/2626.ArrayReduceTransformation.js) |
| 8 | LeetCode | Function Composition | [Problem](https://leetcode.com/problems/function-composition/description/?envType=study-plan-v2&envId=30-days-of-javascript) | [Solution](problems/2629.FunctionComposition.js) |
| 9 | LeetCode | Two Sum | [Problem](https://leetcode.com/problems/two-sum/description/) | [Solution](problems/1.Two_Sum.js) |
| 10 | LeetCode | Linked List Cycle | [Problem](https://leetcode.com/problems/linked-list-cycle/description/) | [Solution](problems/141.Linked_List_Cycle.js) |
| 11 | LeetCode | Middle of the Linked List | [Problem](https://leetcode.com/problems/middle-of-the-linked-list/description/) | [Solution](problems/876.Middle_of_the_Linked_List.js) |
| 12 | LeetCode | Add Two promises | [Problem](https://leetcode.com/problems/add-two-promises/description/) | [Solution](problems/Add_Two_promises.js) |
| 13 | LeetCode | Count Elements With Maximum Frequency | [Problem](https://leetcode.com/problems/count-elements-with-maximum-frequency/) | [Solution](problems/3005.Count_Elements_With_Maximum_Frequency.js) |
| 14 | LeetCode | Timeout Cancellation | [Problem](https://leetcode.com/problems/timeout-cancellation/description/) | [Solution](problems/2715.Timeout_Cancellation.js) |
| 15 | LeetCode | Interval Cancellation | [Problem](https://leetcode.com/problems/interval-cancellation/description/) | [Solution](problems/2725.Interval_Cancellation.js) |
| 16 | LeetCode | Minimum Common Value | [Problem](https://leetcode.com/problems/minimum-common-value/description/) | [Solution](problems/2540.Minimum_Common_Value.js) |
| 17 | LeetCode | Intersection of Two Arrays | [Problem](https://leetcode.com/problems/intersection-of-two-arrays/description/) | [Solution](problems/349.Intersection_of_Two_Arrays.js) |
| 18 | LeetCode | Is Object Empty | [Problem](https://leetcode.com/problems/is-object-empty/description/) | [Solution](problems/2727.Is_Object_Empty.js) |
| 19 | LeetCode | Find the Pivot Integer | [Problem](https://leetcode.com/problems/find-the-pivot-integer/description/) | [Solution](problems/2485.Find_the_Pivot_Integer.js) |
| 20 | LeetCode | Largest Positive Integer That Exists With Its Negative | [Problem](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/description/) | [Solution](problems/LargestPositiveIntegerThatExistsWithItsNegative.js) |
### Medium :
| Index | Site | Problem Title | Problem Link | Solution |
| :---: | :------: | :--------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------: |
| 1 | LeetCode | Find Bottom Left Tree Value | [Problem](https://leetcode.com/problems/find-bottom-left-tree-value/description/?envType=daily-question&envId=2024-02-28) | [Solution](problems/513.Find%20Bottom%20Left%20Tree%20Value.js) |
| 2 | CodeWars | Find the parity Outlier | [Problem](https://www.codewars.com/kata/5526fc09a1bbd946250002dc) | [Solution](problems/FindTheParityOutlier.js) |
| 3 | LeetCode | Remove Nth Node From End of List | [Problem](https://leetcode.com/problems/remove-nth-node-from-end-of-list/?envType=daily-question&envId=2024-03-03) | [Solution](problems/19.Remove_Nth_NodeFromEndofList.js) |
| 4 | LeetCode | Bag of Tokens | [Problem](https://leetcode.com/problems/bag-of-tokens/) | [Solution](problems/948.Bag_of_Tokens.js) |
| 5 | LeetCode | Minimum Length of String After Deleting Similar Ends | [Problem](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/) | [Solution](problems/1750.Minimum_Length_of_String_After_Deleting_Similar_Ends.js) |
| 6 | LeetCode | Memoize | [Problem](https://leetcode.com/problems/memoize/description/) | [Solution](problems/2623.Memoize.js) |
| 7 | LeetCode | Custom Sort String | [Problem](https://leetcode.com/problems/custom-sort-string/) | [Solution](problems/Custom_Sort_String.js) |
| 8 | LeetCode | Promise Time Limit | [Problem](https://leetcode.com/problems/promise-time-limit/description/) | [Solution](problems/2637.Promise_Time_Limit.js) |
| 9 | LeetCode | Remove Zero Sum Consecutive Nodes from Linked List | [Problem](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/) | [Solution](problems/1171.Remove_Zero_Sum_ConsecutiveNodes_from_Linked_List.js) |
| 10 | LeetCode | Contiguous Array | [Problem](https://leetcode.com/problems/contiguous-array/description/) | [Solution](problems/525.ContiguousArray.js) |
| 11 | LeetCode | Binary Subarrays With Sum | [Problem](https://leetcode.com/problems/binary-subarrays-with-sum/description/) | [Solution](problems/930.Binary_Subarrays_With_Sum.js) |