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

Ace the JavaScript Coding Interview

This module teaches us the underlying patterns behind common coding interview questions. By learning these essential patterns, we'll be able to unpack and answer any problem the right way—just by assessing the problem statement. This approach was created by FAANG 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 an array of strings, `words`, and each element in the array has a length of two. You need to return the length of the longest palindrome that can be made by concatenating some elements from `words`.
If no palindrome can be made, return 0.

A **palindrome** is a sequence of characters that reads the same forward and backward.

**Constraints:**

- $1 \leq$ `words.length` $\leq 1000$
- `words[i].length` $= 2$
- Each word can be used at most once.
- `words` should only consist of lowercase English letters.

# Examples

Try to solve the Longest Palindrome by Concatenating Two-Letter Words problem.