A collection of LeetCode novel solutions that is implemented in Java. An overview about data structure for interview questions
-
Updated
Apr 27, 2019 - Java
A collection of LeetCode novel solutions that is implemented in Java. An overview about data structure for interview questions
Magic Square Finder in Java using combination trees and object-orientated design principles. The algorithm will search and find all N*N magic squares.
Implementation of searching and sorting algorithms, written by me in Java with TDD.
EVBox Charging Station Sessions APIs
A Java project that does performance analyses for user-selected computations & lengths.
Core data structures and algorithms implemented in Java from scratch. Very useful to crack the coding interviews at top tech companies.
Projects and tests for COSC2430 Data Structures taken at the University Of Houston
Learning common Data Structures & Algorithms used in the Java programming language.
An implementation of various sorting algorithms as well as a Binary Search Tree.
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.)
This repository contains some Data Structures implemented from scratch using Java.
Compare 3 simple search algorithms and their running time growths in Big-O notations
A REST bases transaction statistics application created as part of N26 take-home assessment task. This is a shortlisted solution.
Repository of code references, notes and observations on data structure and algorithm studies.
Add a description, image, and links to the big-o-performance topic page so that developers can more easily learn about it.
To associate your repository with the big-o-performance topic, visit your repo's landing page and select "manage topics."