This class was created by Brainscape user Katie D. Visit their profile to learn more about the creator.
By:
Katie D
- decks
- flashcards
- learners
Decks in this class (31)
Sorts
Quicksort time complexity 1,
Quicksort space complexity 2,
Quicksort how does it work 3
42
cards
Data Structures
Array index 1,
Array search 2,
Hash table search 3
12
cards
Math
Media 1,
Quadratic equation 2,
Factor quadratic equation 3
3
cards
Everything Else
Four layer web architecture 1,
Memoization 2,
Three layer web architecture 3
5
cards
Big O
Red 1,
Blue 2,
Purple 3
7
cards
Graphs
Legal graph coloring 1,
Adjacency list 2,
Adjacency matrix 3
9
cards
Distributed Systems
Cap theorem 1,
What does consistency in the cap ...,
What does availability mean 3
12
cards
GCP
Bigtable 1,
Bigquery 2,
Spanner 3
4
cards
Java Fundamentals
How does garbage collection work 1,
How is the heap divided in the ho...,
What is cms gc 3
17
cards
Databases
Cap 1,
C in acid 2,
A in acid 3
25
cards
OSI
Layer 1 osi model 1,
Layer 2 osi model 2,
Layer 3 osi model 3
8
cards
System Design - Caching
Approach to system design intervi...,
Application server cache pros and...,
How does a distributed cache work 3
8
cards
System Design - Load Balancer
Where are load balancers typicall...,
Load balancing algorithms 2,
Load balancer progression 3
3
cards
APIs
Get 1,
Put 2,
Patch 3
7
cards
Scala
Object keyword 1,
When to create a companion object 2,
Unit 3
21
cards
System Design - General
Latency versus throughput 1,
Performance requirements 2,
Approach to system design intervi...
33
cards
Python
Strings mutable 1,
Returns true if all char are alph...,
Returns true if all char are lett...
51
cards
System Design - Scale
Facebook dau 1,
Instagram dau 2,
Twitter mdau 3
8
cards
Algos
Backtracking 1,
What are the hallmarks of a backt...,
Two sum given an array of integer...
5
cards
Trees
Bfs 1,
Complete binary tree 2,
Full binary tree 3
15
cards
ML Technologies
Gitops 1,
Ml serving 2,
Feature store 3
3
cards
ML System Design
Elements of ml system design 1,
Questions to ask 2,
Confusion matrix 3
29
cards
Feature Imputation
Feature imputation techniques 1,
Data rows with null values tradeo...,
Dropping columns with high nullab...
4
cards
Feature Store
Online feature store 1,
Offline feature store 2,
Batch inference 3
19
cards
Heaps
Min heap 1,
Heap insertion time complexity 2,
Heap delete node time complexity 3
17
cards
Complete Binary Trees
Complete binary tree 1,
Complete binary tree in array for...,
Complete binary tree in array for...
6
cards
ML Models
Cons of logistic regression 1,
Pros of logistic regression 2,
Logistic regression 3
27
cards
ML Concepts
Feature crossing 1,
Example of crossing two features ...,
Feature selection 3
24
cards
ML Metrics
Offline metrics for classificatio...,
Offline metrics for regression 2,
Offline metrics for ranking system 3
30
cards
Discord
Inputstreamreader 1,
What does the server socket do 2,
How does a serversocket accept a ...
10
cards
Types of Binary Trees
Blank 1
1
cards
More about
My Coding Interview
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Katie D's My Coding Interview flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Coding Interviews (Python)
- 29 decks
- 268 flashcards
- 496 learners
Decks:
Array Strategies, Dynamic Programming Strategies, Linked List Strategies, And more!
CPT Coding
- 41 decks
- 740 flashcards
- 191 learners
Decks:
Ch 1 Text Questions, Ch 1 Chapter Review, Ch 1 Content Review, And more!
