Jetbrains plugin for Codiga. Coding Assistant and Code Analysis in all JetBrains products. Codiga supports more than 10+ languages, try it for free on https://www.codiga.io

Code Complexity measuring tool, which measure the Complexity due to Size, Type and the Nesting Level of Control Structures, Inheritance, Recursion.

Tool for algorithmic complexity analysis based on symbolic execution

Code complexity measuring tool, which measure the complexity due to size, type and the nesting level of control structures, inheritance, recursion.

Representations and operations on basic data structures. Arrays, linked lists, stacks, queues, and recursion; binary search trees and balanced trees; hash tables, dynamic storage management; introduction to graphs using JAVA as the object oriented programming language.

A simple Java program that implements an algorithm to calculate the maximum profit from buying and selling stocks given daily price fluctuations. It includes various test cases to validate the algorithm's performance in different market scenarios.

This Java program efficiently solves the "Three Sum Problem," identifying all unique triplets in an array that sum up to zero, with a focus on avoiding duplicate triplets.

Cracking The coding interview 6th solutions in java

This Java project focuses on implementing a dynamic programming solution to find the shortest combination of numbers that sum up to a given target sum, using recursion and memoization for efficiency.

Empirical complexity guesser written in Java and Python

NTU SC2001 Example Class Project

This Java program efficiently removes duplicate elements from a sorted array in-place, ensuring the original order of elements is maintained. It's designed to optimize space and time complexity while handling various array scenarios, including empty arrays and arrays with consecutive or non-consecutive duplicates.

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

Algoritmos de Ordenamiento

This module consists of various most commonly used sorting algorithms that are very much useful in realtime developments and their time complexity analysis.

A Java desktop application for analyzing code performance metrics, including execution time, memory usage, space/time complexity, and visual graphs. Built with JavaFX, ideal for developers to optimize code performance.

Coded and performed complexity analysis (Big O) on multiple Java methods (contains, interleave, and several others). Individual assignment.

This repository contains implementations of core algorithms and data structures in Java. It includes topics such as sorting, searching, recursion, dynamic programming, graph algorithms, greedy methods, hashing, trees, heaps, and more. The aim is to practice algorithm design, analyze complexities, and strengthen problem-solving skills for intervie

Learned Data Structures and Algorithms: Basic Programming Constructs, Data types, Search trees, Hashing, Complexity Analysis, Algorithm design, Graph algorithms, Sort algorithms