brightlightkim

import java.util.*; class Program { public static int getNthFib(int n) { if (n < 2){ return 0; } else if (n == 2){ return 1; } return getNthFib(n-1) + getNthFib(n-2); } }

import java.util.Scanner; public class Printer { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int statues = sc.nextInt(); System.out.println(1 + (int)Math.ceil(Math.log(statues) / Math.log(2))); } }

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation: nums[0] + nums[1] + nums[1] = (-1) + 0 + 1 = 0. nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) ..

import java.util.*; class Program { // This is an input class. Do not edit. public static class LinkedList { public int value; public LinkedList next; public LinkedList(int value) { this.value = value; this.next = null; } } public LinkedList removeDuplicatesFromLinkedList(LinkedList linkedList) { LinkedList root = linkedList; while(linkedList.next != null){ if (linkedList.value == linkedList.nex..

import java.util.*; class Program { public int tandemBicycle(int[] redShirtSpeeds, int[] blueShirtSpeeds, boolean fastest) { Arrays.sort(redShirtSpeeds); Arrays.sort(blueShirtSpeeds); int sum = 0; for (int i = 0; i < redShirtSpeeds.length; i++){ if (fastest){ sum += Math.max(redShirtSpeeds[i], blueShirtSpeeds[redShirtSpeeds.length - 1 - i]); } else { sum += Math.max(redShirtSpeeds[i], blueShirtS..

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers in each row are sorted from left to right. The first integer of each row is greater than the last integer of the previous row. Example 1: Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3 Output: true Example 2: Input: matrix = [[1,..

import java.util.*; class Program { public boolean classPhotos( ArrayList redShirtHeights, ArrayList blueShirtHeights) { Collections.sort(redShirtHeights); Collections.sort(blueShirtHeights); int diff = redShirtHeights.get(0) - blueShirtHeights.get(0); for (int i = 0; i < redShirtHeights.size(); i++){ if ((redShirtHeights.get(i) - blueShirtHeights.get(i))*diff

import java.util.*; class Program { public int minimumWaitingTime(int[] queries) { Arrays.sort(queries); int totalSum = 0; int sum = 0; for (int i = 1; i < queries.length; i++){ sum += queries[i - 1]; totalSum += sum; } return totalSum; } }

import java.util.*; class Program { // Do not edit the class below except // for the depthFirstSearch method. // Feel free to add new properties // and methods to the class. static class Node { String name; List children = new ArrayList(); public Node(String name) { this.name = name; } public List depthFirstSearch(List array) { array.add(name); for (Node child : children){ if (child == null){ re..

import java.util.*; class Program { public static int nodeDepths(BinaryTree root) { // Write your code here. return findNodeSum(root, 0); } public static int findNodeSum(BinaryTree root, int depth){ int sum = 0; if (root == null){ return 0; } sum += depth; sum += findNodeSum(root.left, depth + 1); sum += findNodeSum(root.right, depth + 1); return sum; } static class BinaryTree { int value; Binar..