Learning common Data Structures & Algorithms used in the Java programming language.

A Java project that does performance analyses for user-selected computations & lengths.

Scala project hosting exercies on Data Structures and Algorithms of the Android app Data Structures & Algorithms

The objective is to build a library to be able to estimate time complexity for machine learning algorithms

A collection of LeetCode novel solutions that is implemented in Java. An overview about data structure for interview questions

Core data structures and algorithms implemented in Java from scratch. Very useful to crack the coding interviews at top tech companies.

Compare 3 simple search algorithms and their running time growths in Big-O notations

Algorithm that tests for prime numbers, with O(√n) time complexity.

C# Solutions for Algorithm Style Programming Questions found on LeetCode

Given an N × N grid of integers and an integer M ≤ N , determine the maximum product that can be made from M integers that are next to each other in the grid (horizontally, vertically, or diagonally.)

Different lectures on approaching the problems asked in Job Interviews that are available on LeetCode.

EVBox Charging Station Sessions APIs

Implementation of searching and sorting algorithms, written by me in Java with TDD.

I had the goal of creating a queue whose performance for both enqueuing and dequeueing would be O(1). To achieve this, instead of using a list, I wrote a dictionary queue structure, DictQueue.

Projects and tests for COSC2430 Data Structures taken at the University Of Houston

A REST bases transaction statistics application created as part of N26 take-home assessment task. This is a shortlisted solution.

A Project in JavaScript to understand different data structures like linked lists, hash tables, Queues, sorting, searching, graphs, etc, and how they are being structured. It is a great learning project and available for some contributors also.

CPS162 Fall 2021 Group1: Gabriela Fernandez Leon, Tan Dinh, Alan Baxley

Deconstruction of a computational problem... 3 algorithms to find the best possible combination of shares for investors (based on list of shares) while making use of dynamic programming.

Magic Square Finder in Java using combination trees and object-orientated design principles. The algorithm will search and find all N*N magic squares.