Pinned Repositories
2D-Array-Spiral-Ordering
Traverse a 2D array in a spiral pattern using O(1) space and O(n) time where n is the number of nodes in the 2D array.
3-Sum-Problem
Given an array of numbers and a target integer determine if there exists three numbers in the that sum to the target. The three numbers do not have to be unique, in other words the same array element could be used three times.
Anagram-Partitioning
Use hashmaps to detect anagrams given a list of words.
Angular-Project-Template
Angular Project Template
auto_analyzer
A playground for automobile data.
Balanced-Binary-Tree-Test
Implemented a binary tree and code that detects whether a binary tree is balanced or not.
Base-Converter
Convert a number from one base to another where the bases are between 2 and 16 inclusive.
Binary-Search-First-Occurrence
A variant of binary search where the first occurrence of an element with a given value is found in a sorted array. Time complexity is still O(log n).
Binary-Tree-Least-Common-Ancestor
O(h) time and space approach where h is the height of the tree.
Binary_Tree_Nodes_Increasing_Depth
Traverse a balanced binary tree return a list of nodes lists organized by depth.
gscalvary's Repositories
gscalvary/2D-Array-Spiral-Ordering
Traverse a 2D array in a spiral pattern using O(1) space and O(n) time where n is the number of nodes in the 2D array.
gscalvary/3-Sum-Problem
Given an array of numbers and a target integer determine if there exists three numbers in the that sum to the target. The three numbers do not have to be unique, in other words the same array element could be used three times.
gscalvary/Angular-Project-Template
Angular Project Template
gscalvary/auto_analyzer
A playground for automobile data.
gscalvary/Base-Converter
Convert a number from one base to another where the bases are between 2 and 16 inclusive.
gscalvary/Binary-Tree-Least-Common-Ancestor
O(h) time and space approach where h is the height of the tree.
gscalvary/Binary_Tree_Nodes_Increasing_Depth
Traverse a balanced binary tree return a list of nodes lists organized by depth.
gscalvary/BST-Authenticator
O(n) time and O(n) space implementation of a program that checks whether or not a tree is a Binary Search Tree.
gscalvary/coliver650-gea
Automatically exported from code.google.com/p/coliver650-gea
gscalvary/Compute-Phone-Number-Mnemonics
A recursive approach to building mnemonics from a phone number such as ACRONYM from 2276696.
gscalvary/Cyclicity-Single-Linked-List
Check for cycles in a single linked list using O(n) space in O(n) time.
gscalvary/I_Watch_Face
gscalvary/Intersection-Sorted-Arrays
Picks the shortest array and iterates through it performing a binary search on the larger array to determine an intersect.
gscalvary/linear-algebra
A linear algebra library written in Java with test classes written in Groovy using the Spock framework.
gscalvary/machine_learning
Learning scala while implementing some machine learning algorithms.
gscalvary/Maze-Search
O(V + E) DFS through a maze from start to finish with a path traced and returned.
gscalvary/myBasicHTTPServer
Basic, configurable, HTTP web server written as part of a job interview test.
gscalvary/Node.js-HTTP-Server
node.js learnings
gscalvary/PebbleFace
Playing with Pebble Watch faces!
gscalvary/Portfolio-Site
Building a portfolio site!
gscalvary/portfolio_site_react
Rewrite my portfolio site using React and Next.js.
gscalvary/Reverse-Single-Linked-List
Implemented a generic linked list. Implemented a class that reverses a linked list using O(1) additional space in O(n) time.
gscalvary/SailboatAdScraper
Microservice that scrapes a sailboat listing site and delivers the listings as JSON.
gscalvary/SailboatPriceAnalyzer
gscalvary/Sample-Offline-Data
Choose k random objects from a given array using O(1) space. Includes an optimization where Random is not called more than half the size of the array times.
gscalvary/scala_template
Scala project template running ScalaTest for unit tests.
gscalvary/Spoon-Knife
This repo is for demonstration purposes only.
gscalvary/String-Replace-And-Remove
An exercise in efficiently removing or replacing characters in a C/C++ style string (array of chars) done using O(1) space in O(n) time.
gscalvary/Synchronized-Interleaved-Threads
Simple wait - notify construct of two threads that access a single resource to print the numbers from 0 to 100 in sequence. One thread prints odd numbers while the other thread prints even numbers.
gscalvary/Tower-Of-Hanoi
Iterative solution to the Tower of Hanoi problem.