Nishant Gaurav·Oct 6Rod Cutting: Unbounded KnapsackChapter 7 introduced Unbounded Knapsack and ended with a promise: every problem in the unbounded family inherits the same structure, just…
Vishesh Sharma·Jun 9Alternative O(n²) Word Break Solution (Without DP / DFS / BFS / Trie)When tackling LeetCode 139 — Word Break, most engineers instinctively reach for Dynamic Programming, DFS + Memoization, or even Trie-based…
Syiemliehmeyoshwa·Mar 27The Role of Digital Marketing in Mizuno’s Success: A Case StudyI’m from Meghalaya.India. Mountains, rain, football-obsessed but equipment-starved. Growing up, I wore whatever I could find. Local brands…
Nausheen | Java & Full-Stack Developer·Mar 25Course Schedule I | GFGProblem Link: https://www.geeksforgeeks.org/problems/course-schedule-i/1
Nausheen | Java & Full-Stack Developer·Mar 23Length of Longest Cycle in a GraphProblem Link: https://www.geeksforgeeks.org/problems/length-of-longest-cycle-in-a-graph/1
InCodeXbyRahul Kumar·Feb 12DSA Day 39/250: Postfix to Prefix Conversion (Stack Based O(N) Solution)Convert postfix expression to prefix using stack in O(N) time — complete step-by-step explanation with iteration flow.
InCodeXbyRahul Kumar·Feb 11DSA Day 38/250: Postfix to Infix Conversion (Stack Based O(N) Solution)Convert postfix expression to infix using stack in O(N) time with full step-by-step iteration flow.
