Posts by divyesh srivastava

Author Biographical Info: Not available

Dima and Bad Xor Problem – Codeforces ( Div. 2 )

By divyesh srivastava

  Problem Statement A matrix  ‘a’ of size n*m is filled with non-negative integers. We have to select exactly one integer from each row such that bitwise exclusiv.... Read More

Subset Sum Problem using DP in C++

By divyesh srivastava

In this CPP tutorial, we are going to discuss the subset sum problem its implementation using Dynamic Programming in CPP. We will also discuss Dynamic programming. Problem Statemen.... Read More

Mathematical functions in C++

By divyesh srivastava

In some problems it is required to find values of some mathematical functions like logarithm value, sinh value, tanh value, exponential value calculating such values manually is no.... Read More

Some important basic in – built functions in python

By divyesh srivastava

As there are many in-built functions in python which helps us in competitive programming and saves our time in writing code for those functions. In this python tutorial, we are goi.... Read More

Linked List Data Structure in Java

By divyesh srivastava

In this Java tutorial, we are going to discuss the linked list data structure. We will learn the following things in this Java Linked List tutorial: Advantages of LinkedList in Ja.... Read More

Interpolation Search in Java

By divyesh srivastava

Time complexity plays a major role in competitive programming problems. To get rid of TLE  we try different approaches and look for the best algorithm on basis of time complexity..... Read More

Nth number in a Fibonacci series using Dynamic Programming in Java

By divyesh srivastava

In this Java tutorial, we are going to find nth number in a Fibonacci series using dynamic programming bottom-up approach. Why Dynamic Programming? The given problem can also be so.... Read More

Length of Longest Increasing Subsequence in Java

By divyesh srivastava

In this Java tutorial, we are going to discuss how to find the length of longest increasing subsequence in an array. Longest increasing Subsequence problem is being asked in compet.... Read More