> For the complete documentation index, see [llms.txt](https://hunterdii.gitbook.io/gfg-solution/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://hunterdii.gitbook.io/gfg-solution/april-2025-gfg-solution.md).

# April 2025 GFG SOLUTION

### 📜 Table of Contents 📜

For discussions, questions, or doubts related to this solution, please visit my LinkedIn: [Any Questions](https://www.linkedin.com/in/patel-hetkumar-sandipbhai-8b110525a). Thank you for your input, together, we strive to create a space where learning is a collaborative endeavor.

#### 🔮Your feedback is valuable! Please consider leaving a 🌟 star 🌟 and sharing your thoughts in the comments.

* [Introduction](/gfg-solution/readme.md)📝
* [Solutions](/gfg-solution/april-2025-gfg-solution.md)💡
  * [Day 1: DFS of Graph](/gfg-solution/april-2025-gfg-solution/01-apr-dfs-of-graph.md)🌐🔍🌲
  * [Day 2: BFS of graph](/gfg-solution/april-2025-gfg-solution/02-apr-bfs-of-graph.md)🌐🚶‍♂️🌲
  * [Day 3: Rotten Oranges](/gfg-solution/april-2025-gfg-solution/03-apr-rotten-oranges.md)🍊🦠⏳
  * [Day 4: Undirected Graph Cycle](/gfg-solution/april-2025-gfg-solution/04-apr-undirected-graph-cycle.md)♻️🔍💠
  * [Day 5: Find the number of islands](/gfg-solution/april-2025-gfg-solution/05-apr-find-the-number-of-islands.md)🏝️🧭⛵
  * [Day 6: Topological sort](/gfg-solution/april-2025-gfg-solution/06-apr-topological-sort.md)📦🕸️🛣️
  * [Day 7: Directed Graph Cycle](/gfg-solution/april-2025-gfg-solution/07-apr-directed-graph-cycle.md)🔄🔁🚦
  * [Day 8: Bridge edge in a graph](/gfg-solution/april-2025-gfg-solution/08-apr-bridge-edge-in-a-graph.md)🌉🕸️🧭
  * [Day 9: Articulation Point - II](/gfg-solution/april-2025-gfg-solution/09-apr-articulation-point-ii.md)🕸️⚙️🗺️
  * [Day 10: Minimum cost to connect all houses in a city](/gfg-solution/april-2025-gfg-solution/10-apr-minimum-cost-to-connect-all-houses-in-a-city.md)🏘️💰🌆
  * [Day 11: Dijkstra Algorithm](/gfg-solution/april-2025-gfg-solution/11-apr-dijkstra-algorithm.md)🚦📡🗺️
  * [Day 12: Flood fill Algorithm](/gfg-solution/april-2025-gfg-solution/12-apr-flood-fill-algorithm.md)🌊🖌️📸
  * [Day 13: Clone an Undirected Graph](/gfg-solution/april-2025-gfg-solution/13-apr-clone-an-undirected-graph.md)📈👥🧬
  * [Day 14: Alien Dictionary](/gfg-solution/april-2025-gfg-solution/14-apr-alien-dictionary.md)🪐🌐🦾
  * [Day 15: Bellman-Ford](/gfg-solution/april-2025-gfg-solution/15-apr-bellman-ford.md)📉🛣️🚦
  * [Day 16: Floyd Warshall](/gfg-solution/april-2025-gfg-solution/16-apr-floyd-warshall.md)🌐🔁💥
  * [Day 17: Minimum Weight Cycle](/gfg-solution/april-2025-gfg-solution/17-apr-minimum-weight-cycle.md)🧮🌐🌀
  * [Day 18: Implement Trie](/gfg-solution/april-2025-gfg-solution/18-apr-implement-trie.md)🔠📝🚀
  * [Day 19: Maximum XOR of two numbers in an array](/gfg-solution/april-2025-gfg-solution/19-apr-maximum-xor-of-two-numbers-in-an-array.md)➕➖❌
  * [Day 20: Find Only Repetitive Element from 1 to n-1](/gfg-solution/april-2025-gfg-solution/20-apr-find-only-repetitive-element-from-1-to-n-1.md)➿🔢🧷
  * [Day 21: Missing in Array](/gfg-solution/april-2025-gfg-solution/21-apr-missing-in-array.md)🔢🧩🕵️‍♂️
  * [Day 22: Unique Number I](/gfg-solution/april-2025-gfg-solution/22-apr-unique-number-i.md)🔢🧠🕵️‍♂
  * [Day 23: Unique Number II](/gfg-solution/april-2025-gfg-solution/23-apr-unique-number-ii.md)🔢🕵️‍♂️🧾
  * [Day 24: Unique Number III](/gfg-solution/april-2025-gfg-solution/24-apr-unique-number-iii.md)🔢🤯💥
  * [Day 25: Majority Element](/gfg-solution/april-2025-gfg-solution/25-apr-majority-element.md)🔢👑🗳️
  * [Day 26: Is Binary Tree Heap](/gfg-solution/april-2025-gfg-solution/26-apr-is-binary-tree-heap.md)🌳❌🛠️
  * [Day 27: Multiply two strings](/gfg-solution/april-2025-gfg-solution/27-apr-multiply-two-strings.md)✖️🔢🖋️
  * [Day 28: Maximum sum of Non-adjacent nodes](/gfg-solution/april-2025-gfg-solution/28-apr-maximum-sum-of-non-adjacent-nodes.md)🌳🚫👨‍👧‍👦
  * [Day 29: Sort a linked list of 0s, 1s and 2s](/gfg-solution/april-2025-gfg-solution/29-apr-sort-a-linked-list-of-0s-1s-and-2s.md)0️⃣1️⃣2️⃣
  * [Day 30: Find length of Loop](/gfg-solution/april-2025-gfg-solution/30-apr-find-length-of-loop.md)🔗📏🧩

### Introduction

This repository contains solutions to daily problems from GeeksforGeeks. Each day, a new problem is provided along with its solution.

*Day 1(01 APR) :* DFS of Graph

*Day 2(02 APR) :* BFS of graph

*Day 3(03 APR) :* Rotten Oranges

*Day 4(04 APR) :* Undirected Graph Cycle

*Day 5(05 APR) :* Find the number of islands

*Day 6(06 APR) :* Topological sort

*Day 7(07 APR) :* Directed Graph Cycle

*Day 8(08 APR) :* Bridge edge in a graph

*Day 9(09 APR) :* Articulation Point - II

*Day 10(10 APR) :* Minimum cost to connect all houses in a city

*Day 11(11 APR) :* Dijkstra Algorithm

*Day 12(12 APR) :* Flood fill Algorithm

*Day 13(13 APR) :* Clone an Undirected Graph

*Day 14(14 APR) :* Alien Dictionary

*Day 15(15 APR) :* Bellman-Ford

*Day 16(16 APR) :* Floyd Warshall

*Day 17(17 APR) :* Minimum Weight Cycle

*Day 18(18 APR) :* Implement Trie

*Day 19(19 APR) :* Maximum XOR of two numbers in an array

*Day 20(20 APR) :* Find Only Repetitive Element from 1 to n-1

*Day 21(21 APR) :* Missing in Array

*Day 22(22 APR) :* Unique Number I

*Day 23(23 APR) :* Unique Number II

*Day 24(24 APR) :* Unique Number III

*Day 25(25 APR) :* Majority Element

*Day 26(26 APR) :* Is Binary Tree Heap

*Day 27(27 APR) :* Multiply two strings

*Day 28(28 APR) :* Maximum sum of Non-adjacent nodes

*Day 29(29 APR) :* Sort a linked list of 0s, 1s and 2s

*Day 30(30 APR) :* Find length of Loop