Skip to content

Instantly share code, notes, and snippets.

View ChrisLeNeve's full-sized avatar
💭
Busy being amazing

Chris Neve ChrisLeNeve

💭
Busy being amazing
View GitHub Profile
@ChrisLeNeve
ChrisLeNeve / Codility semi primes - take 2
Created October 9, 2020 22:17
Commenting the streams and lambdas increased the score from 44% to 55%, as time complexity decreased. Morale: don't use streams in Codility exercises
// 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
@ChrisLeNeve
ChrisLeNeve / Codility: semi primes
Created October 9, 2020 21:36
Scores 44% - 100% correctness, 0% performance. Optimisations were done concerning boundaries and time complexity, not sure how to improve now
// 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
@ChrisLeNeve
ChrisLeNeve / WIP - Hackerrank - abbreviation
Created October 4, 2020 15:23
Fails 9 out of 16 test cases (explicitly returning the wrong answer every time fails 15 / 16)
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
@ChrisLeNeve
ChrisLeNeve / scratch_23.java
Created October 3, 2020 13:55
Max Array Sum from HackerRank (passes all test cases)
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;
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();
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);
//@RunWith(SpringJUnit4ClassRunner.class) // for JUnit 4
//@ExtendWith(MockitoExtension.class) // for running with a Mockito runner. No Spring features
@ExtendWith(SpringExtension.class) // for running with a Spring runner. Loads Spring features (bean loading, etc)
@DisplayName("My test class name (JUnit 5)")
//@SpringBootTest // will load application context
public class MyTest {
// Strategy for loading one specific bean
// If not in a static inner class: needs to be imported on class with @Import
@ChrisLeNeve
ChrisLeNeve / Sudoku
Created March 25, 2020 18:24
Very basic sudoku solver (will not succeed beyond basic sudokus)
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
class Solution {
static final int BOARD_LENGTH = 9;
public static void main(String[] args) {
@ChrisLeNeve
ChrisLeNeve / pre-commit
Last active March 17, 2020 10:35
git pre commit hook - blocking added accents and bad characters
#!/bin/bash
echo "Checking your changes..."
#Whatever characters you want here, in the grep
if git diff --cached origin/stage *.html | grep -c 'é\|è\|ô'
then
echo "Impending doom shall be thy fate, o vilainous junior dev! Banish from thy work these monstrosities, or live to see thy kin demolished"
exit 1
@ChrisLeNeve
ChrisLeNeve / scratch_13.java
Created November 13, 2019 13:15
Project Euler, problem 11 finalised
class Scratch {
static long CURRENT_MAX = Long.MIN_VALUE;
public static void main(String[] args) {
int[][] grid = setupGrid();
computeMaxProduct(grid);
System.out.println(CURRENT_MAX);
}
private static void computeMaxProduct(int[][] grid) {