Auth0 Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Validate a BST

Given a binary search tree like the one below, can you write a function that will return true if it is valid? 5 3 9 1 4 Recall that a BST is valid only given the following conditions: The left child subtree of a node contains only nodes with v...

Difficulty: 4/10

Find in Shifted Sorted Matrix

Understanding the Matrix Shift Problem Suppose you have a matrix where each row and column is sorted in ascending order. Your task is to apply two specific types of shifts, described below, and locate a given element x in the transformed matrix. Shift Types **Left Circular Shift l :** ...

Difficulty: 8/10

Two Sum from BST

This problem is a fun combination of the famous Two Sum problem combined with a binary search lessons binary search technique tree. Given the root of a binary search lessons binary search technique tree, and a target integer K , return true if there exist two nodes in the said tree...

Difficulty: 7/10

Merge Two Binary Trees

Merging Two Binary Trees The Problem Statement You are presented with two binary trees. Your task is to merge these trees into a single, new binary tree. ! Merging Binary Trees https: storage.googleapis.com algodailyrandomassets curriculum trees merge two binary trees cover image.png ...

Difficulty: 5/10

Next Greater Element in a Circular Array

A circular array challenges next larger in a circular array is one where the next element of the last element is the first element. You know how standard arrays look. Instead of 1, 2, 3, 4 , imagine the following, where after index 7 , we'd move back to index 0 . Can you write ...

Difficulty: 6/10

Find First Non-Repeating Character

You're given a string of random alphanumerical characters with a length between 0 and 1000 . Write a method to return the first character in the string that does not repeat itself later on. So if we had a string input of "asdfsdafdasfjdfsafnnunl'" , we can see there are multiple letters that...

Difficulty: 4/10

Most Strongly Connected

You're given the following multi dimensional array matrix: js const matrix 1, 1, 0, 0, 0 , 0, 1, 1, 0, 0 , 0, 1, 0, 1, 0 , 1, 0, 0, 0, 0 Could you find the largest concentration of connected 1 s in the matrix? Write MostConnectedOnes matrix: array class o...

Difficulty: 8/10

Split Set to Equal Subsets

We're given a set in the form of an array with a unique integers. Can you write a function that tells us whether it can be separated into two subsets whose elements have equal sums? Here's an example: 5, 9, 7, 21 : The below would return true because newSet can be divided into 5, 9, 7 ...

Difficulty: 5/10

Authentication and Authorization

Introduction to Authentication and Authorization Authentication and authorization are fundamental concepts in web development, especially when it comes to building secure applications. In this section, we will explore the basics of authentication and authorization and understand why they are cr...

Difficulty: 5/10

Data Store Fundamentals

...

Difficulty: 5/10

Introduction to Algorithms in C++

...

Difficulty: 5/10

Optimizing React Performance

Introduction to React React is a JavaScript library for building user interfaces. It was developed by Facebook and is widely used in frontend development. React provides a component based architecture, making it easier to build reusable UI components. One of the key features of React is its vi...

Difficulty: 5/10

Interview Reports

How I landed my job at Auth0 : Global Nerdy...

On October 19th, I start my new job at Auth0 as a Senior R&D Content Engineer! Here’s the detailed story of what I did to land the job.

How We Hire Engineers...

Providing transparency about the hiring process at Auth0 and the rationale behind it.

Auth0 Interview Questions | Glassdoor...

Auth0 interview details: 164 interview questions and 133 interview reviews posted anonymously by Auth0 interview candidates.

People at Auth0 Say

This information was sourced from reviews originally posted on Glassdoor.

Fantastic culture. And I mean it. It goes way beyond published "company values" (which I'm always skeptical about anyway). This particular group of people truly give a sh*t about what they do, how they do it, both at work and in life.