I am trying to implement the Shunting Algorithm, but after I read in a character, I will need to determine if it is an operand or an operator. The input file has multiple lines of infix expressions ...

I have a decryption algorithm and it compiles successfully but I get an exception while running it.
I've tried changing the order of where the (byte) is and adding more in but I can't seem to figure ...

I came across this in a recent interview.
We are given a N*M grid consisting of numbers and a path in the grid is the nodes you traverse.We are given a constraint that we can only move either right or ...

There is a method called gravity(Vector[] vector) The vector contains sequence of numbers. The gravity function should return a new vector after applying gravity which is explained below.
Assume 0's ...

I am looking for an algorithm or product that will generate low poly trees. Doesn't matter the language. I have searched all over and there are plenty of "tree generation" algorithms but they cater to ...

I'm participating in programming contest, where I have a data, and where the first number is a user, second number is a movie, and the third is a number in then-points rating.
0 0 9
0 1 8
1 1 4
1 2 6
...

I'm trying to optimize a graph-traversal problem, but can't figure out the best way to tackle it. It seems neither like A* search problem (because we want to maximize the path rather than minimizing ...

Following is a question from hackerearth.
here's the link to the problem
problem!
I coded its solution in java and c but got time limit exceeded for some test cases on submission. No participant was ...

I have a graph with nonegative weights, in this graph there are any "special" arcs.
Find an algorithm that can find the minimum path between two vertices s e t, using at most k "special" arcs.
Input: ...

Having an array which represents a 5 picked card out of a full deck (52 cards).
So a random hand will look like this ['H3','H6','D3','D4','S4'], (here is h 2 pairs 4 and 3).
I'm looking for a way to ...

NOTE: quite possibly I need to cut this question up into smaller questions and post them on different stack exchange sites. Or maybe not, because the context might be important. Anyway, suggestions ...

I'm doing research to implement automatic segmentation based on MRI (Magnetic Resonance Image) modals. For my case, prostate region is my focus . To make this happen, I'm thinking about these steps: ...

Given a standard html file which contains css links, image links etc how can just the meaningful text be extracted ? By meaningful I mean the text which is is relevant to the page. So in the case of ...

I wanted to know if there is an algorithm being able to determine whether a line is either partly located in a polygon or totally inside of it (return value is equal for both scenarios). The problem I ...

I have a web application written in Java. It has a scatterplot page, using the JFreeChart library that the user can send results to. The results are pairs of Doubles and do not belong to any specific ...

I building a project in Django that needs to list all fields from a given model as options of a html select tag.
I wrote a recursive function that reads the model and returns a list with all fields ...

This is my assignment and i have completed the coding but not displaying the output correctly. The find function below and used in main also does not display and there is a memory leak when checked ...

I posted this on computer science section but no one replied :(. Any help would be greatly appreciated :).
There is a grid of size L x (MxN). L~50, M~4000 and N~10. So (MxN) is very huge. So one way ...

I have a question about dynamic 2D array returning. That means I don't know size of returning 2D array (It depends on some condition). Let see my problem
N=3;
A[N][5]={}//Given a 2D array
for i=1 to ...

I have an algorithm which takes an NSString, hashes it using PBKDF2 (salt is turned off for now, I understand the purpose of salt in preventing rainbow tables, but for current development that is OK). ...

I'm not sure if SO is the best place to post a question like this but I hope it doesn't get removed.
I am developing an application where I need to find if a "trip" is on the way of another "trip". I ...