Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

Efficiently Finding the Square Root of a Number: Linear Search vs Binary Search

Finding the square root of a number is a common problem in mathematics and computer science. In this blog post, we will focus on the linear search and binary search...

Efficiently Find Prime Numbers Till N: Basic vs. Sieve of Eratosthenes

Finding all prime numbers till N is a common problem in computer science and mathematics. There are various ways to solve this problem, but we will be discussing an optimized...

Optimized Algorithm for Checking Prime Numbers: A Comprehensive Guide

In this blog, we will discuss different methods to check if a number is a prime number or not, and analyze their time complexity. We will start with a basic...

Kefa and First Steps - CodeForces | C++ Implementation

Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1≤*i*≤n) he makes *ai* money. Kefa loves progress,...

orDer oF succeSsion - CodinGame | C++ Implementation

You have to output the order of succession to the British throne of a list of given people. The order is simple: From a descendant A, the next in the...

Stock Exchange Losses - CodinGame | C++ Implementation

A finance company is carrying out a study on the worst stock investments and would like to acquire a program to do so. The program must be able to analyze...

Dungeons and Maps - CodinGame | C++ Implementation

You are given N maps for a dungeon. Each map may contain a path to a treasure T, from starting position [ startRow; startCol ]. Determine the index of the...

Sudoku Validator - CodinGame | C++ Implementation

A sudoku grid consists of 9*9 = 81 cells split in 9 sub-grids of 3*3 = 9 cells. For the grid to be correct, each row must contain one occurrence...

Bank Robbers - CodinGame | C++ Implementation

A gang of R foolish robbers decides to heist a bank. In the bank there are V vaults (indexed from 0 to V-1). The robbers have managed to extract some...

Left Rotation - HackerRank | C++ Implementation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. For example, if 2 left rotations are performed on...

Repeated String - HackerRank | C++ Implementation

Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first...

Single Elevator Simulation in C++

Here we are going to implement the Single Elevator Simulation in C++. Initially the elevator is at ground floor. It is represented by 0. Floors below ground floor are represented...

Picking Numbers - HackerRank | C++ Implementation

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen...

Library Fine | HackerRank

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is...

Sherlock and Squares | HackerRank

Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of *square integers* within that...

Selected Questions from Interviews with Bjarne Stroustrup Part 2| Creator of C++

Why did you choose C as the language to add object oriented features of Simula? There were a few Procedural languages like COBOL, PASCAL to add OO Features. Also Your...

Selected Questions from Interviews with Bjarne Stroustrup Part 1| Creator of C++

What tips would you give to a budding programmer? Programming can be fun, but it is not all fun and games. Our civilization depends on good software.Whatever you are interested...

Circular Array Rotation | HackerRank

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts...

Drawing Book | HackerRank

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back...

Pointers in C++

A pointer is a special type of variable which holds the address of a value. A pointer is declared using * (asterisk).A constant pointer only points to the object it...

Migratory Birds - HackerRank Challenge | C++ Implementation

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value....

Between Two Sets - HackerRank Challenge | C++ Implementation

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors...

Kangaroo HackerRank Challenge | C++ Implementation

The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of...

Kruskal's Algorithm | Minimum Spanning Tree

When edges connects all vertices in a graph and form a tree then it is known as *spanning tree*. While connecting edges no cycle should be formed. A minimum spanning...

Prime Numbers and Sieve of Eratosthenes

A prime number is an integer n > 1 which is only divisible by 1 and n(itself). For example, 2, 3, 5 are prime numbers, but 6, 8, 9 are...

Roy and Code Streak | HackerEarth Challenge

Roy is working on HackerEarth Profile. Right now he is working on User Statistics. One of the statistics data (Code Streak) is as follows:

How to Manipulate Bits in C and C++

All data in computer is represented in binary i.e. in 0 or 1. Computers or machines do not understand our languages, they understand bits. Generally programmer do not care about...

Stack Overflow Vulnerability

Stack overflow is a type of buffer overflow vulnerability. When we pour water in a glass more than its capacity the water spills or overflow, similarly when we enter data...

How to Install graphics.h C/C++ library on Ubuntu

In this post we are going to install graphics.h library on Ubuntu and to use it with gcc or g++ compiler. graphics.h provides access to a simple graphics library that...

C++: Simple Pendulum Animation on Ubuntu Machine

Here is the code to animate simple pendulum on Ubuntu Machine.

C++: Tic Tac Toe

Here is the simple C++ implementation of Tic Tac Toe.

Dijkstra's Algorithm | Single-Source Shortest Path

Dijkstra's algorithm finds shortest paths from the source vertex to all vertices in the graph. The condition for the algorithm is that all edge weights should be non-negative. Thus, Dijkstra’s...

Bellman Ford Algorithm | Single-Source Shortest Path

Bellman–Ford algorithm finds shortest path from the source vertex to all vertices in the graph. The graph can contain negative-weight edges, but it should not contain a negative-weight cycle that...

Breadth First Search using Adjacency List | Graph traversal

Breadth first search (BFS) explores the graph level by level. First it explore every vertex that is connected to source vertex. If the vertex is discovered, it becomes gray or...

Depth First Search using Adjacency List | Graph traversal

Depth first search explores on a single path in a graph as long as it find undiscovered vertices. When an edge leads to the discovered vertices it backtrack to the...

Move all Odd numbers after Even numbers in Singly Linked List | C++ Implementation

