I need to learn bash at some point in the near future, so I decided to start playing around with it. This is really the first actual script that I've written and would like feedback.
This finds and prints all the prime numbers up to the argument provided to the script:
./primes.sh 100
2
3
5
7
1...
I created a table within a postgres database ( https://www.postgresql.org/ ) by executing the following SQL
CREATE TABLE users (
id BIGSERIAL PRIMARY KEY,
username VARCHAR (100) UNIQUE NOT NULL,
passhash VARCHAR (256) NOT NULL,
pub_gpg VARCHAR (2048) UNIQUE,
pub_rsa VARCHAR (2048)...
given a 2 d square matrix find minimum number of swaps required to maximise the sum of the first row.
My logic - store the sorted first row. Create variable num-swaps = 0.
Traverse starting from 2nd row
check if the current number > than
max of first row, then the 2nd max, i.e. find the place ...
I've implemented atoi function as described in leetcode problem string-to-integer-atoi.
I am looking for some feedback on writing this in a more scala native way and being able to include the requirement that:
If the numerical value is out of the range of representable values,
INT_MAX (231...
I've wrote a C++ program to calculate the determinant of a matrix:
#include <iostream>
#include <string>
double getDeterminant(double arr[], int dimension);
int main() {
//First, the user has to enter the dimension of the matrix
int dimension;
std::cout << "Please enter dimensi...
I use the code below, to identify what is new and has changed in UsDtos in comparison to ThemDtos. I am pretty sure it works. Any feedback to improve (fix?) this appreciated? Thanks.
public class UsDto
{
public int Id { get; set; }
public DateTime LastUpdate { get; set; }
}
public class...
This my dijkstra's algorithm code... it solves any order square mazes...
from copy import deepcopy
from math import inf
import maze_builderV2 as mb
def dijkstra(maze, order, pos, finalpos):
mazemap = {}
def scan(): # Converts raw map/maze into a suitable datastructure.
for x in range(1, o...
There is this question which has one close vote and three down-votes. The only comments are
The code is broken because it doesn't deallocate memory (and because it uses a global variable although that observation is incorrect).
The code won't work in a concurrent context.
Looking at the...
I'm trying to refactor this two functions, also thinking in creating functional tests, but my approaches, have not worked.
I would really appreciate new ways of reuse my code.
Thank you
createMenuItems(providers, selected) {
for (let i = 0; i < providers.length; i++) {
const item = documen...
In this question (What is the best practice between second assignment or dict's value call?), I first ask for the best solution between second assignment or dict's value call.
But, after few days I realize that the real issue in my problem wasn't really what I asked in the title but instead "Ho...
@Pimgd were definitely on to something big in the last part of the answer, but not on to it enough. Simply changing Solution<T> to GroupValues<T> did not help much.
However, what certainly did help, is to use a List<Entry<FieldGroup<T>, Integer>> (as ugly as that type declaration looks). And to ...
I am writing a function to have insert a list of strings into a MySQL database and C#.
The process of creating the list of Components:
User has to scan multiple barcodes and have them stored in a list.
The goal is to take that list and insert it into a MySQL database on the click of a submit bu...
I'm working on a C# project (.NET framework) that will result in a DLL / assembly that may be called from multiple applications. The logging framework used by these applications is unknown.
My preference is to use Serilog's static Log method for my own code and not setup any configuration.
u...
I'm creating mazes, and want to pick a cell that is a neighbour of the current one. If one of these neighbours is a dead end, I want to pick the first of those, if not, I want the first non-linked cell in the list.
My current code looks like this...
Cell neighbour = current.Neighbours.Any(n =>...
I'm working on implementing a goal-based pathfinding.
first step is to set a goal and calculate the shortest walkable distance between the goal and all points in the grid, using a brushfire algorithm.
I'm worried about two things here, readability and efficiency, since this is for an RTS game.
...
Before I begin showing code, I have two main questions which I feel could help me.
What is a service or factory, I've heard of them but why use them?
When should I use one logger per class? I only plan on persisting errors and don't care about the reporter, would a shared instance for the whole...
Currently trying to migrate two fields of information into one field. We have many, many objects to go through and it takes roughly 12 minutes to loop through all the objects. That would mean the website would be down for 12 minutes and we do not want that. Is there any way to speed up this migra...
Do you guys have any ideas how to clean up this code? Imo that
new LinkedHasMap<>() look awful.
Document document = response.parse();
List<Elements> elements = Arrays.asList(document.selectFirst("#oddzialy").children(),
document.selectFirst("#nauczyciele").children(),
...
Is this a good way of removing all the nodes that contains a value x?
This functions takes in input the head of a list and has to delete all the nodes that contains a value taken in input and saved in x variable.
If there is any better way to do this can you please show them to me?
node_t *funz...
So I ported a lexer I wrote in C++ over to rust, as I'm starting to learn rust. Since I'm very new though, I don't know any Idioms and good practices in rust. So if anyone could point out some (probably obvious) issues I'd be very thankful.
This is my code:
use std::cmp::PartialEq;
use std::fmt...
