ViewTube

Given a weighted Directed Acyclic Graph (DAG) with V vertices numbered from 0 to V - 1, represented by edges[][], where edges[i] ...

Given two arrays a[] and b[] of size n and m respectively, find the minimum insertions and deletions on the array a[], required to ...

You are given an integer array nums. Return the length of the longest subsequence in nums whose bitwise XOR is non-zero.

Given two arrays pre[] and preMirror[] of size n containing unique elements, where pre[] represents the preorder traversal of a full ...

Given an array arr[ ] consisting of distinct integers, check if the given array can represent preorder traversal of a BST.