fasashen/algorithms

Дрочево задач

Блок 1. Базовые задачи:

• https://leetcode.com/problems/reorder-list/ (решение)
• https://leetcode.com/problems/linked-list-cycle-ii/ (решение)
• https://leetcode.com/problems/linked-list-cycle/ (решение)
• https://leetcode.com/problems/merge-two-sorted-lists/ (решение)
• https://leetcode.com/problems/remove-nth-node-from-end-of-list/ (решение)
• https://leetcode.com/problems/middle-of-the-linked-list/ (решение)
• https://leetcode.com/problems/delete-node-in-a-linked-list/ (решение)
• https://leetcode.com/problems/palindrome-linked-list/ (решение)
• https://leetcode.com/problems/reverse-linked-list/ (решение)
• https://leetcode.com/problems/remove-linked-list-elements/ (решение)
• https://leetcode.com/problems/intersection-of-two-linked-lists/ (решение)
• https://leetcode.com/problems/sort-list/ (решение)

Блок 2

Математика

• https://leetcode.com/problems/fibonacci-number/ (решение)
• https://leetcode.com/problems/course-schedule/ (решение)
• https://leetcode.com/problems/course-schedule-ii/
• Вот 3 ссылки, чтобы понять условие задачи. Название задачи - Alien Dictionary. (https://www.geeksforgeeks.org/given-sorted-dictionary-find-precedence-characters/, https://medium.com/@dimko1/alien-dictionary-6cf2da24bf3c, https://zhuhan0.blogspot.com/2017/06/leetcode-269-alien-dictionary.html)

Интервалы

• https://leetcode.com/problems/non-overlapping-intervals/
• https://leetcode.com/problems/merge-intervals/
• https://leetcode.com/problems/insert-interval/

Массивы

• https://leetcode.com/problems/two-sum/
• https://leetcode.com/problems/3sum/
• https://leetcode.com/problems/subarray-sum-equals-k/

Блок 3. Деревья

• https://leetcode.com/problems/binary-tree-inorder-traversal/
• https://leetcode.com/problems/symmetric-tree/
• https://leetcode.com/problems/maximum-depth-of-binary-tree/
• https://leetcode.com/problems/same-tree/
• https://leetcode.com/problems/invert-binary-tree/
• https://leetcode.com/problems/path-sum/
• https://leetcode.com/problems/binary-tree-level-order-traversal/
• https://leetcode.com/problems/subtree-of-another-tree/
• https://leetcode.com/problems/kth-smallest-element-in-a-bst/
• https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
• https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
• Найти следующий узел в бинарном дереве поиска, если в дереве нет повторений и узел задан:

  struct TreeNode {
      TreeNode *parent;
      TreeNode *left;
      TreeNode *right;
  };
  
  TreeNode* inorderSuccessor(TreeNode* node) {
  };
  

• https://leetcode.com/problems/validate-binary-search-..
• https://leetcode.com/problems/binary-search-tree-iter..

Блок 4. Динамическое программирование

• https://stepik.org/lesson/13259/step/5?unit=3444
• https://leetcode.com/problems/climbing-stairs/
• https://leetcode.com/problems/coin-change/
• https://leetcode.com/problems/longest-increasing-subsequence/
• https://leetcode.com/problems/longest-common-subsequence/
• https://leetcode.com/problems/word-break/
• https://leetcode.com/problems/unique-paths/
• https://leetcode.com/problems/unique-paths-ii/
• https://leetcode.com/problems/jump-game/
• https://leetcode.com/problems/jump-game-ii/
• https://leetcode.com/problems/house-robber/
• https://leetcode.com/problems/house-robber-ii/
• https://leetcode.com/problems/decode-ways/
• https://leetcode.com/problems/coin-change-2/
• https://leetcode.com/problems/n-queens/
• https://leetcode.com/problems/n-queens-ii/