Skip to content

Instantly share code, notes, and snippets.

View computingfreak's full-sized avatar

Milind Shah computingfreak

View GitHub Profile
public class ReverseT9 {
public static void main(String x) {
ReverseT9 phone = new ReverseT9();
System.out.println(phone.reverse_t9(x));
}
char getCharacter(char key, int index) {
char[][] characterMapping = new char[][] {
{'+'},
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class CaeserCipher {
<?php
$currentTime = date('Y-m-d H:i:s');
var_dump(strtotime($currentTime));
$someDate = strtotime("2019-10-10 00:00:00");
$time = time();
var_dump($currentTime);
var_dump($someDate);
$diff = $someDate - strtotime($currentTime);
var_dump($diff);
<?php
$a['b']=[];
$a['b']['x']="y";
$a['c']=[];
$a['c']['y']="z";
$b=array_merge($a['b'],$a['c']);
print_r($b);
var_dump($b);
import java.io.*;
import java.util.*;
public class FizzBuzz {
public static void main(String[] args) {
for(int i=1;i<=100;i++){
if(i%3==0&&i%5==0)System.out.println("FizzBuzz");
else if(i%3==0)System.out.println("Fizz");
else if(i%5==0)System.out.println("Buzz");
from itertools import permutations,combinations
string = raw_input()
text=string.split(" ")[0]
num=int(string.split(" ")[1])
rc = list()
words=list(text)
words.sort()
for j in range(1,num+1):
pc = list(combinations(words,j))
@computingfreak
computingfreak / goldbach.java
Last active March 12, 2019 02:27
Godlbach's COnjecture
import java.util.*;
import java.lang.*;
import java.io.*;
class goldbach
{
public static void main (String[] args)
{
Scanner scr=new Scanner(System.in);
int T=scr.nextInt();
scr.nextLine();
import java.util.*;
public class collectionsortsublist
{
public static void sortsublist()
{
List<Integer> x=new ArrayList<Integer>();
x.add(1);
x.add(3);
x.add(2);
x.add(24);
@computingfreak
computingfreak / bigintfactorial.java
Created March 9, 2019 16:01
BigInteger Factorial Dynamic Programming
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
class bigintfactorial
{
public static Map<BigInteger,BigInteger> nf;
public static void main (String[] args)
{
Scanner scr=new Scanner(System.in);
import java.util.*;
public class series
{
public static void main(int n) {
for(int i=1;i<=n;i++){
//System.out.println(operate(i));
System.out.println(i+" -> "+op(i));
}
}