Given a Singly Linked List, we have to modify it such that all Even numbers appear before Odd numbers.

Merge two sorted Linked List (in-place) | C++ Implementation

Given two sorted Linked List, we have to merge them without using another linked list.

Split Singly Circular Linked List | C++ Implementation

Given a Singly Circular Linked List, we have to split it into two equal halves. If the number of nodes in the given list is odd then first list will...

Doubly Circular Linked List | C++ Implementation

A node in a doubly circular linked list contains a data item and two node pointers, one to the previous node and one to the next node. In doubly linked...

How to Reverse a Linked List | C++ Implementation

There are two ways to reverse a linked list, iterative method and recursive method.

How to find the Length of Loop in Linked List | C++ Implementation

Given a Linked List, we have to find does loop exist in Linked List and if yes, find the length of loop.

Selection sort | C++ Implementation

Selection sort is an in-place sorting algorithm. In the input array there is a sorted portion and an unsorted portion. The algorithm repeatedly finds the smallest element in the unsorted...

Merge Sort | C++ Implementation

Merge sort follows *divide-and-conquer* approach. It divides an array of n elements into two subarrays of n/2 elements each. Then it sort the two subarrays recursively using merge sort. And...

Insertion Sort | C++ Implementation

Insertion sort is an efficient algorithm for sorting a small number of elements. The algorithm selects an element from the unsorted array and put it in the proper position in...

Doubly Linked List | C++ Implementation

A node in a doubly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Singly Linked List | C++ Implementation

A node in a singly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Quicksort | C++ Implementation

The algorithm selects an element as pivot. The input array is divided into two subarrays. All elements in left subarray are less than pivot and all elements in right subarray...

Heapsort | C++ Implementation

Heapsort is implemented using heap data structure. Heap helps us to represent binary tree without using any pointers. Using heap an array can be viewed as a binary tree and...

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

Efficiently Finding the Square Root of a Number: Linear Search vs Binary Search

Finding the square root of a number is a common problem in mathematics and computer science. In this blog post, we will focus on the linear search and binary search...

Efficiently Find Prime Numbers Till N: Basic vs. Sieve of Eratosthenes

Finding all prime numbers till N is a common problem in computer science and mathematics. There are various ways to solve this problem, but we will be discussing an optimized...

Optimized Algorithm for Checking Prime Numbers: A Comprehensive Guide

In this blog, we will discuss different methods to check if a number is a prime number or not, and analyze their time complexity. We will start with a basic...

Left Rotation - HackerRank | C++ Implementation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. For example, if 2 left rotations are performed on...

Repeated String - HackerRank | C++ Implementation

Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first...

Picking Numbers - HackerRank | C++ Implementation

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen...

Library Fine | HackerRank

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is...

Sherlock and Squares | HackerRank

Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of *square integers* within that...

Circular Array Rotation | HackerRank

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts...

Drawing Book | HackerRank

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back...

Migratory Birds - HackerRank Challenge | C++ Implementation

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value....

Between Two Sets - HackerRank Challenge | C++ Implementation

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors...

Kangaroo HackerRank Challenge | C++ Implementation

The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of...

Kruskal's Algorithm | Minimum Spanning Tree

When edges connects all vertices in a graph and form a tree then it is known as *spanning tree*. While connecting edges no cycle should be formed. A minimum spanning...

Roy and Code Streak | HackerEarth Challenge

Roy is working on HackerEarth Profile. Right now he is working on User Statistics. One of the statistics data (Code Streak) is as follows:

Dijkstra's Algorithm | Single-Source Shortest Path

Dijkstra's algorithm finds shortest paths from the source vertex to all vertices in the graph. The condition for the algorithm is that all edge weights should be non-negative. Thus, Dijkstra’s...

Bellman Ford Algorithm | Single-Source Shortest Path

Bellman–Ford algorithm finds shortest path from the source vertex to all vertices in the graph. The graph can contain negative-weight edges, but it should not contain a negative-weight cycle that...

Breadth First Search using Adjacency List | Graph traversal

Breadth first search (BFS) explores the graph level by level. First it explore every vertex that is connected to source vertex. If the vertex is discovered, it becomes gray or...

Depth First Search using Adjacency List | Graph traversal

Depth first search explores on a single path in a graph as long as it find undiscovered vertices. When an edge leads to the discovered vertices it backtrack to the...

Move all Odd numbers after Even numbers in Singly Linked List | C++ Implementation

Given a Singly Linked List, we have to modify it such that all Even numbers appear before Odd numbers.

Merge two sorted Linked List (in-place) | C++ Implementation

Given two sorted Linked List, we have to merge them without using another linked list.

Split Singly Circular Linked List | C++ Implementation

Given a Singly Circular Linked List, we have to split it into two equal halves. If the number of nodes in the given list is odd then first list will...

Doubly Circular Linked List | C++ Implementation

A node in a doubly circular linked list contains a data item and two node pointers, one to the previous node and one to the next node. In doubly linked...

How to Reverse a Linked List | C++ Implementation

There are two ways to reverse a linked list, iterative method and recursive method.

How to find the Length of Loop in Linked List | C++ Implementation

Given a Linked List, we have to find does loop exist in Linked List and if yes, find the length of loop.

Selection sort | C++ Implementation

Selection sort is an in-place sorting algorithm. In the input array there is a sorted portion and an unsorted portion. The algorithm repeatedly finds the smallest element in the unsorted...

