Romman Sabbirrommansabbir.com·Sep 20, 2023Binary Search : Mastering EfficiencyEver wondered how Google finds your search results so quickly? Or perhaps you've been in a library searching for a book? These everyday situations rely on Binary Search, an elegant and powerful algorithm. Let's explore Binary Search using Kotlin, wit...Discuss·65 readsAlgorithmsalgorithms
Akash Devcoolcoderr.hashnode.dev·Sep 3, 2023Algorithm Design Techniques 101Introduction Welcome to the first blog in my algorithm design series! 🚀 In this series, I'll be sharing various algorithm design techniques that you should use. You may already know these, but still, I'll recommend you to read these articles once. Y...DiscussAlgorithms for Everyone: A Beginner’s Guide to Algorithm Design Techniquesalgorithms
Haneunhanlee.hashnode.dev·Aug 29, 2023LeetCode 2413. Smallest Even Multiple Java SolutionProblem Smallest Even Multiple - LeetCode Solution Approach The term "multiple of 2" indicates that the number must be even. The term "multiple of n" indicates that the number must be a multiple of n. This problem is about finding the smallest eve...DiscussAlgorithm Solving Studyalgorithm
Hridoy royroyhridoy.hashnode.dev·Aug 26, 2023Mastering Linear Search: A Comprehensive JavaScript GuideSearching algorithms are digital detectives that help computers find specific pieces of information within large datasets. Whether it's locating a name in a contact list or a value in an array, these algorithms are essential for efficiently retrievin...Discusslinearsearch
Haneunhanlee.hashnode.dev·Aug 22, 2023LeetCode 75. Sort Colors Java SolutionProblem Sort Colors - LeetCode Solution Approach This problem asks whether you can implement a sorting algorithm without using built-in sorting functions or methods. Since the input consists of only 0, 1, and 2, it is possible to solve it using a l...DiscussAlgorithm Solving Studyalgorithm
aansh savlaaanshsavla.hashnode.dev·Aug 18, 2023Number is Prime or NotA brute force approach is to divide n by each number from 2 to n-1 and if it is divisible then n is "Not Prime" else it is "Prime". However, after √n no number divides n. Hence it is efficient to divide n by numbers from 2 to √n which reduces the num...Discussalgorithms
Haneunhanlee.hashnode.dev·Aug 8, 2023GFG Count the Substrings Java SolutionProblem Problem_Link Solution Approach Condition: Substrings with an equal number of uppercase and lowercase letters If the difference between the uppercase and lowercase letters at the starting and ending positions of a specific substring is the s...DiscussAlgorithm Solving Studyalgorithm
Monyuy Divineeikon.hashnode.dev·Aug 5, 2023Implement Insertion SortInsertion sort is a sorting algorithm in which elements are transferred one at a time to their correct position. It can be considered as shifting around and inserting elements in their right order to sort an unsorted array of any size. The array is s...Discuss·1 likeinsertion sort
Haneunhanlee.hashnode.dev·Aug 4, 2023LeetCode 236. Lowest Common Ancestor of a Binary Tree Java SolutionProblem Lowest Common Ancestor of a Binary Tree - LeetCode Problem Solution This problem asks whether you know about the Lowest Common Ancestor (LCA) and if you can implement it. In this problem, the preprocessing step for LCA cannot be used becaus...DiscussAlgorithm Solving Studyalgorithm
Haneunhanlee.hashnode.dev·Jul 30, 2023LeetCode 1512. Number of Good Pairs Java SolutionProblem Number of Good Pairs - LeetCode Problem Solving Approach This is a problem that tests your ability to work with nested loops (for loop inside another for loop) and multiple conditions (if statements with the && operator). Github Link https://...DiscussAlgorithm Solving Studyalgorithm
