<commit_before>Google Technical Interview. Software Engineer Role

10 min Intro
10 min Resume Project Talk
  - Asked for detailed information on (Stack, challenges, decisions, etc..)
compare binary search trees vs hash tables
  - advantages vs disadvantages
  - why use one over the other?
30 min on algorithm


<commit_msg>add algorithm<commit_after>Google Technical Interview. Software Engineer Role

10 min Intro
10 min Resume Project Talk
  - Asked for detailed information on (Stack, challenges, decisions, etc..)
compare binary search trees vs hash tables
  - advantages vs disadvantages
  - why use one over the other?
30 min on algorithm


// given a data set of time stamps and image id's where each occurence is a vote
// return the highest voted image id at the kth timestamp

// ex. input
// [[2, A].
//  [3, B]
//  [4, C],
//  [1, B],
//  [6, B].
//  [7, B]
//  [2, C],
//  [9, A],
// ], 3

// output
// B

function rate(data, time){

  // write code here
}

{'fraction_non_alphanumeric': 0.10298661174047374, 'fraction_numerical': 0.021627188465499485, 'mean_word_length': 3.05, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2241287', 'n_tokens_mistral': 309, 'n_tokens_neox': 288, 'n_words': 140}