Merge Sort | C++ Implementation

Merge sort follows *divide-and-conquer* approach. It divides an array of n elements into two subarrays of n/2 elements each. Then it sort the two subarrays recursively using merge sort. And...

Insertion Sort | C++ Implementation

Insertion sort is an efficient algorithm for sorting a small number of elements. The algorithm selects an element from the unsorted array and put it in the proper position in...

Doubly Linked List | C++ Implementation

A node in a doubly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Singly Linked List | C++ Implementation

A node in a singly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Quicksort | C++ Implementation

The algorithm selects an element as pivot. The input array is divided into two subarrays. All elements in left subarray are less than pivot and all elements in right subarray...

Heapsort | C++ Implementation

Heapsort is implemented using heap data structure. Heap helps us to represent binary tree without using any pointers. Using heap an array can be viewed as a binary tree and...

Selection sort | C++ Implementation

Selection sort is an in-place sorting algorithm. In the input array there is a sorted portion and an unsorted portion. The algorithm repeatedly finds the smallest element in the unsorted...

Merge Sort | C++ Implementation

Merge sort follows *divide-and-conquer* approach. It divides an array of n elements into two subarrays of n/2 elements each. Then it sort the two subarrays recursively using merge sort. And...

Insertion Sort | C++ Implementation

Insertion sort is an efficient algorithm for sorting a small number of elements. The algorithm selects an element from the unsorted array and put it in the proper position in...

Quicksort | C++ Implementation

The algorithm selects an element as pivot. The input array is divided into two subarrays. All elements in left subarray are less than pivot and all elements in right subarray...

Heapsort | C++ Implementation

Heapsort is implemented using heap data structure. Heap helps us to represent binary tree without using any pointers. Using heap an array can be viewed as a binary tree and...

Move all Odd numbers after Even numbers in Singly Linked List | C++ Implementation

Given a Singly Linked List, we have to modify it such that all Even numbers appear before Odd numbers.

Merge two sorted Linked List (in-place) | C++ Implementation

Given two sorted Linked List, we have to merge them without using another linked list.

Split Singly Circular Linked List | C++ Implementation

Given a Singly Circular Linked List, we have to split it into two equal halves. If the number of nodes in the given list is odd then first list will...

Doubly Circular Linked List | C++ Implementation

A node in a doubly circular linked list contains a data item and two node pointers, one to the previous node and one to the next node. In doubly linked...

How to Reverse a Linked List | C++ Implementation

There are two ways to reverse a linked list, iterative method and recursive method.

How to find the Length of Loop in Linked List | C++ Implementation

Given a Linked List, we have to find does loop exist in Linked List and if yes, find the length of loop.

Doubly Linked List | C++ Implementation

A node in a doubly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Singly Linked List | C++ Implementation

A node in a singly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

Left Rotation - HackerRank | C++ Implementation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. For example, if 2 left rotations are performed on...

Repeated String - HackerRank | C++ Implementation

Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first...

Picking Numbers - HackerRank | C++ Implementation

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen...

Library Fine | HackerRank

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is...

Sherlock and Squares | HackerRank

Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of *square integers* within that...

Circular Array Rotation | HackerRank

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts...

Drawing Book | HackerRank

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back...

Migratory Birds - HackerRank Challenge | C++ Implementation

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value....

Between Two Sets - HackerRank Challenge | C++ Implementation

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors...

Kangaroo HackerRank Challenge | C++ Implementation

The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of...

Roy and Code Streak | HackerEarth Challenge

Roy is working on HackerEarth Profile. Right now he is working on User Statistics. One of the statistics data (Code Streak) is as follows:

Merge two sorted Linked List (in-place) | C++ Implementation

Given two sorted Linked List, we have to merge them without using another linked list.

Split Singly Circular Linked List | C++ Implementation

Given a Singly Circular Linked List, we have to split it into two equal halves. If the number of nodes in the given list is odd then first list will...

Doubly Circular Linked List | C++ Implementation

A node in a doubly circular linked list contains a data item and two node pointers, one to the previous node and one to the next node. In doubly linked...

How to Reverse a Linked List | C++ Implementation

There are two ways to reverse a linked list, iterative method and recursive method.

How to find the Length of Loop in Linked List | C++ Implementation

Given a Linked List, we have to find does loop exist in Linked List and if yes, find the length of loop.

Doubly Linked List | C++ Implementation

A node in a doubly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Singly Linked List | C++ Implementation

A node in a singly linked list contains a data item and a node pointer to the next node. In a singly linked list we can traverse only in one...

Efficiently Finding the Square Root of a Number: Linear Search vs Binary Search

Finding the square root of a number is a common problem in mathematics and computer science. In this blog post, we will focus on the linear search and binary search...

Efficiently Find Prime Numbers Till N: Basic vs. Sieve of Eratosthenes

Finding all prime numbers till N is a common problem in computer science and mathematics. There are various ways to solve this problem, but we will be discussing an optimized...

Optimized Algorithm for Checking Prime Numbers: A Comprehensive Guide

In this blog, we will discuss different methods to check if a number is a prime number or not, and analyze their time complexity. We will start with a basic...

Move all Odd numbers after Even numbers in Singly Linked List | C++ Implementation

Given a Singly Linked List, we have to modify it such that all Even numbers appear before Odd numbers.

Kruskal's Algorithm | Minimum Spanning Tree

