Ujjawal Kantt
@ujjawalkantt
Followers
13
Following
93
Media
1
Statuses
113
Creating solutions, one byte at a time.
Joined May 2023
I just completed all 25 days of Advent of Code 2024! https://t.co/Y94tgnKNNH
#AdventOfCode
0
0
2
Built with React, TypeScript, and Tailwind CSS. Note: Auth might take a bit longer becoz backend is hosted on Render's free tier. Looking for your feedback and suggestions! #WebDevelopment #GenerativeAI #Project
0
0
0
Ever stared at security audit report and thought, "What is this?"🤔Here is my project: AuditSafe. This web app uses generative AI to summarize reports, suggest improvements, and visualize data. 📊✨ Check it out: 🔗GitHub: https://t.co/iY94g012q9 🌐Live:
github.com
A web app for managing security audits. It lets users upload reports, view summaries, get security recommendations, and explore insights through interactive charts. Built with React, Node.js, Mongo...
1
0
0
So, finally wrapping up this 100-day journey! Learned a lot, but the key takeaway is the power of consistency. I’m determined to keep this momentum going and will solve at least two DSA problems daily.
0
0
2
Day 100: Solved these key DSA problems yesterday but couldn’t manage to post them, so here they are today: - Inorder Successor in BST - Merge 2 BSTs - Largest BST in BT - Maximum Width of a BT - Print All Nodes at a Distance of K in a BT - Sum of Digits of String After Convert
Day 99: Nearly solved 10 DSA questions including: - Construct BT from Preorder and Inorder Traversal - Construct BT from Inorder and Postorder Traversal - Find the Student that Will Replace the Chalk - Truncate Sentence - Determine Whether Matrix Can Be Obtained By Rotation
0
0
1
Day 99: Nearly solved 10 DSA questions including: - Construct BT from Preorder and Inorder Traversal - Construct BT from Inorder and Postorder Traversal - Find the Student that Will Replace the Chalk - Truncate Sentence - Determine Whether Matrix Can Be Obtained By Rotation
Day 92-98: - Convert 1D Into 2D arr. - Path with Max. Probab. - Graph Edge Weights - Most Stones Removed - Cnt. Sub Islands - N- array traversal BT - Right Side BT Also participated in weekly and biweekly contests, solving 2 questions each. Tackled 7 more DP and tree problem.
0
0
1
Day 92-98: - Convert 1D Into 2D arr. - Path with Max. Probab. - Graph Edge Weights - Most Stones Removed - Cnt. Sub Islands - N- array traversal BT - Right Side BT Also participated in weekly and biweekly contests, solving 2 questions each. Tackled 7 more DP and tree problem.
Day 91: Focused on Binary Trees - Maximum Path Sum (Binary Tree) - Top View of Binary Tree - Bottom View of Binary Tree - LeetCode POTD - Plus, revisited 5 previously solved Binary Tree problems #Coding #DSA #100DaysOfCode #BinaryTree #LeetCode
0
0
0
Day 91: Focused on Binary Trees - Maximum Path Sum (Binary Tree) - Top View of Binary Tree - Bottom View of Binary Tree - LeetCode POTD - Plus, revisited 5 previously solved Binary Tree problems #Coding #DSA #100DaysOfCode #BinaryTree #LeetCode
Day 87 to 90: Exams kept me occupied, so I couldn't post during these days. But, I did solve a few questions: - Strange Printer - Number Complement - Fraction Add & Sub. - Find the Closest Palindrome - Rod Cutting - Unbounded Knapsack - Coin Change 2 - Min. Coins - LCS
0
0
3
Day 87 to 90: Exams kept me occupied, so I couldn't post during these days. But, I did solve a few questions: - Strange Printer - Number Complement - Fraction Add & Sub. - Find the Closest Palindrome - Rod Cutting - Unbounded Knapsack - Coin Change 2 - Min. Coins - LCS
Day 86: - Stone Game II (POTD) - Ninja's Training (DP-7) Balancing exam prep with some coding practice. #Coding #DSA #100DaysOfCode #LeetCode
0
0
1
Day 86: - Stone Game II (POTD) - Ninja's Training (DP-7) Balancing exam prep with some coding practice. #Coding #DSA #100DaysOfCode #LeetCode
Day 85: - 2 Keys Keyboard (POTD) - Subset Sum Equal to Target (DP-14) Taking it easy since exams are ongoing. #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
0
0
3
Day 85: - 2 Keys Keyboard (POTD) - Subset Sum Equal to Target (DP-14) Taking it easy since exams are ongoing. #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
Day 84: Solved more DP problems: - Partition Set Into 2 Subsets With Min Absolute Sum Diff (DP-16) - Ugly Number II #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
1
0
3
Day 84: Solved more DP problems: - Partition Set Into 2 Subsets With Min Absolute Sum Diff (DP-16) - Ugly Number II #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
Day 83: Tackling more DP problems: - Target Sum - LeetCode POTD: Maximum Number of Points with Cost #Coding #DSA #100DaysOfCode #DynamicProgramming #leetcode
1
0
2
Day 83: Tackling more DP problems: - Target Sum - LeetCode POTD: Maximum Number of Points with Cost #Coding #DSA #100DaysOfCode #DynamicProgramming #leetcode
Day 82: DP challenges continue: - Minimum Path Sum in Triangular Grid (DP-11) - Minimum/Maximum Falling Path Sum (DP-12) - Partition Equal Subset Sum (DP-15) - LeetCode POTD: Maximum Distance in Arrays #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
1
0
3
Day 82: DP challenges continue: - Minimum Path Sum in Triangular Grid (DP-11) - Minimum/Maximum Falling Path Sum (DP-12) - Partition Equal Subset Sum (DP-15) - LeetCode POTD: Maximum Distance in Arrays #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
Day 81: Focused on DP in grids: - Minimum Path Sum in Grid (DP-10) - Grid Unique Paths 2 (DP-9) - Grid Unique Paths (DP-8) - LeetCode POTD: Lemonade Change. #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
1
0
3
Day 81: Focused on DP in grids: - Minimum Path Sum in Grid (DP-10) - Grid Unique Paths 2 (DP-9) - Grid Unique Paths (DP-8) - LeetCode POTD: Lemonade Change. #Coding #DSA #100DaysOfCode #DynamicProgramming #LeetCode
Day 80: Continued with DP problems: - Frog Jump (DP-3) - Frog Jump with k distances (DP-4) - House Robber II - Plus, solved today's LeetCode POTD. - Also studied FLA. #Coding #DSA #100DaysOfCode #DynamicProgramming #FLA
1
0
5
Day 80: Continued with DP problems: - Frog Jump (DP-3) - Frog Jump with k distances (DP-4) - House Robber II - Plus, solved today's LeetCode POTD. - Also studied FLA. #Coding #DSA #100DaysOfCode #DynamicProgramming #FLA
Day 79: Started solving DP problems: - Fibonacci numbers (using tabulation and memoization) - Climbing Stairs - House Robber - Combination Sum II #Coding #DSA #100DaysOfCode #DynamicProgramming
0
0
3
Day 79: Started solving DP problems: - Fibonacci numbers (using tabulation and memoization) - Climbing Stairs - House Robber - Combination Sum II #Coding #DSA #100DaysOfCode #DynamicProgramming
Day 78: Solved another one! - Kth Largest Element in a Stream - Revised previously solved problems #Coding #DSA #100DaysOfCode #Algorithms
0
0
0
Day 78: Solved another one! - Kth Largest Element in a Stream - Revised previously solved problems #Coding #DSA #100DaysOfCode #Algorithms
Day 77: Tackled a tough one! - Minimum Number of Days to Disconnect Island Focused less on DSA today as I worked on dev tasks. #Coding #DSA #100DaysOfCode #Algorithms
0
0
1
Day 77: Tackled a tough one! - Minimum Number of Days to Disconnect Island Focused less on DSA today as I worked on dev tasks. #Coding #DSA #100DaysOfCode #Algorithms
Day 76: Solved a key problem! - Regions Cut By Slashes Revised 3 previously solved hard DSA questions, focused on the monotonic stack, and continued learning Formal Language and Automata. #Coding #DSA #100DaysOfCode #Algorithms #MonotonicStack #FormalLanguage #Automata
0
0
0
Day 76: Solved a key problem! - Regions Cut By Slashes Revised 3 previously solved hard DSA questions, focused on the monotonic stack, and continued learning Formal Language and Automata. #Coding #DSA #100DaysOfCode #Algorithms #MonotonicStack #FormalLanguage #Automata
Day 75: Solved a key problem! - Magic Squares in Grid Also revised previously solved problems and continued learning Formal Language and Automata. #Coding #DSA #100DaysOfCode #Algorithms #FormalLanguage #Automata
1
0
3