Posts by divyesh srivastava

Total Ways to traverse a n*m board using Dynamic Programming in Java

By divyesh srivastava

In this Java tutorial, we are going to find the total number of ways to traverse a board consisting of n*m blocks using Dynamic Programming approach. Finding the total number of wa.... Read More

Operation on Strings using pre-defined string functions in PHP

By divyesh srivastava

In this PHP tutorial, we are going to perform different operations on strings using pre-defined string functions in PHP. Some of the pre-defined string functions in PHP:- 1.) strle.... Read More

Total ways to reach destination by snake using Backtracking In Java

By divyesh srivastava

In this Java tutorial, we are going to find all the possible paths for reaching the snake to the destination by using backtracking technique. Suppose we have a n*m cells path and s.... Read More

Maximum Coin Spend Problem using Dynamic Programming in Java

By divyesh srivastava

In this Java tutorial, We are going to discuss Maximum coin Problem using DP. In the problem, we are provided with two input arrays of n values in which one array consists of dista.... Read More

Java solution to maximize the chances of winning in Monty-Hall Paradox Problem

By divyesh srivastava

In this Java Tutorial, we are going to solve the maximum chance of winning the famous Monty-Hall Paradox Problem in Java. Maximize the chances of winning in Monty Hall Paradox in J.... Read More

Converting first letter of each word in a sentence to upper case in Java

By divyesh srivastava

In this Java tutorial, we are going to convert first letter of each word to upper case in Java in a given sentence. In order to do this we have taken an input string “strR.... Read More

How to remove non-alphabetical characters from a string in JAVA

By divyesh srivastava

In this Java tutorial, we will learn how to remove non-alphabetical characters from a string in Java. You can also say that print only alphabetical characters from a string in Java.... Read More