📰 Dev.to · Sergey Leschev
Articles from Dev.to · Sergey Leschev · 6 articles · Updated every 3 hours · View all reads
All
⚡ AI Lessons (9111)
ArXiv cs.AIDev.to · FORUM WEBForbes InnovationOpenAI NewsDev.to AIHugging Face Blog
Dev.to · Sergey Leschev
2y ago
LeetCode, Hard (Acceptance 24%, Latest): 2867. Count Valid Paths in a Tree. DFS. O(n). Swift.
Description There is an undirected tree with n nodes labeled from 1 to n. You are given...
Dev.to · Sergey Leschev
2y ago
LeetCode, Hard: 2818. Apply Operations to Maximize Score. Swift
Description You are given an array nums of n positive integers and an integer...
Dev.to · Sergey Leschev
2y ago
LeetCode, Hard, last two problems: 2809. Min Time to Make Array Sum At Most x & 2813. Max Elegance of a K-Length Subseq.
2809. Min Time to Make Array Sum: Efficient Swift solution, using dynamic programming, for minimizing...
Dev.to · Sergey Leschev
2y ago
LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.
Description There are k workers who want to move n boxes from an old warehouse to a new...
Dev.to · Sergey Leschev
2y ago
LeetCode 2801 (Hard, Acceptance Level 14.5%). Count Stepping Numbers in Range. DP. Efficiently handles large inputs (10^9 + 7).
Description Given two positive integers low and high represented as strings, find the...
Dev.to · Sergey Leschev
2y ago
LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.
Description You are given a 0-indexed array usageLimits of length n. Your task is to...
DeepCamp AI