shahzadaazam

# a million commits
for Y in {2017..2018}
do
  mkdir $Y
  cd $Y
  for M in {01..12}
  do
    mkdir $M
    cd $M
    for D in {01..10}

shahzadaazam

import requests 
import csv

lat_start = ""
long_start = ""
long_end = ""
lat_end = ""

status = ""
destination_address = ""

shahzadaazam

class Permutation {
    
    List<List<Integer>> globalList = new ArrayList<>();
    
    public List<List<Integer>> permute(int[] nums) {
        
        List<List<Integer>> permutations = new ArrayList<>();
        List<Integer> numbers = new ArrayList<>();
        
        for (int i : nums) {

shahzadaazam

import java.util.*;

class PermuteString {
  public static void main(String[] args) {
    String abc = "ABC";
    System.out.println(Solution.permutation(abc));
  }
}

class Solution {

shahzadaazam

public class Knapsack {
  
    public static void main(String[] args) {
        int val[] = new int[]{0, 60, 100, 120};
        int wt[] = new int[]{0, 10, 20, 30};
        int W = 50;
        int n = val.length-1;
        System.out.println(Knapsack.knapsack(wt, val, W, n));
    }
  

shahzadaazam

public class Knapsack {
  
    public static void main(String[] args) {

        int val[] = new int[]{0, 60, 100, 120};
        int wt[] = new int[]{0, 10, 20, 30};
        int W = 50;
        int n = val.length-1;
        int[][] memo = new int[n+1][W+1];

shahzadaazam

public class MergeSort {
	
	public static void main (String args[]) {
		int[] arr = new int[]{5, 2, 3, 1, 4};
        int[] helperArr = new int[arr.length];
		mergeSort(arr, helperArr, 0, arr.length-1);

        for (int i : arr) {
            System.out.print(i + " ");
        }

shahzadaazam

class Quicksort {
    public static void main(String[] args) {
        int[] arr = new int[]{4, 6, 2, 3, 5, 8, 9, 1};
        quicksort(arr, 0, arr.length-1);
        printArr(arr);
    }

    public static void quicksort(int[] arr, int left, int right) {
        if (left < right) {
            int pivot = arr[(left + right)/2];

shahzadaazam

class BinarySearch {
    public static void main(String[] args) {
        int[] arr = new int[]{1, 2, 3, 4, 5};
        System.out.println(binarySearch(arr, 0, arr.length-1, 5));
    }

    public static boolean binarySearch(int[] arr, int left, int right, int num) {

        if (left <= right) {
            int mid = (left + right) / 2;

shahzadaazam

class BinarySearch {
    public static void main(String[] args) {
        int[] arr = new int[]{1, 2, 3, 4, 5};
        System.out.println(binarySearch(arr,4));
    }

    public static boolean binarySearch(int[] arr, int num) {
        int low = 0;
        int high = arr.length-1;