Uncubed
           

News

Issue #20: Handpicked Entry-Level Jobs & Internships + Leap Motion’s VR Cat Explorer


Uncubed Entry is officially 20 issues old! 🎉 🎂 🎊

Thanks to everyone who has been with us since issue #1, and to those of you who have joined us since 🙏

It’s not too late to invite your friends to the party – we’ll be turning 30 soon enough and have A LOT in store for you this Fall!

Also, any friends in Canada? New full-time gigs in Ottawa, very hot off the press. We work closely with IBM on a Watson-powered product so can fast-track you through the application process if a fit.

With love,
The Uncubed Team

20th birthday celebration

 


FEATURED COMPANY: Merrill 

Merrill
Acquisitions make for big headlines, instant millionaires, and plenty of “I told you so” moments. But behind the scenes of every Microsoft purchase of GitHub, there’s a complicated exchange of financial, legal, and other information. Who handles all of that? Merrill, for one.

Merrill has 34 offices worldwide – from Atlanta, Boston, Chicago, Dallas, Denver, Los Angeles, New York, Palo Alto, and St. Paul (HQ) to Sao Paulo, Mexico City, Paris, Frankfurt, London, Shenzhen, Hong Kong, and Tokyo.

And they’re hiring.

👉 Learn more, watch videos, + apply here. 👈


INTERNSHIPS

ENTRY-LEVEL JOBS

 


CRITICAL THINKING INTERVIEW QUESTION

This question comes from The Balance Careers

Question: “Who was your best boss, and who was the worst?”

Why They Ask: “The interviewer is trying to discover if you are the type of candidate to assess blame or carry a grudge. They also want to determine if you are a match for the culture of the company.

Even if you had a boss who was awful, don’t come right out and say so. Interviewers don’t want to hear negativity, and they will wonder what you will ultimately say about their organization if you are hired and it doesn’t work out.”

Sample Answers: Here.


TECHNICAL INTERVIEW QUESTION (via LeetCode)

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.

Given such a binary tree, you need to output the second minimum value in the set made of all the nodes’ value in the whole tree.

If no such second minimum value exists, output -1 instead.

Second Minimum Node In a Binary Tree Examples

Click here for solutions.


LIFE TIP OF THE WEEK (via HighExistence)

Learn to focus only on the present.
The past is unchangeable so it is futile to reflect on it unless you are making sure you do not repeat past mistakes. The future is but a result of your actions today. So learn from the past to do better in the present so that you can succeed in the future.

Even more specifically, live in THIS moment. Even 10 minutes ago is the past. If you live purely in this moment you will always be happy because there is nothing wrong in this split-second.


THIS WEEK’S INTERNET FINDS

 


Thanks for reading this week’s Entry! If you love this email, forward it to your friends. If you hate this email, forward it to your enemies. Both groups can sign up here: uncubed.com/entry/sign-up

See you next Wednesday!
The Uncubed Team

Share