Эта коллекция алгоритмов и структур данных и Вопросов со интервью c ответами. Этот репозиторий состоит с моих решений для алгоритмических задач и реализации структур данных на языке Java. Я создал этот репозиторий для изучения алгоритмов. И буду заполнять ее решениями постоянно.
На данный момент уже выложено решения более 300 алгоритмических проблем, так-же реализация популярных алгоритмов и структур данных
Тут вопросы разделены по уровню сложности:
- Rotate Array
- Contains Duplicate
- Find Peak Element
- Maximum Subarray
- Kth Largest Element in an Array
- Find All Duplicates in an Array
- Longest Increasing Subsequence
- Rotate Image, matrix
- Shuffle an Array
- Find Min in Rotated Array
- Search in Rotated Array
- Singly Linked List Implementation
- Doubly Linked List Implementation
- Delete Node in a Linked List
- Palindrome Linked List
- Reverse Linked List
- Intersection of Two Linked Lists
- Linked List Cycle
- Remove Nth Node From End of List
- Merge Sort List
- Find Linked List Cycle
- Merge k Sorted Lists
And many other Linked list problems
- Binary Tree Level Order Traversal
- Sum of Left Leaves
- Invert Binary Tree
- Binary Search Tree Iterator
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Flatten Binary Tree to Linked List
- Symmetric Tree
- Binary Tree Inorder Traversal
- Same Tree
- Maximum Depth of Binary Tree
- Balanced Binary Tree
- Minimum Depth of Binary Tree
- Sorted List to Balanced Binary Search Tree
- Validate Binary Search Tree
- Sorted List to Balanced BST
- Kth Smallest Element in a BST
- Binary Tree Zigzag Level Order Traversal
- Delete Node in a BST
- Lowest Common Ancestor of BST
- Binary Tree Left Side View
- Binary Tree Right Side View
- Mode in BST
- Most Frequent Subtree Sum
- Find Largest Element in Each Row
- Serialize and Deserialize BT
And many other tree problems
- Integer Break
- Reverse Bits
- Palindrome Number
- Math.pow
- Jug and Water Problem
- Sieve of Eratosthenes
- Fermat's primality
- Evaluate Reverse Polish Notation
- Fibonacci Numbers
- Word Break
- Subset Sum
- 0/1 Knapsack Problem
- Shortest Palindrome (KMP)
- Minimum Square Sum
- Maximum weight transformation of a String
- Coin Change
- Bubble Sort
- Insertion Sort
- Selection Sort
- Counting Sort
- Binary Search , Lower & Upper Bounds
- MergeSort
- QuickSort
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Prim's Minimum Spanning Tree (MST)
- KrusKal's Minimum Spanning Tree (MST)
- Topological Sorting
- Shortest Path Dijsktra
- Shortest Path Bellman-Ford
- A* Heuristic Path Finding
- Is Graph Bipartite
- Is Graph Connected
- Cycle Detection
- Undirected Graph Bridge Detection
- Rabin Karp Subsequence search
- Ransom Note
- Reverse String
- Longest Common Prefix
- Is Anagram
- Needle and Haystack
- Word Break
- Meta Strings
- Binary Search Tree (recursive)
- Binary Search Tree (iterative)
- AVL Tree
- Trie (Prefix tree)
- Hashed Array Tree
- LRU Cache
Нашел ошибку? Или ты умеешь лучше чем я? Сделай пулл реквест?