Ramko9999

🎯

Focusing

Ramki Pitchala

Ramko9999 / twoSumMap.js

Created April 16, 2021 15:51

	// counts all pairs in arr that sum up to target
	function twoSumCountMap(arr, target){
	let count = 0;
	let map = new Map();
	for(const num of arr){
	if(map.has(target - num)){
	count += map.get(target - num);
	}
	if(!map.has(num)){
	map.set(num, 0)

Ramko9999 / twoSum.js

Created April 16, 2021 15:40

	// counts all pairs in arr that sum up to target
	function twoSumCount(arr, target){
	let count = 0;
	let map = {};
	for(const num of arr){
	if((target - num) in map){
	count += map[target - num];
	}
	if(!(num in map)){
	map[num] = 0;

Ramko9999 / StringBuilder.js

Created April 16, 2021 04:03

Ramko9999 / index.html

Created April 12, 2021 23:47

	<!DOCTYPE html>
	<html lang="en">
	<body>
	<script>
	let elems = ["A", "B"];
	elems.forEach((v) => console.log("I ate", v));
	</script>
	</body>
	</html>

Ramko9999 / index.html

Created April 12, 2021 23:43

	<!DOCTYPE html>
	<html lang="en">
	<body>
	<script src="forEachPolyfill.js"></script>

	<script>
	let elems = ["A", "B"];
	elems.forEach((v) => console.log("I ate", v));
	</script>
	</body>

Ramko9999 / forEachPolyfill.js

Created April 12, 2021 23:14


	const isForEachSupported = Array.prototype.forEach;

	if(!isForEachSupported){

	Array.prototype.forEach = function customForEach (callback){
	if(typeof callback !== "function"){
	throw Error(`${callback} is not of type function`);
	}

Ramko9999 / default_dict.py

Last active March 7, 2021 23:50

	from collections import defaultdict

	# create an empty defaultdict with default value equal to []
	default_list_d = defaultdict(list)
	default_list_d['a'].append(1)

	# default_list_d is now {"a": [1]}

	# create a defaultdict with default value equal to 0
	default_int_d = defaultdict(int)

Ramko9999 / multi_field.py

Created March 7, 2021 21:18

	# each entry is a tuple (age, height)
	students = [(12,54),(18,78),(18,62),(17,67),(16,67),(21, 76)]

	# since our student ages and heights are already tuples, no need to pre-process
	heapq.heapify(students)

	k = 4
	kyoungest = []
	for i in range(k):
	kyoungest.append(heapq.heappop(students))

Ramko9999 / max_heap.py

Created March 7, 2021 19:46

	numbers = [4,1,24,2,1]

	# invert numbers so that the largest values are now the smallest
	numbers = [-1 * n for n in numbers]

	# turn numbers into min heap
	heapq.heapify(numbers)

	# pop out 2 times
	k = 2

Ramko9999 / creating_a_heap.py

Last active March 7, 2021 18:07

	# Approach 1: push new elements into the heap
	numbers = [4,1,24,2,1]
	heap = [] # our "heap"
	for num in numbers:
	heapq.heappush(heap, num)
	smallest_num = heapq.heappop(heap)

	# time complexity: O(NlogN)

	# Approach 2: use heapify()