Nishant Goyal@NGoyal91237

Software Engineer in the making | Building with C++, Python, FastAPI, LLMs & RAG | AI • Backend • Open Source | Passionate about Finance & Financial Markets

Joined April 2024
37 Photos and videos
CodeDay: 37🔥 💡 Approach: Sort array → Traverse → Store indices where nums[i] == target. Time: O(n log n) Space: O(n) Easy problems tests speed.(3min 8Sec) whats yours? #LeetCode #DSA #CPlusPlus #CPP #Coding #Learn2Grow #SoftwareEngineer #SDEIntern #OpenToWork #CodeDay
2
67
CodeDay: 37 🔥 💡 Approach: Build Pascal’s Triangle → Split into left & right subtrees → Recursively count ways → Combine using combinations. Time: O(n²) | Space: O(n²) Thanks @CSwithMIK for the explanation!🙌 #LeetCode #DSA #CPlusPlus #CPP #Learn2Grow #OpenToWork #CodeDay
2
35
CodeDay: 36🔥 💡 Approach: Calc digit sums → Sort by {digit sum, number} → Track indices → Swap misplaced . What's your way to solve? Time: O(n log n + n × d) | Space: O(n) #LeetCode #DSA #CPlusPlus #CPP #Coding #Learn2Grow #SoftwareEngineer #SDEIntern #OpenToWork #CodeDay
1
12
This LeetCode problem reminded me of a childhood memory — playing Sudoku on weekends after my father finished reading the newspaper. ❤️ It was as challenging for me today as it was back then! The hardest part was to figure out start and end of each 3×3 grid. #LeetCode #DSA #Go
1
2
28
Todays POTD 🔥 Subarrays Distinct Element Sum of Squares I 💡 Approach: Fix start → Extend subarray → Count distinct → Add count². Time: O(n³ log n) - Brute Force Space: O(n) #LeetCode #DSA #CPlusPlus #CPP #Coding #Learn2Grow #SoftwareEngineer #SDEIntern #OpenToWork
1
9
Todays POTD 🔥 Maximize Sum of Squares of Digits 💡 Approach: Maximize 9s → Add remainder → Fill with 0s. Time: O(num) | Space: O(num) #LeetCode #DSA #CPlusPlus #Greedy #CPP #Coding #Learn2Grow #SoftwareEngineer #SDEIntern #OpenToWork #PrbolemSolving
1
19
Today's LeetCode Daily 🔥 Be consistent! Approach: Square → Sort Descending → Add Larger Half → Subtract Smaller Half Time: O(n log n) | Space: O(1) extra #LeetCode #DSA #Cplusplus #Coding #ProblemSolving #100DaysOfCode #DailyCoding #Algorithms #Greedy #Consistency 🚀
2
15
Today's POTD 🔥 Found it difficult to solve. After struggling for about an hour I watched the solution. Approach: Count set bits → Greedily build largest nums → Maximize Time: O(n × 32 + k × 32) Space: O(32) #LeetCode #DSA #CPP #Greedy #BitManipulation #100DaysOfCode
1
27
Today's LeetCode Daily 🔥 It took me 1 min 43 sec to figure out all I need to do. Approach: Check divisibility → Add squares of valid elements Time: O(n) | Space: O(1) #LeetCode #DSA #Coding #ProblemSolving #100DaysOfCode #Cpp #CodeNewbie #Consistency #DailyChallenge #POTD
1
33
Today's LeetCode Daily 🔥 Approach: Count frequencies → Reduce max differences → Calculate squared sum. Time: O(n + M) | Space: O(M) #LeetCode #DSA #CPlusPlus #Coding #Programming #ProblemSolving #100DaysOfCode #CodeNewbie #Tech #Developer #SoftwareEngineering #KeepLearning
1
58
Today’s POTD made me doubt myself. After 400+ problems, I still get stuck. The clock ticks, confidence fades, and self-doubt kicks in. Took a deep breath, drew every case, trusted myself, and finally solved it 30 minutes later. #DSA #LeetCode #CPP
1
2
37
Today's LeetCode Daily It's about detecting the outermost braces in every valid parenthesis. Observation: Outer '(' -> balance=1 Outer ')' -> balance=0 Approach: Loop->exclude when balance =1 or 0 -> return answer #LeetCode #POTD #Coding #cpp #c #programming #100Days100Ways
1
23
Today's LeetCode Daily — Remove Invalid Parentheses 🧩 Approach: Min removals → Recursion → Hashmap for duplicates → Check valid strings. Time: O(2^n × n) | Space: O(2^n × n) #LeetCode #DSA #CPlusPlus #Coding #ProblemSolving #100DaysOfCode #SoftwareEngineering #Programming
3
21
LeetCode Daily — Minimum Add to Make Parentheses Valid Approach: Track balance → if balance < 0, add a ) and reset → remaining balance needs ( ⏱️ Time: O(n) 💾 Space: O(1) Consistency > perfection. 🚀 #LeetCode #DSA #CPP #100DaysOfCode #SoftwareEngineering #Learn2Grow
2
23
LeetCode Daily🔥 Calculate the score of balanced parentheses using a stack. Approach: Push current score → On ), calculate 1 for () or 2×score for nested groups → Add score to previous level Time: O(n) Space: O(n) #LeetCode #DSA #CPlusPlus #SoftwareDevelopment #Coder #Learn
2
13
LeetCode Daily 🚀 Today’s problem: 678. Valid Parenthesis String Used DP + recursion to track the current balance and handle * as: 1. ( 2. ) 3. Empty Slowly getting better at recognizing state-based DP problems. 💪 #LeetCode #DSA #CPP #Coding #100DaysOfCode #SDE #Developer
1
28
🏆 DCC September 2026 — Completed! Another month of staying consistent and keeping the momentum going. 💻🔥 Small progress every day adds up. Not chasing perfection — just showing up, solving, learning, and improving. 🚀 #LeetCode #DSA #Consistency #Coding #100DaysOfCode
1
14
Today's LeetCode Daily 🚀 Longest Valid Parentheses Approach: Use a stack of indices → push ( → pop on ) → if stack is empty, reset → update max length Stack + index tracking makes this one much cleaner. #LeetCode #DSA #Cpp #ProblemSolving #SoftwareEngineer #LearnLiveLove
1
2
25
Today's LeetCode Daily 🚀 Generate Parentheses Approach: Choose ( while open < n → choose ) only when close < open → backtrack 🔄 A simple recursion + backtracking problem that really tests how well you understand valid choices. #LeetCode #DSA #Cpp #Coding #100DaysOfCode
1
24
Today's LeetCode Daily 🚀 Valid Parentheses Approach: Traverse → Push openings → Pop on matching pairs → Return false on mismatch → Check stack is empty. #LeetCode #DSA #Cpp #Coding #ProblemSolving #SoftwareEngineering #sdeintern #Learn2Grow #opentowork
1
3
55
Load more