Sherxon

4 ms·

1. 1.▲
   by Sherxon 9y ago

   cool (y) I wonder how much time did u spend everyday
2. 2.▲
   by Sherxon 9y ago

   Yes, many problems are the same as leetcode problems. The purpose of this repo is just learning.
3. 3.▲
   by Sherxon 9y ago

   You are right, thinking logically is always better option than memorizing solutions. To have a good thinking ability, one needs practice. Solving many problems leads you to think different approaches, compute running time and space complexi
4. 4.▲
   by Sherxon 9y ago

   Right, Deque is also another option, which has the same amortized time complexity and but extra O(n) space is required for Queue. In the given solution, O(n) time complexity and O(1) space is used
5. 5.▲
   by Sherxon 9y ago

   i fixed the link, thanks (y)
6. 6.▲
   by Sherxon 9y ago

   Thank you for your comment, I added all problem statements. Find Duplicates are correct and tested against 100 test cases. Problem statement is not what u thought I think. Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), som
7. 7.▲
   Linked List Common Problems and Solutions(sherxon.com)

   2 points by Sherxon 10y ago|0 comments
8. 8.▲
   Binary Tree Common Problems and Solutions(sherxon.com)

   3 points by Sherxon 10y ago|0 comments