@MeDeep_13 profile picture
Kuldeep Saharan @MeDeep_13
Joined November 2023
  • Tweets 187
  • Following 128
  • Followers 90
48 Photos and videos
Must practice questions while revising the sliding window: 1) Leetcode 239( use of deque) 2)Leetcode 1456 3) Leetcode 209(img here) 4) Leetcode 3 5) Leetcode 1248 6) Leetcode 992 #DSA #Leetcode #Connect
3
9
105
Learning web scraping is quite interesting. I regret that I'm doing it this late—a big thank you to @Alex_TheAnalyst for his wonderful and well-curated free videos on YouTube. #DataAnalytics #webscraping #pythonlearning
1
79
This guide is about binary search on LeetCode, which is what you need if you want to revise binary search and make it look easier with an amazing template. #LeetCode #DSA
1
5
145
Practising heaps. #leetcode #letsconnect #DSA
7
106
It's March and I just completed 50 days, not good... #leetcode #dsa #letsconnect
1
12
205
Can you help me with memoization of this code??? #DSA #letsconnect
4
92
Did this in O(n^2) TC in 30 minutes, wrote logic on a paper in 7 minutes, and the rest of the time came up with logical mistakes and dubbing. Will try to find a more optimized approach. Coding during exams... Any thoughts? #LeetCode #DSA #letsconnect
7
110
Today's POTD is the same as yesterday's, in fact, its easier. #letsconnect #DSA #LeetCode
7
84
POTD The for loop can be used for cleaner code(ChatGPT suggested ), otherwise, we can do it normally anyways. 1) Reading it, recursion clicks, if it doesn't then 2) Looking at the constraints n<=10, so if it's around 20 or less recursion must click. #letsconnect #DSA #LeetCode
4
71
I hate leetcode 😭, thanks for telling me I'm dumb:) Now ik why people do development. #letsconnect #DSA #LeetCode
14
287
I have been on LC for over a year now but this is my first design question which I did by taking help 😐, phewww. Need to do more to get a taste of all these. #LeetCode #letsconnect #DSA #potd
2
13
255
Did this DP question today! #LeetCode #DSA #letsconnect
6
81
I missed this in my last contest, but I finally did it with help. It uses the same concept I discussed in my last post. I used to check an element in a map using m[ele], but if the element does not exist it will create a value of 0 to it. #LeetCode #letsconnect #DSA
7
88
If we are finding divisors of a number say N, then we need not to check from 1 to N, instead we can use some maths here and improve the a TLE error! ------ continued below ------ #LeetCode #letsconnect #DSA #Maths
4
16
274
POTD! Reading it, I instantly knew it was a stack problem. #letsconnect #DSA #LeetCode
2
28
311
Load more