Grateful for the journey and the appreciation from @geeksforgeeks! 🎁 Ready for more challenges ahead! 💪 #geekstreak2024 #gfg160

I worked on: Searching, sorting, and dynamic programming Graphs, recursion, and advanced data structures Each problem helped me grow as a coder. 🧠💻 #geekstreak2024 #gfg160

🚀 #geekstreak2024 with @geeksforgeeks! 160 days of problem-solving! Improved my skills in algorithms, data structures, and coding. Learned a lot along the way. 💡 #geekstreak2024 #gfg160

Approach: ◾️Traverse the array while maintaining a stack to track elements with no greater element found. ◾️For each element, pop from the stack until a greater element is found, and update the result. Time Complexity: O(n) Space Complexity: O(n) #geekstreak2024 #gfg160

Day 160 of #geekstreak2024 with @geeksforgeeks! Solved Next Greater Element to efficiently find the next larger element for each element in an array using a stack.

Approach: ▪️Traverse through each gas station, calculate the available gas at each step, and update the start station if the tank runs out. ▪️Check if the total gas is enough to cover the total cost; if not, return -1. #geekstreak2024 #gfg160

Day 159 of #geekstreak2024 with @geeksforgeeks! Solved Gas Station problem to determine the starting station for a circular route, ensuring sufficient gas to complete the circuit.

Approach: ▪️XOR all numbers in the array, which results in a number where the only non-zero bits are those corresponding to the two unique numbers. ▪️Use this result to partition the array and identify the two distinct numbers. #geekstreak2024 #gfg160

Day 158 of #geekstreak2024 with @geeksforgeeks! Solved Unique Number II to efficiently find the two distinct numbers occurring exactly once in the array.

Approach: ▪️XOR all numbers in the array. ▪️The result will be the number that occurs only once, since pairs of identical numbers cancel each other out. Time Complexity: O(n) Space Complexity: O(1) #geekstreak2024 #gfg160

Day 157 of #geekstreak2024 with @geeksforgeeks! Solved Unique Number I by using the XOR operation to find the number occurring only once in the array.

Approach: ▪️Compute the sum of all integers from 1 to n (expected sum). ▪️Calculate the sum of elements in the given array (actual sum). ▪️The missing number is the difference between the expected and actual sums. #geekstreak2024 #gfg160

Day 156 of #geekstreak2024 with @geeksforgeeks! Solved Missing in Array by comparing the expected sum with the actual sum to find the missing element.

Approach: ◾️Initialize a visited[] array of size n with false. ◾️Traverse arr[]: ▪️If visited[arr[i]] is already true, it’s the duplicate. ▪️Else, mark visited[arr[i]] = true. #geekstreak2024 #gfg160

Day 155 of #geekstreak2024 with @geeksforgeeks! Solved Find Only Repetitive Element from 1 to n-1 by leveraging a boolean visited array for constant-time tracking. 🔁🔍

Approach: Use a binary Trie to store 32-bit representations of numbers. Insert: Store each number as a path of bits in the Trie. Get Max XOR: Traverse the Trie trying to take the opposite bit at each level to maximize XOR. #geekstreak2024 #gfg160

Day 154 of #geekstreak2024 with @geeksforgeeks! Solved Maximum XOR of Two Numbers in an Array using a Binary Trie approach!

Approach: 🔸Use a TrieNode class to store children and end-of-word markers. 🔸Insert: Add words character by character. 🔸Search: Check for the word's existence. 🔸Prefix: Check if the word is a prefix. #geekstreak2024 #gfg160

Day 153 of #geekstreak2024 with @geeksforgeeks! Solved Trie Implementation to efficiently handle insert, search, and prefix queries.

Here’s what I’ve learned: 🔹 Writing clean code feels so good 🔹 Edge cases are tricky but important 🔹 Consistent practice really pays off 💯 Can’t wait for the next challenge! On to more coding adventures! 🔥✨ #JavaScript #LeetCode #CodingJourney #JS #100DaysOfCode