|
Https://leetcode.com/explore/challenge/card/august-leetcoding-challenge-2021/613/week-1-august-1st-august-7th/3871/
|
7
|
August 8, 2021
|
|
Https://leetcode.com/problems/binary-tree-paths/
|
5
|
August 2, 2021
|
|
Doubt on leetcode prblem
|
3
|
June 29, 2021
|
|
Word Break -II Leetcode
|
5
|
October 26, 2020
|
|
Word Search Leetcode
|
3
|
October 1, 2020
|
|
Ugly number dp question issue
|
2
|
September 10, 2020
|
|
Anybody can explain the logic?
|
3
|
July 26, 2020
|
|
Its giving index out of bound for 1 test case , but i dont know why :\
|
7
|
July 24, 2020
|
|
Giving wrong ans
|
1
|
July 17, 2020
|
|
My code giving wrong ans, why?
|
1
|
July 17, 2020
|
|
My code giving wrong ans here
|
1
|
July 17, 2020
|
|
My code giving wrong ans
|
1
|
July 17, 2020
|
|
Array exception but why?
|
4
|
July 14, 2020
|
|
Dp space optimization problem
|
3
|
July 3, 2020
|
|
You have to given an array A of size N. Find all the elements which appear more than floor(N/3) times in the given array. There is a condition that you have to do your job in O(N) time complexity and O(1) space complexity. 1<=N<=10^7 0<=Ai<=10^9
|
3
|
June 14, 2020
|
