Right rotate an array `k` times
In this post, we will see how to right-rotate an array by specified positions. For example, right rotating array { 1, 2, 3, 4, 5, 6, 7 } three times will result in array { 5, 6, 7, 1, 2, 3, 4 }.
Tag: Easy
Left rotate an array
In this post, we will see how to left-rotate an array by specified positions. For example, left-rotating array { 1, 2, 3, 4, 5 } twice results in array { 3, 4, 5, 1, 2 }.
Reverse a string using a stack data structure
This post will discuss how to reverse a string using the stack data structure in C/C++, Java, and Python using explicit stack and call stack.
Traverse a given directory using BFS and DFS in Java
This post will discuss how to traverse the given directory and list out all files present in it and all its sub-directories using BFS and DFS.
Find floor and ceil of a number in a sorted array (Recursive solution)
Given a sorted integer array, find the floor and ceiling of a given number in it. The floor and ceiling map the given number to the largest previous or the smallest following integer.
Find a pair with the given sum in a BST
Given a binary search tree, find a pair with a given sum present in it.
Compute the maximum number of nodes at any level in a binary tree
Given a binary tree, write an efficient algorithm to compute the maximum number of nodes in any level in the binary tree.
Invert Binary Tree – Iterative and Recursive Solution
Given a binary tree, write an efficient algorithm to invert it.
Convert min heap to max heap in linear time
Given an array representing a min-heap, convert it into a max-heap. The conversion should be done in-place and in linear time.
Find k’th smallest node in a BST
Given a BST and a positive number k, find the k’th smallest node in it.
Maximum Product Subset Problem
Given an integer array, find a subset in it having the maximum product of its elements.
Add binary representation of two integers
Given two integers, add their binary representation.