Binary Tree - BFS Binary Tree Right Side View #LeetCode75 39/75 #Python #DSA #100DaysOfCode #LeetCode

Day 52 of #LeetCode75 — Problem 547: Number of Provinces Converted the adjacency matrix into an adjacency list and used DFS to count connected components. Each DFS run = one province. TC: O(n²) SC: O(n) #Day52 #LeetCode #DSA #CPP #CodingJourney

These are My last Contests I am improving gradually but still stucked not able to cross q3 mark please provide some advice how to break this barieer . #leetcode75 #programming #coding #learnInPublic

Binary Tree - BFS Binary Tree Right Side View #LeetCode75 40/75 slowly moving closer to the goal, 40 days completed. #Python #DSA #100DaysOfCode #LeetCode

Binary Tree - DFS Lowest Common Ancestor of a Binary Tree #LeetCode75 38/75 #Python #DSA #100DaysOfCode #LeetCode

Day 58 of #LeetCode75 Worked on Rotting Oranges (BFS) today. I wrote most of the solution myself (~60%), but needed some guidance to fix the BFS logic and boundary handling. #100DaysOfCode #LeetCode #DSA #codingjourney

Day 31 of #LeetCode75 Problem: 1161.Maximum Level Sum Binary Tree Approach: Use Level Order Traversal (BFS) with a queue. Update the result when a higher sum is found. TimeO(n) Spac:O(n) #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPlusPlus #CodingJourney #cpp

Day 35 of my #LeetCode75 Problem:Letter Combinations of a Phone Number (LeetCode17) Key Idea: Each digit maps to letters. Use recursion and backtracking to explore every possible letter combination Approach:Backtracking #100DaysOfCode #LeetCode #DSA #CodingJourney #CodeNewbie

Day #66 Update: - DevOps - Continuing on the Project - LeetCode: Two Coding Problems from Blind 75 #100DaysOfCode #CodinChallenge #leetcode75 #LeetCode #DSA

Day 56 of #LeetCode75 — Problem 208: Implement Trie (Prefix Tree) Today I implemented a Trie — a tree-based data structure used for fast word insertions, searches & prefix lookups. Key concepts: Node structure with 26 child pointers Recursion for insert/search Dictionary

Day 29 #LeetCode75 Problem: 236. Lowest Common Ancestor Idea: Find the deepest node that’s ancestor of both p & q Return NULL if node is NULL. Return node if it’s p or q. Explore left & right. If both return non-NULL → current node is LCA. #DSA #BinaryTree #CodingJourney #MIET

Day 48 of #LeetCode75 Challenge: Decode String I explored a stack-based solution in C++ to handle nested brackets and repeated strings. Learned how to manage numbers and strings with stacks Great practice for understanding string & stack logic #100DaysOfCode #DSA #CodingJourney

Day 41 of #LeetCode75 Challenge – Problem #198 (House Robber) Used recursion + memoization (Dynamic Programming) to maximize profit without robbing adjacent houses. Time: O(n) Space: O(n) #Day41 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 53 of #LeetCode75 — Problem 215: Kth Largest Element in an Array Used a max-heap (priority queue) to extract the k-th largest efficiently—no sorting needed. T:O(n log n) SC:O(n) #Day53 #LeetCode #DSA #CPP #100DaysOfCode #CodingJourney

Day 1 of #100DaysOfCode Completed daily questions for April 1st and 2nd and started with leetcode75. Just hoping to be consistent.🙂

Day 42 of #LeetCode75 Challenge – Problem #1137 (N-th Tribonacci Number) Solved using recursion + memoization and then optimized via tabulation (Dynamic Programming). Time: O(n) Space: O(n) #Day42 #LeetCode #100DaysOfCode #DSA #CPlusPlus #CodingJourney

Day 54 of #LeetCode75 — Problem2336: Smallest Number in Infinite Set This one was tricky, learned it with help and understood the logic behind maintaining: A pointer (cur) to the next smallest number A min-heap to store numbers that were added back #Day54 #LeetCode #DSA #CPP

1207. Unique number of Occurrences. Leetcode problem solution using Golang. #Leetcode75 #Golang

Day 32 Of #leetcode75 Problem :450.delete node in a binary search tree. #LeetCode #75DaysChallenge #Day31 #BinaryTree #BFS #DSA #CPl

Understood intuition behind solution after going through solutions submitted by others 🤓 #Leetcode #Leetcode75