This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class unboundedKnapsack{ | |
static int knapSack(int n, int W, int val[], int wt[]) | |
{ | |
// Initialize the matrix with 0's | |
int dp[][] = new int[n+1][W+1]; | |
for(int i=0; i<n+1; i++){ | |
for(int j=0; j<W+1; j++){ | |
if(i==0 || j==0) | |
dp[i][j] = 0; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution | |
{ | |
static int knapSack(int W, int wt[], int val[], int n) | |
{ | |
// Initialize the matrix with 0's | |
int dp[][] = new int[n+1][W+1]; | |
for(int i=0; i<n+1; i++){ | |
for(int j=0; j<W+1; j++){ | |
if(i==0 || j==0) | |
dp[i][j] = 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public int fibo(int n){ | |
dp[0] = 0; | |
dp[1] = 1; | |
for(int i=2; i<=n; i++){ | |
dp[i] = dp[i-1] + dp[i-2]; | |
} | |
return dp[n]; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public int fibo(int n){ | |
if(n <= 1) | |
return n; | |
return fibo(n - 1) + fibo(n - 2); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static void main(String[] args) { | |
FastReader s = new FastReader(); | |
int n = s.nextInt(); | |
int k = s.nextInt(); | |
int a[] = new int[n]; | |
for (int i = 0; i < n; i++) | |
a[i] = s.nextInt(); | |
int left=0, right=0, sum=0; | |
int max = Integer.MIN_VALUE; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static void main(String[] args) { | |
FastReader s = new FastReader(); | |
int n = s.nextInt(); | |
int k = s.nextInt(); | |
int a[] = new int[n]; | |
for (int i = 0; i < n; i++) | |
a[i] = s.nextInt(); //accepting array | |
Queue<Integer> q = new LinkedList<>(); | |
for (int i = 0; i < k; i++) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static void main(String[] args) | |
{ | |
FastReader s=new FastReader(); | |
int n = s.nextInt(); | |
int k = s.nextInt(); | |
int a[] = new int[n]; | |
for(int i=0; i<n; i++)a[i] = s.nextInt(); | |
int maximum_sum = Integer.MIN_VALUE; | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public static void main(String[] args) | |
{ | |
FastReader s=new FastReader(); | |
int n = s.nextInt(); //accepting size of an array | |
int k = s.nextInt(); //no. of terms to add | |
int a[] = new int[n]; | |
for(int i=0; i<n; i++)a[i] = s.nextInt(); // inputting array | |
int maximum_sum = Integer.MIN_VALUE; | |
for(int i=0; i< n-k+1; i++){ |