Skip to content

Latest commit

 

History

History
54 lines (43 loc) · 1.21 KB

Intro.md

File metadata and controls

54 lines (43 loc) · 1.21 KB

Study plan based on https://github.com/jwasham/coding-interview-university Good resource here https://hackernoon.com/how-to-prepare-yourself-for-data-structures-and-algorithms-interviews-at-faang-mm23316l

Goals

  • Further my computer science knowledge
  • Keep my skills up to date
  • Improve my problem solving skills
  • To gain the skills to land a role at a top-tier company

Format

This collection of notes was built with Obsidian, a "knowledge base" system built ontop of Markdown files. It supports Mermaid graphs, LaTeX formatting and more.

Contents

  • [[Algorithmic Complexity and Big O Notation]]
  • [[Common Strategies]]

Data Structures

  • [[Array]]
  • [[Hash Table]]
  • [[TreeMap]]
  • [[Linked List]]
  • [[Queue]]
  • [[Stack]]
  • [[LRU Cache]]
  • [[Binary Search Tree]]
  • [[Binary Heap]]
  • [[Trie]]

Algorithms

  • [[Algorithms/Contents]]

System Design

  • [[System Design/Contents]]

Compsci

  • [[Bitwise operations]]
  • [[Character Sets]]
  • [[Powers of 2]]
  • [[Regex]]
  • [[Hash Functions]]

Android

  • [[Architecture Overview]]
  • [[Activity Architecture]]
  • [[Thread Scheduling]]

Maths

  • [[DeMorgan's Law]]
  • [[Sets]]
  • [[n-choose-k]]

Behavioural

  • [[Behavioural Interview Notes]]