Algorithms

For a better reading experience read here 👉🏼 https://codewithbeto.vercel.app/posts/fibonacci Hey there! 👋 If you have a Computer Science background, probably, you have heard about the Fibonacci Number, also known as the Fibonacci Sequence. At its core, the Fibonacci sequence is a series of numbers that starts with 0 and 1, and each number…

The trick to select any kth largest/smallest number in O(n) time — Problem Statement Let’s take a look at the problem below: Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Source: Leetcode What if we sort? For example, if we have an…

Welcome to the seventh instalment of the 114 C++ algorithms series. Today we will talk about algorithms that offer max heap data structure semantics and algorithms that operate on uninitialized (not only heap) memory. The series: Introduction Sorting and partitioning algorithms Algorithms that operate on sorted or partitioned ranges Transformation algorithms Left…

In the previous post we covered what regression problems are and how they along with classification problems fall into the category of supervised learning. In this post we’ll cover one type of regression problems called Simple Linear Regression Problems. So before diving into this ML algorithm let’s clarify some aspects

Ever heard of slow and steady winning the race? What if I told you, you can still win but faster? In the programming universe, you will hear everyone talk about algorithms and optimizations. You’re considered an elite coder when you can sort a list in O(n logn). I always aspired…

Hello, Myself Gauri wankhade, Software Developer, Bangalore, India In this article we will be solving leetcode problem for below problem statement. ⚡Problem Statement:- You are given an integer array nums that is sorted in non-decreasing order. Determine if it is possible to split nums into one or more subsequences such…

Find the Duplicate Number - LeetCode Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is…leetcode.com If the number repeat, the sum would be more than nums.length twice. var findDuplicate = function(nums) { let n = nums.length; let arr = []; for(let i = 0; i < nums.length; i++) { arr.push(nums[i]); } for(let i = 0; i <…