https://github.com/d-4-dibakar/geeksforgeeks
https://github.com/d-4-dibakar/geeksforgeeks
Last synced: 7 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/d-4-dibakar/geeksforgeeks
- Owner: D-4-DIBAKAR
- Created: 2024-11-16T04:38:42.000Z (11 months ago)
- Default Branch: Master
- Last Pushed: 2024-12-02T16:03:53.000Z (10 months ago)
- Last Synced: 2025-01-26T16:12:29.899Z (9 months ago)
- Language: Java
- Size: 51.8 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
GeeksForGeeks
![]()
GFG 160 Series - Syllabus Progress Tracker
## 01-Arrays
- [x] Second Largest Element
- [x] Move all Zeros to End
- [x] Reverse an Array
- [x] Rotate an Array
- [x] Next Permutation
- [x] Majority Element II
- [x] Stock Buy and Sell (With No Limit)
- [x] Stock Buy and Sell (With One Limit)
- [x] Minimize the Heights
- [x] Maximum Sum Subarray
- [x] Maximum Product Subarray
- [x] Maximum Sum Subarray in Circular
- [x] First Missing Positive## 02-String
- [x] String to Integer - Your Own atoi()
- [x] Add Two Binary Strings
- [x] Anagram Check
- [x] First Non-Repeating Character
- [x] KMP Algorithm for Pattern Searching
- [ ] Min Chars to Add for Palindrome
- [ ] String Rotations of each other## 03-Sorting
- [ ] Sort an array of 0s, 1s and 2s
- [ ] Count Inversions
- [ ] Merge Overlapping Intervals
- [ ] Insert and Merge Interval
- [ ] Find Non-Overlapping Intervals
- [ ] Merge Two Sorted Arrays With Constant Extra Space
- [ ] Top K Frequent Elements## 04-Searching
- [ ] Count Occurrences in a Sorted Array
- [ ] Minimum in a Sorted and Rotated Array
- [ ] Search in a Sorted and Rotated Array
- [ ] Peak Element
- [ ] K-th Element of Merged Two Sorted Arrays
- [ ] Aggressive Cows
- [ ] Allocate Minimum Pages
- [ ] Kth Missing Positive Number## 05-Matrix
- [ ] Spiral Traversal
- [ ] Rotate Matrix
- [ ] Search in a sorted matrix
- [ ] Search in a row-wise sorted
- [ ] Search in a row-wise and column-wise sorted
- [ ] Set Matrix Zeroes## 06-Hashing
- [ ] Pair with given sum - 2Sum
- [ ] Count Pairs with given sum
- [ ] Intersection of Two Sets
- [ ] Union of Two Sets
- [ ] Longest Consecutive Subsequence
- [ ] Group Anagrams
- [ ] Count Subarrays with given sum
- [ ] Count Subarrays with given XOR## 07-Two Pointer Technique
- [ ] Check for Pair Sum in Sorted
- [ ] Triplets in Sorted
- [ ] Triplets in Unsorted
- [ ] Print All Pairs with given sum
- [ ] Closest Pair
- [ ] Count Pairs in Sorted
- [ ] Subarray with given sum
- [ ] Count distinct elements in every window of size k
- [ ] Longest Substring With Distinct Characters
- [ ] Trapping Rain Water
- [ ] Container with most water## 08-Prefix Sum
- [ ] Equilibrium Point
- [ ] Longest Subarray with Given Sum
- [ ] Longest Subarray with Equal No of 0s and 1s
- [ ] Product of Array except Self
- [ ] Find Starting Petrol Pump for Circular Tour## 09-Linked List
- [ ] Reverse a Linked List
- [ ] Rotate a Linked List
- [ ] Merge Two Sorted Lists
- [ ] Reverse a linked list in groups
- [ ] Sum two Linked Lists
- [ ] Clone a Linked List
- [ ] Detect Cycle
- [ ] First Node of the Cycle
- [ ] Remove Cycle
- [ ] LRU Cache## 10-Backtracking
- [ ] Permutations of a String
- [ ] N Queens
- [ ] Solve the Sudoku## 11-Tree
- [ ] Level Order Traversal
- [ ] Height of a Binary Tree
- [ ] Diameter of a Tree
- [ ] Invert Binary Tree
- [ ] Construct Tree from Inorder and Preorder
- [ ] Morris Traversal
- [ ] Boundary Traversal
- [ ] Maximum Path Sum
- [ ] Count all K Sum Paths in Binary Tree
- [ ] Is Valid BST
- [ ] K-th Smallest in BST
- [ ] Pair with given Sum in BST
- [ ] Correct a BST with two nodes got swapped
- [ ] LCA in BST
- [ ] Serialize and Deserialize a Binary Tree## 12-Heap
- [ ] K Largest Elements
- [ ] K closest point to origin
- [ ] Merge K Sorted Lists
- [ ] Median of a Stream## 13-Stack
- [ ] Valid Parentheses
- [ ] Longest Valid Parentheses
- [ ] Next Greater Element
- [ ] Stock Span
- [ ] Largest Area in a Histogram
- [ ] Maximum and Minimum of every window size
- [ ] Min Stack
- [ ] Evaluate Reverse Polish Notation
- [ ] Decode the String## 14-Queue and Deque
- [ ] Sliding Window Maximum
- [ ] Maximum score with jumps of at most length K## 15-Dynamic Programming
- [ ] Longest Increasing Subsequence
- [ ] Longest String Chain – Chain of words in an Array
- [ ] Longest Common Subsequence
- [ ] Longest Palindromic Subsequence
- [ ] Longest Palindromic Substring
- [ ] Count Palindromic Substring
- [ ] Edit Distance
- [ ] Stair Climbing
- [ ] Weighted Stair Climbing
- [ ] 0-1 knapsack
- [ ] Coin Change - Count Ways
- [ ] Count Change - Minimum Coins
- [ ] Minimum Jumps to Reach End
- [ ] Subset Sum Problem
- [ ] Partition Equal Subset Sum
- [ ] Stock Buy and Sell (Limit of K)
- [ ] Stock Buy and Sell (Limit of 2)
- [ ] House Robbing
- [ ] House Robbing (Circular)
- [ ] Count Possible Decodings of a Digit Sequence
- [ ] Matrix Chain Multiplication
- [ ] Boolean Parenthesization
- [ ] Word Break## 16-Greedy
- [ ] Minimum Platforms
- [ ] Weighted Job Scheduling
- [ ] Job Sequencing
- [ ] Maximize Partitions with Unique Characters## 17-Graph
- [ ] DFS
- [ ] BFS
- [ ] Minimum time to Rot Oranges
- [ ] Cycle in an Undirected Graph
- [ ] Islands in a Graph
- [ ] Topological Sorting
- [ ] Cycle in a Directed Graph
- [ ] Redundant Connections - Bridges in a Graph
- [ ] Articulation Points
- [ ] Minimum Cost to connect all points
- [ ] Dijkstra's Algorithm
- [ ] Flood Fill
- [ ] Clone a Graph
- [ ] Alien Dictionary
- [ ] Distance from Source - Negative Weight Cycle
- [ ] Find the City With the Smallest Number of Neighbors at a Threshold Distance
- [ ] Email Account Merging## 18-Tries
- [ ] Implement Trie
- [ ] Word Search
- [ ] Maximum XOR of Two Numbers in an Array## 19-Bit Manipulation
- [ ] Find the only repetitive element between 1 to N-1
- [ ] Find the Missing Number
- [ ] Unique Number 1
- [ ] Unique Number 2
- [ ] Unique Number 3