Started learning Rust by solving LeetCode problems as they involve all the standard data structures of the language. I have the following standard hash table solution to the two-sum problem:
use std::collections::HashMap;
impl Solution {
pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32>...
Does the below TS type still need to be improved? I use actions: any as the more general signatures. Is there any better way?
import { ActionCreator, ActionCreatorsMapObject, bindActionCreators } from 'redux';
import { useDispatch } from 'react-redux';
import { DependencyList, useMemo } from 'rea...
These are what I was working on in the last few days, I wrote a bunch of functions that fill a given region with rectangles of different colors.
The functions can:
Randomly split a region into sub regions recursively based on n random points:
one point (each region is split into four sub regions)...
Problem description:
The sum of the squares of the first ten natural numbers is,
1² + 2² + … + 10² = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + … + 10)² = 55² = 3025
Hence the difference between the sum of the squares of the first ten natural numbers and the square of...
I have an app which parses data files on the clients browsers and displays a scatter chart. This is an example of a scatter chart with 10,000 data points:
This is an example of a scatter chart with 1.4 million data points:
My algorithm is crude and simple. I get the events in a correct format (...
I'm making a timer class in C++. This is the overview:
#include <chrono>
namespace ktp {
class Timer {
using Clock = std::chrono::high_resolution_clock;
using TimePoint = std::chrono::high_resolution_clock::time_point;
public:
Timer(bool start = false) {
if (start) Timer::start...
I wrote my own hash function and my own hash table.
My hash function seems to work surprisingly well!
Feel free to comment anything!
Hash function:
#ifndef __CLRS4_HASH_FUNCTION_H__
#define __CLRS4_HASH_FUNCTION_H__
#include <bit>
#include <common.h>
namespace frozenca::hard {
using namespace ...
My goal is to improve my coding skills, I am just looking for feedback specific to encapsulation, the use of static, and any other tips to make this "production quality". I don't feel confident the Solve method has been implemented correctly. By instantiating the object its contained within. Simi...
Here are 2 bubble sort algorithms:
1:
function bubbleSort(array) {
let i = 0;
let startVal = array[i];
let comparingVal = array[i + 1];
let iterations = array.length;
while (iterations > 0) {
if (comparingVal === undefined) {
i = 0;
startVal = array[i]
comparing...
I'm looking for advice on how to improve the performance and/or style of these two search functions. This is just for fun and for practice: they are already fast enough for any application I would be using them in, and they don't have to meet any specific performance criteria, but I'm intereste...
