Test your understanding of various coding challenges focusing on algorithm efficiency.

Coding

Challenge Yourself

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

# Statement

You're given two sorted integer arrays, `nums1` and `nums2`, of size $m$ and $n$, respectively. Your task is to return the median of the two sorted arrays.

The overall run time complexity should be $O(\log (m, n))$.

**Constraints:**

* `nums1.length` $==$ $m$

* `nums2.length` $==$ $n$

* $0 \leq m \leq 1000$

* $0 \leq n \leq 1000$

* $1 \leq m + n \leq 2000$

* $-10^5 \leq$ `nums1[i]`, `nums2[i]` $\leq 10^5$

# Examples

Try to solve the Median of Two Sorted Arrays problem.

Problem: Median of Two Sorted Arrays

Statement

Examples

Problem: Median of Two Sorted Arrays

Statement

Examples