MSCS
CtrlK
  • Introduction
  • School Work
    • Design and Analysis of Algorithms
      • Time Complexity
      • Loop Invariant
      • Insertion Sort
      • Merge Sort
      • Binary Heap
      • Heap Sort
      • Hash Tables
    • Principles of Database Systems
      • Data Model
      • Entity Relationship Model
        • Design Considerations
        • University ER
        • Extended ER
      • Relational Model
        • Schema Diagram for University Database
        • Converting ER to Relational Model
      • Disks and Disk Models
      • I/O - Efficient Sorting
      • Indexing
        • Index Structures
        • Tree Structures
        • Hash Tables
        • Primary Index vs. Secondary Index
        • Dense Index vs. Sparse Index
    • Introduction to Java
      • Page 4
    • Introduction to Operating Systems
      • Page 9
    • Big Data
      • Page 1
    • Web Search Engines
      • The Web and Web Search
      • Introduction to Information Retrieval
      • Basic setups and Techniques
      • Main Components of a Search Engine
    • Network Security
      • Security Basics
      • Risk Assessment
      • Cyber Kill Chain
        • Network Reconnaissance
    • Machine Learning
    • Application Security
    • Responsible Data Science
  • Technical Interview
    • System Design
      • Web Crawler
    • Design Pattern
    • Infrastructure
    • Information Security
  • LeetCode Solutions
    • String
      • 5. Longest Palindromic Substring 🔥
      • 49. Group Anagrams
      • 125. Valid Palindrome
      • 271. Encode and Decode Strings
      • 344. Reverse String
      • 819. Most Common Word
      • 937. Reorder Data in Log Files
    • Arrays
      • 1. Two Sum
      • 15. 3Sum
      • 42. Trapping Rain Water 🔥
      • 121. Best Time to Buy and Sell Stock
      • 238. Product of Array Except Self 🔥
      • 561. Array Partition
    • Linked List
      • 2. Add Two Numbers
      • 19. Reverse Linked List II 🔥
      • 21. Merge Two Sorted Lists
      • 24. Swap Nodes in Pairs
      • 206. Reverse Linked List
      • 234. Palindrome Linked List
      • 328. Odd Even Linked List
    • Stack, Queue
      • Stack
        • 20. Valid Parentheses
        • 316. Remove Duplicate Letters 🔥
        • 739. Daily Temperatures
      • Queue
        • 225. Implement Stack using Queues
        • 232. Implement Queue using Stacks
        • 622. Design Circular Queue
    • Deque, Priority Queue
      • 23. Merge k Sorted Lists 🔥
      • 641. Design Circular Deque
    • Hash Table
      • 3. Longest Substring Without Repeating Characters
      • 347. Top K Frequent Elements
      • 706. Design HashMap
      • 771. Jewels and Stones
    • Graphs
      • 17. Letter Combinations of a Phone Number
      • 39. Combination Sum
      • 46. Permutations
      • 77. Combinations
      • 78. Subsets
      • 200. Number of Islands
      • 207. Course Schedule 🔥
      • 332. Reconstruct Itinerary
      • The Shortest Path
        • 743. Network Delay Time
        • 787. Cheapest Flights Within K Stops
    • Trees
      • 104. Maximum Depth of Binary Tree
      • 105. Construct Binary Tree from Preorder and Inorder Traversal
      • 108. Convert Sorted Array to Binary Search Tree
      • 110. Balanced Binary Tree
      • 226. Invert Binary Tree
      • 297. Serialize and Deserialize Binary Tree
      • 310. Minumum Height Trees
      • 543. Diameter of Binary Tree 🔥
      • 617. Merge Two Binary Trees
      • 687. Longest Univalue Path
      • 783. Minimum Distance Between BST Nodes
      • 938. Range Sum of BST
      • 1038. Binary Search Tree to Greater Sum Tree
    • Heap
      • 215. Kth Largest Element in an Array
      • 1046. Last Stone Weight
    • Tries
      • 208. Implement Trie (Prefix Tree) 🔥
      • 336. Palindrome Pairs
    • Sorting
      • 75. Sort Colors 🔥
      • 148. Sort List
      • 56. Merge Intervals
      • 147. Insertion Sort List
      • 179. Largest Number
      • 242. Valid Anagram
      • 973. K Closest Points to Origin
    • Binary Search
      • 33. Search in Rotated Sorted Array 🔥
      • 167. Two Sum II - Input Array Is Sorted
      • 240. Search a 2D Matrix II
      • 349. Intersection of Two Arrays
      • 704. Binary Search
    • Bit Manipulation
      • 136. Single Number
      • 191. Number of 1 Bits
      • 371. Sum of Two Integers 🔥
      • 393. UTF-8-Validation 🔥
      • 461. Hamming Distance
    • Sliding Window
      • 76. Minimum Window Substring
      • 239. Sliding Window Maximum
      • 424. Longest Repeating Character Replacement
    • Greedy
      • 122. Best Time to Buy and Sell Stock II
      • 134. Gas Station
      • 406. Queue Reconstruction by Height
      • 455. Assign Cookies
      • 621. Task Scheduler
    • Divide-and-Conquer
      • 169. Majority Element
      • 241. Different Ways to Add Parentheses 🔥
    • Dynamic Programming
      • 53. Maximum Subarray
      • 70. Climbing Stairs
      • 198. House Robber
      • 509. Fibonacci Number
      • 746. Min Cost Climbing Stairs
    • SQL
Powered by GitBook
On this page
  1. Technical Interview

System Design

  • System Design Fight Club: https://www.youtube.com/@SDFC

  • System Design Resources: https://github.com/NirmalSilwal/system-design-resources

  • System Design Primer: https://github.com/donnemartin/system-design-primer

  • SystemDesign.org - Textbook for System Design Interviews: https://docs.google.com/document/d/1pOarvQbjzLd9tz5ZuxktyrYsZ41mbWba5_LUeFj65lI/edit

  • Basics of System Design: https://www.youtube.com/playlist?list=PLt4nG7RVVk1g_LutiJ8_LvE914rIE5z4u

  • Low Level Design: https://www.youtube.com/playlist?list=PL12BCqE-Lp650Cg6FZW7SoZwN8Rw1WJI7

Last updated 1 year ago