When edges connects all vertices in a graph and form a tree then it is known as *spanning tree*. While connecting edges no cycle should be formed. A minimum spanning...

Dijkstra's Algorithm | Single-Source Shortest Path

Dijkstra's algorithm finds shortest paths from the source vertex to all vertices in the graph. The condition for the algorithm is that all edge weights should be non-negative. Thus, Dijkstra’s...

Bellman Ford Algorithm | Single-Source Shortest Path

Bellman–Ford algorithm finds shortest path from the source vertex to all vertices in the graph. The graph can contain negative-weight edges, but it should not contain a negative-weight cycle that...

Breadth First Search using Adjacency List | Graph traversal

Breadth first search (BFS) explores the graph level by level. First it explore every vertex that is connected to source vertex. If the vertex is discovered, it becomes gray or...

Depth First Search using Adjacency List | Graph traversal

Depth first search explores on a single path in a graph as long as it find undiscovered vertices. When an edge leads to the discovered vertices it backtrack to the...

Single Elevator Simulation in C++

Here we are going to implement the Single Elevator Simulation in C++. Initially the elevator is at ground floor. It is represented by 0. Floors below ground floor are represented...

C++: Simple Pendulum Animation on Ubuntu Machine

Here is the code to animate simple pendulum on Ubuntu Machine.

C++: Tic Tac Toe

Here is the simple C++ implementation of Tic Tac Toe.

C++: Tic Tac Toe

Here is the simple C++ implementation of Tic Tac Toe.

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

How to Enable Natural Scrolling for Touchpad on OpenSuse Tumbleweed

Are you having trouble getting natural scrolling to work on your touchpad after updating OpenSuse Tumbleweed? Don't worry, we've got you covered. We've gone through the process of searching various...

How to Install a Software on Ubuntu | Package Management

A package file is a compressed collection of files necessary to install a software or an application. It also includes metadata about the package such as text description of package...

How to create Password list using CUPP tool on Ubuntu

People do not create complex passwords. Their password consists of their name or surname, date of birth, favourite football team etc, so they can remember it easily. There are many...

How to Install graphics.h C/C++ library on Ubuntu

In this post we are going to install graphics.h library on Ubuntu and to use it with gcc or g++ compiler. graphics.h provides access to a simple graphics library that...

C++: Simple Pendulum Animation on Ubuntu Machine

Here is the code to animate simple pendulum on Ubuntu Machine.

How to Install graphics.h C/C++ library on Ubuntu

In this post we are going to install graphics.h library on Ubuntu and to use it with gcc or g++ compiler. graphics.h provides access to a simple graphics library that...

C++: Simple Pendulum Animation on Ubuntu Machine

Here is the code to animate simple pendulum on Ubuntu Machine.

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

How to Enable Natural Scrolling for Touchpad on OpenSuse Tumbleweed

Are you having trouble getting natural scrolling to work on your touchpad after updating OpenSuse Tumbleweed? Don't worry, we've got you covered. We've gone through the process of searching various...

Krypton Level 3 to Level 5 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 3 → Level 4, Level 4 → Level 5 and Level 5 → Level...

Krypton Level 0 to Level 2 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 0 → Level 1, Level 1 → Level 2 and Level 2 → Level...

Leviathan Level 3 to Level 4 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 5 to Level 6 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 2 → Level 3 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 0 to Level 1 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Bandit Level 32 → Level 33 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 27 to Level 31 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 25 to Level 26 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 24 → Level 25 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 23 → Level 24 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 21 to Level 22 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 19 to Level 20 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 9 to Level 11 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 16 to Level 18 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 13 to Level 15 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 12 → Level 13 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 4 to Level 8 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 0 to Level 3 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

How to Install a Software on Ubuntu | Package Management

A package file is a compressed collection of files necessary to install a software or an application. It also includes metadata about the package such as text description of package...

How to create Password list using CUPP tool on Ubuntu

People do not create complex passwords. Their password consists of their name or surname, date of birth, favourite football team etc, so they can remember it easily. There are many...

How to Install graphics.h C/C++ library on Ubuntu

In this post we are going to install graphics.h library on Ubuntu and to use it with gcc or g++ compiler. graphics.h provides access to a simple graphics library that...

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

How to scroll Amazon Affiliate Marketing cards horizontally on a website

How to create Password list using CUPP tool on Ubuntu

People do not create complex passwords. Their password consists of their name or surname, date of birth, favourite football team etc, so they can remember it easily. There are many...

How to Install graphics.h C/C++ library on Ubuntu

In this post we are going to install graphics.h library on Ubuntu and to use it with gcc or g++ compiler. graphics.h provides access to a simple graphics library that...

Deploying a Python Telegram Bot on Oracle Cloud

Deploying a Telegram bot on Oracle Cloud provides reliable uptime and cost-effective hosting for a wide range of bot functionalities.

Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

How to create Password list using CUPP tool on Ubuntu

People do not create complex passwords. Their password consists of their name or surname, date of birth, favourite football team etc, so they can remember it easily. There are many...

Stack Overflow Vulnerability

Stack overflow is a type of buffer overflow vulnerability. When we pour water in a glass more than its capacity the water spills or overflow, similarly when we enter data...

How to create Password list using CUPP tool on Ubuntu

People do not create complex passwords. Their password consists of their name or surname, date of birth, favourite football team etc, so they can remember it easily. There are many...

Stack Overflow Vulnerability

Stack overflow is a type of buffer overflow vulnerability. When we pour water in a glass more than its capacity the water spills or overflow, similarly when we enter data...

