Home » Topic

Algorithms

Home » Topic

Algorithms

Power of Four

Explain (n & (n-1)) == 0

Power of Two

x&(x-1) Explained

Calculate Rolling Hashcode for String

Optimized Brute Force String Search Algorithm

Naive Brute Force String Search Algorithm

Can Place Flowers

Remove duplicates from Sorted List 2

Isomorphic Strings

Kth Largest Element in a Stream

Number of 1 Bits

Valid Palindrome 2

Min Cost Climbing Stairs

Unique Email Addresses

Length of Last Word

Search Insert Position in sorted array

Remove Linked List Elements

Min Stack

Happy Number

Lowest Common Ancestor of a Binary Tree 4 - for array of nodes

Lowest Common Ancestor Definition

Lowest Common Ancestor of a Binary Tree 3 - Given Parent Pointer

Lowest Common Ancestor for a n-ary Tree

Lowest Common Ancestor of a Binary Tree 2 - Nodes may not exist in Tree

Replace Elements with Greatest Element on Right Side

Invert Binary Tree

First Unique Character in a String

Substring with Concatenation of All Words

Merge Two Binary Trees

Palindrome Linked List

Climbing Stairs - Take atmost 3 steps

Intersection of Two Sorted Arrays

Swap two number in place without temporary variables

Swap Kth node from beginning with Kth node from end in a Linked List

Subarray with sum divisible by k

Second largest element in binary search tree

Replace all occurrences of a pattern in a text by another string

Reverse a stack in place using recursion

Reverse the given Array without using built in function

Print all sub sequences of a given array

Pain Fence

Number of elements less than or equal to a given number in a given subarray

Minimum Number of Deletions Of a String

Minimum Distance Between Two Elements in an Array

Merge K Sorted Arrays

Maximum Product of Three Numbers

Maximum Pairwise Product 2 - Find pair with maximum product in array of Integers

Number of paths from source to destination in a directed acyclic graph

Shortest Unsorted Continuous Subarray