# LeetCode-Solutions | 🏋️ Python / Modern C++ Solutions of All 2719 LeetCode | Learning library

## kandi X-RAY | LeetCode-Solutions Summary

## kandi X-RAY | LeetCode-Solutions Summary

.

### Support

### Quality

### Security

### License

### Reuse

### Top functions reviewed by kandi - BETA

Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of LeetCode-Solutions

## LeetCode-Solutions Key Features

## LeetCode-Solutions Examples and Code Snippets

```
function evalRPN(tokens) {
let stack = [];
for (let n of tokens) {
// if operator function exists,
// execute it on the two most recent numbers
if (map[n]) {
let fn = map[n];
let y = stack.pop();
let x = stack.pop(
```

```
function f(x) {
if (x === null)
return 0;
var t = x.next;
var tn = f(t);
if (tn === n)
x.next = t.next;
return tn + 1;
}
```

```
function generateKey (str) {
let result = 1;
for (let i = 0, l = str.length; i < l; i++) {
let n = str[i].charCodeAt() - 'a'.charCodeAt() + 1;
result = result * (n*n + n + 41) % 2147483647;
}
return result;
}
```

## Community Discussions

Trending Discussions on LeetCode-Solutions

QUESTION

This is unique path problem from LeetCode https://leetcode.com/problems/unique-paths/.

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.

Here is the backtracking solution from tutorialcup https://www.tutorialcup.com/leetcode-solutions/unique-paths-leetcode-solution.htm

...ANSWER

Answered 2022-Jan-14 at 17:15I think there is m*n possibilities which is reduced by one in each recursive step.

No it is reduced by either *n* or *m* in each step. So:

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

## Vulnerabilities

No vulnerabilities reported

## Install LeetCode-Solutions

## Support

## Reuse Trending Solutions

Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items

Find more librariesStay Updated

Subscribe to our newsletter for trending solutions and developer bootcamps

Share this Page