Pritesh Gondaliya’s Post

🚀 Day 43 Challenge: Maximum Depth of Binary Tree 🚀 Hello there! On the forty-third day of my coding journey, I tackled the problem "Maximum Depth of Binary Tree" (Problem 104). 💡 Challenge Overview: The task in Problem 104 is to find the maximum depth of a binary tree. The maximum depth of a binary tree is defined as the maximum number of nodes along the longest path from the root node down to the farthest leaf node. The challenge here is to efficiently calculate the maximum depth of the given binary tree.

🚀 Day 54 Challenge: Increasing Order Search Tree 🚀 Hey there! On the fifty-fourth day of my coding journey, I tackled the problem "Increasing Order Search Tree" (Problem 897). 💡 Challenge Overview: The task in Problem 897 is to convert a binary search tree (BST) into a sorted linked list using an in-order traversal. The sorted linked list should only contain the tree's nodes, where each node's right child points to the next node in the list, and the left child is null. The challenge here is to perform this conversion efficiently.

🚀 Day 101/180 of #180DaysOfCode Challenge !! 🔍🔢 Row with Maximum 1s: Navigating the Binary Matrix! 💻 Today's coding quest: Find the Row with Maximum 1s. 🕵️♂️💡 The challenge? Given a binary matrix where each row is sorted in non-decreasing order, find the row with the maximum number of 1s. With each traversal across rows and columns, I meticulously counted the occurrences of 1s, identifying the row with the highest count. As I delved into the problem, I appreciated the efficiency of traversing the matrix and the significance of optimizing the search process to find the maximum count.

🚀 Day 9 of #100DaysOfCode Challenge! 🚀 Today marks my 9th day of the coding journey, and I dived into the world of sorting algorithms. 💻 🔍 Algorithm Spotlight: Selection Sort Selection sort is a straightforward sorting algorithm that repeatedly identifies the minimum element from the unsorted part of the array, placing it at the beginning. 🔄 📚 Problem of the Day: Selection Sort Challenge Task: Given an unsorted array with N non-negative integers, the goal is to sort the array in non-decreasing order using the Selection Sort algorithm. 📈

🚀 **Day 14 of my 30-Day Coding Challenge!** 🚀 Today, I solved a classic problem: finding the k-th element in the combined sorted array from two given sorted arrays. The challenge was to merge the arrays and identify the k-th element efficiently. 🔍 **Key Learnings:** - Implemented a two-pointer technique to merge the arrays without extra space. - Handled edge cases to ensure the solution is robust and optimal. - Improved my understanding of array manipulation and sorting algorithms. With persistence and problem-solving strategies, I successfully passed all test cases! #GeekStreak2024 #CodingChallenge #LearningJourney #ProblemSolving #TechCommunity

🚀 Day 49 Challenge: Create Target Array in the Given Order 🚀 Hey there! On the forty-ninth day of my coding journey, I tackled the problem "Create Target Array in the Given Order" (Problem 1389). 💡 Challenge Overview: The task in Problem 1389 is to create a target array given an array of integers and an array of indices. The target array is constructed by inserting the elements of the input array at the specified indices. The challenge here is to efficiently create the target array according to the given order of indices.

Day 25 of 60-Day Coding Challenge 🚀 Today, I tackled the "Merge Sorted Array" problem. Here’s the approach I used: Approach: Use three pointers: one for the end of valid nums1, one for nums2, and one for the end of the merged array. Merge elements from the end of both arrays, placing the larger one in the correct position. Copy any remaining elements from nums2 if necessary. Feeling great about the progress! On to the next challenge. 💪🔍 #Day25 #CodingChallenge #LeetCode

🚀 Day 55 Challenge: Insert into a Binary Search Tree 🚀 Hey there! On the fifty-fifth day of my coding journey, I tackled the problem "Insert into a Binary Search Tree" (Problem 701). 💡 Challenge Overview: The task in Problem 701 is to insert a value into a binary search tree (BST) while maintaining its property that the left subtree of a node contains only nodes with values less than the node's value, and the right subtree contains only nodes with values greater than the node's value. The challenge here is to perform this insertion efficiently.

🚀 Day 45 Challenge: Merge Two Binary Trees 🚀 Hey there! On the forty-fifth day of my coding journey, I tackled the problem "Merge Two Binary Trees" (Problem 617). 💡 Challenge Overview: The task in Problem 617 is to merge two binary trees into a single binary tree. Merging two binary trees involves combining the nodes of both trees at corresponding positions. If a node exists in both trees, the values of the nodes are added together. If a node exists in only one tree, it is copied to the merged tree as is. The challenge here is to efficiently perform this merge operation.

Day 61 of #100DaysOfCodeChallenge 🚀 Today's coding session was all about solving a problem that involved maximizing the area of a rectangle in a binary matrix! 💻✨ 🔍 Problem: Maximum Rectangle in Binary Matrix In the Maximum Rectangle in Binary Matrix problem, I was tasked with finding the largest rectangular area of 1's in a binary matrix. To tackle this challenge, I implemented a solution that involved calculating the Maximum Area Histogram (MAH) for each row in the matrix. 🔗Link:https://lnkd.in/gtCeEVry