🌟 Welcome to My GFG Journey! 🌟

Hello! I'm thrilled to share my journey and accomplishments on GeeksforGeeks with you. 🚀✨

🌐 About Me

🏆🌟I solve the Problem of the Day on GeeksforGeeks daily 🗓️🧩 and have successfully tackled Love Babbar's 450 DSA sheet 📚 and Fraz's 180 DSA sheet 📘. My primary coding language is C++ 💻, but I have also solved many problems in Java ☕. 🏆🌟

🏆 My Achievements

Solved the daily Problem of the Day on GFG 🧠🔥
Completed Love Babbar's 450 DSA sheet 📚
Completed Fraz's 180 DSA sheet 📘
Proficient in C++ and Java 💻

🚀 Topics and Subtopics Mastered

Here’s a detailed list of the topics and subtopics I have mastered, categorized and neatly organized:

🚀 C++ and Java

Basic Syntax 📝
Object-Oriented Programming 🧩
STL (Standard Template Library) 📚

🌳 Data Structures

Linked List: Singly, Doubly, Circular 🔗
Graphs: BFS, DFS, Dijkstra’s, Prim’s, Kruskal’s 🌐
Trees: Binary Trees, Binary Search Trees, AVL Trees 🌲
Heaps: Min-Heap, Max-Heap ⛏️
Tries: Prefix Trees 📚
Stacks and Queues: Stack, Queue, Priority Queue 📊

🧩 Algorithms

Sorting: Quick Sort, Merge Sort, Heap Sort 🔄
Searching: Binary Search, Linear Search 🔍
Dynamic Programming: Memoization, Tabulation 🎯
Greedy Algorithms: Activity Selection, Huffman Coding 🤑
Backtracking: N-Queens, Sudoku Solver ♟️
Divide and Conquer: Merge Sort, Quick Sort ⚔️
Bit Manipulation: Bitwise AND, OR, XOR 🧩

📈 Advanced Topics

Graphs: Bellman-Ford, Floyd-Warshall, Topological Sort 🌐
Recursion: Basic to Advanced Recursion Techniques ♾️
Matrix: Spiral Order, Search in Sorted Matrix, Rotate Matrix 🔄
Hashing: Hash Maps, Hash Sets, Collision Handling 🔑

🔥 Additional Competitive Programming Topics

Fenwick Tree: Binary Indexed Tree 🌳
Segment Tree: Range Queries, Lazy Propagation 🌲
Union-Find: Disjoint Set Union (DSU) 📌
String Algorithms: KMP, Rabin-Karp, Z Algorithm 📝
Game Theory: Nim Game, Grundy Numbers 🎮
Geometry: Convex Hull, Line Intersection 📐
Number Theory: Sieve of Eratosthenes, Modular Arithmetic 🔢

📅 Daily Practice

I consistently solve the GFG Problem of the Day to stay sharp and up-to-date with different problem-solving techniques. 🧠💡

📂 Repository Structure

Here's how this repository is structured for easy navigation:

GFG-Journey/
|
├── C++/
|   ├── LinkedList/
|   ├── Graphs/
|   ├── Strings/
|   ├── Matrix/
|   ├── Trie/
|   ├── Hash/
|   ├── Recursion/
|   ├── Backtracking/
|   ├── BitManipulation/
|   ├── Greedy/
|   ├── BinarySearchTree/
|   ├── Arrays/
|   ├── Heap/
|   ├── DynamicProgramming/
|   ├── BinaryTrees/
|   ├── DivideAndConquer/
|   ├── StacksAndQueues/
|   ├── SearchingAndSorting/
|   ├── FenwickTree/
|   ├── SegmentTree/
|   ├── UnionFind/
|   ├── StringAlgorithms/
|   ├── GameTheory/
|   ├── Geometry/
|   ├── NumberTheory/
|
├── Java/
|   ├── LinkedList/
|   ├── Graphs/
|   ├── Strings/
|   ├── Matrix/
|   ├── Trie/
|   ├── Hash/
|   ├── Recursion/
|   ├── Backtracking/
|   ├── BitManipulation/
|   ├── Greedy/
|   ├── BinarySearchTree/
|   ├── Arrays/
|   ├── Heap/
|   ├── DynamicProgramming/
|   ├── BinaryTrees/
|   ├── DivideAndConquer/
|   ├── StacksAndQueues/
|   ├── SearchingAndSorting/
|   ├── FenwickTree/
|   ├── SegmentTree/
|   ├── UnionFind/
|   ├── StringAlgorithms/
|   ├── GameTheory/
|   ├── Geometry/
|   ├── NumberTheory/
|
└── README.md

