April 2025 GFG SOLUTION
๐ Table of Contents ๐
For discussions, questions, or doubts related to this solution, please visit my LinkedIn: Any Questions. 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๐
Solutions๐ก
Day 1: DFS of Graph๐๐๐ฒ
Day 2: BFS of graph๐๐ถโโ๏ธ๐ฒ
Day 3: Rotten Oranges๐๐ฆ โณ
Day 4: Undirected Graph Cycleโป๏ธ๐๐
Day 5: Find the number of islands๐๏ธ๐งญโต
Day 6: Topological sort๐ฆ๐ธ๏ธ๐ฃ๏ธ
Day 7: Directed Graph Cycle๐๐๐ฆ
Day 8: Bridge edge in a graph๐๐ธ๏ธ๐งญ
Day 9: Articulation Point - II๐ธ๏ธโ๏ธ๐บ๏ธ
Day 10: Minimum cost to connect all houses in a city๐๏ธ๐ฐ๐
Day 11: Dijkstra Algorithm๐ฆ๐ก๐บ๏ธ
Day 12: Flood fill Algorithm๐๐๏ธ๐ธ
Day 13: Clone an Undirected Graph๐๐ฅ๐งฌ
Day 14: Alien Dictionary๐ช๐๐ฆพ
Day 15: Bellman-Ford๐๐ฃ๏ธ๐ฆ
Day 16: Floyd Warshall๐๐๐ฅ
Day 17: Minimum Weight Cycle๐งฎ๐๐
Day 18: Implement Trie๐ ๐๐
Day 21: Missing in Array๐ข๐งฉ๐ต๏ธโโ๏ธ
Day 22: Unique Number I๐ข๐ง ๐ต๏ธโโ
Day 23: Unique Number II๐ข๐ต๏ธโโ๏ธ๐งพ
Day 24: Unique Number III๐ข๐คฏ๐ฅ
Day 25: Majority Element๐ข๐๐ณ๏ธ
Day 26: Is Binary Tree Heap๐ณโ๐ ๏ธ
Day 27: Multiply two stringsโ๏ธ๐ข๐๏ธ
Day 28: Maximum sum of Non-adjacent nodes๐ณ๐ซ๐จโ๐งโ๐ฆ
Day 29: Sort a linked list of 0s, 1s and 2s0๏ธโฃ1๏ธโฃ2๏ธโฃ
Day 30: Find length of Loop๐๐๐งฉ
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
Last updated