These Advance algorithms are very common in Interviews even if we don’t ask about them directly. Dijkstra’s Algorithm: In a weighted graph, the shortest path is the one where the sum of the edges is the smallest. Dijkstra’s Algorithm is an algorithm that solves the Shortest Path Problem in a weighted graph…

Graph is a data structure design to show relationships between objects. Graph can be called Networks. The graph’s nodes called Vertices, and graph connection called Edges. The vertices and the edges contain data. Commonly the edges data is how strong a connection is. Edge’s data must represent some information about…

Abstract concepts and data structures… Sets: Set is an abstract data type. its data have no order and there are no repeated values. Examples of set base data structures are dictionaries (Maps), Graphs, etc… Lists: list is also an abstract data type. Its data have order and there can be repeated values…

The field of Data Structures is one of the most important fields in computer science. The basic of Data Structures are collection base DS(Data Structure) Collection are containers used to store data in order to access it and use it in the future. …

Binary Search: Binary Search is an algorithm based on sorted array. The flow of this algorithm is that: you repeatedly dividing in half the portion of the array. And check if the middle element of the initial array is bigger or smaller then your target element. if bigger, do the same to…