Introduction

Data structure

Coding interviews. Problem-solving skills. Algorithm questions. What do you call the intersection of their Venn Diagram?

Hint: it starts with "data" and ends with "structures".

What Are Data Structures?

The elementary particles of algorithms, data structures are woven into the very fabric of computer science and are essential building blocks of many a solution to coding interview problems.

Sans the need for a microscope.

Complexity Analysis

Key Terms

• Complexity Analysis - The process of determining ow efficient an algorithm is. Complexity analysis usually involves finding both the time complexity and the space complexity of an algorithm.
  Complexity analysis is effectively used to determine how "good" an algorithm is and whether it's "batter" than another one.
• Time Complexity - A measure of how fast an algorithm runs, time complexity is a central concept in the field of algorithms and in coding interviews.
  it's expressed using Big O notation.
• Space Complexity - A measure of how much auxiliary memory an algorithm takes up. space complexity is a central concept in the field of algorithms an din coding interviews.