Aditya Gupta (@offx_aadi) 's Twitter Profile
Aditya Gupta

@offx_aadi

β€’ I am currently immersing myself in the realm of problem-solving.

β€’ I am deeply passionate about competitive programming, that's why I solve DSA problems.

ID: 1790378026024243200

linkhttps://www.linkedin.com/in/aditya-gupta-iuj/ calendar_today14-05-2024 13:46:20

33 Tweet

1 Followers

26 Following

Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day142 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Find the Number of Islands πŸ“¦ Concept: Used DFS/BFS on a grid to count disconnected land clusters ('1'). #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day142 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Find the Number of Islands
πŸ“¦ Concept: Used DFS/BFS on a grid to count disconnected land clusters ('1'). 

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day143 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Topological Sort πŸ“¦ Concept: Used DFS Algorithm to linearly order vertices of a DAG so that every directed edge u β†’ v #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day143 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Topological Sort
πŸ“¦ Concept: Used DFS Algorithm to linearly order vertices of a DAG so that every directed edge u β†’ v 

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day144 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Directed Graph Cycle πŸ“¦ Concept: Used DFS with recursion stack to detect back edges in a directed graph. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day144 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Directed Graph Cycle
πŸ“¦ Concept: Used DFS with recursion stack to detect back edges in a directed graph.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

🎯Milestone Achieved! Just claimed this exclusive T-shirt for completing the #GfG160 Challenge! 100+ days of consistency, countless problems solved, and endless learning momentsπŸ”₯ Grateful to GeeksforGeeks for the inspiration and platform to grow πŸš€πŸ’š #gfg160 #geekstreak2025

🎯Milestone Achieved!
Just claimed this exclusive T-shirt for completing the #GfG160 Challenge! 
100+ days of consistency, countless problems solved, and endless learning momentsπŸ”₯
Grateful to <a href="/geeksforgeeks/">GeeksforGeeks</a> for the inspiration and platform to grow πŸš€πŸ’š
#gfg160 #geekstreak2025
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day145 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Bridge Edge in a Graph πŸ“¦ Concept: Applied DFS with discovery and low times. Track parents and update low values. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day145 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Bridge Edge in a Graph
πŸ“¦ Concept: Applied DFS with discovery and low times. Track parents and update low values.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day146 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Articulation Point – II πŸ“¦ Concept: Used Tarjan’s Algorithm with DFS to find articulation points by tracking discovery time and low values. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect

πŸ“˜ #Day146 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Articulation Point – II
πŸ“¦ Concept: Used Tarjan’s Algorithm with DFS to find articulation points by tracking discovery time and low values.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day147 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Minimum Cost to Connect All Houses in a City πŸ“¦ Concept: Modeled the city houses as graph vertices and roads as weighted edges. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day147 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Minimum Cost to Connect All Houses in a City
πŸ“¦ Concept: Modeled the city houses as graph vertices and roads as weighted edges.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day148 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Dijkstra’s Algorithm πŸ“¦ Concept: Implemented Dijkstra’s shortest path algorithm using a priority queue. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day148 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Dijkstra’s Algorithm
πŸ“¦ Concept: Implemented Dijkstra’s shortest path algorithm using a priority queue.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day149 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Flood Fill Algorithm πŸ“¦ Concept: Applied DFS/BFS traversal to fill all connected cells of the same color starting from a given pixel. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect

πŸ“˜ #Day149 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Flood Fill Algorithm
πŸ“¦ Concept: Applied DFS/BFS traversal to fill all connected cells of the same color starting from a given pixel.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day150 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Clone an Undirected Graph πŸ“¦ Concept: Used DFS/BFS with a hashmap to map original nodes to their cloned counterparts. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day150 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Clone an Undirected Graph
πŸ“¦ Concept: Used DFS/BFS with a hashmap to map original nodes to their cloned counterparts.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day151 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Alien Dictionary πŸ“¦ Concept: Built a directed graph from the given dictionary words by comparing adjacent strings. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day151 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Alien Dictionary
πŸ“¦ Concept: Built a directed graph from the given dictionary words by comparing adjacent strings.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day152 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Bellman-Ford Algorithm πŸ“¦ Concept: Relaxed all edges (V-1) times) to compute shortest paths. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day152 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Bellman-Ford Algorithm
πŸ“¦ Concept: Relaxed all edges (V-1) times) to compute shortest paths.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day153 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Floyd–Warshall Algorithm πŸ“¦ Concept: Used dynamic programming to compute shortest paths between all pairs of vertices. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day153 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Floyd–Warshall Algorithm
πŸ“¦ Concept: Used dynamic programming to compute shortest paths between all pairs of vertices.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day154 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Minimum Weight Cycle πŸ“¦ Concept: Applied graph algorithms to detect the smallest cycle by checking shortest paths and edges. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day154 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Minimum Weight Cycle
πŸ“¦ Concept: Applied graph algorithms to detect the smallest cycle by checking shortest paths and edges. 

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day155 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Implement Trie πŸ“¦ Concept: Designed a tree-like data structure where each node represents a character. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day155 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Implement Trie
πŸ“¦ Concept: Designed a tree-like data structure where each node represents a character. 

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day156 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Maximum XOR of Two Numbers in an Array πŸ“¦ Concept: Used a Trie-based bitwise approach to maximize XOR. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day156 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Maximum XOR of Two Numbers in an Array
πŸ“¦ Concept: Used a Trie-based bitwise approach to maximize XOR. 

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day157 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Find Only Repetitive Element from 1 to n-1 πŸ“¦ Concept: Use Floyd’s Cycle Detection to detect the duplicate in an array. #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day157 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Find Only Repetitive Element from 1 to n-1
πŸ“¦ Concept: Use Floyd’s Cycle Detection to detect the duplicate in an array.

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day158 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Missing in Array πŸ“¦ Concept: Use n*(n+1)/2 – sum(arr) to find the missing element in an array of size n-1 containing num (1->n) #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day158 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Missing in Array
πŸ“¦ Concept: Use n*(n+1)/2 – sum(arr) to find the missing element in an array of size n-1 containing num (1-&gt;n)

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day159 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Unique Number I πŸ“¦ Concept: Leveraged the XOR property XOR-ing all elements cancels out duplicates, leaving only the unique no #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic

πŸ“˜ #Day159 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Unique Number I
πŸ“¦ Concept: Leveraged the XOR property  XOR-ing all elements cancels out duplicates, leaving only the unique no

#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode #LetsConnect #LearnInPublic
Aditya Gupta (@offx_aadi) 's Twitter Profile Photo

πŸ“˜ #Day160 | #gfg160 with GeeksforGeeks πŸš€ πŸ’° Problem Solved: Unique Number II 160 days strong! A huge milestone β€” completing the entire #gfg160 journey πŸŽ‰πŸ’― Grateful for the learning, growth, and consistency. πŸš€πŸ”₯ #gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode

πŸ“˜ #Day160 | #gfg160 with <a href="/geeksforgeeks/">GeeksforGeeks</a> πŸš€
πŸ’° Problem Solved: Unique Number II
160 days strong! A huge milestone β€” completing the entire #gfg160 journey πŸŽ‰πŸ’―
Grateful for the learning, growth, and consistency. πŸš€πŸ”₯
#gfg160 #geekstreak2025 #DSA #CodingChallenge #160DaysOfCode