# GeetCode Hub

### Medium

#### 49. Group Anagrams

Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the orig

### Medium

#### 50. Pow(x, n)

Implement pow(x, n), which calculates x raised to the power n (i.e., xn). &nbsp; Example 1: Input: x = 2.000

### Hard

#### 51. N-Queens

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You may retu

### Hard

#### 52. N-Queens II

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return the number of distinct solutions to the&nbsp;n-queens puzzle</em

### Easy

#### 53. Maximum Subarray

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. &nbsp; Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output:</stron

### Medium

#### 54. Spiral Matrix

Given an m x n matrix, return all elements of the matrix in spiral order. &nbsp; Example 1: <img alt="" src="https://raw.githubusercontent.com/sumitc91/GeetCodeImage/master/Images/54-spiral1.jpg" style="w

### Medium

#### 55. Jump Game

Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. &nbs

### Medium

#### 56. Merge Intervals

Given an array&nbsp;of intervals&nbsp;where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. &nbsp; Exampl

### Medium

#### 57. Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. &nbsp; Example 1: Input: in

### Easy

#### 58. Length of Last Word

Given a string s consists of some words separated by spaces, return the length of the last word&nbsp;in the string. If the last word does not exist, return 0. A word is a maximal substring consisting&nbsp;of non-space characters only.</p

### Medium

#### 59. Spiral Matrix II

Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order. &nbsp; Example 1: <img alt="" src="https://raw.githubusercontent.com/sumitc91/Gee

### Hard

#### 60. Permutation Sequence

The set [1, 2, 3, ...,&nbsp;n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following sequence for n = 3: &quot;123&quot; &quot;132&quot;<