Evon
@evoncodes.bsky.social
Software Engineer
Miami, Florida 🏖️
To Thine Own Self Be True
Miami, Florida 🏖️
To Thine Own Self Be True
Floyd's Cycle Finding Algorithm (Tortoise & Hare) detects loops in a linked list. A slow pointer moves one step at a time, while a fast pointer moves two. If a loop exists, they’ll meet; if no loop, the fast pointer reaches the end. #Algorithms #LinkedList #DataStructures #Coding
March 30, 2025 at 8:15 PM
Floyd's Cycle Finding Algorithm (Tortoise & Hare) detects loops in a linked list. A slow pointer moves one step at a time, while a fast pointer moves two. If a loop exists, they’ll meet; if no loop, the fast pointer reaches the end. #Algorithms #LinkedList #DataStructures #Coding
When analyzing Big-O, always drop non-dominant terms!
Given:
O(n² + n) → Drop the n since n² grows faster.
Final: O(n²)
Example: The code in the image has nested loops (O(n²)) and a single loop (O(n)). We drop O(n), leaving O(n²).
#BigO #CodingTips #TimeComplexity
Given:
O(n² + n) → Drop the n since n² grows faster.
Final: O(n²)
Example: The code in the image has nested loops (O(n²)) and a single loop (O(n)). We drop O(n), leaving O(n²).
#BigO #CodingTips #TimeComplexity
March 27, 2025 at 12:43 PM
When analyzing Big-O, always drop non-dominant terms!
Given:
O(n² + n) → Drop the n since n² grows faster.
Final: O(n²)
Example: The code in the image has nested loops (O(n²)) and a single loop (O(n)). We drop O(n), leaving O(n²).
#BigO #CodingTips #TimeComplexity
Given:
O(n² + n) → Drop the n since n² grows faster.
Final: O(n²)
Example: The code in the image has nested loops (O(n²)) and a single loop (O(n)). We drop O(n), leaving O(n²).
#BigO #CodingTips #TimeComplexity
Day 1 of #100DaysOfCode
It's been a few weeks since I've touched Python so I started with @neetcode1 's Python 🐍 for Coding Interviews as a Python refresher.
Completed the Merge Strings Alternatively problem on LeetCode:
It's been a few weeks since I've touched Python so I started with @neetcode1 's Python 🐍 for Coding Interviews as a Python refresher.
Completed the Merge Strings Alternatively problem on LeetCode:
January 4, 2024 at 12:20 PM
Day 1 of #100DaysOfCode
It's been a few weeks since I've touched Python so I started with @neetcode1 's Python 🐍 for Coding Interviews as a Python refresher.
Completed the Merge Strings Alternatively problem on LeetCode:
It's been a few weeks since I've touched Python so I started with @neetcode1 's Python 🐍 for Coding Interviews as a Python refresher.
Completed the Merge Strings Alternatively problem on LeetCode:
Amazing home office. Here’s my humble setup:
April 29, 2023 at 12:43 AM
Amazing home office. Here’s my humble setup: