# Competent

• Balanced trees
• Advanced algorithms complexity (calculation, deep understanding)
• Divide and conquer method(recursive, recurrence)
• Searching strings algorithms (The Knuth-Morris-Pratt algorithm)
• String searching tries
• Regular Expressions implementation using Nondeterministic finite-state automata
• Mutithreading algorithms(sort)
• Graphs basic (therms understanding, directed, undirected,breadth-search and depth-search algorithms)

---

# Balanced trees

---

# Advanced algorithms complexity (calculation, deep understanding)

---

# Divide and conquer method(recursive, recurrence)

---

# Searching strings algorithms (The Knuth-Morris-Pratt algorithm)

---

# String searching tries

---

# Regular Expressions implementation using Nondeterministic finite-state automata

---

# Mutithreading algorithms(sort)

---

# Graphs basic (therms understanding, directed, undirected, breadth-search and depth-search algorithms)