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...

# Check if a given Binary Tree is SumTree

Write a function that returns true if the given Binary Tree is SumTree else false. A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes p...

# Convert a given Binary Tree to Doubly Linked List Set 2

Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL). The left and right pointers in nodes are to be used as previous and next pointers respectively in...

# Merge Sort

Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted ha...

# QuickSort

Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many di...

# Ugly Numbers

Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, &#x2026; shows the first 11 ugly numbers. By convent...

# Find if two rectangles overlap

Given two rectangles, find if the given two rectangles overlap or not. Note that a rectangle can be represented by two coordinates, top left and bottom right. So mai...

# Count Possible Decodings of a given Digit Sequence

Let 1 represent &#x2018;A&#x2019;, 2 represents &#x2018;B&#x2019;, etc. Given a digit sequence, count the number of possible decodings of the given digit sequence. ...

# QuickSort

Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many di...