📢 Coding Challenge Alert: Convert Integers to Roman Numerals! 🔢➡️🏛️ #CrackCodingWithMayank #RomanNumerals #CodingChallenge #DailyCoding #ProblemSolving #Algorithms #LeetCode #CodeNewbie #SoftwareEngineering #100DaysOfCode #DevCommunity #BuildInPublic #JavaScript #Python #Tech

🧠 Can your path cross itself? Start at (0,0). Move: North, West, South, East... (repeat ⤴️ counter-clockwise). Input: distance = [2,1,1,2] ➡️ Output: true (Crosses at (0, 1)) #100DaysOfCode #CodingChallenge #LeetCode #DSA #Algorithms #DevLife #CrackCodingWithMayank

🚀 SQL Challenge: High Earners in Each Department! Given Employee & Depart. tables, find the top 3 unique salaries per depart. 💡Using DENSE_RANK() to rank salaries within each department. #SQL #Coding #DataAnalytics #CrackCodingWithMayank

🚀 Word Search II 🔍 Used Trie + Backtracking to efficiently find words in a grid! 📜 ✅ Optimized from O(m * n * 4^L) ➝ O(m * n * 3^L) ✅ Found words: "oath", "eat" 🎯 #LeetCode #Coding #Algorithms #Trie #Backtracking #CrackCodingWithMayank

🚀 Max Points on a Line! 🚀 Given a set of points on an X-Y plane, find the maximum no. of points that lie on the same straight line. Eg: 📌[[1,1],[2,2],[3,3]] → 3 📌[[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]] →4 #Coding #LeetCode #Algorithms #ProblemSolving #CrackCodingWithMayank

🚀 Binary Trees: Max Path Sum! 🌳 Find the max path sum in a binary tree. The path can be any seq. of connected nodes. 💡Eg: [1,2,3] →6 (2 →1→3) [-10,9,20,null,null,15,7] → 42 (15→20→7) #Coding #LeetCode #BinaryTree #CrackCodingWithMayank 🚀

🚀 Coding Challenge: Count 1s! Given n, count how many times digit 1 appears from 0 to n. 🔹 n = 13 → Output: 6 🔹 n = 0 → Output: 0 Constraints: 0 ≤ n ≤ 10⁹ Drop your solution below! ⬇️ #CodingChallenge #LeetCode #ProblemSolving #CrackCodingWithMayank

📌 Given the head of a linked list, delete the node that's n-th from the end, and return the updated head. Input: [1, 2, 3, 4, 5], n = 2 Output: [1, 2, 3, 5] #LinkedList #DSA #CodingChallenge #TechInterview #ProblemSolving #CrackCodingWithMayank #100DaysOfCode #DataStructures

🚀 Best Time to Buy and Sell Stock IV 📈 Maximize profit with at most k transactions! 🔹 DP solution: O(k * n) 🔹 Greedy for large k 🔹 Key: Track balance & optimize state transitions #LeetCode #DynamicProgramming #Coding #CrackCodingWithMayank

Can you restore valid IPs from a string of digits? E.g. Input: "25525511135" Output: ["255.255.11.135", "255.255.111.35"] Rules: 4 parts 0–255 range No leading 0s No digit reordering #CrackCodingWithMayank #CodingChallenge #100DaysOfCode #LeetCode #DevLife #Backtracking #Tech

🚀 Palindrome Partitioning – Min Cuts Problem 🔥 Given a string s, partition it so every substring is a palindrome. Find the min cuts needed! 🔹Input: "aab" → 1 (["aa", "b"]) 🔹Input: "a" → 0 🔹Input: "ab" → 1 #Coding #LeetCode #DynamicProgramming #CrackCodingWithMayank

Can you partition a string into all palindromic substrings? Example: "aab" ➡️ [["a","a","b"],["aa","b"]] Use recursion + backtracking to crack this! #CrackCodingWithMayank #100DaysOfCode #Backtracking #DSA #CodingChallenge #LeetCode #TechTwitter

🚀 DSA Challenge Time! How many range sums in nums fall within [lower, upper]? Example: Input: [-2,5,-1], Range: [-2,2] ✅ Output: 3 Master prefix sums & level up 💪 More at 👉 Crack Coding with Mayank #100DaysOfCode #DSA #CodingChallenge #CrackCodingWithMayank

🚀 DP Challenge: Distinct Subsequences Given s & t, find how many distinct subsequences of s equal t. Eg: 🔹s = "rabbbit", t = "rabbit" → 3 🔹s = "babgbag", t = "bag" → 5 Can you solve it using Dynamic Programming? #Coding #DynamicProgramming #LeetCode #CrackCodingWithMayank

🚀 Candy Distribution Problem! 🍬 Given ratings = [1,0,2], distribute candies so: ✅Each child gets at least one candy ✅Higher-rated kids get more than lower-rated neighbors Optimal: [2,1,2] → 5 candies #Coding #Algorithms #LeetCode #ProblemSolving #CrackCodingWithMayank 🚀

🚀 Shortest Palindrome Challenge! 🚀 Transform a string into a palindrome by adding the fewest characters in front of it. 🔥 Eg: 🔹"abcd" → "dcbabcd" 🔹"aacecaaa" → "aaacecaaa" Think KMP algorithm or two-pointer tricks! #Coding #LeetCode #Algorithms #CrackCodingWithMayank

🚀 Stock Trading Challenge! 📈 Given prices[i] as the stock price on day i, find the max profit with ≤2 transactions! Eg: 🔹 [3,3,5,0,0,3,1,4] → 6 🔹 [1,2,3,4,5] → 4 🔹 [7,6,4,3,1] → 0 #Coding #LeetCode #StockMarket #CrackCodingWithMayank

💡 Coding Tip: Next Permutation Problem Given: [1,2,3] ➡️ Output: [1,3,2] Rearrange to next lexicographical order in-place with constant space! Perfect for tech interviews 🔥 #TechTwitter #CodeNewbie #InterviewPrep #LeetCode #DSA #CrackCodingWithMayank

🚀 Built a Basic Calculator in Python! 🧮 ✅ Handles +, -, (), and spaces ✅ No eval()—used stack for expression evaluation ✅ Supports nested parentheses & unary #Python #Coding #InterviewPrep #CrackCodingWithMayank

Zigzag String Conversion 🧵 Write a function to convert a string into zigzag form across rows and read line by line. Example: Input: "PAYPALISHIRING", numRows=3 Output: "PAHNAPLSIIGYIR" #CrackCodingWithMayank #Coding #Cplusplus