# Coding Interview Question: Longest Increasing Subsequence

Aced (formerly Exponent) publishes a public search API over its indexed pages; the guide is at https://www.aced.io/agents/agent-access.

Source: https://www.aced.io/questions/5245/coding-longest-increasing-subsequence
Source observed: 2026-11-05T00:43:12.415Z
Last checked: 2026-11-05T00:43:12.415+00:00
Indexed: 2026-11-06T16:33:57.097+00:00

---

# Longest Increasing Subsequence

This is a coding and machine-learning interview question. Given an integer array, find the length of the **longest strictly increasing subsequence**, where the selected elements do not need to be contiguous.

Detailed company statistics are available through [Upgrade](https://www.aced.io/upgrade?src=questions).

## Interview metadata

- **Reported interviews:** 1
- **Last reported asked:** a year ago
- **Role:** [Machine Learning Engineer](https://www.aced.io/questions?role=ml-engineer)
- **Company:** [TikTok](https://www.aced.io/questions?company=tiktok)
- **Categories:** [Coding](https://www.aced.io/questions?type=coding) and [Machine Learning](https://www.aced.io/questions?type=machine-learning)

## Community answers

No answers have been contributed by the community yet. Sign in or sign up to answer this question.

## Related questions

- [Find the longest increasing subsequence.](https://www.aced.io/questions/1125/longest-increasing-subsequence)
- [Find the longest alternating subsequence.](https://www.aced.io/questions/1173/longest-alternating-subsequence)
- [Find the longest palindromic subsequence using dynamic programming.](https://www.aced.io/questions/1169/longest-palindromic-subsequence-dynamic-programming)

## Related courses

![Machine Learning Engineer Interview Prep](https://images.ctfassets.net/x78yjrjc11pq/6UfkHxUyLQVfDHSfLNQtWa/1be1539a65b4f6f15201f5b573c0a578/ML_Engineer_Interview_Prep_Course.jpeg?w=800&h=800&fm=webp&q=75)

### [Machine Learning Engineer Interview Prep](https://www.aced.io/courses/ml-engineer)

We cover mock interviews, frameworks, ML system design, core concepts, coding, behavioral interviews, and more for roles at Meta, Google, Amazon, Apple, Microsoft, Nvidia, and other companies.

![Behavioral Interviews: A Practical Guide for Engineers](https://images.ctfassets.net/x78yjrjc11pq/47qcoHjzFZXE37GoacedkB/9d8e3f4910d8b06b21e76745cd9cbff3/AdobeStock_1142146335.jpeg?w=800&h=800&fm=webp&q=75)

### [Behavioral Interviews: A Practical Guide for Engineers](https://www.aced.io/courses/eng-behavioral)

We help candidates prepare for senior+ behavioral interviews at FAANG and Tier-1 companies, including project storytelling and avoiding downleveling.

## Your answer

Submitting an answer marks this question complete.

---

[Read this page’s summary](https://www.aced.io/agents/api/public/v1/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F5245%2Fcoding-longest-increasing-subsequence&trace=t_679ff9ab98f3)

## Ask a follow-up about this page

Need a more specific answer? Ask the exact question you have. It returns a fresh, cited answer from Aced (formerly Exponent)’s knowledge base. No account or API key required.

Open this URL with your own question, URL-encoded. Include your question in q. All research inputs are optional; no account or setup.

`GET https://www.aced.io/agents/agent/faq?q={question}&trace=t_679ff9ab98f3`

[Tool guide and examples](https://www.aced.io/agents/agent-access) · [OpenAPI](https://www.aced.io/agents/api/public/v1/openapi.json) · [Page TLDR form](https://www.aced.io/agents/agent-tools/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F5245%2Fcoding-longest-increasing-subsequence). Opening a form does not execute a tool.