SubPages

Python basics

Complexity Analysis & Big O

_Object-Oriented Analysis and Design

Hashtables & Hashsets

Recursion, DP & Backtracking

Stacks & Queues

Trees & Graphs

Sorting

Searching

Heaps & Priority Queues

Greedy Algorithms

Trie (Keyword Tree)

Math Tricks

One of those

Quick Tips

_Patterns for Coding Questions

Data Structures and Algorithms

I have to literally lookup up every leetcode solution. Is it normal?

Introduction | Tech Interview Handbook

Coding Interview Prep

Comprehensive Data Structure and Algorithm Study Guide - LeetCode Discuss

Posts by Category

Data Structure Visualization

Introduction

How To Find a Solution

Python Functions

TOPICS WHICH YOU CAN'T SKIP [INTERVIEW PREPARATION | STUDY PLAN] USING LEETCODE - LeetCode Discuss

All You Need This For Better Preparation - LeetCode Discuss

Important and Useful links from all over the LeetCode - LeetCode Discuss

A LeetCode Grinding Guide

Data structures playlist

My notes for the night before interview. - LeetCode Discuss

Other

Data structures and Algorithms (patterns):

• Binary search: BS can be used in so many different situations!
• Leap year, GCD, LCM, isPrime, prime finding, prime factorization
• Bit manipulation
• Reservoir sampling
• 2 pointer strategy and sliding window
• cumulative sum, prefix sum (1d, 2d, 3d)
• Sorting: selection sort, quick sort, quick select, insertion sort (with binary search optimization), merge sort, heap sort, radix sort, counting sort, bucket sort
• String strategies: rabin-karp, KMP, Boyer-Moore
• Graph: Dijkstra, Bellman-Ford, Union find, Kruskal, Prim, Floyd-Warshall, Tarjan, DFS, BFS, Ford Fulkerson & Edmond (Min cut max flow), Hamiltonion path (with bitmasking), Eulerian cycle, Topological sorting
• DFS: backtracking
• Monotonically increasing stack, queue, etc.
• DP: Top-down using recursion and memoization, Bottom up using iteration and tabulation
• Classic DP patterns: LCS, LIS, LIS (strictly increasing), Equal sum partition
• BIT: binary indexed tree/sedgwick tree
• Interval trees
• Tree: inorder, preorder, postorder traversal: iterative and recursive, morris traversal to do those 3 in O(1) space
• Binary search trees (BSTs), heaps, splay trees, red-black trees, skip list, avl tree

Tips:

https://www.topcoder.com/thrive/articles/Greedy is Good

https://www.topcoder.com/thrive/articles/An Introduction to Recursion Part Two

Data structures in 5 min:

How to approach problems

Interview Cake Slides

TODO