I am writing a simple script that will combine two images at a pixel level, selecting every other pixel from one image, and the other pixels from a second image.
from PIL import Image
import struct
print("Photo 1: ", end="")
photo1 = Image.open(input()) # First image, 1920 by 1080
photo1 = pho...
I have a problem where I need to construct a given string from scratch for a minimum cost by either:
Appending a new character for a cost A
Appending a substring of my existing string for a cost B
E.g. for a string "abcabc" with a cost of A = 10, B = 11
a 10
ab 20
abc 30
abcabc 41
First I tr...
Problem Statement:-
Max has a garden full of roses. He planted roses in a certain pattern of rows and columns. Say there are N rows and M columns. Max has to move from start to finish in a minimum number of steps so that he is able to collect maximum roses along the way. While collecting the flo...
I've prepared a tenpin bowling scoring game in Java - https://github.com/chalcrow/DiusBowlingGame
I'd like a critical review of the code to identify potential improvements. The code runs like this:
Main.java
package com.dius.bowling;
public class Main {
private DiusBowlingGame game;
...
I have a Web API method that returns the Active Directory security groups for the specific login user. The below code was working fine but it was taking so munch time nearly 45 sec to get the results.
DirectoryEntry root = GetDirectoryEntry()
using (var groups = root.Children.Find("OU=Sample ...
I'm posting this after reviewing the Meta Q&A, Non-code formula spreadsheet, and I believe I've got something here that meets the criteria there.
Occasionally I find myself analyzing data that I need to turn into a spreadsheet with two levels of indices. For example, from the mock data:
Authors...
#include <iostream>
const bool DEBUG = false;
template <typename ... Args>
void debug(Args ... args);
template <typename ... Args>
void _debug(Args ... args) {
std::cout << "[" << __FILE__ << ":" << __LINE__ << "] ";
(std::cout << ... << args) << std::endl;
}
#define debug(args...) if...
I wrote a min-heap using a binary tee. How can I improve the time complexity of insert and delete function to log(n)? Thank you
'''
Min Heap Tree Implementation
'''
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
class HeapB...
This code is part of java application that I use for sending an XML command with a header to a server over TCP/IP. The server responds back with the XML data.
I want to send XML request using the following instruction :
I would like to ask about your opinion about my code.
import java.io.IOEx...
I am developing a high-performance(real-time) system, it requires message passing between its component. speed and accuracy is at most priority. I have explored a few options. ConcurrentQueue<T> is super fast BlockingCollection<T> provides a better API. also BlockingCollection<T> waits for the pr...
I'm using websockets in my React application. The application is supposed to consist of function components only.
Imagine the application consists of two "tabs": one irrelevant, and the other one, a chat using websockets. Given that, we want to whip up a websocket connection once the user enters...
What I want to achieve is the following:
#include "tree.h"
#include <iostream>
int main() {
Tree<std::string>* tA = new Tree<std::string>("A");
Tree<std::string>* tB = new Tree<std::string>("B", tA);
Tree<std::string>* tC = new Tree<std::string>("C", tA);
Tree<std::string>* tD = new Tree
I am parsing large XML (DB dump). So, the content looks like many different objects with their properties and dependencies (foreign keys). My way to do it - using lxml.etree (iterparse):
def insert_db(content):
for item in xml_parser(content):
if isinstance(item, DPoint):...
using System;
using System.Data;
using System.Data.SqlClient;
using System.Windows.Forms;
namespace FinalDatabaseConnection {
public partial class Form1 : Form {
public Form1() {
InitializeComponent();
}
//if statment dealing with sql queries once butto...
I've written a class that implements something akin to the token bucket algorithm so that I may rate limit aysnc HTTP requests made from my application.
The code works but I'm still not sure if it feels 'right', maybe just because I am new to async programming in Python.
Specific concerns:
It...
So I have a loop that works great, but doing some testing I notice it is a bit slow. I get an average time within the loop of about 0.11 seconds. Include that with some arrays containing a length of over 100 and the time starts making a big difference. So I mainly want to improve the speed of the...
I just refactored my Javascript calculator and added some extra features and trying to solve using different solutions. How could I refactor my code further? Any comments are welcome. Thanks in advance.
"use strict";
var lastOperand, lastInputIsOperator, lastOperator, tempResult;
// 12. las...
I was solving the HackerEarth problem. Problem statement is stated below.
You are given a nxm matrix. You need to print the sum of all the numbers in the rectangle which has (1,1) as the top left corner and (x,y) as the bottom right corner.
Here's my solution
import java.util.*;
public cla...
Problem
Write a function that accepts a string, capitalizes the first letter of each word in the string, and returns the capitalized string.
Examples
function('a short sentence') => 'A Short Sentence'
function('a lazy fox') => 'A Lazy Fox'
function('look, it is working!') => 'Look, It Is Worki...
Given this example
private function compareTwo($first, $second)
{
$result = $first->param === $second->param;
$result = $result && $first->param2 === $second->param2;
$result = $result && $first->param3 === $second->param3;
$result = $result && $this->runDiff...
Have you ever wanted to get just not one "best" element from a list, but all of them, or a random element of the best ones? That's what the Best class is here for. Opinion-based? Definitely not!
Features:
Should work with any kind of element.
Should always keep track of the best elements seen ...
I used to view freedom as a license to do pretty much anything that wasn't illegal or unethical. If someone else was bothered by it, it was their freedom to be bothered or not bothered by whatever they chose. They could choose to react differently to it; there was no requirement for them to rea...
Does Stack Exchange, Inc. really care about us? Because it doesn't feel like that.
Meta is burning with hatred and heinous speech and SE Inc. is nowhere to be seen.
Sure, they made a post that apologizes for that (among other things) ten days ago. Sure, they are handling flags and removing bad...
Thank you for writing to us about this. This isn’t our final response here, but in the interest of being transparent and keeping lines of communication open, we wanted to respond with something as soon as possible. While this isn’t the answer you’ve been looking for, we wanted to update you on so...
The code I am writing is for the Jacobi method of approximating eigenvalues. I keep getting eigenvalues of 0 for any size matrix even though by hand I am not getting eigenvalues of 0. I think that my code might be resetting my matrix A to all zeroes somewhere.
import numpy
from numpy import *
fr...
I have a list, to make it easier to understand it's structure I'll write it out like so:
mylist = [[["a","b","c","d"]...]...]
Where the ... means the previous list is repeated (although the values inside may change)
An example list would be:
mylist = [[["a","b","c","d"], ["e","f","g","h"]], ...
