SDE - 1

You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.

A singly linked list is a linear data structure in which we can traverse only in one direction i.e. from Head to Tail. It consists of several nodes where each node contains some data and a reference to the next node.

Note:

• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.

A sample Linked List-

Given two sorted linked lists, list1, and list2, merge them to create a new sorted linked list that contains all the elements from both lists in ascending order.

Given an array nums of distinct integers and a target sum target, find all unique triplets in the array that add up to the target sum. Each triplet should be a list of three integers and should not contain duplicate triplets.

You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.

The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.

Note :

You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.

For example :

For the given binary tree

LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.

The Minimum Cost Path problem is a classic optimization problem in graph theory and dynamic programming. Given a 2D grid or matrix with non-negative integer weights assigned to each cell, the goal is to find the minimum cost path from the top-left cell to the bottom-right cell while moving only rightwards or downwards.
 

The Longest Increasing Subsequence (LIS) problem is a classic algorithmic problem where the goal is to find the length of the longest subsequence of a given array that is in strictly increasing order. A subsequence is a sequence that can be derived from the original array by deleting some elements without changing the order of the remaining elements.