Samsung

300+ posts

Last Updated: 05 December 2024

Given a BST, the task is to delete a node in this BST, which can be broken down into 3 scenarios:Case 1. Delete a Leaf Node in BST Case 2. D...read more

Amazon

Qualcomm

Samsung

Accolite

Binary Search Tree

DSA

Searching in Binary Search Tree (BST)

Last Updated: 25 September 2024

Given a BST, the task is to search a node in this BST. For searching a value in BST, consider it as a sorted array. Now we can easily perfor...read more

Last Updated: 20 December 2024

QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the ...read more

Similar Topics

DSA

22.3k+ articles

Experiences

16.9k+ articles

Interview Experiences

13.5k+ articles

Arrays

6.4k+ articles

On-Campus

3k+ articles

Amazon

1.8k+ articles

Internship

1.7k+ articles

Microsoft

790+ articles

Accolite

290+ articles

Flipkart

240+ articles

Topological Sorting

Last Updated: 23 July 2024

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

Convert Infix expression to Postfix expression

Last Updated: 06 December 2024

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., whe...read more

expression-evaluation

DSA

Heap Sort - Data Structures and Algorithms Tutorials

Last Updated: 02 January 2025

Heap sort is a comparison-based sorting technique based on Binary Heap Data Structure. It can be seen as an optimization over selection so...read more

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

Last Updated: 02 January 2025

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 g...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last Updated: 05 December 2024

Introduction to Prim's algorithm:We have discussedKruskal's algorithm for Minimum Spanning Tree. Like Kruskal's algorithm, Prim’s algorith...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 ass...read more

Detect Cycle in a Directed Graph

Last Updated: 13 December 2024

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

Longest Increasing Subsequence (LIS)

Last Updated: 03 December 2024

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 subseq...read more

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

Last Updated: 10 October 2024

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

Reverse a Linked List

Last Updated: 02 January 2025

Given a linked list, the task is to reverse the linked list by changing the links between nodes.Examples:Input: head: 1 - 2 - 3 - 4 - NULLOu...read more

Permutations of given String

Last Updated: 18 September 2024

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 numbe...read more

Maximum Subarray Sum - Kadane's Algorithm

Last Updated: 11 September 2024

Given an array arr[], the task is to find the subarray that has the maximum sum and return its sum.Examples:Input: arr[] = {2, 3, -8, 7, -1,...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>