GitHub Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by GitHub. The higher the ranking, the more likely you'll encounter it in a GitHub interview.

Question

Frequency

Difficulty

Ugly Number

Determine if a given positive integer is an ugly number. Ugly numbers are defined as positive numbers whose prime factors are limited to 2, 3, and 5.

Very likely

If you have a GitHub interview, it's very likely that you will get this question

Easy

#1. Ugly Number

Easy

Determine if a given positive integer is an ugly number. Ugly numbers are defined as positive numbers whose prime factors are limited to 2, 3, and 5.

This question is very likely to be asked in your GitHub interview

Set Mismatch

You are given a set of numbers that originally contained all numbers from 1 to n. However, due to an error, one number is duplicated and another is missing. Find both the duplicated and missing numbers.

ArraysBit Manipulation

Somewhat likely

If you have a GitHub interview, you might get this question

Easy

#2. Set Mismatch

Easy

ArraysBit Manipulation

This question is somewhat likely to be asked in your GitHub interview

Determine if a Cell Is Reachable at a Given Time

You're at a starting cell and want to reach a target cell in a given amount of time. Can you reach the destination in the allotted time, considering you can move in any of the eight directions?

Not likely

If you have a GitHub interview, it's unlikely that you will get this question. GitHub does ask it, but it's rare

Medium

#3. Determine if a Cell Is Reachable at a Given Time

Medium

You're at a starting cell and want to reach a target cell in a given amount of time. Can you reach the destination in the allotted time, considering you can move in any of the eight directions?

This question is not likely to be asked in your GitHub interview