I've been trying to create an alternate function 'squeeze(s1, s2)' and well, I have taken my time to do it, but I'm actually I'm not 100% sure If the solution I have done is correct. Although I test it, and everything it works fine and gives me the result I expect. But sometimes I start to wonder...
I have tried to remove the duplicate elements from the array using c language, here I am using 3 for loops to remove the duplicate elements.
How can this optimize the code?
Are there any other simple methods to remove the duplicate elements?
#include <stdio.h>
#define MAX_SIZE 100 // Maximum siz...
I just completed Pset 2 about the Hangman game that was issued from OCW MIT. The Pset has no available solution so that any comment regarding code writing best practices would be greatly appreciated (especially about defining functions and linking them to each other). The full lines of code and a...
I would like to use Julia to compute the hamming distance on a very large dataset.
I need to get back a distance matrix between rows in order to run further analysis on this matrix.
For my purposes, it is useful that the data are stored in a DataFrame type.
using DataFrames
The data looks someth...
I am new to java collections and learning them right now. I was trying to code the phone keypad characters with its numbers. The first idea which came to my mind is using a HashMap. After trying various options I came up with the below Code. I want to know if the data structure and methodology wh...
This is my solution to the N-Queens Puzzle.
Here is the AEC code (compiled to WebAssembly):
/*
* My solution to the n-queens puzzle, one of the classical problems of the
* structural programming. It asks in how many ways you can arrange n chess
* queens on an n-times-n chessboard without break...
I have the following code:
const arr = Array.from({length: 5}, (_, i) => i + 1);
const finalArray = [];
for (let i = 0; i < arr.length; i++) {
for (let j = 0; j < arr.length; j++) {
finalArray.push(arr[i] + '-' + arr[j])
}
}
console.log(finalArray);
Which creates an array ...
def T(n):
if n <= 0:
return 1
else:
return T(n-1) + (n-1) * T(n-2)
print T(2)
I want to print out a list of numbers generated using the recurrence relation above. Is there any way to make this more efficient?
ApplicationDetail.txt:
URL: https://www.abc.com
applicationNo : 123456
Application Class:
from dataclasses import dataclass
@dataclass
class Application(object):
""" Binding Json Data to this Class """
Status: str
ApplicationType: str
StatusDate: str
Location: str
LocationD...
I have uploaded data with updateChildren() as follows:
public void update(List<Player> playerList) {
Map<String, Object> map = new HashMap<>();
for (Player player : playerList) {
map.put("players/"+player.getKey() + "/entity", player.getEntity());
}
mR...
I have too many pdf files in the folder. I want to remove the old version file automatically by Python only.
The file name is like this:
20022021_cap_mp_19_1_col_r1.pdf
20022021_cap_mp_19_1_col_r2.pdf
20022021_cap_mp_18_1_col_r1.pdf
20022021_cap_mp_20_1_col_r2.pdf
20022021_cap_mp_20_2_col_r1.pdf
...
I've noticed for some functions that take a matrix as a parameter could be rewritten for a vector.(A vector is a double*, and so is our matrix).
typedef struct {
size_t rows;
size_t cols;
double* m;
}MATRIX;
int matrix_abs(MATRIX* const A);
int matrix_negate(MATRIX* const A);
int mat...
