Author: Andrey
-

CROSSFIT GAMES OPEN 19.1 STRATEGY AND ANALYSIS
19.1 CrossFit Open includes the following workout: Do as many reps as possible of the following in 15 minutes: 19 wall-ball shots 19 calorie row
-

CrossFit Games Open 18.5 Strategy and Analysis
18.5 CrossFit Open includes the following workout: Do as many reps as possible of the following in 7 minutes: 3 thrusters at 100lb 3 pull ups 6 thrusters at 100lb 6 pull ups Increase each round by 3
-

CrossFit Games Open 18.4 Strategy and Analysis
18.4 CrossFit Open includes the following workouts: Do 2 rounds of the following in 14 minutes: 21 deadlifts at 225lb 21 handstand push ups 15 deadlifts at 225lb 15 handstand push ups 9 deadlifts at 225lb 9 handstand push ups 21 deadlifts at 315lb 50 foot handstand walk 15 deadlifts at 315lb 50 foot handstand walk 9 deadlifts at…
-

CrossFit Games Open 18.3 Strategy and Analysis
18.3 CrossFit Open includes the following workouts: Do 2 rounds of the following in 14 minutes: 100 double unders 20 squads with 115lb 100 double unders 12 rind muscle ups 100 double unders 20 dumbbell snatches, 50lb 100 double unders 12 bar muscle ups
-

CrossFit Games Open 18.2 Strategy and Analysis
18.2 CrossFit Open includes the following workouts: 1-2-3-4-5-6-7-8-9-10 reps for time of: dumbbell squats (50s/35s) bar facing burpees 18.2a is: 1RM clean You have 12 minutes to complete both.
-

CrossFit Games Open 18.1 Strategy and Analysis
18.1 CrossFit Open includes the following workouts: AMRAP 20 min 8 toes to bar 10 dumbbell clean & jerks (50/35, must be done 5 on one side and 5 on the other) 14/12 calorie row
-

Min Max Sum from hackerrank on C++
Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. Full question is over here:hackerrank Working solution #include <bits/stdc++.h> using namespace std; void miniMaxSum(vector <int> arr)…
-
Merge Sort in Objective-C
An implementation of the merge sort. Coded according to a Top-Down C example from Wikipedia. https://en.wikipedia.org/wiki/Merge_sort // Array A[] has the items to sort; array B[] is a work array. – (void)topDownMergeSort:(NSMutableArray*)A array:(NSMutableArray*) B int:(int) n{ [self copyArray:A begin:0 end:n array:B]; // duplicate array A[] into B[] [self topDownSplitMerge:B begin:0 end:n array:A];// sort data from…
-
Clone Undirected Graph with Javascript
A question that I got asked on the interview at Facebook on 2016 that I wasn’t able to finish coding within interview time frame. Finally got a chance to put it into code. I used a LeetCode as a JS platform to test a code: https://leetcode.com/problems/clone-graph/description/ /** * Definition for undirected graph. * function UndirectedGraphNode(label)…
-
Find a second largest number in array with Javascript
Back to the simple coding questions. This time with javascript – it seems the easiest language to test with. Code for the problem can be run over here: http://js.do/code/svetliy-second-largest var first_largest; var second_largess; function large(a_list){ if (a_list.length == 0 || a_list.length == 1) return “None”; if (a_list[0] > a_list[1]){ first_largest = a_list[0]; second_largest = a_list[1];…