This is the first API wrapper I've written and I'm wondering what I can do to improve. I've read through the feedback of a few similar posts
Readme
Code
import requests
import time as notdatetime
import datetime
import matplotlib.pyplot as plt
# uses Algolia for API
class API():
def __init__...
#include <iostream>
#include <vector>
class Node {
public:
std::vector<Node*> front;
Node* end;
int value;
Node(std::vector<Node*> front, Node* end, int value) {
this->front = front;
this->end = end;
this->value = value;
}
};
void findLargestSumRevers...
So far I have reached chapter 5 of the K&R Book, Edition 2 from which I have been learning C. I spent a few days thinking of a solution to this program. I wrote two or three versions of the same program, And the truth is that I couldn't bring myself to think of a better solution for this exercise...
check if a given variable is positive integer:
def is_positive_int(n: Any) -> bool:
try:
return str(n).isdecimal() and n > 0
except ValueError:
return False
I'm learning algorithms and I wrote the single-directional linked list implementation in C. I need a code review of what can I improve in my code and I want to make sure there are no possible memory leaks.
Code:
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *...
I am developing (WIP) a mine sweeping game to get more familiar with Rust.
I decided to represent the mine field as a 2D grid.
While developing I realized that this grid can be outsourced as a general purpose grid into an own module.
Here it goes:
#[derive(Debug)]
pub struct Grid<T> {
width: ...
