« first day (3067 days earlier)      last day (32 days later) » 

12:02 AM
REFRESH! There are 7839 unanswered questions (89.2989 answered)
 
 
2 hours later…
1:45 AM
The thing is any browser-specific css is not allowed due to the rules of our code review. Edge is just an example here it might be suited for this one, but other browsers may not. — wtf512 28 secs ago
 
 
2 hours later…
3:23 AM
0
Q: Python: lru_cache make leetcode's dungeon game more slower

pvdI'm trying to implement a recursive+momoize version for leetcode's dungeon game question. I tried to use @lru_cache(): ________________________________________________________ Executed in 14.22 secs fish external usr time 14.13 secs 101.00 micros 14.13 secs sys time 0...

 
 
1 hour later…
4:45 AM
Questions asking for review of working code are better suited for codereview.stackexchange.com. That said, why not parse your strings as dates and then simply compare the dates instead? — shree.pat18 11 secs ago
@shree.pat18 Thank You for the suggestion I was unaware of the code review section. I will post their as well. In this specific case, the professor explicitly said not to use any modules that analyze dates. — Jack 33 secs ago
 
 
2 hours later…
6:25 AM
Monking
 
 
1 hour later…
7:55 AM
0
Q: Event handling with async await in Python

Sourav Kannantha BRecently, I had to write a code to classify and rename lots of image files based on their content. So, I wrote a Python script which displays all those images as a slideshow to the me, and I can classify and rename them with one button click, instead of renaming every file manually. The directory...

 
 
3 hours later…
11:24 AM
Monking
 
 
1 hour later…
12:25 PM
0
Q: Adding Odd numbers in C++

Strange AlchemistI have written following code for the this C++ Problem: Write a program to add only odd numbers between one to ten. #include <iostream> using namespace std; int main() { int num = 1, n = 0; int odd_num; while(num <= 10) { if(num % 2 != 0) { odd_num = nu...

 
 
2 hours later…
2:28 PM
0
Q: Performance optimization of nested dict

ProtractorNewbieI have been currently working on which way is the fastest way to get a nested dict. By spending few hours with researching aswell as asking people I have ended up creating my own test which I do not know if it is a valid test nor not: def with_in(): if "localised" in data and "test" in data["...

 
 
1 hour later…
3:42 PM
0
Q: golang http.Client wrapper with rate and concurrency limiting

beardeadclownMy goal is to safely consume an API without getting 429 Too Many Requests error, activating DDoS protection or going over system limit of maximum open file descriptors. To achieve that I wrote this simple wrapper around http.Client using worker pool pattern: package client import ( "errors" ...

0
Q: Comparison of 2 different ways of writing Merge Sort Algorithm

Divij ManchandaI have recently learned Merge Sort algorithm in C++ with 2 ways of writing it. 1st Way: void merge(int arr[],int low,int mid,int high){ const int n1=(mid-low+1); const int n2=(high-mid); int*a=new int[n1],*b=new int[n2];//dynamically allocated because of MSVC compiler ...

 
 
3 hours later…
6:17 PM
Since you already have some working code, the codereview site would be a better fit. — imsmn just now
 
6:45 PM
These questions are off-topic on Stack Overflow, so it's best not to answer them, and instead refer contributors to e.g. Code Review Stack Exchange (as @imsmn has done in the comments). That said, even if this was on-topic, or if it were on Code Review Stack Exchange, we'd expect more explanation of why these options are preferred, instead of simply an assertion. — Jeremy Caney 14 secs ago
 
7:10 PM
Monking
 
7:24 PM
0
Q: Whats the best way to refactor a POCO class

user16405900In work I was asked to fix a bug which involved me making changes in a class. To fix the bug I needed to add a collection of a class that looks like this. public class Branch { public int StartNode { get; set; } public int EndNode { get; set; } } The collection List<Branch> _vistedB...

 
 
 
1 hour later…
9:02 PM
0
Q: Concatenate two vectors and store the result

memoryallocatorI code in Rust, but one doesn't need to be familiar with Rust to understand the question. We are given the two vectors, first and res. Our goal is to append res to first, and then to assign the result to res. Let's consider the following two approaches. The first one is first.extend(res); res = f...

 

« first day (3067 days earlier)      last day (32 days later) »