Kalidas VBcodeverses.hashnode.dev·Sep 23, 2023Finding Largest and Smallest element from a list in pythonIn this article, I will provide you with functions for finding the largest and smallest element from a list in Python using two ways methods. Without using the library function Using library function Without library Function Finding the largest ...Discusscoding
Tanay Kediatanaykedia.hashnode.dev·Sep 19, 2023Streamlining Competitive Programming with a Pre-made Template (C++)Competitive programming is a thrilling world where problem-solving skills are put to the test under strict time constraints. To excel in this domain, one must be efficient and error-free in their coding. This is where having a pre-made template becom...DiscussCompetitive programming
RUDHRESH Siamrudhresh.hashnode.dev·Sep 17, 2023How to Become a Competitive Programmer: A Step-by-Step GuideCertainly! Here's an article on "How to Become a Competitive Programmer: A Step-by-Step Guide." Competitive programming is not just a hobby; it's a sport of the mind, a battle of algorithms and data structures. For those who love solving complex prob...Discuss·67 readsComputer Science
Srikar GaneshforHacker'sGuidehackclub-vitc.hashnode.dev·Aug 31, 2023Dancing Links Algorithm: Unravelling the Mystery behind cracking a SudokuIntroduction: Picture this: a secret dance of algorithms, choreographed to solve intricate problems with finesse and elegance. Amid the symphony of algorithms that power competitive programming, there exists a hidden gem that performs a unique dance ...Discuss·1 like·36 readsCompetitive programming
92_prajak senblogoverflow.hashnode.dev·Aug 27, 2023Leetcode Weekly contest Discussion 360I just wanted to share my experience participating in the LeetCode weekly contest 360 . So lets analyze each algorithm of every problem of today's contest. The problems are as follows:- 1. The first one is "Furthest Point From Origin" which is a basi...Discuss·64 readsCompetitive programming
Farhan Ishtiyakfarhanishtiyak.hashnode.dev·Aug 23, 2023Embarking on the Journey of Competitive Programming: Strategies and SuccessIntroduction: In the realm of coding challenges and intense problem-solving, competitive programming stands as a thrilling and intellectually rewarding pursuit. It's a domain where programmers pit their skills against complex algorithms and intricate...DiscussCodeforcesCompetitive programming
Sunny Anju Singhphanaticnotes.hashnode.dev·Aug 13, 2023How to solve complement of base 10 integer question on coding platforms.Hello everyone, in this article I will tell you how you can solve the complement of base 10 integer question on coding platforms. So in this article, I am using C++ language but I will focus on the concept of solving question , so that you can solve ...Discussleetcode
MInhTrietdevtriet.hashnode.dev·Aug 9, 2023Count divisor of a numberI have the following problem: How many divisors does a given number n have? For example: n = 6 so the answer is 4 because we have 1, 2, 3, 6. Naive method You can loop through 1 to n, and count the divisors. void countDivisors(int n) { int cnt = ...DiscussC++
Isaac Bellibell.hashnode.dev·Aug 8, 20233 Approaches to Mex AlgorithmsMex problems refer to the minimum non-negative integer that is not present in an array of positive integers. Solving Mex problems requires finding an efficient algorithm to determine the missing number. In this blog post, we’ll explore three differen...Discussalgorithms
Botmanprogrammercave.hashnode.dev·Aug 5, 2023Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ ImplementationIntroduction The Euclidean algorithm has stood the test of time as one of the most efficient methods for finding the Greatest Common Divisor (GCD) of two integers. Its elegant simplicity and effectiveness have made it a staple in various mathematical...DiscussMathematics
