
Pranav Hegde
@pranav_hegde80
Followers
63
Following
128
Media
240
Statuses
343
๐ Tech Enthusiast | ๐ป Learning DSA & Solving Problems | 1๐ on CodeChef| GFG : https://t.co/rccWeXfrCB
India
Joined December 2024
๐ Day 160/365 #365DaysOfCodeโ
. ๐ฅ Solved GFGโs "String Counting" #geeksforgeeks. โก Approach:Frequency Counting + Combinatorics . โฑ๏ธ T.C:O(n) | ๐พ S.C: O(1) . ๐ก Key Insight: Count character pairs to avoid brute force! . #DSA #Combinatorics #algorithm .#ProblemSolving
1
0
4
๐ Day 160/365 #365DaysOfCodeโ
. ๐ฅ Solved GFGโs "String Counting" #geeksforgeeks. โก Approach:Frequency Counting + Combinatorics . โฑ๏ธ T.C:O(n) | ๐พ S.C: O(1) . ๐ก Key Insight: Count character pairs to avoid brute force! . #DSA #Combinatorics #algorithm .#ProblemSolving
0
0
1
๐ข Day 159/365 #365DaysOfCodeโ
. ๐ฏ Solved "Count Pairs" Challenge! . โก Approach: Binary Search (Lower/Upper Bound) . โฑ๏ธ T.C:O(n log n) | ๐พ S.C: O(1) . ๐ Initially did it through .Brute Force โ Optimized with Binary Search! . #DSA #BinarySearch #Optimization #Coding
0
0
1
๐ข Day 159/365 #365DaysOfCodeโ
. ๐ฏ Solved "Count Pairs" Challenge! . โก Approach: Binary Search (Lower/Upper Bound) . โฑ๏ธ T.C:O(n log n) | ๐พ S.C: O(1) . ๐ Initially did it through .Brute Force โ Optimized with Binary Search! . #DSA #BinarySearch #Optimization #Coding
0
0
0
๐ Day 158/365 #365DaysOfCodeโ
. ๐งน Solved "Remove Duplicates from Unsorted LL"! #geeksforgeeks. โก Approach:Hash Map Tracking . โฑ๏ธ T.C:O(n) | ๐พ S.C:O(n) . ๐กKey Insight:Track seen nodes with hash map to eliminate duplicates! . #DSA #LinkedList #HashMaps #Coding
0
1
3
๐ Day 158/365 #365DaysOfCodeโ
. ๐งน Solved "Remove Duplicates from Unsorted LL"! #geeksforgeeks. โก Approach:Hash Map Tracking . โฑ๏ธ T.C:O(n) | ๐พ S.C:O(n) . ๐กKey Insight:Track seen nodes with hash map to eliminate duplicates! . #DSA #LinkedList #HashMaps #Coding
0
0
0
๐ก Day 157/365 #365DaysOfCode โ
. ๐ฏ Solved "k-1 Distinct Substrings"! @geeksforgeeks. โก Approach:Sliding Window + Hash Map. โฑ๏ธ T.C:O(n) | ๐พ S.C: O(k) . ๐กKey Insight: Track char counts in window of size k! . #DSA #SlidingWindow #Strings #Coding.#LearnInPublic
1
0
3
๐ก Day 157/365 #365DaysOfCode โ
. ๐ฏ Solved "k-1 Distinct Substrings"! @geeksforgeeks. โก Approach:Sliding Window + Hash Map. โฑ๏ธ T.C:O(n) | ๐พ S.C: O(k) . ๐กKey Insight: Track char counts in window of size k! . #DSA #SlidingWindow #Strings #Coding.#LearnInPublic
0
0
0
๐ Day 156/365 #365DaysOfCode โ
. ๐ฅ Solved "Two Swaps Sorting"! @geeksforgeeks. โก Approach: Index Matching + Smart Swaps . โฑ๏ธ T.C: O(n) . ๐พ S.C:O(n) . ๐ก Key Insight:Match indices & count swaps needed! . #DSA #Sorting #Arrays #ProblemSolving #LearnInPublic .#consistency
0
0
2
๐ Day 156/365 #365DaysOfCode โ
. ๐ฅ Solved "Two Swaps Sorting"! @geeksforgeeks. โก Approach: Index Matching + Smart Swaps . โฑ๏ธ T.C: O(n) . ๐พ S.C:O(n) . ๐ก Key Insight:Match indices & count swaps needed! . #DSA #Sorting #Arrays #ProblemSolving #LearnInPublic .#consistency
0
0
1
๐ฎ Day 155/365 #365DaysOfCode โ
. ๐ Solved "Gold is Old" Quest Problem! @geeksforgeeks. โก Approach: Max-Heap + Greedy . โฑ๏ธ T.C: O(n log n) . ๐พ S.C: O(n) . ๐กKey Insight:Always pick the highest EXP gain you qualify for!. #DSA #Heap #Greedy #problemSolving #LearnInPublic
0
0
0
๐ฎ Day 155/365 #365DaysOfCode โ
. ๐ Solved "Gold is Old" Quest Problem! @geeksforgeeks. โก Approach: Max-Heap + Greedy . โฑ๏ธ T.C: O(n log n) . ๐พ S.C: O(n) . ๐กKey Insight:Always pick the highest EXP gain you qualify for!. #DSA #Heap #Greedy #problemSolving #LearnInPublic
0
0
0
๐ฝ๏ธ Day 153/365 #365DaysOfCodeโ
. ๐ฐ Solved "Friends' Dining Problem"! @geeksforgeeks. โก Approach: Pair Sorting + Greedy . โฑ๏ธ T.C: O(n log n) | ๐พ S.C: O(n) . ๐กKey Insight: Sort by price & pick cheapest non-disliked options! . #DSA #Greedy #Sorting #ProblemSolving
0
0
0
๐ฝ๏ธ Day 154/365 #365DaysOfCodeโ
. ๐ฐ Solved "Friends' Dining Problem"! @geeksforgeeks. โก Approach: Pair Sorting + Greedy . โฑ๏ธ T.C: O(n log n) | ๐พ S.C: O(n) . ๐กKey Insight: Sort by price & pick cheapest non-disliked options! . #DSA #Greedy #Sorting #ProblemSolving
0
0
0
๐ข Day 151/365 #365DaysOfCode โ
@geeksforgeeks. ๐ฅ Solved "Next Greater Frequency Element"!. โกApproach: Stack + Frequency Map . โฑ๏ธ T.C:O(n) | ๐พ S.C: O(n). ๐ก Key Insight: Track frequencies & use stack to find next higher freq! . #DSA #Stack #Array.#Coding #algorithm
0
0
5
๐ข Day 151/365 #365DaysOfCode โ
@geeksforgeeks. ๐ฅ Solved "Next Greater Frequency Element"!. โกApproach: Stack + Frequency Map . โฑ๏ธ T.C:O(n) | ๐พ S.C: O(n). ๐ก Key Insight: Track frequencies & use stack to find next higher freq! . #DSA #Stack #Array.#Coding #algorithm
0
0
0
๐ Day 150 of #365DaysOfCode. Solved: Largest Subarray with 0 Sum ๐ง @geeksforgeeks. Used: Prefix Sum + HashMap ๐งฉ.๐จโ๐ป T.C: O(n) . S.C: O(n). Code it โ Debug it โ Learn it ๐ฅ.#DSA #GFG #ProblemSolving #CodingJourney #LearnInPublic
0
0
0
๐ Day 150 of #365DaysOfCode. Solved: Largest Subarray with 0 Sum ๐ง @geeksforgeeks. Used: Prefix Sum + HashMap ๐งฉ.๐จโ๐ป T.C: O(n) . S.C: O(n). Code it โ Debug it โ Learn it ๐ฅ.#DSA #GFG #ProblemSolving #CodingJourney #LearnInPublic
0
0
0