Skip to main content

All Questions

13 questions with no upvoted or accepted answers
4 votes
0 answers
221 views

Algorithm to find connected tiles (percolation)

I wrote a little program in JavaFX which displays a path of neighbouring open tiles going from top to bottom. It should simulate a percolation. The algorithm iterates through the whole grid (every ...
Equiphract's user avatar
4 votes
0 answers
100 views

Minimum amount of edges that needs to be traversed to visit all vertices... or something like that

So I have this problem, where I'm given m connections over n vertices. The vertices are labeled ...
Olavi Mustanoja's user avatar
3 votes
0 answers
56 views

Number of ways to complete a plan

I worked on a dynamic programming problem. Here is its link. I have to find the number of ways respecting the constraint that user doesn't go to the Gym for two consecutive days. ...
SarahData's user avatar
  • 265
2 votes
0 answers
801 views

LeetCode 218: The Skyline Problem II

Here I'm posting my Java code for the skyline problem. If you have time and would like to review, please do so, I'd appreciate that. Problem A city's skyline is the outer contour of the silhouette ...
Emma's user avatar
  • 3,527
2 votes
0 answers
213 views

Longest Palindromic Substring challenge

My code is a mix-up between dynamic programming with the HashMap and brute force with the way I reach out the results and substring. I don't know how to optimize my ...
Manu Carba's user avatar
2 votes
0 answers
126 views

Tic Tac Toe game becomes more inefficient as time goes on

I designed a tic tac toe using 4 classes. The game class being the main class, the board class being the board, the player class being the decision making, and the AI class keeping the previous game ...
XTImpossible's user avatar
2 votes
0 answers
554 views

Find minimum distance in matrix

Challenge URL: http://acm.scu.edu.cn/soj/problem.action?id=3330 Windy has a matrix A with size N*M which only contains 0 or 1. The distance between Axy and Apq is: |x-p| + |y-q| Can you help Windy ...
ljy's user avatar
  • 21
2 votes
0 answers
213 views

Can this heap sort be further optimized to have fewer comparisons?

...
Joseph Nields's user avatar
1 vote
0 answers
74 views

A parallel MSD radix sort in Java for integer keys

I have this repository: https://github.com/coderodde/ParallelRadixSort.java/tree/main It contains a parallel MSD radix sort presented below: ...
coderodde's user avatar
  • 28.9k
1 vote
0 answers
129 views

Making Robert Tarjan's offline LCA algorithm run (much) faster (Java)

I have produced this GitHub repository that compares the performance of: Robert Tarjan's off-line lowest common ancestors algorithm, An improvement of the above algorithm. Typical demo program ...
coderodde's user avatar
  • 28.9k
1 vote
0 answers
256 views

Algorithm X implementation for Minimum Dominating Set

As as final project for a MOOC I wanted to write a program that finds the exact cover set/minimum dominating set from the given social network data. So I did end up with writing this. I kinda followed ...
alemst11's user avatar
1 vote
0 answers
602 views

Implementation of Resenblatt’s perceptron ,LMS algorithm Single Layer Network and Back-propagation algorithm (MLP) Network

I wrote a Java program implementing Resenblatt’s perceptron Single Layer Network, Least Mean Square algorithm for Single Layer Network and Back-propagation algorithm (MLP) Network. I'm trying to write ...
Eslam Ali's user avatar
  • 433
1 vote
0 answers
518 views

Give the variable length permutations (combinations) of a set of strings

This code is a proof-of-concept which I intend to convert into a static utility / helper class. I'm looking at this review from a structure or performance viewpoint. Small detail such as whether it ...
Stewart's user avatar
  • 111