View Code? Open in Web Editor
NEW
PriorityQueue Time and Space complexity. Binary Tree : Get Number of Node; Get depth; Inorder, preorder, postorder; DFS, BFS, Double linkedlist
codetraining's Introduction
| Week 1 |
Week2 |
| Arrays & String |
Binary Trees & LinkedList |
| Easy: 27 |
Easy: |
| Medium: 5 |
Medium: |
- Easy : Two Sum
- Medium: Valid-parentheses
- Easy : Reverse String
- Easy : Reverse String II
- Easy : Reverse Words in a String III
- Easy : Word Pattern
- Easy: Two Sum II - Input array is sorted
- Easy: Two Sum IV - Input is a BST
- Easy : Sort Array By Parity
- Easy: Contains Duplicate
- Easy : Contains Duplicate II
- Medium: Contains Duplicate III
- Hard: Median of Two sorted Arrays
- Easy : Flipping an Image
- Easy : Pascal's Triangle
- Easy : Squares of a Sorted Array
- Easy : Merge Sorted Array
- Medium:
- Easy : Merge Two Sorted Lists
- Easy : Sort Array By Parity ||
- Easy: Fibonacci Number
- Easy : Available Captures for rook
- Easy : find common characters
- Easy: Intersection of Two Arrays II
- Medium : sort an array
- Medium: Sort Colors
- Easy :sum of even numbers after queries
- Easy : 1-bit and 2-bit Characters
- Easy : Transpose Matrix
- Easy : Toeplitz Matrix
- Easy: Majority Element
- Easy : Last Stone Weight (PQ)
Binary Trees and Linked Lists
- Easy : Peak index in a mountain array
- Easy : Range Sum of BST
- Easy: Search in a Binary Search Tree
- Easy : N-ary Tree Preorder Traversal
- Medium: Insert into a Binary Search Tree
- Medium : Binary Search Tree to Greater sum tree
- Medium : Binary Tree Preorder Traversal
- Easy : Merge Two Sorted Lists
- Easy : Balanced Binary Tree
- Easy : Palindrome Linked List
- Easy : Maximum Depth of N-ary Tree
- Medium: Remove Nth Node From End of List
- Medium : kth smallest element in a BST
codetraining's People
Contributors
Watchers
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent