Algorithms

Algorithms

My Calendar III Problem [Solved with Segment Tree, Sweep Line]

In this article at OpenGenus, we have solved the Calendar 3 problem that is to find number of conflicting meetings in a given range of time. We have solved this using the concept of Sweep Line and Segment tree with Lazy Propagation.

Algorithms

Bubble sort in C

In this article, we have explained bubble sort algorithm and implemented a program on it in C Programming Language.

Algorithms

Binary Search in C using recursion

In this article at OpenGenus, we have explained Binary search algorithm and implement a program on the same in C programming language using recursion.

Algorithms

Linear Search explained simply [+ code in C]

In this article, we have explained Linear search algorithm and implement a program on the same in C programming language.

Algorithms

Minimum cost to connect all points (using MST)

In this article, we will understand how to solve the minimum cost to connect all the points problem using Minimum Spanning Tree.

C++

QuickSort using template in C++

In this article, we have designed and implemented Quick Sort algorithm in C++ Programming Language to use the concept of template to make Quick Sort generic/ independent of input datatype.

Search Algorithms

OOP design for Search Algorithms

In this article, we have presented good implementation designs considering there are multiple search algorithms and different data types.

backtracking

Shortest path in a Maze using Backtracking

In this article, we have covered the topic on finding the Shortest path in a Maze using Backtracking. We have presented the Time and Space Complexity for various cases.

C Programming

C program to swap two numbers without using third variable [3 techniques]

In this article, we have demonstrated multiple approaches to swap two numbers without using a third temporary variable.

Algorithms

Schedule Events in Calendar Problem [Segment Tree]

In this article, we will discuss the My Calendar 1 problem where we need to schedule events in a calendar such that there is no conflict. This will involve the concept of Segment Tree.

C++

Parallel Radix Sort handling positive & negative numbers in C++

In this article, we have designed and implemented Parallel Radix Sort handling positive and negative numbers in C++ Programming Language.

Algorithms

Minimum Deletions to Make Array Divisible [3 Solutions]

In this article, we will explore how we can get the minimum number of deletion of smallest element such that the smallest element in the first array divides all the elements in the second array. This will involve the concept of Min Heap and Hash Map.

Algorithms

Find K closest numbers to a given value

In this article, we will explore on how to find the K closest numbers to a given value in a given set of numbers. We have presented two approaches using the concepts of binary search and Heap data structure.

Python

Multi-threaded Python code to find Prime Numbers using Sieve of Eratosthenes

In this article, we have designed and implemented a Multi-threaded Python code to find Prime Numbers using Sieve of Eratosthenes.

binary search

K-th Smallest Number in Multiplication Table [Solved]

In this article, we have solved the problem of finding the K-th Smallest Number in Multiplication Table. This involve the concept of Binary Search.

Algorithms

Find K-th Smallest Pair Distance [Solved]

In this article, we have solved the problem of finding the K-th smallest pair distance. This involve the concept of Binary Search.

C++

Interpolation Search in C++ using OOPs

In this article, we will implement Interpolation Search in C++ using some OOPs concept. But before that we need to have a basic idea and working technique of Interpolation Search.

Dynamic Programming (DP)

Interleaving String [Solved]

The Interleaving Strings problem is a classical dynamic programming problem that involves whether a string can be formed by interleaving two strings. In this article, we'll explore this problem in depth and provide a C++ implementation using dynamic programming.

Algorithms

Sliding Window Technique [Explained]

In this article, we will discuss about the sliding window technique and how it is useful while solving problems.

Algorithms

Generating IP Addresses [Backtracking String problem]

In this article, we will explore a common problem of restoring IP addresses from a given string of digits. For example, given the string "25525511135", the valid IP addresses that can be generated are "255.255.11.135" and "255.255.111.35".

Algorithms

Number of closed islands [2 solutions]

In this article, we have explored how to find the Number of closed islands in a graph. We have presented two approaches using the concept of BFS/ DFS and Union Find.

Algorithms

Longest Consecutive Subsequence [3 solutions]

In this article, we have solved the problem of Longest Consecutive Subsequence using the concept of Hash Map and Union Find.

Algorithms

Maximum Gap [Solved]

In this article, we are going to see the interesting solution to the problem - "Maximum Gap". This will involve the concept of Bucket Sort and Radix Sort.

bitwise algorithm

Find the rightmost set bit in a number (+ toggle it)

Finding the rightmost set bit in a number is a common problem in computer science and is used in many applications, from competitive programming to low-level programming and data compression. In this article, we will explore various techniques to find the rightmost set bit in a number.

cheatsheet

Cheatsheet for Search algorithms

This is the complete cheatsheet for all the Searching Algorithms that will act as a summary of each concepts including time complexity, key weakness and strengths.