obsidian/АиСД/Список задач.md

Line reflection

Longest Subarray of 1’s After Deleting One Element

Summary Ranges

String Compression

Zigzag Iterator

Valid Palindrome

One Edit Distance

Subarray Sum Equals K

Move Zeroes

Group Anagrams

Insert Delete GetRandom O(1)

LRU Cache

Generate Parentheses

Reverse Linked List

Permutation in String

Merge k Sorted Lists

Number of Recent Calls

Valid Parentheses

Max Consecutive Ones II

Maximize Distance to Closest Person

Design Hit Counter

Merge Intervals

Trapping Rain Water

Two Sum

Meeting Rooms II

Find All Anagrams in a String

Implement Rand10() Using Rand7()

Symmetric Tree

Longest Substring Without Repeating Characters

Validate Binary Search Tree

Number of Islands

Flatten Nested List Iterator

Consecutive Characters

Interval List Intersections

Implement Queue using Stacks

Add Two Numbers

Merge Sorted Array

Merge Two Sorted Lists

Max Consecutive Ones III

Longest Palindromic Substring

Jewels and Stones

Lowest Common Ancestor of a Binary Tree

Intersection of Two Arrays II

Missing Number

Evaluate Reverse Polish Notation

Median of Two Sorted Arrays

Simplify Path

Is Subsequence

Squares of a Sorted Array

Remove Nth Node From End of List

Perfect Squares

Max Stack

Lowest Common Ancestor of a Binary Tree III

Longest Substring with At Most Two Distinct Characters

Maximal Rectangle

Search in Rotated Sorted Array

Two Sum II – Input Array Is Sorted

Remove Duplicates from Sorted Array

Find Minimum in Rotated Sorted Array

Range Sum of BST

Partition Labels

Product of Array Except Self

Binary Tree Maximum Path Sum

Continuous Subarray Sum

Reverse Words in a String III

Add Strings

Palindrome Linked List

First Unique Character in a String