-
Check if a given circle lies completely inside the ring formed by two concentric circles in C++
-
Check if a given string is sum-string in C++
-
Check if a given tree graph is linear or not in C++
-
Check if a graph is strongly connected - Set 1 (Kosaraju using DFS) in C++
-
Check if a line touches or intersects a circle in C++
-
Check if a Matrix is Invertible in C++
-
Check if a number from every row can be selected such that xor of the numbers is greater than zero in C++
-
Check if a binary string contains all permutations of length k in C++
-
Check if a Binary Tree (not BST) has duplicate value in C++
-
Check if a Binary Tree contains duplicate subtrees of size 2 or more in C++
-
Check if a binary tree is sorted levelwise or not in C++
-
Check if a cell can be visited more than once in a String in C++
-
Check if a given array can represent Preorder Traversal of Binary Search Tree in C++
-
Check if a given matrix is Hankel or not in C++
-
Check if a given mobile number is fancy in C++
-
Check if a given number can be represented in given a no. of digits in any base in C++
-
Check if a given number divides the sum of the factorials of its digits in C++
-
Check if a given number is Pronic in C++
-
Check if a large number can be divided into two or more segments of equal sum in C++
-
Check if a large number is divisible by 13 or not in C++