This repo helps keep track about exercises, Jupyter Notebooks and projects from the Data Structures & Algorithms Nanodegree Program offered at Udacity.

Learning DSA - From 100DaysOfCode challenge to Placement Preparation:) [ C++]

All about Data Structures and Algorithms.

Comprehensive guide to Algorithms and Data Structures created by me to practice important concepts for technical interviews.

Understanding Big O Notation: A Comprehensive Guide to Time Complexity Analysis

Benchmark a given function for variable input sizes and find out its time complexity

⏱ TIME COMPLEXITY ANALYSIS ⏱ Use Python to analyze and answer questions about the texts and calls contained in the dataset. Then, perform run time analysis of the solution and determine its efficiency ⏱

Comparison of time complexities between different Sort (Bubble and Merge) and Search (Linear and Binary) algorithms

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. [2020]

My own Interviewbit solutions

The distance between two documents to be the angle between their word frequency vectors. The document distance problem is thus the problem of computing the distance between two given text documents.

Solution to the varied questions on CodingNinjas platform on data structures in JAVA.

This Repository contains the CodeForces contests problems analysis and it's one of the most optimized solutions.

Time and space complexity are terms used in computer science to analyze the efficiency of algorithms. Time Complexity measures the amount of time an algorithm takes to complete as a function of the input size. Space Complexity quantifies the amount of memory space an algorithm uses in relation to the input size.

C++ based sorting algorithm runtime generator that carries out different sorting operations on very large randomized datasets and records the time taken to complete the sort. University of the West Indies, STA, Computer Science, Data Structures and Algorithms Project.

Sorting algorithms & Big O - This project is the implementation of how to select the best sorting algorithm and how to select the best algorithm for a project.

CSCI570 Analysis of Algorithms Project: Sequence Alignment Problem

Numerical investigation into the distributional analysis of the time complexity of Euclid's algorithm. Sheds numerical light on an "obscure" constant related to a certain variance.