This repo helps keep track about exercises, Jupyter Notebooks and projects from the Data Structures & Algorithms Nanodegree Program offered at Udacity.
This ipynb contains a visualization to the time-complexity analysis - which function grows faster? Why we omit the constants, or why we take the highest degree?
Divide and Conquer technique is used to work out different problems of varyying natures. Our problem at hand is to efficiently search an integer value from grid of size n x n, where n is any integer, using the principles of divide and conquer. The grid has both it's rows as well as columns sorted in ascending order.
GREP is a command-line utility for searching plain-text data sets for lines that match a regular expression or simply a string. In this, I implemented GREP using Naive Search.
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]
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.
This repository will have solutions to problems asked in the interview. Each Problem has better as well as optimal approaches with their time and space complexities.
