Skip to content

Instantly share code, notes, and snippets.

View mehtaparitosh's full-sized avatar

Paritosh Mehta mehtaparitosh

  • Gurgaon, India
View GitHub Profile
import java.util.*;
import java.math.*;
class battel
{
int findValue(int x){
BigInteger f = new BigInteger;
f = 1;
for(int i=1;i<=x;i++){
f=f*i;
@mehtaparitosh
mehtaparitosh / HCF - LCM (JAVA)
Created August 24, 2017 05:47
An efficient way to find HCF and LCM
import java.util.Scanner
public class JavaProgram
{
public static void main(String args[])
{
int a, b, x, y, t, hcf, lcm;
Scanner scan = new Scanner(System.in);
System.out.print("Enter Two Number : ");
@mehtaparitosh
mehtaparitosh / HCF - LCM (JAVA)
Last active August 24, 2017 05:47
An efficient way to find HCF and LCM
import java.util.Scanner
public class JavaProgram
{
public static void main(String args[])
{
int a, b, x, y, t, hcf, lcm;
Scanner scan = new Scanner(System.in);
System.out.print("Enter Two Number : ");
/*
* @author Paritosh Mehta
*/
import java.io.*;
import java.util.*;
public class NewClass {
public static boolean exists(ArrayList<Integer> u, int val){
int flag = 0;
import java.io.*;
import java.util.*;
/**
*
* @author Paritosh Mehta
*/
public class largest {
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
package project;
import java.util.*;
import java.io.*;
/**
*
* @author Paritosh Mehta
*/
public class Payoda {
public static boolean checker(char[] x, char[] y){
package Sorting;
import java.util.*;
/**
*
* @author paritosh mehta
*/
public class MergeSort {
public static void merge(int[] left, int[] right, int[] arr){
int l, r, i=0, j=0, k=0;
package Programs;
import java.util.*;
/**
*
* @author paritosh mehta
*/
public class WhiteSpace {
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
System.out.println("Enter the String: ");
import java.util.*;
import java.io.*;
/**
*
* @author paritosh mehta
*/
import java.util.*;
public class JadenCase {
public static void main(String[] args){
Scanner in = new Scanner(System.in);