π #Day51 of #LeetCode75
π 208. Implement Trie (Prefix Tree)
π§ Intuition:
Store words as paths β shared prefixes = faster search
β±οΈ TC: O(n)
πΎ SC: O(N*M)
π‘ Tries = backbone of autocomplete π₯
Consistency builds skill.
#DSA #Coding #Developer
#cohort3.0 @sheryians_
1
Jun 12
π Day 49 of #LeetCode75
π³ Binary Tree BFS
Q1161: Maximum Level Sum
π‘ Not every deeper level is stronger β measure level by level!
βοΈ BFS β compute sum per level β track max
β±οΈ O(n) | π¦ O(n)
Consistency is the real algorithm. πͺ
#cohort3.0 @sheryians_ @ali_In_bits
1
6
Jun 11
Day48 of #LeetCode75
β
Q.199 Binary Tree Right Side View
π‘ Intuition:
Right view = last node at each level
βοΈ Approach:
Use BFS (level order traversal) & pick last node of every level
β±οΈ T: O(n)|π¦S: O(n)
Consistency>MotivationKeep going πͺ
#cohort3.0 @sheryians_ @ali_In_bits
1
Jun 9
π Day 46 of #LeetCode75
π Path Sum III (Binary Tree DFS)
π§ Key Idea:
Start from EVERY node, not just root!
βοΈ DFS recursive sum tracking
β±οΈ O(NΒ²) | πΎ O(H)
β¨ Small insight: Problems get easier when you stop thinking linearly.
#DSA @sheryians_ @ali_In_bits
6
Jun 8
#Day45 of #LeetCode75 π
Q1g
π‘ Track max value from root β node
If current β₯ max_so_far β good node
βοΈ DFS state passing
β±οΈ O(n) | π¦ O(h)
Small insight, big impact π―
#LeetCode #DSA #BinaryTree @sheryians_ @ali_In_bits
6
Jun 7
π #Day 44 #LeetCode75
Q2300 Successful Pairs β
Brute β β Binary Search β
π§ Find min potion for each spell
βοΈ Sort first valid index
π Count = n - index
β±οΈ O(n log m)
π₯ BS = finding boundaries
#cohort3.0
#DSA #Coding @sheryians_ @ali_In_bits
6
Jun 5
π #Day42 of #LeetCode75
β
Q1318: Minimum Flips to Make a OR b Equal to c
π‘ Bit Manipulation
π§ Idea: Solve bit by bit
c = 1 β need at least one 1
c = 0 β both must be 0
βοΈ Time: O(1) | Space: O(1)
Small steps daily = big results π
#DSA #Coding #Programmer @sheryians_
1
2
20
May 20
π Day 26 #LeetCode75
π§ 1207. Unique Number of Occurrences
π‘ Trick: Donβt check numbers β check their frequencies
βοΈ Approach:
HashMap β count
HashSet β check uniqueness
β±οΈ O(n) time | O(n) space
Consistency > Motivation π―
#cohort3.0
#DSA #Java. @sheryians_ @ali_In_bits
2
20
May 15
π Day 21 of #LeetCode75
β
Asteroid Collision (Stack)
π‘ Intuition: Simulate collisions using stack (like resolving conflicts step by step)
βοΈ Approach:
Push positive asteroids
Resolve when negative appears
Compare sizes β destroy accordingly
β±οΈ O(n) time | O(n) space
1
2
51
May 3
Day9 of #LeetCode75 π
Solved: Increasing Triplet Subsequence
π§ Intuition: Track 2 smallest values while iterating
βοΈ If num > second > first β Triplet found β
β±οΈ O(n) | π¦ O(1)
From O(nΒ³) β O(n) π€―
Small optimizations = BIG impact. Keep building πͺ
@sheryians_ @harshbhaiyaa
1
3
238
Jan 26
1 / LeetCode 75
Solved 2 problems today
Kids With the Greatest Number of Candies
β Key idea: compare against global max, not every kid
Merge Strings Alternately
β Two pointers safety checks
β Important lesson: while controls loop, if ensures bounds safety
#LeetCode75 #DSA
4
56
Jan 24
Completed LeetCode 75 π»π
Grateful for the grind & the learnings π
#LeetCode75 #GratefulToLeetCode #DSA π
1
7
75
Jan 19
Starting a new public journey
Iβve completed the #LeetCode75 DSA challenge,and now Iβm committing to deepening my understanding of Data Structures &Algorithms in C by learning in public.
Focus:
βStrong fundamentals
βClean problem-solving
βLong-term growth in tech
Letβs build.
1
29
577
Holo.....Developers
My leetcode profile : leetcode.com/u/zoolpher/
#LeetCode Day 14
# 328 (medium) : Odd Even Linked List
# 2130 (medium) : Maximum twin sum of a Linked List
#DSA #Datastructure #LeetCode75
2
14
Jan 14
π₯ Problem of the Day: Maximum Level Sum of a Binary Tree
Approach:
Language: C
Difficulty: Medium
β
Passed all testcases
#DSA #LeetCode75
2
11
Jan 13
π₯ Problem of the Day: Binary Tree Right Side View
Approach:
Language: C
Difficulty: Medium
β
Passed all testcases
#DSA #LeetCode75
2
13
Jan 10
π₯ Problem of the Day: Robot Return to Origin
Approach:
Language: C
Difficulty: Easy
β
Passed all testcases
#DSA #LeetCode75
2
11
π₯ Problem of the Day: Path sum 3
Approach:
Language: C
Difficulty: Medium
β
Passed all testcases
#DSA #LeetCode75
1
2
14
π₯ Problem of the Day: Leaf-Similar Trees
Approach:
Language: C
Difficulty: Easy
β
Passed all testcases
#DSA #LeetCode75
2
13
π₯ Problem of the Day: Repeated Substring Pattern
Approach:
Language: C
Difficulty: Easy
β
Passed all testcases
#DSA #LeetCode75
2
11