# recursion

## Pow(x n) LeetCode Solution

Implement pow(x, n), which calculates x raised to the power n.

## Wildcard Matching LeetCode Solution

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any single character.’*’ Matches any sequence of characters (including the empty sequence).The matching should cover the entire input string.

## Swap Nodes in Pairs LeetCode Solution

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list’s nodes.

## Difference Between Recursion and Iteration

Here, We will learn about recursion, iteration, differences between recursion and iteration and their code in java. Recursion Recursion is a technique in which function calls itself until a base condition is satisfied. A recursive method solves a problem by calling a copy of itself to work on a smaller problem Example Recursion Code in …

## Recursive Algorithms

Here, We will learn about recursive algorithm, recursion, recursive function, implementation, properties and examples of recursion. Recursive Algorithms: A Recursive Algorithm that calls itself repeatedly until a base condition is satisfied. Recursion is a technique in which function calls itself. A recursive method that solves a problem by calling a copy of itself to work …