Algorithms (LeetCode, HackerRank, Codility, CTCI - Cracking The Coding Interview & Miscellaneous studies & solutions)
Problem Tags |
---|
Binary Search |
Binary Tree |
Breadth First Search (BFS) (Both BSTs and Graphs) |
Depth First Search (DFS) (Both BSTs and Graphs) |
Divide and Conquer |
Dynamic Programming |
Graph |
Greedy |
Interactive |
Linked List |
Minimum Spanning Tree - MST |
Notes |
Shortest Path |
Sliding Window |
Sorting |
Tree |
Trie |
Common Pitfalls & Notes |
---|
Integer.MAX_VALUE and Integer.MIN_VALUE usages |
PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
---|---|---|---|---|
Codility | Binary Gap | π’Easy | Iterations | Lessons / 1 - Iterations |
Codility | Cyclic Rotation | π’Easy | Arrays | Lessons / 2 - Arrays |
Codility | Odd Occurrences In Array | π’Easy | Arrays | Lessons / 2 - Arrays |
Codility | Frog Jump (FrogJmp) | π’Easy | Time Complexity | Lessons / 3 - Time Complexity |
Codility | Permutation Missing Element (PermMissingElem) | π’Easy | Time Complexity | Lessons / 3 - Time Complexity |
Codility | Tape Equilibrium (TapeEquilibrium) | π’Easy | Time Complexity | Lessons / 3 - Time Complexity |
Codility | Brackets | π’Easy | Stacks and Queues | Lessons / 7 - Stacks and Queues |
Codility | Fish | π’Easy | Stacks and Queues | Lessons / 7 - Stacks and Queues |
Codility | Nesting | π’Easy | Stacks and Queues | Lessons / 7 - Stacks and Queues |
PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
---|---|---|---|---|
HackerRank | 2D Array - DS | π’Easy | Array | Data Structures / Arrays |
HackerRank | Sales by Match | π’Easy | Array | Algorithms / Implementation |
HackerRank | Minimum Absolute Difference in an Array | π’Easy | Greedy | Algorithms / Greedy |
PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
---|---|---|---|---|
CTCI | C1Q1 - IsUniqueChars | π’Easy | Arrays and Strings | Data Structures / Arrays |
CTCI | C1Q4 - Anagram | π’Easy | Arrays and Strings | Data Structures / Arrays |
CTCI | C1Q7 - RotateMatrix | π’Easy | Arrays and Strings | Data Structures / Arrays |
CTCI | C1Q8 - ZeroMatrix | π’Easy | Arrays and Strings | Data Structures / Arrays |
CTCI | C2Q1 - RemoveDups | π’Easy | Linked Lists | Data Structures / LinkedLists |
CTCI | C2Q2 - ReturnKthToLast | π’Easy | Linked Lists | Data Structures / LinkedLists |
CTCI | C8Q1 - TripleStep | π’Easy | Dynamic Programming | Algorithms / Dynamic Programming |
PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
---|---|---|---|---|
Misc | Longest substring length with K distinct characters | π’Easy | Sliding Window | Algorithms / Sliding Window |
Misc | Maximum Sum Of Contiguous SubArray Of Fixed Size K | π’Easy | Sliding Window | Algorithms / Sliding Window |
Misc | Smallest subarray with given sum | π’Easy | Sliding Window | Algorithms / Sliding Window |
Misc | Bubble Sort | π’Easy | Sorting | Algorithms / Sorting |
Misc | Insertion Sort | π’Easy | Sorting | Algorithms / Sorting |
Misc | Merge Sort | π’Easy | Sorting | Algorithms / Sorting |
Misc | Quick Sort | π’Easy | Sorting | Algorithms / Sorting |
Misc | Selection Sort | π’Easy | Sorting | Algorithms / Sorting |
Misc | Sorted Array | π’Easy | Sorting | Algorithms / Sorting |
Misc | Dijkstra's Algorithm | π’Easy | Shortest Path | Algorithms / Shortest Path |
Misc | Prim's Algorithm | π’Easy | Minimum Spanning Tree - MST | Algorithms / Minimum Spanning Tree - MST |
Misc | Binary Tree From Sorted Array | π’Easy | Binary Tree | Algorithms / Study |
Misc | Lru Cache Impl. | π’Easy | Lru Cache | Algorithms / Study |
Misc | Reverse LinkedList | π’Easy | Linked List | Algorithms / Study |
Misc | Biggest Two Digit Value String Fragment | π’Easy | Algorithms / Assessments | |
Misc | Min Num Of Letters Must Be Deleted | π Medium | Algorithms / Assessments | |
Misc | Chain Divided Into Three Smaller Chains | π Medium | Algorithms / Assessments | |
Misc | 0/1 Knapsack Problem | π Medium | Dynamic Programming | Problem Set / Algorithms |