Algorithms-Made-Easy-May-Challenges
Algorithms Made Easy May 10 day 30 problems Challenge
Hi
👨🎓
, I'm Rohit Kumar Singh
All Leetcode Soluton
Connect with me:
Languages Used:
Day 1:
Question 1 : Find the first and last position of element in sorted array
Time Complexity
Space Complexity
O(lon n)
O(1)
Question 2 : Powerful Integers
Time Complexity
Space Complexity
O(N * M)
O(N * M) where N=logx(bound) and M=logy (bound)
Question 3: Brick Wall
Time Complexity
Space Complexity
O(No.of Bricks)
O(Width of wall)
Day 2:
Question 1 : Prefix and suffix search
Question 2 : Spiral Matrix
Time Complexity
Space Complexity
O(row * col)
O(row * col)
Question 3: House Robber
Time Complexity
Space Complexity
O(n)
O(n)
Day 3:
Question 1 : Search in rotated sorted array ii
Time Complexity
Space Complexity
O(log n)
O(1)
Question 2 : Maximum product of two elements in an array
Time Complexity
Space Complexity
O(n)
O(1)
Question 3: Course Schedule iii
Time Complexity
Space Complexity
O(nlogn)
O(n)
Day 4:
Question 1 : Running sum of 1d array
Time Complexity
Space Complexity
O(n)
O(1)
Question 2 : Sort List
Time Complexity
Space Complexity
O(nlogn)
O(logn)
Question 3: Sort an Array
Time Complexity
Space Complexity
O(nlogn)
O(n)
Day 5:
Question 1 : Se zero matrix
Time Complexity
Space Complexity
O(n * n)
O(1)
Question 2 : Non decreasing array
Time Complexity
Space Complexity
O(n)
O(1)
Question 3: Sudoku
Time Complexity
Space Complexity
O(9^(n* n))
O(n * n)
Day 6:
Question 1 : Convert sorted list to binary search tree
Time Complexity
Space Complexity
O(n )
O(1)
Question 2 : Jump game ii
Time Complexity
Space Complexity
O(n)
O(1)
Question 3: Longest word in dictionary
Time Complexity
Space Complexity
O(n logn)
O(n)
Day 7:
Question 1 : Delete Node in a BST
Time Complexity
Space Complexity
O(height )
O(1)
Question 2 : Subsets
Question 3: Delete operation for two strings
Time Complexity
Space Complexity
O(mn)
O(mn)
Day 8:
Question 1 : Rotate Image
Time Complexity
Space Complexity
O(n * n )
O(1)
Question 2 : Rotate Array
Time Complexity
Space Complexity
O(n)
O(1)
Question 3: Reverse Nodes in K group
Time Complexity
Space Complexity
O(n)
O(n/k)
Day 9:
Question 1 : Reverse Integer
Time Complexity
Space Complexity
O(n)
O(1)
Question 2 : Super Palindrome
Question 3: 3 Sum
Time Complexity
Space Complexity
O(nlogn)
O(n * n)
Day 10:
Question 1 : Single Number
Time Complexity
Space Complexity
O(n)
O(1)
Question 2 : Single Number ii
Time Complexity
Space Complexity
O(n)
O(1)
Question 3: Trapping Rain Water
Time Complexity
Space Complexity
O(n)
O(1)