DATA STRUCTURES AND ALGORITHMS
DATA STRUCTURES AND ALGORITHMS
A data structure is a named location that can be used to store and organize data. And, an algorithm is a collection of steps to solve a particular problem.
PROGRAMMING FUNDAMENTALS
Programming involves activities such as analysis, developing understanding, generating algorithms, verification of requirements of algorithms.
Read more
ARRAYS
This is the one of most important data structure that is generally easy to understand but algorithms and concepts of this topic can be very tricky and it is asked in almost every tech company. Algorithms such as Binary Search, Sorting, Maximum Subarra...
Read more
TIME AND SPACE COMPLEXITY
It helps us to compare the algorithms on the basis of Time and Space it takes to run the code and help us to master how to write codes by considering constraints of the problem.
Read more
LINKED LISTS
In this topic we learn how to store data in a non-contiguous manner and we understand how the Linked List can work in a better time complexity that other data structures in some operations.
Read more
GRAPHS
The most popular data structures in companies like Direct-i, Google, and Arcesium etc. It is usually considered tough because of the dependency on other data strucutres such as queue, hashmaps, sets, and heap etc. but once you get a taste of how to ap...
Read more
QUEUE
This data structure works just like a normal queue does and it is mainly used as a helping data structure in Trees and Graphs.
Read more
DIVIDE AND CONQUER ALGORITHMS
Divide: This involves dividing the problem into smaller sub-problems. ; Conquer: Solve sub-problems by calling recursively until solved.
Read more
TRIES
It helps us to search in constant time and incase you want to use auto suggestions features of Amazon, Flipkart or other sites search bar this is the solution.
Read more
DYNAMIC PROGRAMMING
The most important concepts of DP are Knapsack, Optimal Game strategy, and solving string problems using 2D storage there by improving their complexities multiple folds.
Read more
HASHMAPS
It helps us to understand how we can store, update and delete the data in constant time. It is majorly used in Dynamic Programming and Graphs to help us make the time complexities of the algorithms better.
Read more
GREEDY ALGORITHMS
This is where you learn how being greedy can benefit you to solve certain problems in a faster way. The main point of focus here is to understand where we can apply Greedy over Dynamic Programming.
Read more
HEAPS | PRIORITY QUEUE
This data structures helps you to understand how the infinite stream of data coming can be accessed to fetch the useful information, for example, find the most sold products on any website?
Read more
BINARY SEARCH TREES
In this data structure, we learn how to store data in a hierarchical format. It is one of the most important topic from Interview point of view and questions from this topic is frequently asked in companies such as Amazon, Microsoft, Flipkart and Goog...
Read more
BINARY TREES
In this data structure, we learn how to store data in a hierarchical format. It is one of the most important topic from Interview point of view and questions from this topic is frequently asked in companies such as Amazon, Microsoft, Flipkart and Goog...
Read more
DISJOINT SETS
Disjoint sets are sets that have no common elements. Their intersection will always result in a null set or an empty set.
Read more
STACK
It follows the principle of Last In and First Out, although this data structure can be easily understood but the concept of LIFO can be used to solve some typical problems such as Histogram Area, Stock Span, and Balanced Parentheses etc.
Read more
VECTORS
A vector is a sequence container class that implements dynamic array, means size automatically changes when appending elements.
Read more
RECURSION
Inorder to understand Recursion we must understand Recursion, so this is what is focused here i.e. write codes using Recursion. It is used in Dynamic Programming and as well as in data structure such as Trees, Graphs, and Heap etc.
Read more
POINTERS
This most important topic to understand in order to move towards the advanced data structures, it is just like another datatype to help store address of memory we create to store data.
Read more
FUNCTIONS AND BITMASKING
In this section, you will learn to write code in a modular way to help you reuse the code in different C++ files and make it more readable and organized.
Read more
STRING ALGORITHMS
Strings are considered a data type in general and are typically represented as arrays of bytes (or words) that store a sequence of characters. Strings are defined as an array of characters.
Read more
OOPS
One of the most important topic to build data structures, this is not only used in every data structure but also help us to understand how to associate the real world with programming language.
Read more
Library
WEB DEVELOPMENT
FAANG QUESTIONS