Stack Overflow Vulnerability

Stack overflow is a type of buffer overflow vulnerability. When we pour water in a glass more than its capacity the water spills or overflow, similarly when we enter data...

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

Efficiently Finding the Square Root of a Number: Linear Search vs Binary Search

Finding the square root of a number is a common problem in mathematics and computer science. In this blog post, we will focus on the linear search and binary search...

Efficiently Find Prime Numbers Till N: Basic vs. Sieve of Eratosthenes

Finding all prime numbers till N is a common problem in computer science and mathematics. There are various ways to solve this problem, but we will be discussing an optimized...

Optimized Algorithm for Checking Prime Numbers: A Comprehensive Guide

In this blog, we will discuss different methods to check if a number is a prime number or not, and analyze their time complexity. We will start with a basic...

Kefa and First Steps - CodeForces | C++ Implementation

Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1≤*i*≤n) he makes *ai* money. Kefa loves progress,...

orDer oF succeSsion - CodinGame | C++ Implementation

You have to output the order of succession to the British throne of a list of given people. The order is simple: From a descendant A, the next in the...

Stock Exchange Losses - CodinGame | C++ Implementation

A finance company is carrying out a study on the worst stock investments and would like to acquire a program to do so. The program must be able to analyze...

Dungeons and Maps - CodinGame | C++ Implementation

You are given N maps for a dungeon. Each map may contain a path to a treasure T, from starting position [ startRow; startCol ]. Determine the index of the...

Sudoku Validator - CodinGame | C++ Implementation

A sudoku grid consists of 9*9 = 81 cells split in 9 sub-grids of 3*3 = 9 cells. For the grid to be correct, each row must contain one occurrence...

Bank Robbers - CodinGame | C++ Implementation

A gang of R foolish robbers decides to heist a bank. In the bank there are V vaults (indexed from 0 to V-1). The robbers have managed to extract some...

Left Rotation - HackerRank | C++ Implementation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. For example, if 2 left rotations are performed on...

Repeated String - HackerRank | C++ Implementation

Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first...

Picking Numbers - HackerRank | C++ Implementation

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen...

Library Fine | HackerRank

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is...

Sherlock and Squares | HackerRank

Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of *square integers* within that...

Circular Array Rotation | HackerRank

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts...

Drawing Book | HackerRank

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back...

Migratory Birds - HackerRank Challenge | C++ Implementation

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value....

Between Two Sets - HackerRank Challenge | C++ Implementation

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors...

Kangaroo HackerRank Challenge | C++ Implementation

The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of...

Prime Numbers and Sieve of Eratosthenes

A prime number is an integer n > 1 which is only divisible by 1 and n(itself). For example, 2, 3, 5 are prime numbers, but 6, 8, 9 are...

Roy and Code Streak | HackerEarth Challenge

Roy is working on HackerEarth Profile. Right now he is working on User Statistics. One of the statistics data (Code Streak) is as follows:

How to Manipulate Bits in C and C++

All data in computer is represented in binary i.e. in 0 or 1. Computers or machines do not understand our languages, they understand bits. Generally programmer do not care about...

How to Manipulate Bits in C and C++

All data in computer is represented in binary i.e. in 0 or 1. Computers or machines do not understand our languages, they understand bits. Generally programmer do not care about...

Amazon Great Indian Festival Sale 2019: Top 10 Laptop Deals

Great Indian Festival sale on Amazon.com starts from 21st Oct to 25th Oct. Products have heavy discounts and cashback offers. There is 10% Instant Discount + Bonus Offer on Axis...

Selected Questions from Interviews with Bjarne Stroustrup Part 2| Creator of C++

Why did you choose C as the language to add object oriented features of Simula? There were a few Procedural languages like COBOL, PASCAL to add OO Features. Also Your...

Selected Questions from Interviews with Bjarne Stroustrup Part 1| Creator of C++

What tips would you give to a budding programmer? Programming can be fun, but it is not all fun and games. Our civilization depends on good software.Whatever you are interested...

Amazon Great Indian Festival Sale 2019: Top 10 Laptop Deals

Great Indian Festival sale on Amazon.com starts from 21st Oct to 25th Oct. Products have heavy discounts and cashback offers. There is 10% Instant Discount + Bonus Offer on Axis...

Roy and Code Streak | HackerEarth Challenge

Roy is working on HackerEarth Profile. Right now he is working on User Statistics. One of the statistics data (Code Streak) is as follows:

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Prime Numbers and Sieve of Eratosthenes

A prime number is an integer n > 1 which is only divisible by 1 and n(itself). For example, 2, 3, 5 are prime numbers, but 6, 8, 9 are...

How to Install a Software on Ubuntu | Package Management

A package file is a compressed collection of files necessary to install a software or an application. It also includes metadata about the package such as text description of package...

How to scroll Amazon Affiliate Marketing cards horizontally on a website

How to scroll Amazon Affiliate Marketing cards horizontally on a website

Left Rotation - HackerRank | C++ Implementation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. For example, if 2 left rotations are performed on...

Repeated String - HackerRank | C++ Implementation

Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first...

Picking Numbers - HackerRank | C++ Implementation

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen...

Library Fine | HackerRank

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is...

Sherlock and Squares | HackerRank

Watson likes to challenge Sherlock's math ability. He will provide a starting and ending value describing a range of integers. Sherlock must determine the number of *square integers* within that...

