Bubble Sort

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

Time and Space Complexity

The space complexity for Bubble Sort is O(1), because only a single additional memory space is required i.e. for temp variable. Also, the best case time complexity will be O(n), it is when the list is already sorted.

Bot Saves Princess 1

Bot saves princess 1 - Output all moves to reach princess

Bot Saves Princess 2

Bot saves princess 2 - Output next move to reach princess

Tic Tac Toe

Tic Tac Toe - Ouput next move in game of Tic Tac Toe

Reverse Integer

Given a signed 32-bit integer x, return x with its digits reversed.

ZigZag string

P A H N A P L S I I G Y I R

Longest Palindrome

Given a string s, return the longest palindromic substring in s.