
Shubham Raskar
@shubhamimsr
Followers
57
Following
2K
Media
195
Statuses
219
The Protagonist π From designing mechanical βοΈ gears to creating dynamic software solutions | Full Stack Dev | Java | Spring Modules | Microservices
Pune, Maharashtra
Joined December 2017
Looking to connect with fellow developers and problem-solvers!π‘.Whether itβs .-> Java.-> Spring Modules .-> Microservices.-> AWS .-> Docker .-> K8S .-> CI/CD .-> DSA.-> . letβs share insights and grow together. π #Networking #Java #TechCommunity #letsconnect #CONNECT
18
0
16
Day 126: Cracking the Code!.Solved "Total Decoding Messages" using Dynamic Programming to decode number sequences efficiently!.#DSA #DynamicProgramming #TotalDecodingMessages #geekstreak2024 #gfg160 #126DaysOfCode.@geeksforgeeks
0
0
0
Day 125: Stickler Thief II β The Ultimate Heist! π‘π°.Solved "Stickler Thief II" using Dynamic Programming in a circular setup!.#DSA #DynamicProgramming #SticklerThiefII #geekstreak2024 #gfg160 #125DaysOfCode.@geeksforgeeks
0
0
0
Day 124: Stickler Thief β The Art of Smart Looting!.Solved "Stickler Thief" using Dynamic Programming. #DSA #DynamicProgramming #SticklerThief #geekstreak2024 #gfg160 #124DaysOfCode.@geeksforgeeks
0
0
0
Day 123: Cracking the Stock Market!.Solved "Stock Buy and Sell β Max 2 Transactions Allowed" using Dynamic Programming. Optimized profits with strategic buying and selling! ππ‘.#DSA #DynamicProgramming #StockTrading #geekstreak2024 #gfg160 #123DaysOfCode.@geeksforgeeks
0
0
0
Day 122: Mastering Stock Trading!.Solved "Stock Buy and Sell β Max K Transactions Allowed" using Dynamic Programming. #DSA #DynamicProgramming #StockTrading #geekstreak2024 #gfg160 #122DaysOfCode @geeksforgeeks
0
0
2
Day 121: Partitioning the Problem! .Solved "Partition Equal Subset Sum" using Dynamic .#DSA #DynamicProgramming #PartitionEqualSubsetSum #geekstreak2024 #gfg160 #121DaysOfCode.@geeksforgeeks
0
0
0
Day 120: Cracking the Subset Sum Problem!.Solved "Subset Sum Problem" using Dynamic Programming! .#DSA #DynamicProgramming #SubsetSum #geekstreak2024 #gfg160 #120DaysOfCode.@geeksforgeeks
0
0
0
Day 119: Jumping Towards Optimal Solutions!.Solved "Minimum Jumps" using Dynamic Programming + Greedy Approach! Finding the least number of jumps needed to reach the end efficiently!.#DSA #Greedy #DynamicProgramming #geekstreak2024 #gfg160 #119DaysOfCode.@geeksforgeeks
0
0
0
Day 68: LeetCode 75 β Challenge Complete! .Solved "Online Stock Span" & "Search Suggestion System"βMastered Stacks & Tries! π₯ #DSA #LeetCode75 #68DaysOfCode @LeetCode
0
0
1
Day 118: Minimizing the Change, Maximizing the Efficiency! .Solved "Coin Change (Minimum Coins)" using Dynamic Programming! Finding the least number of coins needed to make the target sum efficiently.#DSA #DynamicProgramming #geekstreak2024 #gfg160 #118DaysOfCode.@geeksforgeeks
0
0
0
Day 67: Building a Prefix Tree, One Node at a Time! .Solved "Implement Trie (Prefix Tree)" using Trie Data Structure! Efficiently handling insert, search, and prefix operations! .#DSA #Trie #PrefixTree #LeetCode75 #67DaysOfCode.@LeetCode
0
0
1
Day 66: Popping Balloons with Precision! .Solved "Minimum Number of Arrows to Burst Balloons" using Greedy Algorithm! Finding the optimal way to minimize shots while maximizing efficiency! .#DSA #Greedy #LeetCode75 #66DaysOfCode.@LeetCode
0
0
1
Day 117: Making Change, One Coin at a Time! π°.Solved "Coin Change (Count Ways)" using Dynamic Programming! Finding all possible ways to reach the target sum efficiently! π’π.#DSA #DynamicProgramming #CoinChange #geekstreak2024 #gfg160 #117DaysOfCode.@geeksforgeeks
0
0
0
Solved "0 - 1 Knapsack Problem" using Dynamic Programming! Mastering the art of selecting the most valuable items while staying within capacity. πβ¨.#DSA #Knapsack #DynamicProgramming #geekstreak2024 #gfg160 #116DaysOfCode.@geeksforgeeks
0
0
1
Day 65: Flipping the Bits Right!.Solved "Minimum Flips to Make a OR b Equal to c" using Bit Manipulation! Tweaking bits efficiently to match the target. #DSA #BitManipulation #LeetCode75 #65DaysOfCode.@LeetCode
0
0
1
Day 64: Counting Bits, One at a Time!.Solved "Counting Bits" using Dynamic Programming & Bit Manipulation! Efficiently tracking set bits for all numbers up to n. β‘π‘.#DSA #BitManipulation #DynamicProgramming #LeetCode75 #64DaysOfCode.@LeetCode
0
0
1
Day 115: Climbing Smart, Not Hard!.Solved "Min Cost Climbing Stairs" using Dynamic Programming! Optimizing each step to reach the top efficiently. ππ‘.#DSA #DynamicProgramming #geekstreak2024 #gfg160 #115DaysOfCode.@geeksforgeeks
0
0
0
Day 114: Climbing the Stairs, One Step at a Time!.Solved "Ways to Reach the n'th Stair" using Dynamic Programming! Every step counts towards mastering problem-solving! π.#DSA #DynamicProgramming #geekstreak2024 #gfg160 #114DaysOfCode.@geeksforgeeks
0
0
0
Day 63: Transforming One String to Another! .Solved "Edit Distance" using Dynamic Programming! Mastering string transformations one operation at a time! .#DSA #DynamicProgramming #LeetCode75 #63DaysOfCode.@LeetCode
0
0
1
Day 113: Transforming One String to Another! πSolved "Edit Distance" using Dynamic Programming! #DSA #DynamicProgramming #geekstreak2024 #gfg160 #113DaysOfCode.@geeksforgeeks
0
0
0