{{ message }}

Instantly share code, notes, and snippets.

💭
Busy being amazing

# Chris Neve ChrisLeNeve

💭
Busy being amazing
Created Oct 9, 2020
Commenting the streams and lambdas increased the score from 44% to 55%, as time complexity decreased. Morale: don't use streams in Codility exercises
View Codility semi primes - take 2
 // you can also use imports, for example: import java.util.*; import java.util.stream.Collectors; // you can write to stdout for debugging purposes, e.g. // System.out.println("this is a debug message"); class Solution { //codility semi primes
Created Oct 9, 2020
Scores 44% - 100% correctness, 0% performance. Optimisations were done concerning boundaries and time complexity, not sure how to improve now
View Codility: semi primes
 // you can also use imports, for example: import java.util.*; import java.util.stream.Collectors; // you can write to stdout for debugging purposes, e.g. // System.out.println("this is a debug message"); class Solution { //codility semi primes
Created Oct 4, 2020
Fails 9 out of 16 test cases (explicitly returning the wrong answer every time fails 15 / 16)
View WIP - Hackerrank - abbreviation
 class Scratch { public static void main(String[] args) { // System.out.println(abbreviation("daBcd", "ABC")); // should be YES // System.out.println(abbreviation("AbCdE", "AFE")); // should be NO // System.out.println(abbreviation("beFgH", "EFG")); // should be NO // System.out.println(abbreviation("beFgH", "EFH")); // should be YES // System.out.println(abbreviation("Pi", "P")); // should be YES // System.out.println(abbreviation("UMKFW", "UMKFW")); // should be YES
Created Oct 3, 2020
Max Array Sum from HackerRank (passes all test cases)
View scratch_23.java
 class Scratch { public static void main(String[] args) { System.out.println(maxSubsetSum(new int[] {-2, 1, 3, -4, 5})); } static int maxSubsetSum (int[] arr){ if (arr.length == 0) { return 0;
Created Oct 2, 2020
Simple DFS
View scratch_22.java
 import java.util.*; /** * Implements a simple depth-first search for a graph. * Limitations: does not handle a disconnected graph; does not handle cases where a vertix has multiple edges towards * another given vertix; each vertix is defined by its index rather than by its value. */ class Scratch { public static void main(String[] args) { Scratch app = new Scratch();
Created Oct 1, 2020
View Level first traversal for a tree
 class Scratch { public static void main(String[] args) { Scratch app = new Scratch(); Node root = app.setup(); app.printBreadthFirst(root); } public void printBreadthFirst(Node node) { int height = getHeight(node);
Last active Sep 9, 2020
Test cheat sheet