Aditya Kumar Saroj - OpenGenus IQ: Computing Expertise & Legacy

Finding LCM of an array of numbers

Find the LCM of the given array of positive numbers. We have explored 2 approaches: one using GCD and other without using GCD.

Software Engineering

Fixed width integer types (int8) in C++

C99 has defined a set of fixed-width integers that are guaranteed to have the same size on any architecture. These can be found in stdint.h header. This enables to use INT8 in C++.

Algorithms

Longest Alternating Subsequence

Given an array, find the length of the longest alternating subsequence. We solve this using two approaches: Dynamic Programming and Efficient Approach.

String Algorithms

Minimum number of operations to convert binary string to self-destructing

We will explore algorithms to find the Minimum number of operations to convert a binary string to a self-destructing string.

Algorithms

Maximum Sum Decreasing Subsequence (Dynamic Programming)

Given an array of n positive integers, find the sum of the maximum sum decreasing subsequence (msds) of the given array such that the integers in the subsequence are sorted in decreasing order.

Algorithms

Minimum steps to make binary string empty by removing alternating subsequence in each step

Given a string str consisting of only '0's and '1's, the task is to make the string empty by performing minimum number of operations. An operation is defined as the removal of an alternating subsequence from str without changing the order of the remaining characters.