Circular Array Rotation | HackerRank

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts...

Drawing Book | HackerRank

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back...

Migratory Birds - HackerRank Challenge | C++ Implementation

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value....

Between Two Sets - HackerRank Challenge | C++ Implementation

You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors...

Kangaroo HackerRank Challenge | C++ Implementation

The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of...

Best Memes on Linked List Data Structure

Here is the collection of some of the best memes on Linked List Data Structure

Best Memes on Windows Operating System Failure

Here is the collection of some of the best memes on Microsoft Operating System.

Best Memes on Javascript

Here is the collection of some of the best memes on Javascript.

Memes on copy pasting code from Stackoverflow

Stackoverflow was launched on 2008 by Jeff Atwood and Joel Spolsky. It is written in C#. It is owned by Stack Exchange Network. Stack Exchange Network has some good websites...

Bandit Level 32 → Level 33 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 27 to Level 31 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 25 to Level 26 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 24 → Level 25 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 23 → Level 24 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 21 to Level 22 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 19 to Level 20 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 9 to Level 11 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 16 to Level 18 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 13 to Level 15 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 12 → Level 13 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 4 to Level 8 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 0 to Level 3 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Krypton Level 3 to Level 5 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 3 → Level 4, Level 4 → Level 5 and Level 5 → Level...

Krypton Level 0 to Level 2 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 0 → Level 1, Level 1 → Level 2 and Level 2 → Level...

Leviathan Level 3 to Level 4 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 5 to Level 6 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 2 → Level 3 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 0 to Level 1 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Bandit Level 32 → Level 33 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 27 to Level 31 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 25 to Level 26 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 24 → Level 25 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 23 → Level 24 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 21 to Level 22 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 19 to Level 20 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 9 to Level 11 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 16 to Level 18 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 13 to Level 15 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 12 → Level 13 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 4 to Level 8 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Bandit Level 0 to Level 3 | OverTheWire

Learn linux command by playing Bandit wargame. The Bandit wargame is aimed at absolute beginners. It will teach the basics needed to be able to play other wargames. Below is...

Leviathan Level 3 to Level 4 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 5 to Level 6 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 2 → Level 3 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Leviathan Level 0 to Level 1 | Basic Exploitation Techniques

Learn linux command by playing Leviathan wargame from OverTheWire. This wargame doesn't require any knowledge about programming - just a bit of common sense and some knowledge about basic *nix...

Krypton Level 3 to Level 5 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 3 → Level 4, Level 4 → Level 5 and Level 5 → Level...

Krypton Level 0 to Level 2 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 0 → Level 1, Level 1 → Level 2 and Level 2 → Level...

Krypton Level 3 to Level 5 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 3 → Level 4, Level 4 → Level 5 and Level 5 → Level...

Krypton Level 0 to Level 2 | Basic Cryptographic Techniques

Learn basic cryptographic techniques by playing Krypton wargame from OverTheWire. Below is the solution of Level 0 → Level 1, Level 1 → Level 2 and Level 2 → Level...

orDer oF succeSsion - CodinGame | C++ Implementation

You have to output the order of succession to the British throne of a list of given people. The order is simple: From a descendant A, the next in the...

Stock Exchange Losses - CodinGame | C++ Implementation

A finance company is carrying out a study on the worst stock investments and would like to acquire a program to do so. The program must be able to analyze...

Dungeons and Maps - CodinGame | C++ Implementation

You are given N maps for a dungeon. Each map may contain a path to a treasure T, from starting position [ startRow; startCol ]. Determine the index of the...

Sudoku Validator - CodinGame | C++ Implementation

A sudoku grid consists of 9*9 = 81 cells split in 9 sub-grids of 3*3 = 9 cells. For the grid to be correct, each row must contain one occurrence...

Bank Robbers - CodinGame | C++ Implementation

A gang of R foolish robbers decides to heist a bank. In the bank there are V vaults (indexed from 0 to V-1). The robbers have managed to extract some...

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Efficiently Finding the Square Root of a Number: Linear Search vs Binary Search

Finding the square root of a number is a common problem in mathematics and computer science. In this blog post, we will focus on the linear search and binary search...

Efficiently Find Prime Numbers Till N: Basic vs. Sieve of Eratosthenes

Finding all prime numbers till N is a common problem in computer science and mathematics. There are various ways to solve this problem, but we will be discussing an optimized...

Optimized Algorithm for Checking Prime Numbers: A Comprehensive Guide

In this blog, we will discuss different methods to check if a number is a prime number or not, and analyze their time complexity. We will start with a basic...

Bank Robbers - CodinGame | C++ Implementation

A gang of R foolish robbers decides to heist a bank. In the bank there are V vaults (indexed from 0 to V-1). The robbers have managed to extract some...

Kefa and First Steps - CodeForces | C++ Implementation

Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1≤*i*≤n) he makes *ai* money. Kefa loves progress,...

Kefa and First Steps - CodeForces | C++ Implementation

Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1≤*i*≤n) he makes *ai* money. Kefa loves progress,...

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

How to Enable Natural Scrolling for Touchpad on OpenSuse Tumbleweed

Are you having trouble getting natural scrolling to work on your touchpad after updating OpenSuse Tumbleweed? Don't worry, we've got you covered. We've gone through the process of searching various...

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

How to Enable Natural Scrolling for Touchpad on OpenSuse Tumbleweed

