Mots-clés » D.P.

Behind The Scenes Of Horror Movie BETHANY with Director James Cullen Bressack

(Watch the video interview here)

Behind The Scenes Of Horror Movie BETHANY with Director James Cullen Bressack

23-year-old Director James Cullen Bressack on the set for his latest feature horror film BETHANY.  33 mots de plus

Directing

Aaaand....... Relax

I don’t normally relax because I like to keep my momentum going. My job requires a lot of reading, writing and thinking. I have multiple deadlines and countless meetings. 40 mots de plus

Daily Post

Is the glass half full or half empty?

My metaphorical and literal answer to this age-old question:

When I see a glass that needs to be filled, I’m going to fill it. I don’t think it matters if I see it as half-full or half-empty because I’m going to fill it up anyway. 42 mots de plus

Philosophy

[LeetCode] - DP - Climbing Stairs

Problem:

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. 62 mots de plus

Java

Not quite privacy; but instead lets talk about Cyber Security.

So it’s been a while since I’ve posted anything (again) as the day job (and indeed one of the ‘other’ job’s) has been taking up a large chunk of my time. 490 mots de plus

Data Protection

Friday Music: We Weren't Born to Lose

Happy Friday!  Go ahead and skip to the 41:22 mark on this baby and enjoy yourself.  You deserve it.

Longest Palindromic Substring

Maintain a nxn boolean table, table[i][j] is true when a is palindromes
O(n^2) time, O(n^2) space

def longestpalindromic(a):
    n = len(a)
    table = [ for x in xrange(n)]
    maxLength = 1
    # All substrings of length 1 are true
    for i in xrange(n):
        table[i][i] = 1
    # Check for substring of length 2
    for i in xrange(n-1):
        if a[i] == a:
            table[i] = 1
            start = i
            maxLength = 2
    # check substring greater than 2
    for k in xrange(3, n+1): # k is length of substring
        for i in xrange(n-k+1): # i is starting index
            j = i + k - 1 # j is ending index

            if table != 0 and a[i] == a[j]:
                table[i][j] = 1
                if k > maxLength:
                    start = i
                    maxLength = k
    return a 14 mots de plus
OJ Problem