Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.

See full index

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
Start Studying

Decks in this class (29)

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

Learn more about spaced repetition

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 Interview Questions
  • 3 decks
  • 45 flashcards
  • 2 learners
Decks: Python Interview Qs, Data Structures, Concurrent Programming, And more!
Cracking the Coding Interview
  • 9 decks
  • 281 flashcards
  • 1 learners
Decks: Big O, Ch 1 Arrays Strings, Ch 2 Linked Lists, And more!
Coding Interviews
  • 5 decks
  • 65 flashcards
  • 1 learners
Decks: Blind 75, Sean Prashad, System Design Concepts, And more!
Find Flashcards
Make Flashcards
Brainscape helps you realize your greatest personal and professional ambitions through strong habits and hyper-efficient studying.
© 2023 Bold Learning Solutions. Terms and Conditions