Data Structure and Algorithms Resources
Level 0: Arrays and HashMap
Level 1: Two Pointers, BinarySearch, SlidingWindow, Strings
- Binary Search
- Search a 2D Matrix
- Find Minimum In Rotated Sorted Array : (Youtube Explaination)
- Search In Rotated Sorted Array
- Median of Two Sorted Arrays
- Find First and Last Position of Element in Sorted Array
- Find Minimum Time to Finish All Jobs
- Minimum Number of Days to Make m Bouquets
- Split Array Largest Sum
- Square root of an integer
- Search in Bitoinic Array : (Youtube explaination.)
Two Pointers
Binary Search
SlidingWindow
Level 2: Stack, LinkedList
- Reorder List
You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → … - Reverse Nodes In K Group
- Merge K Sorted Lists
- LRU Cache
- Find The Duplicate Number
Stack
LinkedList
Level 3: Trees, HashMaps, Heaps and Maps
- Find lowest common ancestor of two given nodes in binary tree.
- Check whether tree is binary search tree.
- Invert Binary Tree.
- Flip Equivalent Binary Tree.
- Binary Tree Maximum Path Sum.
- Binary Tree Zigzag Level Order Traversal.
- Binary Tree Right Side View.
- Binary Tree Vertical Order Traversal.
- Boundry Of Binary Tree.
- Flatten Binary Tree To Linked List.