Samsung

330+ posts

Similar Topics

DSA

21k+ articles

Experiences

12k+ articles

Interview Experiences

11.1k+ articles

Arrays

6.4k+ articles

On-Campus

3.3k+ articles

Amazon

1.8k+ articles

Internship

1.6k+ articles

Microsoft

820+ articles

Accolite

310+ articles

Flipkart

230+ articles

Topological Sorting

Last Updated: 29 November 2023

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u-v, vertex u comes before v in the ordering.Note: ...read more

Convert Infix expression to Postfix expression

Last Updated: 20 November 2023

Write a program to convert an Infix expression to Postfix form.Infix expression: The expression of the form "a operator b" (a + b) i.e., when an operator is in-between eve...read more

expression-evaluation

DSA

Heap Sort - Data Structures and Algorithms Tutorials

Last Updated: 25 July 2023

Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and plac...read more

How to find Shortest Paths from Source to all Vertices using Dijkstra's Algorithm

Last Updated: 23 November 2023

Given a weighted graph and a source vertex in the graph, find the shortest paths from the source to all the other vertices in the given graph.Note: The given graph does no...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last Updated: 04 December 2023

Introduction to Prim's algorithm:We have discussed Kruskal's algorithm for Minimum Spanning Tree. Like Kruskal's algorithm, Prim’s algorithm is also a Greedy algorithm. Th...read more

Amazon

Minimum Spanning Tree

Huffman Coding | Greedy Algo-3

Last Updated: 11 September 2023

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the fr...read more

Detect Cycle in a Directed Graph

Last Updated: 06 November 2023

Given the root of a Directed graph, The task is to check whether the graph contains a cycle or not.Examples:Input: N = 4, E = 6 Output: YesExplanation: The diagram clearly...read more

Longest Increasing Subsequence (LIS)

Last Updated: 27 September 2023

Given an array arr[] of size N, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subsequence in which the elements of ...read more

Level Order Traversal (Breadth First Search or BFS) of Binary Tree

Last Updated: 05 June 2023

Level Order Traversal technique is defined as a method to traverse a Tree such that all nodes present in the same level are traversed completely before traversing the next...read more

Reverse a Linked List

Last Updated: 21 November 2022

Given a pointer to the head node of a linked list, the task is to reverse the linked list. We need to reverse the list by changing the links between nodes.Examples:Input: ...read more

Permutations of given String

Last Updated: 18 October 2023

Given a string S, the task is to write a program to print all permutations of a given string.A permutation also called an "arrangement number" or "order," is a rearrangeme...read more

Largest Sum Contiguous Subarray (Kadane's Algorithm)

Last Updated: 04 December 2023

Given an array arr[] of size N. The task is to find the sum of the contiguous subarray within a arr[] with the largest sum. Recommended PracticeSave Your LifeTry It!The i...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>