Skip to content
Navigation menu
Search
Powered by
Search
Algolia
Search
Log in
Create account
DEV Community
Close
Algorithms Series' Articles
Back to Sergey Leschev's Series
LeetCode: 211. Design Add and Search Words Data Structure (and others)
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Mar 19 '23
LeetCode: 211. Design Add and Search Words Data Structure (and others)
#
algorithms
#
swift
#
mobile
5
reactions
Comments
Add Comment
1 min read
LeetCode 956 (Hard). Solution of the day. Tallest Billboard. Swift. DP.
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Jun 24 '23
LeetCode 956 (Hard). Solution of the day. Tallest Billboard. Swift. DP.
#
swift
#
ios
#
programming
#
algorithms
6
reactions
Comments
1
comment
3 min read
LeetCode 2612 (Hard). Minimum Reverse Operations. Swift. BFS. O(n+k). O(n).
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Jul 3 '23
LeetCode 2612 (Hard). Minimum Reverse Operations. Swift. BFS. O(n+k). O(n).
#
swift
#
ios
#
programming
#
algorithms
8
reactions
Comments
Add Comment
4 min read
LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Jul 23 '23
LeetCode 2790 (Hard). Maximum Number of Groups With Increasing Length. O(NlogN). Math. Only 10 lines of code.
#
swift
#
ios
#
programming
#
algorithms
5
reactions
Comments
Add Comment
4 min read
LeetCode 2801 (Hard, Acceptance Level 14.5%). Count Stepping Numbers in Range. DP. Efficiently handles large inputs (10^9 + 7).
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Jul 30 '23
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
reactions
Comments
2
comments
4 min read
LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Aug 5 '23
LeetCode 2532 (Hard++, Extra Category, Amazon). Time to Cross a Bridge.
#
swift
#
ios
#
programming
#
algorithms
7
reactions
Comments
4
comments
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.
Sergey Leschev
Sergey Leschev
Sergey Leschev
Follow
Aug 12 '23
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
reactions
Comments
2
comments
4 min read
We're a place where coders share, stay up-to-date and grow their careers.
Log in
Create account