Logan, Author at Only Code

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

Python Tutorial for Beginners (Introduction)

Python is an interpreted, high-level, general-purpose programming language. It was Created by Guido van Rossum in 1991.

Python

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.

Competitive Programming, Dynamic Programming

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.

Competitive Programming, Mathematics

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.

Competitive Programming, Mathematics

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”

C/C++, Competitive Programming

C++ Standard Template Library (STL) – [Priority queue]

In the last post we discussed about C++ Standard Template Library (STL) Linked List. In this post we will learn about STL Priority queue and using it as Max/Min Heap. A priority queue is a data structure for maintaining a set of elements having an associated value.

C/C++, Heaps, Special Data Structures

C++ Standard Template Library (STL) – [Linked List]

The C++ Standard Template Library (STL) is a powerful library of C++ template classes that provide general-purpose classes and functions. It has implementations of many popular and commonly used algorithms and data structures like vectors, linked-lists etc.

C/C++, Linked Lists

Huffman Code Explained using Heap [Introduction to Algorithms book]

Huffman codes are a widely used technique for compressing data. Huffman codes is a greedy algorithm to build up an optimal way of representing each character as a binary string. Suppose we have a 10,000 character data file that we wish to store. And we observe a character ‘a’ occurs very frequently.

Greedy approach, Heaps

Array Rotation

Array rotation is a problem of changing the order of the elements of the array. Decreasing the index of the element by one and changing the index of the first element to n-1.

Arrays