fbpx
Byte by Byte
Skip to content
  • Home
  • Blog
  • Interview Questions
    • All
    • Easy
    • Medium
    • Hard
  • Coaching
    • Mock Interviews
    • Coaching
    • Roadmapping
  • Resources
    • DP Ebook
    • DP Video Course
    • 50 Questions
  • About
    • FAQ
  • Student Login

Searching Coding Interview Questions

Median of Arrays: Coding Interview Question

Coding Interview Question: Median of Arrays

Posted by Sam Gavis-Hughson

Coding Interview Question: Find the median of two sorted arrays. Click for the solution.

Posted in Coding Interview Questions Tagged Array, Medium, Searching 1 Comment
Random Binary Tree: Coding Interview Question

Coding Interview Question: Random Binary Tree

Posted by Sam Gavis-Hughson

Coding Interview Question: Implement a binary tree with a method getRandomNode() that returns a random node. Click for the solution.

Posted in Coding Interview Questions Tagged Medium, Recursion, Searching, Tree Leave a comment
Shortest Path: Coding Interview Question

Coding Interview Question: Shortest Path

Posted by Sam Gavis-Hughson

Coding Interview Question: Given a directed graph, find the shortest path between two nodes if one exists. Click for the solution.

Posted in Coding Interview Questions Tagged Graph, Medium, Searching Leave a comment
Lowest Common Ancestor: Coding Interview Question

Coding Interview Question: Lowest Common Ancestor

Posted by Sam Gavis-Hughson

Coding Interview Question: Given two nodes in a binary tree, write a function to find the lowest common ancestor. Click for the solution.

Posted in Coding Interview Questions Tagged Medium, Recursion, Searching, Tree 1 Comment
Matrix Search: Coding Interview Question

Coding Interview Question: Matrix Search

Posted by Sam Gavis-Hughson

Coding Interview Question: Given an sorted n x m array, write a function to determine whether the array contains an element x. Click for the solution.

Posted in Coding Interview Questions Tagged Array, Medium, Searching 7 Comments
Three Sum: Coding Interview Question

Coding Interview Question: Three Sum

Posted by Sam Gavis-Hughson

Coding Interview Question: Given a list of integers, find all sets of 3 numbers in the list, a, b, and c, so that a + b + c == 0. Click for the solution.

Posted in Coding Interview Questions Tagged Medium, Searching 3 Comments
Tree Level Order: Coding Interview Question

Coding Interview Question: Tree Level Order

Posted by Sam Gavis-Hughson

Coding Interview Question: Given a tree, write a function that prints out the nodes of the tree in level order. Click for the solution.

Posted in Coding Interview Questions Tagged Medium, Searching, Tree Leave a comment

Posts navigation

Dynamic programming crash course for non-geniuses

Download my free guide to learn:

  • How to finally “get” what Dynamic Programming really is – no Ph.D required
  • The not-so-obvious way you can solve any dynamic programming problem fast – and not freeze up during your interview
  • The only 10% of information you need to know to ace your interview – forget all the useless fluff

Enter your email below and get instant access to your free Dynamic Programming guide.

Success! Now check your email to download your free ebook!

There was an error submitting your subscription. Please try again.

Recent Posts

  • Why All Developers Should Conduct Interviews
  • FAANG Interview – Big 5 Coding Prep
  • 3 Ways to Ace Your System Design Interview
  • Finding a brute force solution

Interview Cake

Interview Cake

Interview Cake is an awesome resource for more practice interview questions. Get 50% off for a limited time.

Cracking the Coding Interview

“Cracking

Check out my hands down favorite resource for coding interview prep here.

Made in NYC
[email protected]
Youtube

© Byte by Byte 2016-2019

Privacy Policy
Terms and Conditions

Sam Gavis-Hughson is a software engineer based in New York City. Through Byte by Byte, he publishes regular coding interview question videos, demonstrating proper interview techniques. He also helps many students by offering practice coding interviews to help them get jobs at Google, Facebook, and other exciting tech companies.