Yashi Shandilya yashishandilya

A Way to Look at Tideman Lock Pairs

I've observed that there is a little bit of a disconnect in understanding what it is that needs to be done to properly implement the lock_pairs function for cs50 Tideman. The goal of this little write-up is simply an attempt at explaining what the problem actually is, and why a cycle imposes a problem.

First:
If you are unfamiliar with the actual problem, or have not read through the entire cs50 Tideman problem description. Then I think you should start there.
cs50 Tideman

Second:
This little write-up is only narrowing in on the idea of cycles, and a way to think about what a cycle is and determine if locking a pair in the pairs array would create that cycle. This does not talk about any other part of the Tideman problem.

A simple look at pointers in C

Consider this simple snippet of code

int a = 5; 
int* b;
int c;
b = &c

Crudely drawn. If you think about memory like a char array. Then
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]

(You can comment here.)

Here I'm trying to understand what happens when I run

./hello

#include

	const fetch = require('node-fetch');
	const dayjs = require('dayjs')

	const DATASET_API = "https://candidate.hubteam.com/candidateTest/v3/problem/dataset?userKey=USER_KEY"
	const RESULT_API = "https://candidate.hubteam.com/candidateTest/v3/problem/result?userKey=USER_KEY"

	const findIdealStartDatePartners = (country, partners) => {
	let partnersByDate = {}
	let mostAvailDate = null
	let maxAttendee = -1