All Hard Articles

## Number of ways to divide an array into K equal sum sub-arrays 4

Given an integer K and an array arr[] of N integers, the task is to find the number of ways to split the array into… Read More »

## Algorithms Sample Questions | Set 3 | Time Order Analysis 4

Question 1: What is the asymptotic boundary of T(n)? θ( n*log(n) ) θ( n2 ) θ( n ) θ( n*log2(n) ) θ( n2*log2(n) ) Answer:… Read More »

## Fibonacci Power 4

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

## Number of subsets with zero sum 4

Given an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… Read More »

## Sum of maximum of all subarrays | Divide and Conquer 4.2

Given an array arr[] of length N, the task is to find the sum of the maximum elements of every possible sub-array of the array.… Read More »

Each and every day, you must be watching some video or another on YouTube which may be related to Music, Movies, Studies, Research, Leisure etc.… Read More »

## Top 10 Algorithms every Machine Learning Engineer should know 4.3

“Computers are able to see, hear and learn. Welcome to the future.” And Machine Learning is the future. According to Forbes, Machine learning patents grew… Read More »

## Adobe Interview Experience | MTS-1 4

1. Online Assessment Test (HackerRank) a. 15 aptitude questions (15 mins) b. 5 input-output programs (15 mins) c. 2 programming questions (45 mins)   2.… Read More »

## Queries for bitwise AND in the index range [L, R] of the given array 4

Given an array arr[] of N and Q queries consisting of a range [L, R]. the task is to find the bit-wise AND of all… Read More »

## Distinct palindromic sub-strings of the given string using Dynamic Programming 4.5

Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string. Examples: Input: str = “abaaa”… Read More »

## Minimize the number of steps required to reach the end of the array 4.5

Given an integer array arr[] of length N consisting of positive integers, the task is to minimize the number of steps required to reach the… Read More »

## IBM Placement Paper | Logical Reasoning Set 2 4

This is an IBM model placement paper on Logical Reasoning for placement preparation. This placement paper will cover logical reasoning questions that are asked in… Read More »

## Minimum number of sub-strings of a string such that all are power of 5 4

Given a binary string str. The task is to find the smallest positive integer C such that the binary string can be cut into C… Read More »

## Dynamically generating a QR code using PHP 4

There are a number of open source libraries available online which can be used to generate a Quick Response(QR) Code. A good open source library… Read More »

## Persistent Trie | Set 1 (Introduction) 4

Prerequisite: Trie Persistency in Data Structure Trie is one handy data structure that often comes into play when performing multiple string lookups. In this post,… Read More »

## Maximum number of edges in Bipartite graph 4

Given an integer N which represents the number of Vertices. The Task is to find the maximum number of edges possible in a Bipartite graph… Read More »

## Odd Even Transposition Sort / Brick Sort using pthreads 4

Odd-Even Transposition Sort is a parallel sorting algorithm. It is based on the Bubble Sort technique, which compares every 2 consecutive numbers in the array… Read More »

## Kth largest node among all directly connected nodes to the given node in an undirected graph 4

Given two arrays u and v, representing a graph such that there is an undirected edge from u[i] to v[i] (0 ≤ v[i], u[i] <… Read More »

## Personal Voice Assistant in Python 4.5

As we know Python is a suitable language for script writers and developers. Let’s write a script for Personal Voice Assistant using Python. The query… Read More »

## Maximum Sum SubArray using Divide and Conquer | Set 2 4

Given an array arr[] of integers, the task is to find the maximum sum sub-array among all the possible sub-arrays. Examples: Input: arr[] = {-2,… Read More »