Implement strstr function in Java
Write an efficient algorithm to implement the strstr function in Java, which returns the index of the first occurrence of a string in another string.
Tag: Recursive
Euclid’s Algorithm to find GCD of two numbers
Euclid’s algorithm (or Euclidean algorithm) is a method for efficiently finding the greatest common divisor (GCD) of two numbers. The GCD of two integers, X and Y, is the largest number that divides both X and Y without leaving a remainder.
Extended Euclidean Algorithm – C, C++, Java, and Python Implementation
The extended Euclidean algorithm is an extension to the Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout’s identity, i.e., integers x and y such that ax + by = gcd(a, b).
Reverse an array in C
In this post, we will see how to reverse an array in C in linear time.
List all files in a directory in Java using Guava and Apache Commons IO
This post will discuss how to list all files in a directory and all its subdirectories in Java with Guava and Apache Commons IO library.
Reverse a List in Java (In-place)
This post will discuss how to reverse a list in Java by modifying the list in-place. That means that the conversion should occur without using any auxiliary list by overwriting the existing elements of the specified list.
Reverse an array in Java
This post will discuss how to reverse an array in Java.
Reverse a String in Java in 10 different ways
This post will discuss how to reverse a string in Java in 10 different ways. For example, the reverse of “Techie Delight” is “thgileD eihceT”.
Recursive solution to reverse a String in Java
In this post, we will show we how to reverse a string in Java using recursion.
Find all increasing subsequences of an array
Given an integer array, find all distinct increasing subsequences of length two or more.
Count distinct permutations of an array that sums to a target
Given an array of distinct positive integers, find the total number of distinct permutations that add up to a given target, where each array element may be used any number of times.
Calculate sum of root to leaf digits in a binary tree
Given a binary tree, where each node stores a value between 0 and 9, calculate the sum of the numbers created by the paths from root to leaf.