Are you having trouble getting natural scrolling to work on your touchpad after updating OpenSuse Tumbleweed? Don't worry, we've got you covered. We've gone through the process of searching various...

How to Resize Partitions in Arch Linux

Running out of space on your root partition can be a frustrating experience when using Arch Linux. Fortunately, resizing your partitions can be done easily with the help of a...

Complete Guide: Installing, Setting Up, and Removing PostgreSQL in Linux

PostgreSQL is an open-source relational database management system. It is known for its reliability, scalability, and extensibility, making it a popular choice for enterprise-level applications. In this tutorial, we will...

Exploring JSONB in PostgreSQL: A Beginner's Guide to Storing and Querying Structured Data

In the realm of databases, PostgreSQL stands tall, renowned for its robust features and adaptability. Among its many offerings, JSONB shines as a versatile data type, facilitating the efficient storage...

Writing Unit Tests for SQL-Integrated Functions with Mock Databases in Go

Unit testing is a critical part of software development that ensures the reliability and functionality of code modules. In this blog post, we will explore unit testing for Go functions...

When Designing a Product: Adapting Your Database with Schema Modifications

Discover the essential art of schema modifications for evolving databases in this comprehensive guide. Learn how to adapt your data structure to accommodate growth while retaining valuable information. Uncover the...

Getting Started with Kafka and Go: Reading Messages and Inserting into a Database

In the below code, messages are read from a Kafka topic, parsed as JSON, and then inserted into a PostgreSQL database. This is a common use case for Kafka, where...

Creating triggers in PostgreSQL to monitor changes in tables

In a database management system, triggers are special types of stored procedures that are automatically executed in response to specific database events, such as insert, update, or delete operations on...

Exploring JSONB in PostgreSQL: A Beginner's Guide to Storing and Querying Structured Data

In the realm of databases, PostgreSQL stands tall, renowned for its robust features and adaptability. Among its many offerings, JSONB shines as a versatile data type, facilitating the efficient storage...

Writing Unit Tests for SQL-Integrated Functions with Mock Databases in Go

Unit testing is a critical part of software development that ensures the reliability and functionality of code modules. In this blog post, we will explore unit testing for Go functions...

When Designing a Product: Adapting Your Database with Schema Modifications

Discover the essential art of schema modifications for evolving databases in this comprehensive guide. Learn how to adapt your data structure to accommodate growth while retaining valuable information. Uncover the...

Getting Started with Kafka and Go: Reading Messages and Inserting into a Database

In the below code, messages are read from a Kafka topic, parsed as JSON, and then inserted into a PostgreSQL database. This is a common use case for Kafka, where...

Creating triggers in PostgreSQL to monitor changes in tables

In a database management system, triggers are special types of stored procedures that are automatically executed in response to specific database events, such as insert, update, or delete operations on...

Exploring JSONB in PostgreSQL: A Beginner's Guide to Storing and Querying Structured Data

In the realm of databases, PostgreSQL stands tall, renowned for its robust features and adaptability. Among its many offerings, JSONB shines as a versatile data type, facilitating the efficient storage...

Getting Started with Kafka and Go: Reading Messages and Inserting into a Database

In the below code, messages are read from a Kafka topic, parsed as JSON, and then inserted into a PostgreSQL database. This is a common use case for Kafka, where...

Creating triggers in PostgreSQL to monitor changes in tables

In a database management system, triggers are special types of stored procedures that are automatically executed in response to specific database events, such as insert, update, or delete operations on...

Writing Unit Tests for SQL-Integrated Functions with Mock Databases in Go

Unit testing is a critical part of software development that ensures the reliability and functionality of code modules. In this blog post, we will explore unit testing for Go functions...

Step-by-Step Guide: Setting up Environment Variables in GitHub Actions for Go

GitHub Actions is a powerful platform that allows developers to automate workflows and build, test, and deploy their applications with ease. One common use case is to securely pass environment...

Elevating Code Modularity: Harnessing Interfaces for Generic Types and Decoupling in Go

In Go programming, interfaces serve as powerful tools for defining generic types, streamlining code, and decoupling functionality. By leveraging interfaces, you can write more efficient and flexible code that can...

Unleashing the Power of Interfaces in Go: Simplifying Code Flexibility

In the world of programming, flexibility is a valuable asset. It allows us to write code that can work with different types of objects, even if they have different behaviors....

From Strings to Numbers: Converting Integers and Floats in Go

In Go, working with integer and floating-point data types is fundamental for various programming tasks. This article will explore the integer and floating-point types available in Go, along with detailed...

Understanding Go: Exploring Structs and Methods

Go is a statically typed, compiled programming language that offers a unique approach to object-oriented programming. Unlike languages such as C++ or Java, Go doesn't have traditional classes. Instead, it...

Getting Started with Kafka and Go: Reading Messages and Inserting into a Database

In the below code, messages are read from a Kafka topic, parsed as JSON, and then inserted into a PostgreSQL database. This is a common use case for Kafka, where...

Getting Started with Kafka and Go: Reading Messages and Inserting into a Database

In the below code, messages are read from a Kafka topic, parsed as JSON, and then inserted into a PostgreSQL database. This is a common use case for Kafka, where...

Rearranging an Array: Transforming arr[i] into arr[arr[i]]

Aspiring software developers and computer science engineering enthusiasts often encounter captivating challenges that put their problem-solving abilities to the test. In this beginner's guide to data structures and algorithms, we...

