Fibonacci Numbers Solution (O(1) auxiliary space)
To find the nth fibonacci number, we need not store previous Fibonacci numbers in an array. We could use two temporary variables instead of an array to store previous fibonacci numbers
Common Sorting Algorithms
A sorting algorithm is an algorithm that puts elements of a list into an order. Most frequently we’re required to sort data structures such as arrays, linked lists etc having numerical values. There’re various algorithms to sort a container or a data structure. In this post, we’ll discuss most popular or commonly used algorithms.
Pascal’s Triangle
In mathematics, Pascal’s triangle is a triangular array of the binomial coefficients. It can also be viewed as: each number in Pascal’s triangle is the sum of the two numbers directly above it.
Minimum number of moves to equal array elements – LeetCode Solution [Medium]
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment n – 1 elements of the array by 1.
Getting started with Python
In this post we’ll delve deeper into the Python language’s concepts, structure and its syntax. We’ll learn about more complex parts of the language. In the later section, we’ll introduce Python’s most popular Machine Learning libraries. So let’s get started with the portion left from the previous post.
Python Tutorial for Beginners (Introduction)
Python is an interpreted, high-level, general-purpose programming language. It was Created by Guido van Rossum in 1991.
Number of ways to climb a stair having n steps – LeetCode Solution [Easy]
You are climbing a staircase. It has n steps upto the top. Each time you can either climb 1 step or 2 steps. You’ve to find the number of ways to climb the stair.
Implementing basic Mathematical operations (Euclidean algorithm for GCD)
Given two non-negative integers a and b, you’ve to find the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) of the two numbers. In other words, find the largest number that divides them both. The Euclidean algorithm is one of the oldest numerical algorithms to compute the greatest common divisor (gcd) of two positive integers.
Implementing basic Mathematical operations (Exponential)
Drawback of this method is that it will cause int overflow. This is because pow( ) method will calculate the exponential before taking the modulo.
Find all the occurrences of a substring in a given string in C++
Given a string s1, find the occurrences of string s2 in s1.
Input: s1 = “onlycode”; s2 = “code”