1509. Minimum Difference Between Largest and Smallest Value in Three Moves
You are given an integer array nums. In one move, you can choose one element of nums and change it to any value. Return the […]
Remove all occurences of duplicates in a linked list
Given a sorted linked list, delete all nodes that have duplicate numbers (all occurrences), leaving only numbers that appear once
350. Intersection of Two Arrays II
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as
linked list of strings forms a palindrome
Given a linked list with string data, check whether the combined string formed is palindrome. If the combined string is
1550. Three Consecutive Odds
Given an integer array arr, return true if there are three consecutive odd numbers in the array. Otherwise, return false. Example 1: Input: arr
Make Binary Tree From Linked List
Given a Linked List Representation of Complete Binary Tree. The task is to construct the Binary tree and print the
1579. Remove Max Number of Edges to Keep Graph Fully Traversable
Alice and Bob have an undirected graph of n nodes and three types of edges: Type 1: Can be traversed by Alice
Delete node in Doubly Linked List
Given a doubly Linked list and a position. The task is to delete a node from a given position (position starts from 1) in
Identical Linked Lists
Given the two singly Linked Lists respectively. The task is to check whether two linked lists are identical or not. Two Linked Lists are identical
2192. All Ancestors of a Node in a Directed Acyclic Graph
You are given a positive integer n representing the number of nodes of a Directed Acyclic Graph (DAG). The nodes are numbered from 0 to n –
2285. Maximum Total Importance of Roads
You are given an integer n denoting the number of cities in a country. The cities are numbered from 0 to n – 1. You
The Palindrome Pattern
Given a two-dimensional integer array arr of dimensions n x n, consisting solely of zeros and ones, identify the row or column (using