DEV Community

Challenge!

Posts

đź‘‹ Sign in for the ability to sort posts by relevant, latest, or top.
Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)

Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)

1
Comments
3 min read
Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)

Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)

Comments
2 min read
Day 75 of 100 days dsa coding challenge

Day 75 of 100 days dsa coding challenge

1
Comments
1 min read
Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)

Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)

Comments
3 min read
Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic

Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic

1
Comments
3 min read
Week 5 Scripting Challenge: Secure Password Authentication

Week 5 Scripting Challenge: Secure Password Authentication

Comments
15 min read
Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)

Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)

1
Comments
3 min read
Day 68 of 100 days dsa coding challenge

Day 68 of 100 days dsa coding challenge

1
Comments
2 min read
Day 58: Python Run-Length Encoding (RLE) – Compress Strings Like a Pro with This Ultra-Simple O(n) Trick

Day 58: Python Run-Length Encoding (RLE) – Compress Strings Like a Pro with This Ultra-Simple O(n) Trick

Comments
2 min read
Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal

Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal

Comments
3 min read
Day 57: Python GCD & LCM with Euclidean Algorithm, Lightning-Fast Divisor Math That's 2000+ Years Old (And Still Unbeatable)

Day 57: Python GCD & LCM with Euclidean Algorithm, Lightning-Fast Divisor Math That's 2000+ Years Old (And Still Unbeatable)

Comments
3 min read
I built a Python website with AI - can you break it?

I built a Python website with AI - can you break it?

Comments 1
1 min read
Day 9 of 100

Day 9 of 100

1
Comments
2 min read
Day 7 of 100

Day 7 of 100

1
Comments 2
3 min read
Better Late Than Never: Balancing Class 12 Boards with my AI Ambitions (My Scaler YIIC Journey)

Better Late Than Never: Balancing Class 12 Boards with my AI Ambitions (My Scaler YIIC Journey)

1
Comments
1 min read
đź‘‹ Sign in for the ability to sort posts by relevant, latest, or top.