Our favorite holiday of the year is this Saturday: National Knife Day! We are so excited we thought we would kick off the festivities early and make it National Knife WEEK! Celebrate with us and save an EXTRA 25% OFF ALL MTECH KNIVES ALL WEEK LONG!!
Summer is a time for grilling and chilling! Finish summer strong with a great new set of grilling tools found in one of our 4 awesome sets! Simply enter the code GRILL-19 when checking out and the savings will be applied to your cart. This deal ends at midnight on Saturday so don't wait!
This is the app that I wrote for Master Cutlery. You can build your own knife with this knife customization app. You get to choose handle material, bolster, box, and pouch. The visual appearance and the price of the knife will be changed based on your configuration.
Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.
Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1 instead.
These photos were taken on a trip to Roosevelt Island, New York. It was a sunny day, and I love how quiet the island is. I took a photo of Roosevelt Island from a tram, and under the Ed Koch Queensboro Bridge.
This web application is built exclusively for Master Cutlery staffs, in which it will be used during the shows throughout the year. It allows the staffs to place orders for customers on site with show-only discounted pricing as well as create new customers.
Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.
(Recall that the number of set bits an integer has is the number of 1s present when written in binary.
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node's value is the smaller value among its two sub-nodes.
On an infinite plane, a robot initially stands at (0, 0) and faces north. The robot can receive one of three instructions:
"G": go straight 1 unit;
"L": turn 90 degrees to the left;
"R": turn 90 degress to the right.
The robot performs the instructions given in order, and repeats them forever.
In a list of songs, the i-th song has a duration of time[i] seconds.
Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i < j with (time[i] + time[j]) % 60 == 0.