Step-by-Step Guide: Setting up Environment Variables in GitHub Actions for Go

GitHub Actions is a powerful platform that allows developers to automate workflows and build, test, and deploy their applications with ease. One common use case is to securely pass environment...

Step-by-Step Guide: Setting up Environment Variables in GitHub Actions for Go

GitHub Actions is a powerful platform that allows developers to automate workflows and build, test, and deploy their applications with ease. One common use case is to securely pass environment...

Understanding the Euclidean Algorithm for Finding the Greatest Common Divisor (GCD) | C++ Implementation

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...

Writing Unit Tests for SQL-Integrated Functions with Mock Databases in Go

Unit testing is a critical part of software development that ensures the reliability and functionality of code modules. In this blog post, we will explore unit testing for Go functions...

When Designing a Product: Adapting Your Database with Schema Modifications

Discover the essential art of schema modifications for evolving databases in this comprehensive guide. Learn how to adapt your data structure to accommodate growth while retaining valuable information. Uncover the...

Structural Design Patterns - Decorator and Facade

Notes on Structural Design Patterns - Decorator and Facade

Structural Design Patterns - Adapter and Flyweight

Notes on Structural Design Patterns - Adapter and Flyweight from Scaler

Creational Design Patterns - Prototype, Factory Method and Abstract Factory

Notes on Creational Design Patterns - Prototype, Factory Method and Abstract Factory from Scaler

Creational Design Patterns - Singleton and Builder

Notes on Creational Design Patterns - Singleton and Builder from Scaler

SOLID - Liskov Substitution, Interface Segregation, and Dependency Inversion

Notes on SOLID - Liskov Substitution, Interface Segregation, and Dependency Inversion from Scaler

SOLID - Single Responsibility, Open/Closed Principle

Notes on SOLID - Single Responsibility, Open/Closed Principle from Scaler

Polymorphism

Notes on Polymorphism from Scaler

Constructor, Access modifiers, Inheritance, Diamond Problem

Notes on Constructor, Access modifiers, Inheritance, Diamond Problem from Scaler

Programming paradigms - Procedural vs Object Oriented Programming

Notes on Programming paradigms from Scaler

Low Level Design - What and Why?

Notes on Low Level Design from Scaler

Unraveling the Power of Virtualization: A Comprehensive Guide

In the dynamic realm of technology, virtualization stands as a bedrock, reshaping our approach to computing resources. Originating in the late 1960s at IBM, virtualization has undergone a profound transformation,...

Unraveling the Power of Virtualization: A Comprehensive Guide

In the dynamic realm of technology, virtualization stands as a bedrock, reshaping our approach to computing resources. Originating in the late 1960s at IBM, virtualization has undergone a profound transformation,...

Unraveling the Power of Virtualization: A Comprehensive Guide

In the dynamic realm of technology, virtualization stands as a bedrock, reshaping our approach to computing resources. Originating in the late 1960s at IBM, virtualization has undergone a profound transformation,...

Structural Design Patterns - Decorator and Facade

Notes on Structural Design Patterns - Decorator and Facade

Structural Design Patterns - Adapter and Flyweight

Notes on Structural Design Patterns - Adapter and Flyweight from Scaler

Creational Design Patterns - Prototype, Factory Method and Abstract Factory

Notes on Creational Design Patterns - Prototype, Factory Method and Abstract Factory from Scaler

Creational Design Patterns - Singleton and Builder

Notes on Creational Design Patterns - Singleton and Builder from Scaler

SOLID - Liskov Substitution, Interface Segregation, and Dependency Inversion

Notes on SOLID - Liskov Substitution, Interface Segregation, and Dependency Inversion from Scaler

SOLID - Single Responsibility, Open/Closed Principle

Notes on SOLID - Single Responsibility, Open/Closed Principle from Scaler

Polymorphism

Notes on Polymorphism from Scaler

Constructor, Access modifiers, Inheritance, Diamond Problem

Notes on Constructor, Access modifiers, Inheritance, Diamond Problem from Scaler

Programming paradigms - Procedural vs Object Oriented Programming

Notes on Programming paradigms from Scaler

Low Level Design - What and Why?

Notes on Low Level Design from Scaler

A Comprehensive Guide to Terraform: Understanding the Fundamentals

Terraform, an open-source tool developed by HashiCorp, enables you to define your infrastructure as code. This approach allows you to manage infrastructure across a variety of providers (like AWS, Azure,...

Deploying a Python Telegram Bot on Oracle Cloud

Deploying a Telegram bot on Oracle Cloud provides reliable uptime and cost-effective hosting for a wide range of bot functionalities.

A Beginner's Guide to AWS Lambda

AWS Lambda is a serverless compute service that automatically manages the underlying infrastructure, scaling, and execution of your code. You only need to write the code, and AWS Lambda takes...

A Comprehensive Guide to Terraform: Understanding the Fundamentals

Terraform, an open-source tool developed by HashiCorp, enables you to define your infrastructure as code. This approach allows you to manage infrastructure across a variety of providers (like AWS, Azure,...

A Beginner's Guide to AWS Lambda

AWS Lambda is a serverless compute service that automatically manages the underlying infrastructure, scaling, and execution of your code. You only need to write the code, and AWS Lambda takes...

Deploying a Python Telegram Bot on Oracle Cloud

Deploying a Telegram bot on Oracle Cloud provides reliable uptime and cost-effective hosting for a wide range of bot functionalities.