Page 153 - Career Development Guidebook

SECTION 4: INTERVIEWS

How companies source candidates

82% of employers rated employee referrals above all other sources for generating the best return
on investment.
Referred candidates are 55% faster to hire compared to candidates sourced through career sites.
The retention rate of referred employees is 45% after two years, compared to 20% for those from
job boards.
Referred candidates are 2.6 to 6.6% more likely to accept an offer.
(https://www.glassdoor.com/research/studies/interview-sources/)
Across all jobs, Referrals account for 7% of applications but 40% of all hires. If you’re referred,
you’re almost six times more likely to get your dream job.

Common interview questions and practice guide for CS & Data major

Interview Question: Computer Science

For coding questions, the best way to prepare is to write code every day. Programming mastery requires
consistent practice. Before interviews, do a few typical software engineering questions to get yourself
into the problem-solving, whiteboard coding mode. If you haven’t seen them in a while, pick up a book
on algorithms & data structures and skim it.
We recommend the book Data Structures and Algorithms in Python by Michael T. Goodrich and the
classic Introduction to Algorithms by Thomas Cormen et al. We also recommend practicing websites
such as LeetCode, CodeSignal, and HackerRank.

Those sites rank problems by difficulty; you should try medium and hard problems. Most of them have
solutions available in case you want to compare your solutions to more optimal ones.

Interview Question: Algorithm

1. Write a Python function to recursively read a JSON file.
2. Implement a sorting algorithm, preferably quick sort or merge sort.
3. Find the longest increasing sequence in a string.
4. Find the longest common subsequence between two strings.
5. Traverse a tree in pre-order, in-order, and post-order.
6. Given an array of integers and an integer k, find the total number of continuous subarrays whose
sum equals. The solution should have a runtime.
7. There are two sorted arrays, with and elements, respectively. Find the median of the two sorted
arrays. The solution should have a runtime.

153