Detect Loop in a Linked List | And Remove Loop
Given the head pointer of a linked list, check if there’s a loop in the linked list. Proof of Floyd’s Cycle-Finding Algorithm.
Category: Interview Questions
Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question
Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.
Stock Buy Sell Maximum Profit Solution
The cost of a stock on each day is given in an array. Each day, you can either buy one share, sell any number of shares that you own, or not make any transaction at all.
Find maximum of all subarrays of size k
Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k.
Lowest Common Ancestor in a Binary Tree in C++
The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants.
Best Time to Buy and Sell Stock [Interview Question]
You are given an array prices where prices[i] is the price of a given stock on the ith day. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Find the minimum distance to travel through a road having hills [Interview Question]
Logan has to travel through a road having hills of different heights. Also each hill has a cave to pass through it, to avoid travelling extra distance of a hill. Logan wants to travel through this road by taking at most K caves.
Edit Distance – LeetCode Solution [Hard]
Given two strings word1 and word2 (in lowercase alphabets), return the minimum number of operations required to convert word1 to word2.
Given a sorted Alien dictionary, find order of characters
In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.
Stock Span Problem – LeetCode Solution [Medium]
The stock span problem is a financial problem defined as the maximum number of consecutive days (starting from today and going backward)