This class was created by Brainscape user Matthew McAteer. Visit their profile to learn more about the creator.
By:
Matthew McAteer
- decks
- flashcards
- learners
Decks in this class (29)
Array Strategies
Binary search 1,
Find maximum in sliding window 2,
Search rotated array 3
12
cards
Dynamic Programming Strategies
Largest sum subarray 1,
Maxsum subsequence nonadjacent el...,
Game scoring find the number of w...
39
cards
Linked List Strategies
Reverse a singly linked list 1,
Remove duplicates from a linked l...,
Delete node with a given key 3
14
cards
Math & Stats Strategies
Find kth permutation 1,
Integer division 2,
Pythagorean triplets 3
15
cards
String Strategies
Reverse words in a sentence 1,
Remove duplicates 2,
Remove white spaces 3
7
cards
Tree Strategies
Check if two binary trees are ide...,
Write an in order iterator for a ...,
Iterative inorder traversal 3
16
cards
Stack & Queue Strategies
Stack using queues 1,
Queue using stacks 2,
Expression evaluation 3
4
cards
Graph Strategies
Clone a directed graph 1,
Minimum spanning tree 2,
Word chaining 3
3
cards
Back-tracking strategies
Boggle 1,
All possible braces 2,
Solve n queens problem 3
4
cards
Sliding Window Strategies
Maximum sum subarray of size k 1,
Smallest subarray with a given sum 2,
Longest substring with k distinct...
11
cards
Two-pointer strategies
Pair with target sum 1,
Remove duplicates 2,
Squaring a sorted array 3
12
cards
Fast & Slow Pointer Strategies
Linkedlist cycle 1,
Start of linkedlist cycle 2,
Happy number any number will be c...
7
cards
Merge Intervals Problems
Merge intervals 1,
Insert interval 2,
Intervals intersection 3
7
cards
Cyclic Sort Problems
Cyclic sort 1,
Find the missing number 2,
Find all missing numbers 3
8
cards
InPlace Reversal of LinkedList
Reverse a linkedlist 1,
Reverse a sub list 2,
Reverse every k element sub list 3
5
cards
Tree Breadth First Search Strategies
Binary tree level order traversal 1,
Reverse level order traversal 2,
Zigzag traversal 3
10
cards
Tree Depth First Search Strategies
Binary tree path sum 1,
All paths for a sum 2,
Sum of path numbers 3
7
cards
Two-Heap Problems
Find the median of a number stream 1,
Sliding window median 2,
Maximize capital 3
5
cards
Subset Problems
Subsets 1,
Subsets with duplicates 2,
Permutations given a set of disti...
9
cards
Modified Binary Search Problems
Order agnostic binary search 1,
Ceiling of a number 2,
Next letter 3
10
cards
Top K elements problems
Top k numbers 1,
Kth smallest number 2,
K closest points to the origin 3
14
cards
K-way Merge Problems
Merge k sorted lists 1,
Kth smallest number in m sorted l...,
Kth smallest number in a sorted m...
5
cards
Topological Sort (Graph) Strategies
Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if event ‘B’ is dependent on event ‘A’, ‘A’ comes before ‘B’ in topological ordering.
This pattern defines an easy way to understand the technique for performing topological sorting of a set of elements and then solves a few problems using it.
7
cards
Matrix Strategies
Make columns and rows zeros 1,
Search in a matrix 2,
Closest meeting point 3
6
cards
ML Basics
Using the following template cons...
1
cards
Trie (Digital/Prefix tree) Strategies
Implement trie prefix tree 1,
Add and search word data structur...,
Word search ii boggle 3
17
cards
Facebook Sample Questions
This is a sample of questions based on real-life ones from Facebook. This is not intended to be comprehensive (after all, the company intentionally switches up their questions to avoid memorization), but it should give you a good sense for the kind of concepts that are important to keep in mind.
11
cards
Google Sample Questions
Ratio finder given a list of conv...
1
cards
Amazon Sample Questions
Most people alive 1
1
cards
More about
Coding Interviews (Python)
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Matthew McAteer's Coding Interviews (Python) flashcards for their Brown University class 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?
PYTHON Coding Interviews
- 29 decks
- 268 flashcards
- 7 learners
Decks:
Array Strategies, Dynamic Programming Strategies, Linked List Strategies, And more!
My Coding Interview
- 31 decks
- 465 flashcards
- 67 learners
Decks:
Sorts, Data Structures, Math, And more!
