As of the 9th of March, the banner shown to askers whose questions have attracted at least one duplicate close vote has a couple of new options:
If the author clicks the first button, they're shown a confirmation that clarifies the results of this action somewhat:
If they click "Ok", the qu...
I am working on a question in which I need to find a largest palindrome given a string. Below is my code:
public class LargestPalindrome {
public static void main(String[] args) {
System.out.println("Longest Palindrome 1: " +findLongestPalindrome("xyzracecar"));
System.out.println("L...
This meta is prompted by a specific Q & A, but I'm curious how the community feels about un-deleting useful answers that OP themselves deleted for whatever reason. I think it will be easiest to explain the exact situation that prompts me to write this and then ask for general guidance on this and...
This meta is prompted by a specific Q & A, but I'm curious how the community feels about un-deleting useful answers that OP themselves deleted for whatever reason. I think it will be easiest to explain the exact situation that prompts me to write this and then ask for general guidance on this and...
I have successfully implemented a divide and conquer approach for find the maximum sum subarray (see code below). The code works fine and is correct, however I have an efficiency problem in that in order to recursively calculate sub-vectors, I need to do a copying operation which ordinarily would...
Discussion between RubberDuck and Bar…
I have this code do calculate the velocity and accelerator of one element. If, I calculate with 1 value of w is very fast.
%**setting the equation to calculate**
syms m w k e mi c w t L z ;
a = (((m * w ^ 2 - k) ^ 2 + (c * w) ^ 2) / (e * mi) ^ 2) ^ (1 / 8);
B = 1 / 4 * atan(-c * w / (m * w ...
I am working on a survivor problem as shown below: Here is the source
Complete Question Text: Take a second to imagine that you are in a
room with 100 chairs arranged in a circle. These chairs are numbered
sequentially from One to One Hundred.
At some point in time, the person in cha...
I was wondering and I don't think there's any specific guideline concerning this.
The specific instance I have in mind is concerning a meta answer here: Should we un-delete useful answers that were deleted by OP?
It's not something I've ever done before, so I was wondering-- I also don't partic...
I am writing a QA wap page and want to switch questions in one page.
This is my first time to write js and css code, so I think there must be some improvement :) here is my code:
<!DOCTYPE html>
<html>
<head lang="en">
<meta charset="UTF-8">
<title></title>
<meta name="viewport" cont...
I am very new to c++, im trying out a sample program. Could you please help me.
// Example program
#include
#include
using namespace std
class Employee {
public:
char *name;
long int EmpID;
void setPerson (char *n, long int id);
void print ();
};
class Manager : ...
I am writing a piece of code, where each subsequent method uses data returned by previous one as an argument. The code looks like below:
class Fun(object):
def __init__(self, n):
self.n = n
def foo(self, a):
return range(a)
def sq_foo(self, l):
return [i*i f...
I am writting a program to remove the duplicate values from an array, is any way to optimize code by removing one loop?
var arr=[10,20,30,20,40,10],
newarr=[];
var foo=function(ele, index, array){
match=array[index];
for(var m in newarr){
if(newarr[m]==match)
return true;
}
ne...
I have the following query:
return Postcodes
.Where(
s => s.Postcode.IndexOf(term, StringComparison.InvariantCultureIgnoreCase) > -1 &&
string.IsNullOrEmpty(country) ? true : s.CountryRegionID.Equals(country, StringComparison.InvariantCultureIgnoreCase...
class BinaryTreeNode {
private BinaryTreeNode left;
private BinaryTreeNode right;
private int data;
BinaryTreeNode(int d) {
data = d;
}
public void insertLeft(BinaryTreeNode n) {
this.left = n;
}
public void insertRight(BinaryTreeNode n) {
this.right = n;
}
pu...
I am very happy because I solved this problem with very little code:
"""
100 people are standing in a circle with gun in their hands.
1 kills 2, 3 kills 4, 5 kills 6 and so on till we are
left with only one person. Who will be the last person alive?
Write code to implement this ...
I'm trying to improve my codes performance, and I've found an area where the execution time is being significantly increased. I've had a look through the code but I can't see how I can improve it.
Here is the code:
AddData gets called over 200,000 times.
public void AddData(String label, int f...
You shouldn't be writing your answers specifically tailored to the specific scenario asked about in the question or specifically tailored to the specific user asking the question. Your answer should certainly solve their specific problem, but your answer shouldn't be quite so specific.
Instead,...
I've just started to learn Scala and decided to implement small graph library to train.
Here is the basic version, that describes graph and nodes structure and also provides implementation of DFS to find some path from one node to other.
class Graph[A] {
var nodes = Set.empty[Node[A]]
def ...
One should never push code right before going on vacation.
The bug has been fixed, a test has been written, and any incorrectly-awarded badges have been revoked. Your topbar's achievement list has also been cleaned.
My apologies.
I had five questions which were poorly received (3 downvoted by single votes and all 5 with no answers) by the Stack Overflow community, and therefore I had deleted those.
Yesterday when I was not able to post my second question in a day.
I thought it's because of my history of poorly received...
Problem: http://www.spoj.com/problems/TSHPATH/
I'm getting TLE(Time limit exceeded) (30 times, sadly). I have used Dijkstra's algorithm, java.util.PriorityQueue.
Code (Java): http://ideone.com/WYrVHT
How do I optimize it?
Ok,
I do a fair amount of scraping but I am by no way a good php programmer. I always struggle to get the innerhtml of elements using php, domdocument and xpath.
I have cobbled together a couple of functions that appear to do what I need but my question is are there any major holes in my logic ...
Adding a directory to the PATH in Unix/Linux is a very common task. However, what if the directory is already in the path? My goal is to write a shell function (preferably portable) that will add a directory to the front or back of the PATH variable, but only if it's not already there.
Here's ...
I am figuring out how I could make the following query more secure:
I have already used mysqli_real_escape_string but i doubt that adds much to security.
I have looked into the following:
http://mattbango.com/notebook/code/prepared-statements-in-php-and-mysqli/
but I also have to take into acco...
