Coding Patterns: Longest Common Substring/Subsequence (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Posts by Tag
- python 33
- algorithms 24
- data-structures 9
- basics 8
- dynamic-programming 5
- graphs 3
- binary-numbers 2
- bitwise-operators 2
- list 1
- string 1
- linked-list 1
- stack 1
- queue 1
- binary-tree 1
- heap 1
- search 1
- hash-table 1
- hashing 1
- dictionary 1
- binary-search-tree 1
- sort 1
- sorting 1
- greedy 1
python
Coding Patterns: Palindromes (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Staircase (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Bitwise XOR
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Topological Sort (Graph)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: 0/1 Knapsack (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: K-way Merge
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Top K Numbers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Modified Binary Search
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Subsets
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Two Heaps
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Depth First Search (DFS)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Breadth First Search (BFS)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: In-place Reversal of a Linked List
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Cyclic Sort
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Merge Intervals
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Fast & Slow Pointers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Two Pointers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Sliding Window
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Graphs
Graph theory is a branch of Mathematics, first introduced in 1736 when mathematician Carl Ehler introduced Leonhard Euler to the Seven Bridges of Königsberg ...
Greedy Algorithms
A greedy algorithm, as the name suggests, always makes the choice that seems to be the best at that moment. This means that it makes a locally-optimal choice...
Dynamic Programming
Dynamic programming is all about breaking down an optimization problem into simpler sub-problems, and storing the solution to each sub-problem so that each s...
Sorting Algorithms with Animations
Sorting refers to arranging the given data in a particular format and it is one of the most common operations in Computer Science.
Binary Search Trees
The Binary Search Tree (BST) is a Binary Tree with the following properties.
Hash Tables
A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing a...
Search Algorithms
Searching for items and sorting through items are tasks that we do everyday. If a deck of cards has less than 52 cards, how do you determine which card is mi...
Heaps
The word heap is used in a couple of different context in Computer Science. A heap is sometimes refers to an area in the memory which is used for dynamic mem...
Binary Tree
Binary Tree is a classical data structure in Computer Science. It is a non-linear data structure and formally a binary tree is either empty or a root node wi...
Stacks and Queues
Stacks and Queues are two fundamental data structures often used in Computer Science.
Linked Lists
Linked Lists are among the most common data structures used in computer science.
Strings
Strings are one of the basic types that are built into the Python interpreter.1 You can create strings (str) by enclosing a sequence of characters within a p...
Lists
In Python, when people are talking about arrays, they are generally referring to lists. However, there is a fundamental difference between them which can be ...
Data Structures in Python
Data structures -as their name suggests- are structures which can hold some data together. They are one of the most important fundamental concepts in Compute...
algorithms
Tarjan’s Algorithm: Strongly Connected Components
Tarjan’s algorithm1, 2 which runs in linear time is an algorithm in Graph Theory for finding the strongly connected components of a directed graph.
Coding Patterns: Longest Common Substring/Subsequence (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Palindromes (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Staircase (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Bitwise XOR
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Topological Sort (Graph)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: 0/1 Knapsack (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: K-way Merge
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Top K Numbers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Modified Binary Search
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Subsets
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Two Heaps
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Depth First Search (DFS)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Breadth First Search (BFS)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: In-place Reversal of a Linked List
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Cyclic Sort
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Merge Intervals
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Fast & Slow Pointers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Two Pointers
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Sliding Window
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Greedy Algorithms
A greedy algorithm, as the name suggests, always makes the choice that seems to be the best at that moment. This means that it makes a locally-optimal choice...
Dynamic Programming
Dynamic programming is all about breaking down an optimization problem into simpler sub-problems, and storing the solution to each sub-problem so that each s...
Sorting Algorithms with Animations
Sorting refers to arranging the given data in a particular format and it is one of the most common operations in Computer Science.
Search Algorithms
Searching for items and sorting through items are tasks that we do everyday. If a deck of cards has less than 52 cards, how do you determine which card is mi...
data-structures
Graphs
Graph theory is a branch of Mathematics, first introduced in 1736 when mathematician Carl Ehler introduced Leonhard Euler to the Seven Bridges of Königsberg ...
Binary Search Trees
The Binary Search Tree (BST) is a Binary Tree with the following properties.
Hash Tables
A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing a...
Heaps
The word heap is used in a couple of different context in Computer Science. A heap is sometimes refers to an area in the memory which is used for dynamic mem...
Binary Tree
Binary Tree is a classical data structure in Computer Science. It is a non-linear data structure and formally a binary tree is either empty or a root node wi...
Stacks and Queues
Stacks and Queues are two fundamental data structures often used in Computer Science.
Linked Lists
Linked Lists are among the most common data structures used in computer science.
Lists
In Python, when people are talking about arrays, they are generally referring to lists. However, there is a fundamental difference between them which can be ...
Data Structures in Python
Data structures -as their name suggests- are structures which can hold some data together. They are one of the most important fundamental concepts in Compute...
basics
Graphs
Graph theory is a branch of Mathematics, first introduced in 1736 when mathematician Carl Ehler introduced Leonhard Euler to the Seven Bridges of Königsberg ...
Heaps
The word heap is used in a couple of different context in Computer Science. A heap is sometimes refers to an area in the memory which is used for dynamic mem...
Binary Tree
Binary Tree is a classical data structure in Computer Science. It is a non-linear data structure and formally a binary tree is either empty or a root node wi...
Stacks and Queues
Stacks and Queues are two fundamental data structures often used in Computer Science.
Linked Lists
Linked Lists are among the most common data structures used in computer science.
Strings
Strings are one of the basic types that are built into the Python interpreter.1 You can create strings (str) by enclosing a sequence of characters within a p...
Lists
In Python, when people are talking about arrays, they are generally referring to lists. However, there is a fundamental difference between them which can be ...
Data Structures in Python
Data structures -as their name suggests- are structures which can hold some data together. They are one of the most important fundamental concepts in Compute...
dynamic-programming
Coding Patterns: Longest Common Substring/Subsequence (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Palindromes (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: Staircase (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Coding Patterns: 0/1 Knapsack (DP)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Dynamic Programming
Dynamic programming is all about breaking down an optimization problem into simpler sub-problems, and storing the solution to each sub-problem so that each s...
graphs
Tarjan’s Algorithm: Strongly Connected Components
Tarjan’s algorithm1, 2 which runs in linear time is an algorithm in Graph Theory for finding the strongly connected components of a directed graph.
Coding Patterns: Topological Sort (Graph)
In Coding Patterns series, we will try to recognize common patterns underlying behind each algorithm question, using real examples from Leetcode.
Graphs
Graph theory is a branch of Mathematics, first introduced in 1736 when mathematician Carl Ehler introduced Leonhard Euler to the Seven Bridges of Königsberg ...
binary-numbers
Bit Manipulation Tricks
If programming is a craft, then it is best learned by imitation and lots of practice. These bit manipulation techniques are little programming tricks that ma...
Binary Computation and Bitwise Operators
If binary code is something only computers can understand, why should you learn about it?
bitwise-operators
Bit Manipulation Tricks
If programming is a craft, then it is best learned by imitation and lots of practice. These bit manipulation techniques are little programming tricks that ma...
Binary Computation and Bitwise Operators
If binary code is something only computers can understand, why should you learn about it?
list
Lists
In Python, when people are talking about arrays, they are generally referring to lists. However, there is a fundamental difference between them which can be ...
string
Strings
Strings are one of the basic types that are built into the Python interpreter.1 You can create strings (str) by enclosing a sequence of characters within a p...
linked-list
Linked Lists
Linked Lists are among the most common data structures used in computer science.
stack
Stacks and Queues
Stacks and Queues are two fundamental data structures often used in Computer Science.
queue
Stacks and Queues
Stacks and Queues are two fundamental data structures often used in Computer Science.
binary-tree
Binary Tree
Binary Tree is a classical data structure in Computer Science. It is a non-linear data structure and formally a binary tree is either empty or a root node wi...
heap
Heaps
The word heap is used in a couple of different context in Computer Science. A heap is sometimes refers to an area in the memory which is used for dynamic mem...
search
Search Algorithms
Searching for items and sorting through items are tasks that we do everyday. If a deck of cards has less than 52 cards, how do you determine which card is mi...
hash-table
Hash Tables
A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing a...
hashing
Hash Tables
A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing a...
dictionary
Hash Tables
A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing a...
binary-search-tree
Binary Search Trees
The Binary Search Tree (BST) is a Binary Tree with the following properties.
sort
Sorting Algorithms with Animations
Sorting refers to arranging the given data in a particular format and it is one of the most common operations in Computer Science.
sorting
Sorting Algorithms with Animations
Sorting refers to arranging the given data in a particular format and it is one of the most common operations in Computer Science.
greedy
Greedy Algorithms
A greedy algorithm, as the name suggests, always makes the choice that seems to be the best at that moment. This means that it makes a locally-optimal choice...