Learn essential coding patterns to answer problems and prepare for tech companies' interviews.

Ace the Java Coding Interview

This module teaches us the underlying patterns behind common coding interview questions. By learning these essential patterns, we'll be able to assess the problem statement and unpack and answer any problem the right way. This approach was created by FAANG’s hiring managers to help us prepare for the typical rounds of interviews at major tech companies like Apple, Google, Meta, Microsoft, and Amazon.

By the end of this module, we'll have the skills we need to unlock even the most challenging questions, grok the coding interview, and level up our career with confidence.

Coding Interview Patterns

# Statement

Suppose you are given two strings. You need to find the length of the longest common subsequence between these two strings.

A **subsequence** is a string formed by removing some characters from the original string while maintaining the relative position of the remaining characters. For example, "abd" is a subsequence of "abcd", where the removed character is "c".

If there is no common subsequence, then return 0.

**Constraints:**

- $1 \leq$ `str1.length` $\leq 500$
- $1 \leq$ `str2.length` $\leq 500$
- `str1` and `str2` contain only lowercase English characters.

# Examples

Try to solve the Longest Common Subsequence problem.