Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

zenglekidd/LeetcodeInSwift

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

188 Commits

Repository files navigation

LeetcodeInSwift

This is the tracking page for personal Leetcode progress.


Progress

Stage 1

Total: 48 / 48 (Finished in Day 30)

Stage 2

Total: 41 / 41 (Finished in Day 45)

Stage 3

(Leetcode# <= 200)

Total: 111 / 111 (Finished in Day 99)

Stage 4

  • Tackle a topic at once and then go back and solve a bunch of related problems. Topics:

    • Buy and Sell Stock (I - IV)
    • Recursion
    • 2D Array connectivities
    • Graphs: Adjacency List and Adjacency Matrix
  • Made sure to do a lot of mock interviews. Almost 1 mock interview every other weekend or so.

(Top 90% Speed)

Paper

  • 'Programming pearls: algorithm design techniques' by Jon Bentley (Sep. 1984 Vol. 27 No. 9 Communications of the ACM P885)

  • 'A Note on the Standard Strategy for Developing Loop Invariants and Loops' by David Gries (1982) (ScienceofComputerProgramming2,pp. 207- 214)

  • E. W. Dijkstra, Some beautiful arguments using mathematical induction, Actu Informat. 13 (1980) 1-8.

Book

  • 'Programming Pearls' by Jon Bentley

Sequence

Array

Binary

Dynamic Programming

Geometry

Interval

Linked list

Math

Matrix

Recursion

String

(削除) [Encode and Decode Strings] (削除ここまで)

Tree

(削除) Serialize and Deserialize Binary Tree (削除ここまで)

Heap

References

The 30-minute guide to rocking your next coding interview

Creating and Running a Playground Book

About

Leetcode challenge solution in Swift

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

AltStyle によって変換されたページ (->オリジナル) /