Tags » List

7 Brightest Highlights Of Martin Brodeur's Legendary Career

By Daniel Friedman
» More Columns

On Tuesday afternoon, it was announced that former New Jersey Devils goaltender Martin Brodeur would be retiring from the NHL… 396 more words


Journaling Challenge - Day 28

Day 28: Finally in this three-day journey, you need to gather the tools necessary to make your life a masterpiece. Take a look at the article, and define the various tools that you will need and use to work towards those purposes and goals you laid out a couple days ago. 904 more words

Nine Movie Moments I Can't Get Enough Of Part I

1.  Revolutionary Road (2008): “Do you know what the defination of insanity is?”

Why? Leonardo DiCaprio is the king of tantrums!

2. The Dark Knight Rises ( 2012): “You think the darkness is your ally?” 140 more words

Movie Moments

iOS Roundup: 28/01/15 - Exiles, Particle Mace, Lamp And Vamp and More

Early next week I’ll be starting my new position at Pocket Gamer, something I’m incredibly excited about. I’m not expecting it to affect my work here or elsewhere but hopefully it will make it understandable if I miss a day or post later than expected. 127 more words


My daily most-used apps

Apps are everywhere today. From our phones, to our tablets and computers going all the way to apps for our watch and even TV. And it’s true what they say: there is an app for everything! 804 more words


Chocolate Carnival's Tutorial On Writing Exceptional Fanfiction

Hello All My Honeys,

I apologize that I took me so long to complete The Sinister Pride Of Perfection but I simply had to take my time with it, otherwise the story would have turned out forced. 1,030 more words

Bleach FF

Lintcode: rehashing

how to deal with neg hash code?
Answer: int index = (newNode.val%cap + cap)%cap;

    public ListNode[] rehashing(ListNode[] hashTable) {
        int len = hashTable.length, cap = len*2;
        ListNode[] result = new ListNode;
        ListNode[] tail = new ListNode;
        for (ListNode node: hashTable) {
            while (node != null) {
                ListNode newNode = new ListNode(node.val);
                int index = (newNode.val%cap + cap)%cap;
                ListNode head = result;
                if (head == null) {
                    result = newNode;
                    tail = newNode;
                else {
                    tail.next = newNode;
                    tail = newNode;
                node = node.next;
        return result;
    } 7 more words