In computer science, a data structure is a way to store and organize data. During the computer programming process, identifying and using the appropriate data structure is an important task as it can improve the overall efficiency of the algorithm. In large-scale systems, choosing the most suitable data structure directly impacts the difficulty of program design and the final quality and performance.
As of now, the repository contains 3 main directories: Bookmarks, Data Structures and Algorithms.
Contains all data structure questions categorized into sub-directories like stack, queue, etc. according to their type.
- Array
- Dictionary
- Binary Search Tree
- Linked List
- Stack
- Queue
- Graphs
- Circular Linked List
- Doubly Linked List
This directory contains various types of algorithm questions like Dynamic Programming, Sorting, Greedy, etc. The current structure of this directory is:
You can find useful links in this repository in the different markdown files. Below is a table of contents.