justinbutler700 Goto Github PK

palindrome-number-leetcode-easy

An integer is a palindrome when it reads the same backward as forward. This checks to see if the integer is a palindrone.

partition-list-leetcode-medium

Partitions a list based on which elements are less than a target element. Java Solution.

pascals-triangle-leetcode-easy

recursive java solution to pascal's triangle. O(n^2)

permutations-ii-leetcode-medium

Java Backtracking solution to Permutations II

plus-one-leetcode-easy

0ms, Beats 100% solution to Plus One Leetcode Problem.

pow-x-n-leetcode-medium

prison-cells-after-n-days-leetcode-medium

A simple intuitive solution to Prison Cells After N days. Beats 98% of submissions. O(n^2).

readyqueue

A ReadyQueue of PCB class objects which implement a GnomeSort as their sortation function. The ReadyQueue is timed to 1 million iterations.

realesrgan-video-script

Modified realesrgan-ncnn-vulkan upscaler to be faster for video rendering on macos

registore-business-logic-dev

Development Branch for Registore (Point of Sales System) Backend.

registore-electron-dev

remove-duplicates-from-sorted-list-leetcode-easy

Removes duplicate elements from a linked list. beats 100% of Java submissions. O(n) time complexity.

resume

My Resume (Latex)

reverse-words-in-a-string-leetcode-medium

Reverses the order of words in a string and removes excess blank spaces.

roman-to-integer-leetcode-easy

Function to convert Roman numerals to integers.

rotate-image-leetcode-medium

C++ in place solution to Rotate Image.

schedulingalgorithms

C++ Assignment to test Round Robin, FCFS, SJF, Priority, and Priority Round Robin Scheduling Algorithms.

search-insert-position-leetcode-easy

O(Log(N) Binary search solution in Python, Java, and C++ for searching for an index on an array

set-matrix-zeroes-leetcode-medium

shuffle-an-array-leetcode-medium

Given an integer array nums, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling. Implement the Solution class: Solution(int[] nums) Initializes the object with the integer array nums. int[] reset() Resets the array to its original configuration and returns it. int[] shuffle() Returns a random shuffling of the array.

shuffle-the-array-leetcode-easy

O(n) 1ms solution to Shuffle the Array Java. Beats 100% of Submissions.

sort-characters-by-frequency-leetcode-medium

Brute force solution to map chars by frequency in descending order using hash map.

sort-colors-leetcode-medium

Linear time complexity Java solution to sort an array of colors (represented by an integer). beats 100% of submissions.

strictly-palindromic-number-leetcode-medium

Java O(n) solution to check if number is Strictly Palindromic. beats 100%.

swap-nodes-in-pairs-leetcode-medium

Java, Python, and Typescript solution to Swap nodes in Pairs. O(n). most beat 99%.

two-sum-leetcode-easy

Returns the two indexes on the array that add up to the target element. Fastest solution in Java.

unique-paths-leetcode-medium

Calculates total # of unique paths to go to the end edge of a 2d array using dynamic programming. Beats 100% of Java Submissions.

unix-shell

C based Unix Shell Program with pipelining and additional features

utf-8-validation-leetcode-medium

1ms beats 100% Java solution to UTF-8 Validation

valid-anagram-leetcode-easy

O(n) solution to Valid Anagram in Java. Beats 95% of Java Submissions.