Nicholas Workshop (Page 2)

Nicholas Workshop

Sign in Subscribe

Sublime Text 3 On CentOS And RHEL

Sublime Text 3 On CentOS And RHEL

#!/bin/sh # run this to install # sudo su install-sublime-text-3.sh # modify this if you need another version or or architecture URL="http://c758482.r82.cf2.rackcdn.com/sublime_text_3_build_3083_x64.tar.bz2" SHORTCUT="[Desktop Entry] Name=Sublime Text 3 Comment=Edit text files Exec=/usr/local/sublime-text-3/

Never Alone (Kisima Ingitchuna)

Gameplay Walkthrough

Never Alone (Kisima Ingitchuna)

Gameplay walkthrough

The Order: 1886

Gameplay Walkthrough

The Order: 1886

Gameplay walkthrough

How to Change Computer Name in Ubuntu

How to Change Computer Name in Ubuntu

1. Open a terminal window. 2. At the input prompt you will see this structure: nicholas@computer-name:~$ _ 3. So you have to edit the hostname file: sudo nano /etc/hostname 4. When prompted, enter the administrator password and hit Enter. 5. The hostname file will open, showing the current computer

No Solution Stacks Listed in Elastic Beanstalk Configuration

No Solution Stacks Listed in Elastic Beanstalk Configuration

It is how you do the elastic beanstalk configurations. eb init You would be very frustrated when you can select no available solution stacks… Select a solution stack. Available solution stacks are: Select (1 to 0): It is because the credentials you use don’t have administrator rights. Go to

Unable to Install Homebrew

Unable to Install Homebrew

Unable to install Homebrew with this? ruby -e "$(curl -fsSL https://raw.github.com/Homebrew/homebrew/go/install)" What’s happening warning: Insecure world writable dir /usr/local/bin in PATH, mode 040777 ==> This script will install: /usr/local/bin/brew /usr/local/Library/... /usr/local/share/man/man1/brew.

Awesome New Layout!

Awesome New Layout!

Well, it is always good to have a refreshing layout. I spent like 2 days to tweak my website layout. It’s really awesome. Useless widgets are removed and background changed. There is even a whole new typography. I love it so much!

Happy Android Development with Gradle

Happy Android Development with Gradle

Recently I have been working a lot on migrating android projects to use gradle building system. Seriously it is much better than the old time. I can easily use libraries on maven repositories and customize my building process. I also no long need to create a desperate project for testing.

Universal Value Binary Tree

Universal Value Binary Tree

Question Design an algorithm to verify that a tree is a universal value binary tree. Universal value binary tree means all value in that tree is the same. Solution There is two approach for this problem. One is with recursive function and another is with iterative function. For this problem,

Vending Machine

Vending Machine

Question This is an actual question I encountered in an Amazon phone interview in November 2013. You are going to design the money changing algorithm for a vending machine. That is, after any purchase, the machine makes change to users with a combination of coins. And the machine only have

Identify Prime Numbers

Identify Prime Numbers

Question Write an algorithm to identify prime numbers from a list of numbers ranging 0-100. Solution The main question is actually to write a program to check if a number is prime. There are 4 situations. 1. If number is 0 or 1, it is not prime. 2. if the

Remove Node from Singly Linked List

Remove Node from Singly Linked List

Question How do you remove a node from a singly linked list, given only that node? Head node is not given. Solution Set next of this node to the next of the next node. node->next = node->next->next; Reference * Glassdoor

Counting One in Binary Expression

Counting One in Binary Expression

Question Given a number, find the number of 1 in the number’s binary expression. For example, binary express of 10 is 1010. So the number of 1 in it is 2. Solution To solve this, we can check each bit by shifting the bits one by one. 1. 1010

Right-rotate String

Right-rotate String

Question Write a program to right-rotate a string by m characters. Right-rotating a string means moving m characters at the left of string to the right. Is it required the time complexity is O(n) and helper memory size is O(1). For example, right-rotate “abcdefghi” by 3 characters gives

Longest Consecutive Digits

Longest Consecutive Digits

Question Given a function prototype: int continumax(char *output_string,char *input_string). Implement it to find the longest consecutive digits. This function must return the length of the longest digits. The found longest digits should be written to the memory location that output_string is pointing. For example, if

Reverse a Linked List

Reverse a Linked List

Question Reverse a linked list. Sample # node structure class Node: value = None next = None def __init__(self, value, next_node=None): self.value = value self.next = next_node # reverse the linked list and return the head node def reverse_linked_list(head): reversed_head = None last_node = None node = head

Card Guessing

Question Consider there are 4 blue and 4 red cards. Host gets 2 cards randomly, no one knows what cards they are. Then he places 2 random cards at the forehead of each player A, B and C. Players do not know the color of their own cards, but know

Summing Combinations

Summing Combinations

Question Given a integers m and n, generate all combination within 1 to n that would give the sum m. For example, for m=5 and n=5, the combinations are {5}, {4+1}, {3+2}. Solution This is a knapsack problem. #knapsack that store the found combination knapsack = array

Find the Heavier Marble

Find the Heavier Marble

Question You have 9 marbles. 8 marbles weigh 1 ounce each, & one marble weighs 1.5 ounces. You are unable to determine which is the heavier marble by looking at them. You have a weighing scale that consists of 2 pans, but the scale is only good for 2 total

Convert String to Integer

Convert String to Integer

Question Convert the inputted string to an integer. For example, “345” will output 345. Solution Though it looks simple, in fact it is pretty tricky. First we need to make the concept clear. 1. Scan each character from the left to right, then multiply the previously obtained integer by ten

Fastest Way to Calculate Fibonacci Sequence

Fastest Way to Calculate Fibonacci Sequence

Question Construct an algorithm so that the Nth item of Fibonacci Sequence can be found in the shortest time. Definition of Fibonacci Sequence is: f(n) = 0 , when n = 0 f(n) = 1 , when n = 1 f(n) = f(n-1) + f(n-2), when n > 1 Solution There are many solutions

Last Surviving Number in Loop

Last Surviving Number in Loop

Consider Consider there is a list containing N numbers, and which formed a ring. That is, item n+1 is item 1. Construct an algorithm such that it traverses through the ring, and remove the Mth item. Repeat this process until there is only one number left in the ring

Find The String Appeared Once

Find The String Appeared Once

Question Given a string, write an algorithm to find the character inside that appeared only once. For example, the result for string “abaccdeff” is b. Solution We can use a hashtable to count the appearance times for each character. Then rescan the hashtable for the character that appeared only once.

Verify Binary Tree with Same Value

Verify Binary Tree with Same Value

Question Verify whether all nodes have the same value in a binary tree. Solution We can traverse the tree with our usual way, like depth-first or breadth-first algorithm. Then pass a value, probably the root value, to compare with the visiting node. Example # node structure class bst_node: value = None

Remove Duplicates In List

Remove Duplicates In List

Question Write an algorithm to remove duplicated node from a linked list. Solution with O(n²) There are many ways to do it. For the first one, as the simplest one, we could use 2 loops to compare each element with all other elements. However, this takes forever: O(n²