Maze Traveller Problem solved using Dynamic programming

 Maze Traveller Solution in Java solved using recursion.




  import java.util.*;
  class mazeTraveller
  {
      static HashMap<String, Long> map = new HashMap<>();
      static long calculate(int row , int col) {
          return _calculate(row, col , map);
      }
      static long _calculate(int row ,int col,HashMap<String,Long> map) {
          String key = row+":"+col;

          if(map.containsKey(key)) return map.get(key);
          if(row == 0 || col == 0 ) return 0;
          if(col == 1 || row == 1) return 1;

          long res =  _calculate(row-1,col,map) + _calculate(row,col-1,map);
          map.put(key,res);
          return map.get(key);

      }
      static Scanner input = new Scanner(System.in);
      public static void main(String[] args) {
      try
      {
            int row = input.nextInt();
            int col = input.nextInt();
            long paths = calculate(row,col);
            System.out.println("There are "+paths + " to travel in maze");
      }
      catch(Exception e){
        return;
      }
    }
  }

  5 5
  There are 70 to travel in maze
  18 18
  There are 2333606220 to travel in maze
  2 10
  There are 10 to travel in maze

Popular Posts

Family Tree Project in Java

Image
Creating Family tree in java .  Trees are such an important structure in computer science. But what more important tree, than our family tree? ❤️   👨‍👩‍👧‍👦   ❤️    Made this simple program in java to implement family tree. Java File import java.util.*; class Person { String name; boolean married; String wife; int noOfChild; Person[] childs; public Person(String name){ this.name = name; } public Person(String name,boolean married,String wife,Person[] childs,int noOfChild) { this.name = name; this.married = married; this.wife = wife; this.childs = childs; this.noOfChild = noOfChild; } public Person(String name , boolean married,String wife) { this.name = name; this.married = married; this.wife = wife; } } class familyTree { static int population; static Scanner input = new Scanner...
View post ��

java:17: error: local variables referenced from a lambda expression must be final or effectively final count ++ ;

Image
 Modifying variables inside java lambdas. Integer list[] = {1,2,3,4,5,6,7,8}; int index = 0; Arrays.asList(list).forEach(e -> { System.out.println(e+" at index "+index); index++; }); Error : maze2.java:22: error: local variables referenced from a lambda expression must be final or effectively final System.out.println(e+" at index "+index); ^ maze2.java:23: error: local variables referenced from a lambda expression must be final or effectively final index++; ^ Solution : Integer list[] = {1,2,3,4,5,6,7,8}; int[] index = {0}; Arrays.asList(list).forEach(e -> { System.out.println(e+" at index "+index[0]); index[0]++; }); Output : 1 at index 0 2 at index 1 3 at index 2 4 at index 3 5 at index 4 6 at index 5 7 at index 6 8 at index 7
View post ��

Creating basic tic tac toe android app using java

Image
 Marvel Tic Tac Toe Android Game ( Java ) In this blog I we will create basic android app. We will be coding in java.   package com.example.batvsiron ; import androidx.appcompat.app.AppCompatActivity ; import android.os.Bundle ; import android.util.Log ; import android.view.View ; import android.widget.Button ; import android.widget.GridLayout ; import android.widget.ImageView ; import android.widget.TextView ; import android.widget.Toast ; import java.util.Arrays ; public class MainActivity extends AppCompatActivity { int active = 0 ; public int [][] winningPosition = { { 0 , 1 , 2 } , { 3 , 4 , 5 } , { 6 , 7 , 8 } , { 0 , 3 , 6 } , { 1 , 4 , 7 } , { 2 , 5 , 8 } , { 0 , 4 , 8 } , { 2 , 4 , 6 } } ; public int [] moves = { 111 , 111 , 111 , 111 , 111 , 111 , 111 , 111 , 111 } ; public int checkWinning () { for ( int [] arr : winningPosition ) { ...
View post ��