Search for a command to run...
Articles tagged with #problems
Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. Example 1: Input: s = "Let's take LeetCode contest" Output: "s'teL ekat edoCteeL tsetnoc" Example 2: Input: s ...
Constraints: The number of nodes in the tree is in the range [0, 100]. -100 <= Node.val <= 100 class Solution { public List<Integer> inorderTraversal(TreeNode root) { if(root==null)return new ArrayList<Integer>(); List<Integer>...
class Solution { public void rotate(int[][] matrix) { for (int col = 0; col < matrix[0].length; col++){ for (int row = 0; row < matrix.length/2; row++){ swap(matrix, row, col, matrix.length-row-1, col); ...
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 th...
Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] ```class Solution { public ListNode removeNthFromEnd(ListNode head, int n) { ...
You are given a string s and an array of strings words of the same length. Return all starting indices of substring(s) in s that is a concatenation of each word in words exactly once, in any order, and without any intervening characters. You can retu...
