Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 505d9c6

Browse files
Format definition
1 parent f413955 commit 505d9c6

File tree

1 file changed

+2
-2
lines changed
  • lib/src/medium/516.longest_palindromic_subsequence

1 file changed

+2
-2
lines changed

‎lib/src/medium/516.longest_palindromic_subsequence/problem.txt‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@
22
https://leetcode.com/problems/longest-palindromic-subsequence/
33

44
Given a string s, find the longest palindromic subsequence's length in s.
5-
6-
A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
5+
A subsequence is a sequence that can be derived from another sequence by
6+
deleting some or no elements without changing the order of the remaining elements.
77

88

99
Example 1:

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /