Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# Given a string, find its first non-repeating character

Given a string, find the first non-repeating character in it. For example, if the input string is &#x201C;GeeksforGeeks&#x201D;, then output should be &#x2018;f&#x2...

# Write a function to get the intersection point of two Linked Lists.

There are two singly linked lists in a system. By some programming error, the end node of one of the linked list got linked to the second list, forming an inverted Y...

# Sort a linked list of 0s, 1s and 2s

Given a linked list of 0s, 1s and 2s, sort it. Source: Microsoft Interview | Set 1 Recommended: Please solve it on &#x201C;PRACTICE&#x201D; first, before moving on t...

# Write a Program to Find the Maximum Depth or Height of a Tree

Given a binary tree, find height of it. Height of empty tree is 0 and height of below tree is 3. Example Tree Recommended: Please solve it on &#x201C;PRACTICE&#x20...

# A program to check if a binary tree is BST or not

A binary search tree (BST) is a node based binary tree data structure which has the following properties. &#x2022; The left subtree of a node contains only nodes with...

# AVL Tree Set 1 (Insertion)

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. An Examp...

# AVL Tree Set 2 (Deletion)

We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion. Steps to follow for deletion. To make sure that t...

# Activity Selection Problem Greedy Algo-1

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy...

# Rat in a Maze Backtracking-2

We have discussed Backtracking and Knight&#x2019;s tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be solved using Backtracki...

# Write a program to calculate pow(x,n)

Given two integers x and n, write a function to compute xn. We may assume that x and n are small and overflow doesn&#x2019;t happen. Examples : Input : x = 2, n = ...