RitamChakraborty

import java.util.Arrays;
import java.util.HashMap;

public class KNFAlgorithm {
	
	private static int[] getTable(String s) {
		char[] chars = s.toCharArray();
		int n = chars.length;
		HashMap<Character, Integer> map = new HashMap<>();
		int[] table = new int[n];

RitamChakraborty

public class StringMatching {
	
	private static boolean contains(String a, String b) {
		int i = 0;
		int n1 = a.length();
		int n2 = b.length();
		char[] ch1 = a.toCharArray();
		char[] ch2 = b.toCharArray();
		
		while (i < n1) {

RitamChakraborty

import java.util.Arrays;

public class SumOfSubsets {
	private static int required;
	private static int[] arr;
	private static int n;
	
	private static void fun(int i, int[] sol, int sum, int remaining) {
		if (remaining >= 0 && sum <= required) {
			if (sum == required && remaining == 0) {

RitamChakraborty

import java.util.*;

public class NQueensProblem {
	private static int n;
	private static char[][] arr;
	private static LinkedHashSet<String> finalSolution;
	
	static {
		finalSolution = new LinkedHashSet<>();
	}

RitamChakraborty

mport java.util.*;

public class LongestCommonSubsequenceWithDynamicProgramming {
	public static void main(String[] args) {
		char[] A = "bd".toCharArray();
		char[] B = "abcd".toCharArray();
		
		int[][] arr = new int[A.length + 1][B.length + 1];
		
		for (int i = 1; i <= A.length; i++) {

RitamChakraborty

import java.util.Arrays;

public class LongestCommonSubsequenceWithMemorization {
	private static char[] A;
	private static char[] B;
	private static int[][] arr;
	
	private static int longestCommonSubsequent(int i, int j) {
		if (i == A.length || j == B.length) {
			return 0;

RitamChakraborty

public class LongestCommonSubsequenceWithoutMemorization {
	private static char[] A;
	private static char[] B;
	
	private static int longestCommonSubsequent(int i, int j) {
		if (i == A.length || j == B.length) {
			return 0;
		} else if (A[i] == B[j]) {
			return 1 + longestCommonSubsequent(i + 1, j + 1);
		} else {

RitamChakraborty

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class TravellingSalesmanProblem {
	private static final int startingIndex;
	private static final int[][] arr = {{0, 10, 15, 20}, {5, 0, 9, 10}, {6, 13, 0, 12}, {8, 8, 9, 0}};
	

RitamChakraborty

import java.util.ArrayDeque;
import java.util.List;
import java.util.Queue;
import java.util.Stack;
import java.util.stream.Collectors;
import java.util.stream.Stream;

class Node {
	int data;
	List<Node> neighbours;

RitamChakraborty

import java.util.Arrays;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class ZeroOneKnapsackProblem {
	public static void main(String[] args) {
		int max = 8;
		int n = 4;
		int[] p = {1, 2, 5, 6};
		int[] w = {2, 3, 4, 5};