Coding Interviews (Python)

This class was created by Brainscape user Matthew McAteer. Visit their profile to learn more about the creator.

Flashcard maker: Matthew McAteer

Decks in this class (29)

Array Strategies
The creator of this deck did not yet add a description for what is included in this deck.
12  cards
Dynamic Programming Strategies
The creator of this deck did not yet add a description for what is included in this deck.
39  cards
Linked List Strategies
The creator of this deck did not yet add a description for what is included in this deck.
14  cards
Math & Stats Strategies
The creator of this deck did not yet add a description for what is included in this deck.
15  cards
String Strategies
The creator of this deck did not yet add a description for what is included in this deck.
7  cards
Tree Strategies
The creator of this deck did not yet add a description for what is included in this deck.
16  cards
Stack & Queue Strategies
The creator of this deck did not yet add a description for what is included in this deck.
4  cards
Graph Strategies
The creator of this deck did not yet add a description for what is included in this deck.
3  cards
Back-tracking strategies
The creator of this deck did not yet add a description for what is included in this deck.
4  cards
Sliding Window Strategies
The creator of this deck did not yet add a description for what is included in this deck.
11  cards
Two-pointer strategies
The creator of this deck did not yet add a description for what is included in this deck.
12  cards
Fast & Slow Pointer Strategies
The creator of this deck did not yet add a description for what is included in this deck.
7  cards
Merge Intervals Problems
The creator of this deck did not yet add a description for what is included in this deck.
7  cards
Cyclic Sort Problems
The creator of this deck did not yet add a description for what is included in this deck.
8  cards
InPlace Reversal of LinkedList
The creator of this deck did not yet add a description for what is included in this deck.
5  cards
Tree Breadth First Search Strategies
The creator of this deck did not yet add a description for what is included in this deck.
10  cards
Tree Depth First Search Strategies
The creator of this deck did not yet add a description for what is included in this deck.
7  cards
Two-Heap Problems
The creator of this deck did not yet add a description for what is included in this deck.
5  cards
Subset Problems
The creator of this deck did not yet add a description for what is included in this deck.
9  cards
Modified Binary Search Problems
The creator of this deck did not yet add a description for what is included in this deck.
10  cards
Top K elements problems
The creator of this deck did not yet add a description for what is included in this deck.
14  cards
K-way Merge Problems
The creator of this deck did not yet add a description for what is included in this deck.
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
The creator of this deck did not yet add a description for what is included in this deck.
6  cards
ML Basics
The creator of this deck did not yet add a description for what is included in this deck.
1  cards
Trie (Digital/Prefix tree) Strategies
The creator of this deck did not yet add a description for what is included in this deck.
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
The creator of this deck did not yet add a description for what is included in this deck.
1  cards
Amazon Sample Questions
The creator of this deck did not yet add a description for what is included in this deck.
1  cards

More about Coding Interviews (Python)

  • Company name Unspecified
  • Training purpose Employee Onboarding
  • Industry Other
  • Number of employees who could use this 2001+

Like the SATs, getting better at coding interviews requires a lot of practice. However also like the SATs, there's a fair amount of common patterns and repeat problems. Combine this class with live practice (such as pramp.com or interviewing.io), and you'll be on your way to that FAANG job of your dreams. INSTRUCTIONS FOR BEST RESULTS: Go on leetcode. Study the most frequent problems. Set a timer for 25 minutes and try each problem. If you spend more than 25 minutes, log the problem in a spreadsheet and tackle it another day. DO NOT LOOK AT ANSWERS UNTIL YOU HAVE SOLVED THE PROBLEM. Between problems use these flashcards.

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?

DS+Python+SQL interview questions
  • 5 decks
  • 364 flashcards
  • 9 learners
Decks: Sql Interview Questions, Python Interview Questions, Deep Learning, And more!
Coding Interview
  • 6 decks
  • 80 flashcards
  • 1 learners
Decks: Trees And Graphs, Problem Solutions, Python3, And more!
Coding Interview
  • 1 decks
  • 50 flashcards
  • 2 learners
Decks: Coding Interview, And more!
Make flashcards