Explore tweets tagged as #LeetCodePOTD
#LeetcodePoTD #BinarySearch.Another variation of binary search.- distance range varies from 1 to n-1 and has to check if possible at each distance.- โโโโโ
โ
โ
(pattern for BS).- tricky to find mid because buckets don't have all numbers
1
0
0
#SlidingWindow #LeetcodePoTD.- felt easy/basic example of sliding window.- able to easily identify the pattern.- the only thing to take care of is, increasing/decreasing the count of happy customers when the window slides or expands (initially)
0
0
0
Nice Question to start your day with ๐ฅ. Hint : Do not think much + Just simple Graph walk concept ๐ค๐. #LeetcodePOTD
0
0
1
๐
๐๐๐ฒ-๐๐๐: ๐๐๐ & ๐๐๐ฏ [ ๐
๐ข๐ฑ๐ข๐ง๐ ๐๐ฎ๐ญ๐ก & ๐๐ฆ๐๐ข๐ฅ ๐๐๐ ๐ข๐ ] โ๏ธ. ๐๐ข๐ญ๐ก๐ฎ๐: #Day150 #DSA #LeetCodePOTD #Development #Supabase #EmailAuth #UserAuthentication #ReactNative #ImageProcessing #SystemDesign #TechJourney
0
0
2
Day 254 of #DailyCoding: Tackled "Maximum Difference Between Even and Odd Frequency II" on #LeetCode! My O(n) solution with prefix sums & parity tracking was a beast to crack! Still grinding on Day 223 of #LeetCodePOTD! #Programming #LeetCodeChallenge #TechTwitter
1
0
12
Koi baat nahi, karke wapas aata hu ๐ฅน. #LeetcodePOTD #CodingLife #RelatableReels #DSAMemes #EngineerHumor #StudentStruggles #CodeLife #ProgrammingHumor #TechMemes #LifeOfACoder #FunnyReels #DailyStruggles #CodersOfInstagram #StudyMeme #DSAReels #ReelComedy #CodeWithMIK
0
1
18
Day 103 .- Solved @LeetCodePOTD: Count Good Numbers (Maths).- Solved @GeeksforGeeks: Clone an Undirected Graph
0
0
1
Leetcode POTD. I did Spiral Matrix I(Leetcode 5) before. so it was easy using the same logic(Thanks to Neetcode) #Leetcode #LeetcodePOTD #POTD #DSA
0
0
5
Can You Split a String into K Palindromes? Letโs Find Out! (leetcode POTD). 1๏ธโฃ Count character frequencies. 2๏ธโฃ Count odd-frequency characters. 3๏ธโฃ Return True if odd counts โค K, else False. @takeUforward_ #happycoding #leetcodepotd
1
0
2
Completed today's LeetCode Problem of the Day: 'Map of Highest Peak' ๐๐๏ธ. Happy to have solved all 59 test cases successfully! ๐ป #LeetCodePOTD #Coding
0
0
3
Day 105 .- Solved @LeetCodePOTD: Count the Number of Good Subarrays (Sliding Window).- Solved @GeeksforGeeks: Floyd Warshall
0
0
1
Day 104.- Solved @LeetCodePOTD: Count Good Triplets (Brute Force).- Solved @GeeksforGeeks: Alien Dictionary (A lot of Brainstorm ;( )
0
0
1
Day 105 .- Solved @LeetCodePOTD: Count Good Triplets in an Array (Khandani Segment Tree Problem).- Solved @GeeksforGeeks: Bellman-Ford
0
0
1
LeetCode POTD: Learned a new concept - counting numbers between [1, n] without extra space. Bit Manipulation is crazy!.Thanks @CSwithMIK ๐.#LeetCodePOTD #DSA
0
0
2
After playing around with the brute-force approach, letโs put some strategy into our remapping! We donโt need to test all digits โ just the ones that actually exist in the number. Letโs break it down smartly:-.#LeetCode #sundayvibes #LeetCodePOTD #DataStructures
1
0
1