Long one here, but election transparency is worth a rough code review.
The Iowa Caucuses have numerous errors in delegate awards because they did their computations manually (their closed-source app failed).
In response I released a Swift "Caucus Report" iOS app for the upcoming Nevada caucuses...
I am sure there will be a way to make this code simpler, can someone take a look?
Basically what it does is:
get now and a week ago from now
then format it to utc (i.e. 2020-02-04T23:18:00Z)
to enter in boto3 command as parameters
import datetime
end_time = datetime.datetime.now()
start_tim...
This is my second week in python. For
help(time)
there is no problem it works but for
help(import)
orhelp(as) I have this error:
File "<ipython-input-5-664ce45ddf5e>", line 1
help (import)
^
SyntaxError: invalid syntax
Can you tell me how import is different from time?
I'm having trouble with proper naming. That issue appears when i try to apply to first class collection to my class and use sonar as well:
public class Units {
private final List<Unit> units = new ArrayList<>();
[...]
}
Here's the problem, sonar says:
A field should not duplicat...
Was trying to implement and example code to smart pointer from link.
Is it a good practice? To go with all unique pointers or should we use shared pointers in this case? How can i improve this ?
#include <iostream>
#include <string>
#include<memory>
void LOG(std::string strText)
{
std::cout <<
The program needs to count the number of distinct permutations of N which appear as a substring of H at least once. N can have anywhere between 1 and |N |! distinct permutations in total – for example, the string “aab” has 3 distinct permutations (“aab”, “aba”, and “baa”). The runtime is too high...
I have a class with 3 similar methods. I can't consider which a pattern to use better for refactoring: template method, strategy or something else? I don't know. Can you help me?
public class Graph{
// doesn't matter methods and constructor of the class
public bool BreadthFirstSearc...
Wanted to know if there is a way to check if a number is near to the one at the peak of the given numbers...
Code:
#include <iostream>
#include <cmath>
using namespace std;
int main() {
string name[100];
int score[100], i = 0, j = 0, highest = 0, avg = 0, count = 0;
for (i = 1; i <...
I'm wondering if there is a better way to write the same exact thing? I wrote it to display three different dynamic messages, but I feel like there can be a lot of improvements...
Any help/idea would be appreciated.
.list-wrapper {
width: 100%;
}
.list {
...
I have an input like this:
x = '415,252,428,233,428,214,394,207,383,205,390,195'
And I want to end up with this
y = [(415,252),(428,233),(428,214),(394,207),(383,205),(390,195)]
The closes I got is
tmp = [int(i) for i in x.split(',')]
y = zip(tmp[::2], tmp[1::2])
How do I get rid of the ...
I am struggling with require issue in node js
I have 2 files modules.
File 1 (report.obj.js):
const moment = require('moment');
module.exports = function () {
this.functionOne = function () {
// some task
}
this.functionTwo = function () {
// some task 2
}
};
...
I was applying for a Senior Python developer position at a startup. I have around 3 years of experience.
This was the question given to me.
Implement a function to query json_schema
The goal of this excercise is to implement a function that allows you to query the type of a keypath in a jsonsch...
I have the following code and it does not look nice to me as too many if statements strolling around. How can I make this shorther and nice looking (more readable).
public TreeNode pruneTree(TreeNode root) {
if (root == null || (root.left == null && root.right == null && root.val == 0)) retu...
Hi i needed to find the max int of a list using recursion, I have done it this way I'd like to know if you think is a good way, and I have a couple of questions:
int trovaMassimo(node_t *head){
int e;
if(head == NULL){//this can happen just the first time right?
printf("Lista vu...
I have implemented a function mcollect which is effectively mconcat only for applicative monoids:
mcollect
:: Applicative f
=> Monoid (f a)
=> [a]
-> f a
mcollect = mconcat . fmap pure
However I am not overly keen on the name mcollect, an alternative name in the spirit of mconcat is am...
I am solving the following problem:
https://codeforces.com/problemset/problem/331/C3#
My code for the above problem is as follows:
n=int(input())
count=0
while n:
l=list(int(i) for i in str(n))
n=n-max(l)
count+=1
if n == 0:
break
print (count)
The code gives correct...
I've been asked to do a code review on an MVC project that is still in the early stages of development. I am seeing something that I'm not sure about. I'm wondering about the thread-safe nature of CurrentUserProfile in the Base Controller and then _userId in the controllers.
public class BaseCo...
Meme: Monking
Originator: Morwenn
Cultural Height: The 2nd Monitor
Background: A morning greeting to the Monkey doing his monkey-business, in other words: monking
Examples: A small chat search
Variations: Monkernoon, Monkevening, Monknight, and the reversed gniknoM sometimes used when one le...
I'm a graduate developer, and have been assigned a small task to write a Elevator program that takes a starting floor, a direction and a sequence of destination floors and then works out the sequence in which the floors should be visited. While there is the option to use Collections.sort() on an ...
In connection with the moderator elections, we are holding a Q&A thread for the candidates. Questions collected from an earlier thread have been compiled into this one, which shall now serve as the space for the candidates to provide their answers.
Not every question was compiled - as noted, we...
For a course I following and my code is approved I had to make some code that finds the person with the biggest loss where the input is a string[]
The string arrray looks like this :
{ "Tom, 1, 3, -1", "Gillie, 2, 3, 1", "Thor, 1000, 1001, 1002" };
I solved it this way but it's not a clean ...
I know you can calculate if an element is overlapping another by comparing the top|bottom|right|left properties within the getBoundingClientRect method. However, you need to loop through the elements to do so. I'm curious to know what is the performant way of checking to see if an element is over...
I was struggling with this question for many times.
and I have solved it every time, because I understand the concept.
but I can never get to a good concise solution which is easy to follow.
in a coding interview I always choke when I see this question.
this is the best solution I was able to f...
I am new to python and I have a little problem. I Have some data-sets like below written in a txt file. I would like to extract the first sequence of numbers from a txt file in 2 separated vectors: Xcen and Ycen, and then take the second sequence and overwrite the 2 vectors and so on. I've tried ...
