You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-3
Original file line number
Diff line number
Diff line change
@@ -121,7 +121,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
121
121
| 1480 |[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Java](./Java/running-sum-of-1d-array.java)|_O(N)_|_O(N)_| Easy | Simple sum ||
122
122
| 42 |[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)|[Python](./Python/trapping_rain.py)|_O(N^2)_|_O(N)_| Hard | Array ||
123
123
| 11 |[Container with Most Water](https://leetcode.com/problems/container-with-most-water/)|[Python](./Python/container_with_most_water.py)|_O(N)_|_O(N)_| Medium | Array Two Pointers ||
| 002 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Java](./Java/add-two-numbers.java)|_O(n)_|_O(n)_| Medium | Math ||
173
+
| 002 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Java](./Java/Add-Two-Numbers.java)|_O(n)_|_O(n)_| Medium | Math ||
174
174
| 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[Java](./Java/remove-nth-node-from-end-of-list.java)|_O(n)_|_O(1)_| Medium | Two pointers ||
175
175
| 23 |[Merge K sorted lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[C++](./C++/merge-k-sorted-lists.cpp)|_O(nlogn)_|_O(n)_| Hard | sorting and append ||
176
176
| 109 |[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)|[Java](./Java/convert-sorted-list-to-binary-search-tree.java)|_O(n)_|_O(n)_| Medium | LinkedList ||
@@ -297,7 +297,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
297
297
| 326 |[Power of Three](https://leetcode.com/problems/power-of-three)|[Java](./Java/Power-of-Three.java)|_O(logn)_|_O(n)_| Easy | Math ||
298
298
| 12 |[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|[Java](./Java/integer-to-roman.java)|_O(n)_|_O(1)_| Medium | Math ||
299
299
| 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[Java](./Java/roman-to-integer.java)|_O(n)_|_O(1)_| Easy | Math ||
300
-
| 14 |[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Java](./Java/arithmetic-subarrays.java)|_O(m*n)_|_O(n)_| Medium | Math | Pattern Count |
300
+
| 14 |[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Java](./Java/Arithmetic-Subarrays.java)|_O(m*n)_|_O(n)_| Medium | Math | Pattern Count |
0 commit comments