#365daysofcodesolved search results
๐ Day 24/365 โ #365DaysOfCodeSolved: ๐งฉ Longest Subarray with Sum = K๐น Sliding Window โ works only for positives ๐น Prefix Sum + HashMap โ handles +ve & โve ๐น Key idea: store first occurrence of prefix sum๐ Learned when to switch approaches #DSA #LeetCode #ProblemSolving
๐ Day 34/365 โ #365DaysOfCodeSolved: ๐ค Longest Substring Without Repeating Characters๐น Approach 1: Brute Force (O(nยฒ)) ๐น Approach 2: Sliding Window + Hashing (O(n))๐ Learned how optimizing window movement reduces complexity drastically #LeetCode #SlidingWindow
๐ Day 25/365 โ #365DaysOfCodeSolved: ๐งฉ Maximum Consecutive Ones๐น Traverse once, track current streak ๐น Reset count on 0 ๐น Update max length on the go๐ Simple logic, powerful pattern #DSA #LeetCode #ProblemSolving #Cplusplus #Consistency
๐ Day 48/365 โ #365DaysOfCodeSolved: ๐ Reverse Nodes in K Group โ recursion + pointer reversal ๐ง Copy List with Random Pointer โ in-place node cloning #DSA #LeetCode #LinkedList #ProblemSolving #Cplusplus #Consistency
๐ Day 32/365 โ #365DaysOfCodeSolved: ๐๏ธ Merge Intervals ๐ฏ 4Sum Problem๐น Sorting + smart traversal ๐น Interval merging with range expansion ๐น Two pointers inside nested loops ๐น Careful duplicate handling๐ Learned how sorting #DSA #LeetCode #ProblemSolving #Cplusplus
๐ Day 37/365 โ #365DaysOfCodeSolved: ๐ช Assign Cookies โณ Minimum Average Waiting Time ๐น Applied Greedy Strategy ๐น Sorted inputs to make optimal decisions ๐น Understood why smallest-first approach minimizes waiting #DSA #LeetCode #Greedy #ProblemSolving #Cplusplus #Coding
๐ Day 31/365 โ #365DaysOfCodeSolved: ๐ Find Missing & Repeating Number๐น Used mathematical formulas ๐น Sum of first n numbers ๐น Sum of squares of first n numbers ๐น Derived equations to find both valuesโก O(n) time | O(1) space #DSA #ProblemSolving #Cplusplus #LeetCode
๐ Day 48/365 โ #365DaysOfCodeSolved: ๐ Reverse Nodes in K Group โ recursion + pointer reversal ๐ง Copy List with Random Pointer โ in-place node cloning #DSA #LeetCode #LinkedList #ProblemSolving #Cplusplus #Consistency
๐ Day 37/365 โ #365DaysOfCodeSolved: ๐ช Assign Cookies โณ Minimum Average Waiting Time ๐น Applied Greedy Strategy ๐น Sorted inputs to make optimal decisions ๐น Understood why smallest-first approach minimizes waiting #DSA #LeetCode #Greedy #ProblemSolving #Cplusplus #Coding
๐ Day 34/365 โ #365DaysOfCodeSolved: ๐ค Longest Substring Without Repeating Characters๐น Approach 1: Brute Force (O(nยฒ)) ๐น Approach 2: Sliding Window + Hashing (O(n))๐ Learned how optimizing window movement reduces complexity drastically #LeetCode #SlidingWindow
๐ Day 32/365 โ #365DaysOfCodeSolved: ๐๏ธ Merge Intervals ๐ฏ 4Sum Problem๐น Sorting + smart traversal ๐น Interval merging with range expansion ๐น Two pointers inside nested loops ๐น Careful duplicate handling๐ Learned how sorting #DSA #LeetCode #ProblemSolving #Cplusplus
๐ Day 31/365 โ #365DaysOfCodeSolved: ๐ Find Missing & Repeating Number๐น Used mathematical formulas ๐น Sum of first n numbers ๐น Sum of squares of first n numbers ๐น Derived equations to find both valuesโก O(n) time | O(1) space #DSA #ProblemSolving #Cplusplus #LeetCode
๐ Day 25/365 โ #365DaysOfCodeSolved: ๐งฉ Maximum Consecutive Ones๐น Traverse once, track current streak ๐น Reset count on 0 ๐น Update max length on the go๐ Simple logic, powerful pattern #DSA #LeetCode #ProblemSolving #Cplusplus #Consistency
๐ Day 24/365 โ #365DaysOfCodeSolved: ๐งฉ Longest Subarray with Sum = K๐น Sliding Window โ works only for positives ๐น Prefix Sum + HashMap โ handles +ve & โve ๐น Key idea: store first occurrence of prefix sum๐ Learned when to switch approaches #DSA #LeetCode #ProblemSolving
๐ Day 34/365 โ #365DaysOfCodeSolved: ๐ค Longest Substring Without Repeating Characters๐น Approach 1: Brute Force (O(nยฒ)) ๐น Approach 2: Sliding Window + Hashing (O(n))๐ Learned how optimizing window movement reduces complexity drastically #LeetCode #SlidingWindow
๐ Day 25/365 โ #365DaysOfCodeSolved: ๐งฉ Maximum Consecutive Ones๐น Traverse once, track current streak ๐น Reset count on 0 ๐น Update max length on the go๐ Simple logic, powerful pattern #DSA #LeetCode #ProblemSolving #Cplusplus #Consistency
๐ Day 24/365 โ #365DaysOfCodeSolved: ๐งฉ Longest Subarray with Sum = K๐น Sliding Window โ works only for positives ๐น Prefix Sum + HashMap โ handles +ve & โve ๐น Key idea: store first occurrence of prefix sum๐ Learned when to switch approaches #DSA #LeetCode #ProblemSolving
๐ Day 48/365 โ #365DaysOfCodeSolved: ๐ Reverse Nodes in K Group โ recursion + pointer reversal ๐ง Copy List with Random Pointer โ in-place node cloning #DSA #LeetCode #LinkedList #ProblemSolving #Cplusplus #Consistency
๐ Day 32/365 โ #365DaysOfCodeSolved: ๐๏ธ Merge Intervals ๐ฏ 4Sum Problem๐น Sorting + smart traversal ๐น Interval merging with range expansion ๐น Two pointers inside nested loops ๐น Careful duplicate handling๐ Learned how sorting #DSA #LeetCode #ProblemSolving #Cplusplus
๐ Day 37/365 โ #365DaysOfCodeSolved: ๐ช Assign Cookies โณ Minimum Average Waiting Time ๐น Applied Greedy Strategy ๐น Sorted inputs to make optimal decisions ๐น Understood why smallest-first approach minimizes waiting #DSA #LeetCode #Greedy #ProblemSolving #Cplusplus #Coding
๐ Day 31/365 โ #365DaysOfCodeSolved: ๐ Find Missing & Repeating Number๐น Used mathematical formulas ๐น Sum of first n numbers ๐น Sum of squares of first n numbers ๐น Derived equations to find both valuesโก O(n) time | O(1) space #DSA #ProblemSolving #Cplusplus #LeetCode
Something went wrong.
Something went wrong.
United States Trends
- 1. Good Wednesday N/A
- 2. Hump Day N/A
- 3. #TheBoys N/A
- 4. #WednesdayMotivation N/A
- 5. Indiana N/A
- 6. Happy Hump N/A
- 7. Axios N/A
- 8. YOKO NEW OST OUT NOW N/A
- 9. #WednesdayWisdom N/A
- 10. Vivek N/A
- 11. U.S. and Iran N/A
- 12. Then Peter N/A
- 13. Happy Nurses Week N/A
- 14. Rubio N/A
- 15. Canary Islands N/A
- 16. Andes N/A
- 17. Bo Jackson N/A
- 18. Meek N/A
- 19. Fisk N/A
- 20. Hantavirus N/A