Feel free to explore each directory for detailed solutions and explanations of the problems I've solved. Happy coding! 😊

Name		Name	Last commit message	Last commit date
Latest commit History 429 Commits
3out1in		3out1in
404 Not Found		404 Not Found
ABC Conjecture		ABC Conjecture
AVL Tree Deletion		AVL Tree Deletion
AVL Tree Insertion		AVL Tree Insertion
Account Merge		Account Merge
Add Binary		Add Binary
Add Binary Strings		Add Binary Strings
Add two numbers represented by linked lists		Add two numbers represented by linked lists
Additive sequence		Additive sequence
Adivitiya		Adivitiya
All Unique Permutations of an Array		All Unique Permutations of an Array
All Unique Permutations of an array		All Unique Permutations of an array
Allocate minimum number of pages		Allocate minimum number of pages
Angle Between Hour and Minute Hand		Angle Between Hour and Minute Hand
Anti Diagonal Traversal of Matrix		Anti Diagonal Traversal of Matrix
Armstrong Numbers		Armstrong Numbers
Arrange Consonants and Vowels		Arrange Consonants and Vowels
Array Pair Sum Divisibility Problem		Array Pair Sum Divisibility Problem
Array Removals		Array Removals
Better String		Better String
Binary Search		Binary Search
Binary Tree to CDLL		Binary Tree to CDLL
Binary representation of next number		Binary representation of next number
Bit Difference		Bit Difference
Bleak Numbers		Bleak Numbers
Boolean Matrix		Boolean Matrix
Boolean Parenthesization		Boolean Parenthesization
Boundary Traversal of Matrix		Boundary Traversal of Matrix
Brackets in Matrix Chain Multiplication		Brackets in Matrix Chain Multiplication
Bus Conductor		Bus Conductor
Buy Maximum Stocks if i stocks can be bought on i-th day		Buy Maximum Stocks if i stocks can be bought on i-th day
Buy and Sell a Share at most twice		Buy and Sell a Share at most twice
CamelCase Pattern Matching		CamelCase Pattern Matching
Candy		Candy
Check If Given Four Points Form a Square		Check If Given Four Points Form a Square
Check If two Line segments Intersect.cpp		Check If two Line segments Intersect.cpp
Check for BST		Check for BST
Check for Children Sum Property in a Binary Tree		Check for Children Sum Property in a Binary Tree
Check if Circular Linked List		Check if Circular Linked List
Check if Tree is Isomorphic		Check if Tree is Isomorphic
Check if a given graph is tree or not		Check if a given graph is tree or not
Check if a number is divisible by 8		Check if a number is divisible by 8
Check if a string is repetition of its substring of k-length		Check if a string is repetition of its substring of k-length
Check if all leaves are at same level		Check if all leaves are at same level
Check if frequencies can be equal		Check if frequencies can be equal
Check if string is rotated by two places		Check if string is rotated by two places
Check if strings are rotations of each other or not		Check if strings are rotations of each other or not
Check whether BST contains Dead End		Check whether BST contains Dead End
Circular Tour		Circular Tour
City With the Smallest Number of Neighbors at a Threshold Distance		City With the Smallest Number of Neighbors at a Threshold Distance
Clone an Undirected Graph		Clone an Undirected Graph
Closest Neighbour in BST		Closest Neighbour in BST
Column name from a given column number		Column name from a given column number
Combination Sum II		Combination Sum II
Compare two fractions.cpp		Compare two fractions.cpp
Concatenation of Zig-Zag String in n Rows		Concatenation of Zig-Zag String in n Rows
Consecutive 1's Not Allowed		Consecutive 1's Not Allowed
Construct Binary Tree from Inorder and Postorder		Construct Binary Tree from Inorder and Postorder
Construct Binary Tree from String with bracket representation		Construct Binary Tree from String with bracket representation
Construct a Full Binary Tree		Construct a Full Binary Tree
Construct list using given q XOR queries		Construct list using given q XOR queries
Convert To Roman No.		Convert To Roman No.
Convert array into Zig-Zag fashion		Convert array into Zig-Zag fashion
Count More than n k Occurences		Count More than n k Occurences
Count Pairs With Given Sum		Count Pairs With Given Sum
Count Pairs in an Array		Count Pairs in an Array
Count Pairs whose sum is equal to X		Count Pairs whose sum is equal to X
Count Pairs with Given Sum		Count Pairs with Given Sum
Count Total Set Bits		Count Total Set Bits
Count Ways To Reach The n'th Stairs		Count Ways To Reach The n'th Stairs
Count all Possible Path		Count all Possible Path
Count digit groupings of a number		Count digit groupings of a number
Count no. of Hops		Count no. of Hops
Count no. of Substrings		Count no. of Substrings
Count number of Hops		Count number of Hops
Count numbers containing 4		Count numbers containing 4
Count pairs Sum in matrices		Count pairs Sum in matrices
Count possible ways to construct buildings		Count possible ways to construct buildings
Count the Reversals		Count the Reversals
Count the elements		Count the elements
Count ways to N'th Stair		Count ways to N'th Stair
Count ways to reach the n'th stair		Count ways to reach the n'th stair
Course Schedule		Course Schedule
Coverage of all Zeros in a Binary Matrix.cpp		Coverage of all Zeros in a Binary Matrix.cpp
DFS of Graph		DFS of Graph
Decimal Equivalent of Binary Linked List		Decimal Equivalent of Binary Linked List
Delete Middle of Linked List		Delete Middle of Linked List
Delete node in Doubly Linked List.cpp		Delete node in Doubly Linked List.cpp
Detect Cycle Using DSU		Detect Cycle Using DSU
Detect Loop In Linked List		Detect Loop In Linked List
Determinant of a Matrix		Determinant of a Matrix
Determine if Two Trees are Identical		Determine if Two Trees are Identical
Diagonal sum in binary tree		Diagonal sum in binary tree
Distance of nearest cell having 1		Distance of nearest cell having 1
Distinct occurrences		Distinct occurrences
Distribute candies in a binary tree		Distribute candies in a binary tree
Divisibility tree		Divisibility tree
Divisor Game		Divisor Game
Does array represent Heap		Does array represent Heap

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

🌟 Welcome to My GFG Journey! 🌟

🌐 About Me

🏆 My Achievements

🚀 Topics and Subtopics Mastered

🚀 C++ and Java

🌳 Data Structures

🧩 Algorithms

📈 Advanced Topics

🔥 Additional Competitive Programming Topics

📅 Daily Practice

📂 Repository Structure

About

Releases

Packages

Languages

nidhiupman568/GFG-Problem-Solved

Folders and files

Latest commit

History

Repository files navigation

🌟 Welcome to My GFG Journey! 🌟

🌐 About Me

🏆 My Achievements

🚀 Topics and Subtopics Mastered

🚀 C++ and Java

🌳 Data Structures

🧩 Algorithms

📈 Advanced Topics

🔥 Additional Competitive Programming Topics

📅 Daily Practice

📂 Repository Structure

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages