DEV Community

Algorithms Series' Articles

Back to Sergey Leschev's Series
LeetCode: 211. Design Add and Search Words Data Structure (and others)
sergeyleschev profile

LeetCode: 211. Design Add and Search Words Data Structure (and others)

#algorithms #swift #mobile
5
Comments
1 min read
LeetCode 956 (Hard). Solution of the day. Tallest Billboard. Swift. DP.
Cover image for LeetCode 956 (Hard). Solution of the day. Tallest Billboard. Swift. DP.
sergeyleschev profile

LeetCode 956 (Hard). Solution of the day. Tallest Billboard. Swift. DP.

#swift #ios #programming #algorithms
6
Comments 1
3 min read
LeetCode 2612 (Hard). Minimum Reverse Operations. Swift. BFS. O(n+k). O(n).
Cover image for LeetCode 2612 (Hard). Minimum Reverse Operations. Swift. BFS. O(n+k). O(n).
sergeyleschev profile

LeetCode 2612 (Hard). Minimum Reverse Operations. Swift. BFS. O(n+k). O(n).

#swift #ios #programming #algorithms
8
Comments
4 min read
LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.
Cover image for LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.
sergeyleschev profile

LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.

#swift #ios #programming #algorithms
5
Comments
4 min read
LeetCode 2801 (Hard, Acceptance Level 14.5%). Count Stepping Numbers in Range. DP. Efficiently handles large inputs (10^9 + 7).
Cover image for LeetCode 2801 (Hard, Acceptance Level 14.5%). Count Stepping Numbers in Range. DP. Efficiently handles large inputs (10^9 + 7).
sergeyleschev profile

LeetCode 2801 (Hard, Acceptance Level 14.5%). Count Stepping Numbers in Range. DP. Efficiently handles large inputs (10^9 + 7).

#swift #ios #programming #algorithms
7
Comments 2
4 min read
LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.
Cover image for LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.
sergeyleschev profile

LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.

#swift #ios #programming #algorithms
7
Comments 4
6 min read
LeetCode, Hard, last two problems: 2809. Min Time to Make Array Sum At Most x & 2813. Max Elegance of a K-Length Subseq.
Cover image for LeetCode, Hard, last two problems: 2809. Min Time to Make Array Sum At Most x & 2813. Max Elegance of a K-Length Subseq.
sergeyleschev profile

LeetCode, Hard, last two problems: 2809. Min Time to Make Array Sum At Most x & 2813. Max Elegance of a K-Length Subseq.

#swift #ios #programming #algorithms
7
Comments 2
4 min read