@thi-lee
I'm talking data structure and algorithms, for now
Nothing here yet.
Nothing here yet.
Jul 30, 2021 · 2 min read · I have been doing Leetcode on-and-off lately. "On" for most days. "Off" when I have an exam or, lately, feel not in good health. I know this is not a recommended schedule, so I want to incorporate a system to learn and review. Set up: Focus on 75 B...
Join discussionJul 4, 2021 · 3 min read · Above, I attached a table of common data structure operations from Big-O cheat sheet . And we will focus on Array for now. As you can see, there are four operations to take notice of. Those are access, search, insertion, and deletion. With each of ...
Join discussionJun 29, 2021 · 2 min read · O(n) vs O(1) When we say an algorithm is O(n), we imply that it takes n steps to take this algorithm from start to finish, given n is the number of input, or in the array case, the length of an array. For example, let's look at the following code sn...
MMilo commentedJun 24, 2021 · 4 min read · Imagine you are in a library, facing rows of bookshelves. Each bookshelf is stacked with rows and rows of books covering many topics–History, Astronomy, Biography, and Literature–like this one I got from Google: Because the libraries have to handle ...
Join discussion