# Tag: Competitive Programming

# Lecture Notes | Advanced Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

Source: Lecture Notes | Advanced Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

# Amortized Analysis by Prof. Charles E. Leiserson

Source: lec13.pdf

# Princeton COS 423 Analysis of Algorithms Lectures

Source: Princeton COS 423 Analysis of Algorithms Lectures

# Splay Trees

Source: Splay Trees

# Mustafa Qamar-ud-Din shared an answer on Quora with you

What is the best strategy to improve my skills in competitive programming in 2-3 months? by Sachin Gupta https://www.quora.com/What-is-the-best-strategy-to-improve-my-skills-in-competitive-programming-in-2-3-months/answer/Sachin-Gupta-6?srid=GwvE&share=81f94ec2

# AVL Trees

In the previous article we’ve reviewed Randomized Binary Search Trees. Today we are going to review the implementation of AVL Trees. They must be the first type of Balanced Binary Search Trees. They were invented by two Soviet inventors, G. M. Adelson-Velskii and E. M. Landis in 1962. There are plenty of AVL trees implementations,… Continue reading AVL Trees

# Lecture – 12 AVL Trees – YouTube

# Algorithm Gym :: Data structures – Codeforces

Source: Algorithm Gym :: Data structures – Codeforces

# Algorithm Gym :: Everything About Segment Trees – Codeforces

Source: Algorithm Gym :: Everything About Segment Trees – Codeforces