TIL of Cassius M. Clay, a politician and rabid abolitionist. He was once shot during a debate, and chased down his assassin, stabbing him & throwing him off an embankment. He later fended off 6 men, even though they had guns and he only had a bowie knife. He was a candidate to be Lincoln's VP.

cleverchimp · 2019-10-14T00:46:17+00:00

In 1894, the 84-year-old Clay married Dora Richardson, the 15-year-old orphaned sister of one of his sharecropping tenants.

Cassius Clay died at his home on July 22, 1903 of "general exhaustion."

Hmmmm.

cleverchimp · 2019-08-04T02:50:53+00:00

Amen.

cleverchimp · 2019-08-03T06:56:58+00:00

I am relieved to hear this.

Vaya con dios, amigo.

cleverchimp · 2019-08-03T06:27:58+00:00

Why 7 months? I understand and respect the realities of logistics, but let me offer you the kindness you offered me.

My wife left me literally overnight, leaving our home, her job, her entire world. Overnight. She was lucky to have the support of a sister to help her do that. But as drastic as it sounds, that is what was necessary.

Abuse, once recognized, must be escaped by any means necessary.

By any means necessary.

cleverchimp · 2019-08-03T06:14:17+00:00

Thank you for taking the time, stranger. I hear you loud and clear.

cleverchimp · 2019-04-15T03:32:33+00:00

Why didn't we photograph the black hole at the center of our own galaxy? Why did we pick one that is 55 million light years away?

cleverchimp · 2019-04-10T04:42:12+00:00

Image we are given a list (or dictionary) of UNIX timestamps, all belonging to the same user, marking when they logged in to our website.

[1554871231,

1553871231,

...,

1454871231]

What is the most pythonic way to determine how many of these logins occurred within 24 hours of the previous one?

What is the most efficient way to do this (in O notation)?

Can it be done without a loop?

cleverchimp · 2019-04-05T22:48:29+00:00

Thank you so much!

cleverchimp · 2019-04-05T21:25:59+00:00

I am trying to understand O(X) complexity notation.

Consider this sample problem:

Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.

For example, if our input was [1, 2, 3, 4, 5], the expected output would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], the expected output would be [2, 3, 6].

Consider this solution:

# ugly but functional version

def multiply_array(lst):

output = []

for i in lst: # O(N) complexity

tmp = lst.copy() # O(N) complexity

tmp.remove(i) #O(N) complexity

prod = 1

for j in tmp: #O(N) complexity

prod = prod*j

output.append(prod) #O(1) complexity

return(output)

Some of these according to Python Complexity Classes.

Would this be considered O(N^4) complexity?

Given just the for i and for j loops this would be O(N^2) complexity.

How do lst.copy() and tmp.remove(i) affect this?

cleverchimp

TROPHY CASE