The ace-the-java-coding-interview's discuss from david-kariuki

Arrays - Challenge 11: Find the Sum of Maximum Sum Subarray

Challenge 3: Big O of Nested Loop with Multiplication

Compute the Big O of an algorithm that involves nested loops, and increments the loop variables through multiplication.

public static void main(String[] args) {
		int n = 10; // O(time complexity of the called function)
		int sum = 0; //O(?)
		double pie = 3.14; //O(?)
		int var = 1; //O(?)

		while(var < n) {
			System.out.println("Pie: " + pie); //O(?)
			for (int j = 0; j < var; j++) {
				sum++; //O(?)
			}
			var *= 2;  //O(?)
		} //end of while loop
		System.out.println("Sum: " + sum); //O(?)
	}

Arrays - Subarrays with Product Less than a Target (medium)

Arrays - Smallest Sub-array With a Greater Sum (easy)

Arrays - Subset (easy)

Complexity Interview Questions

Arrays - Sort an Array Using Quicksort Algorithm

Challenge 2: Big (O) of Nested Loop with Subtraction

Compute Big(O) of an algorithm that involves nested loops and the loop variables decrement.

public static void main(String[] args) {
    int n = 10; // O(time complexity of the called function)
    int sum = 0; //O(1)
    double pie = 3.14; //O(1)
    
    //O(?)
    for (int var = n; var >= 1; var = var - 3) {
      System.out.println("Pie: " + pie);
      //O(?)
      for (int j = n; j >= 0; j = j - 1) {
        sum++;
      }
    } //end of outer for loop
  System.out.println("Sum: " + sum);//O(1)
  }

Arrays - Number Range (medium)

Arrays - Challenge 6: First Non-Repeating Integer in an Array

Arrays - Challenge 1: Remove Even Integers from an Array

Challenge 7: Nested Loop with Multiplication (Pro)

Compute the big O complexity of the code snippet given below.

public static void main(String[] args) {
    int n = 10;   
		int sum = 0;  
    int j = 1;   
		double pie = 3.14; 

		for (int var = 0; var < n; var++) {  
      
			System.out.println("Pie: " + pie); 
			while(j < var) { 
        sum += 1;  
        j *= 2;  
      }
    } 
    System.out.println("Sum: " + sum); 
  }

Arrays - Triplet Sum to Zero (medium)

Arrays - Move All Zeros to the Beginning of the Array

Arrays - Subsets With Duplicates (easy)

Arrays - Find the Smallest Common Number

Arrays - Order-agnostic Binary Search (easy)

Big Oh Cheat Sheet

Challenge 6: Nested Loop with Multiplication (Advanced)

Compute the Big O complexity of the code snippet given below.

public static void main(String[] args) {
    int n = 10;   
		int sum = 0; 
		double pie = 3.14; 

		for (int var = 0; var < n; var++) {   
      int j = 1;  
			System.out.println("Pie: " + pie);
			while(j < var) { 
        sum += 1;  
        j *= 2;  
      }
    } //end of for loop
    System.out.println("Sum: " + sum); 
  }

Arrays - Challenge 3: Find Two Numbers that Add up to "n"

Challenge 4: Nested Loop with Multiplication (Basic)

A basic exercise based on the Big(O) of an algorithm that involves nested loops and the loop variables increment with multiplication.

public static void main(String[] args) {
		int n = 10; // O(time complexity of the called function)
		int sum = 0; //O(1)
		double pie = 3.14; //O(1)
		int var = 1; //O(?)
		while(var < n) { 
			System.out.println("Pie: " + pie); 
				//O(?)
			for (int j = 1; j < n; j = j + 2) {   
				sum++;  
			}
			var *= 3;  
		} //end of while loop
		System.out.println("Sum: " + sum); //O(1)
	}

Arrays - Challenge 9: Re-arrange Positive & Negative Values

Arrays - Challenge 5: Find Minimum Value in Array

Arrays - Pair with Target Sum (easy)

Arrays - Find Low/High Index of an Element in a Sorted Array

Arrays - Implement Binary Search on a Sorted Array

Arrays - Challenge 7: Find Second Maximum Value in an Array

Arrays - Triplet Sum Close to Target (medium)

Challenge 5: Nested Loop with Multiplication (Intermediate)

Compute the Big O complexity of the code snippet given below. It is better to solve it on a piece of paper, and then see if your answer matches the correct option!

public static void main(String[] args) {
    int n = 10;    //O(1) 
    int sum = 0;  //O(1)
    int j = 1;   //O(1)
    double pie = 3.14;  //O(1) 
  
    //O(?)
    for (int var = 1; var < n; var += 3) {
      System.out.println("Pie: " + pie);
      j = 1;
      while (j < n) { //O(?)
        sum += 1;     
        j *= 3;       
      }
    }
    System.out.println("Sum: " + sum); //O(1)
	}

Arrays - Merge Intervals (medium)

Arrays - Maximum Sum Subarray of Size K (easy)

Arrays - Bitonic Array Maximum (easy)

Arrays - Squaring a Sorted Array (easy)

Arrays - Challenge 10: Rearrange Sorted Array in Max/Min Form

Arrays - Permutations (medium)

Arrays - Next Letter (medium)

Arrays - Find Maximum in Sliding Window

Cyclic Sort (easy)

Arrays - Introduction to Arrays

Arrays - Merge an Array With Overlapping Intervals

Challenge 1: Big (O) of Nested Loop with Addition

Compute the Big O complexity of an algorithm that involves nested loops where the loop variables increase with addition.

public static void main(String[] args) {
    int n = 10;
    int sum = 0;
    double pie = 3.14;
    
    for (int var = 0; var < n; var = var + 3) {
      System.out.println("Pie: " + pie);
      for (int j = 0; j < n; j = j + 2) {
        sum++;
        System.out.println("Sum = " + sum);
      }
    }
  }

david-kariuki / ace-the-java-coding-interview Goto Github PK

ace-the-java-coding-interview's Issues

Recommend Projects

Recommend Topics

Recommend Org