Skip to content

Added Important Algos #1322

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
deadshotsb merged 16 commits into from
May 25, 2020
Merged

Added Important Algos #1322

Changes from 1 commit
Commits
Show all changes
16 commits
Select commit Hold shift + click to select a range
627115b
Created Graph Algos
Ritik2604 May 22, 2020
278529e
Create SinglyLinkedList
Ritik2604 May 23, 2020
4842a4c
Update and rename SinglyLinkedList to ListAddnFun
Ritik2604 May 23, 2020
ef2be07
Create AVLSimple
Ritik2604 May 23, 2020
07aee8b
Create BoardPath
Ritik2604 May 23, 2020
e717f96
Create CountNumBinaryStrings
Ritik2604 May 23, 2020
9a8ccea
Delete LinkedList.java
Ritik2604 May 23, 2020
3a234f0
Delete Node.java
Ritik2604 May 23, 2020
01d5814
Create Intersection
Ritik2604 May 23, 2020
1ef46db
Update GraphAlgos
Ritik2604 May 24, 2020
f710f3a
Update ListAddnFun
Ritik2604 May 24, 2020
82e2132
Update AVLSimple
Ritik2604 May 24, 2020
920852a
Update BoardPath
Ritik2604 May 24, 2020
94cfab0
Update BoardPath
Ritik2604 May 24, 2020
ec4f6a1
Update CountNumBinaryStrings
Ritik2604 May 24, 2020
a23a17b
Update Intersection
Ritik2604 May 24, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update BoardPath
  • Loading branch information
@Ritik2604
Ritik2604 authored May 24, 2020
commit 920852aa0e41015a05fe72976675b4c439560bab
25 changes: 25 additions & 0 deletions DynamicProgramming/BoardPath
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,29 @@
package DynamicProgramming.BoardPath;
/*
* this is an important Algo in which
* we have starting and ending of board and we have to reach
* we have to count no. of ways
* that help to reach end point i.e number by rolling dice
* which have 1 to 6 digits

Test Case:
here target is 10

int n=10;
startAlgo();
System.out.println(bpR(0,n));
System.out.println(endAlgo()+"ms");
int[] strg=new int [n+1];
startAlgo();
System.out.println(bpRS(0,n,strg));
System.out.println(endAlgo()+"ms");
startAlgo();
System.out.println(bpIS(0,n,strg));
System.out.println(endAlgo()+"ms");



*/
public class BoardPath {
public static long startTime;
public static long endTime;
Expand Down