Sanya Dodasanya23.hashnode.dev·Sep 14, 2024N meetings in one roomQ. The question goes like you are given N meetings with their start and end times, find the maximum number of meetings you can attend without any overlap. Introduction: It is one of the activity selection problem. Here, we gotta find maximum number ...DiscussC++
Fatima Jannetmahia.hashnode.dev·Aug 27, 2024Learn Greedy AlgorithmIn the previous blog, I mentioned I would create a separate blog on the Greedy Algorithm, and here it is. This is the blog! Let's get started! What is Greedy Algorithm? Imagine a pile of both good bricks and broken pieces. Now, you are told to build ...DiscussPython Data Structure and Algorithm - DSAgreedy
Jay Choukseyjayjava.hashnode.dev·Jul 22, 2024Increasing Triplet SubsequenceIntroduction Today, I tackled an interesting medium-level problem from LeetCode: Increasing Triplet Subsequence. This problem requires a good understanding of arrays and greedy algorithms. The goal is to determine if there exists a triplet in the arr...DiscussJava
Jay Choukseyjayjava.hashnode.dev·Jul 14, 2024Container With Most WaterIntroduction Today, I tackled an interesting problem from LeetCode 75: Container With Most Water. This medium-level question requires knowledge of two pointers and greedy algorithms. It involves finding the maximum amount of water a container can sto...DiscussJava
Nadim Anwarblog.nadim.in·Jul 14, 2024Data Structures for Beginners: Essential Concepts SimplifiedWhat is Data Structure? A data structure is a way of organizing data so that it can be used effectively and efficiently. From a code design perspective, we need to pay particular attention to the way data is structured. If data isn’t stored properly,...DiscussData Structures and Algorithms (DSA)#nadim.in
Paras kaushikparaskaushik.hashnode.dev·Jun 4, 2024Greedy Technique ProblemsGreedy problems are a class of algorithmic problems where the solution is built incrementally, selecting the most optimal choice at each step with the hope that these local optimum choices will lead to a globally optimal solution. Identification Cho...DiscussDSAgreedy
Gulshan Kumarperfinsights.hashnode.dev·Apr 28, 2024Minimum Number of Pushes to Type Word IYou are given a string word containing distinct lowercase English letters. Telephone keypads have keys mapped with distinct collections of lowercase English letters, which can be used to form words by pushing them. For example, the key 2 is mapped wi...DiscussJava SolutionJava
Subrat Kumar Pattanaikblog-by-subrat.hashnode.dev·Mar 27, 2024What if, I was greedy?What if, you were given an access to a particular stock? What if, you could know the price of that stock prior to a day through that access? What if, the stock price only changed everyday and not every second? What if, you could hold a single stoc...Discussalgorithms
Gulshan Kumarperfinsights.hashnode.dev·Jan 20, 2024Increasing Triplet SubsequenceGiven an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false. LeetCode Problem - 334: Link | Click Here class Solution { public...DiscussJava Solutionarray
Akash Devakashdevblog.hashnode.dev·Sep 10, 2023Greedy Algorithms and Optimization ProblemsHey, dear readers! 👋 Welcome to the third article in my blog series. If you haven't read my previous articles, I recommend checking those out first. However, you can also start right here, as I'll be explaining everything from scratch. Introduction ...DiscussAlgorithms for Everyone: A Beginner’s Guide to Algorithm Design Techniquesgreedy
