Raunak Ramakrishnan rrampage

I hereby claim:

To claim this, I am signing this object:

Programming Achievements: How to Level Up as a Developer


	# %%
	import os
	os.environ["KMP_DUPLICATE_LIB_OK"] ="TRUE"
	import sys
	import re
	import time
	import torch as t
	import numpy as np
	from pathlib import Path

	package main

	import (
	"fmt"
	"regexp"
	"strconv"
	)

	var polyRegex = regexp.MustCompile(`\s(?P<coef>[+-]?[0-9])?\s\?((?P<var>[a-z])?\s(\^(?P<pow>[+-]?[0-9]+))?)?\s`)
	var wsRegex = regexp.MustCompile(`\s+`)

	#!/bin/bash
	# Search Wayback machine for a particular URL
	# Add to your ~/.bashrc or ~/.bash_profile
	# Needs `jq` and `curl` to work
	if [[ -z $1 ]]; then
	echo "Usage: $0 URL";
	else
	curl "http://web.archive.org/cdx/search/cdx?url=$1*&output=json&fl=original,timestamp" 2> /dev/null \| jq '.[1:][] \|"https://web.archive.org/web/" +.[1] + "/" + .[0]' 2> /dev/null;
	fi

	# Check if two strings are permutations (anagrams) of each other
	# For this example, using just the lowercase ASCII letters as the alphabet
	# Step 1 : Generate k primes using Sieve of Erasthothenes
	# Step 2 : Map characters in alphabet to prime
	# Step 3 : Compare the products of the 2 strings
	# Why does this work?
	# - Multiplication is commutative i.e a * b * c = c * a * b
	# - Fundamental theorem of arithmetic i.e every natural number can be expressed uniquely as either a prime or a product of primes (https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic)

	from string import ascii_lowercase as ALPHABETS

	"""Using the implementation from Wikipedia: https://en.wikipedia.org/wiki/Hamming_weight#Efficient_implementation """

	def hamming_weight(n):
	t1 = n - ((n>>1) & 0x55555555)
	t2 = (t1 & 0x33333333) + ((t1 >> 2) & 0x33333333)
	return ((((t2 + (t2 >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24,n)

	def hamming_sort(n):
	return [x[1] for x in sorted(map(hamming_weight,xrange(1,n+1)))]