ishika22

**Problem Description** We need to find the majority element if it exists in an array. Majority element is an element which occurs for more than n/2 times in an array...

**Problem Description** To find diameter of the binary tree in O(n) time complexity. The diameter of a tree is the number of nodes on the longest path between two end...

N Queen Problem Backtracking

8

## 🚀 Feature We need to place N chess queens on an N×N chessboard so that no two queens attack each other. ### Have you read the Contribution Guidelines? Yes...

Vertical Traversal of Binary tree

8

## 🚀 Feature We will be printing a binary tree in vertical order. Input:  **Output**: 4,2,1,5,3,6 **Explanation**: As we can see there are 5 vertical lines which can pass...

Floyd's alogorithm

7

## 🚀 Feature This algorithm helps us to detect and remove cycles from a linked list ### Have you read the Contribution Guidelines? Yes ## Pitch This can be obtained...