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-

You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.

For example

For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
    1
   / \
  2   3
     / \
    4   5

Output: 1 3 2 4 5

Given a linked list having two pointers in each node. The first one points to the next node of the list, however, the other pointer is random and can point to any node of the list or null. The task is to create a deep copy of the given linked list and return its head. We will validate whether the linked list is a copy of the original linked list or not.

A deep copy of a Linked List means we do not copy the references of the nodes of the original Linked List rather for each node in the original Linked List, a new node is created.

For example,

Random pointers are shown in red and next pointers in black.

Multithreading Concepts? How thread works in java?
Difference in sleep() and wait().
Print even odd using two threads. What is synchronization Block & why it is used?

Introduction of all my projects.
What is serialization and deserialization in Java?
Deep go through all the projects and technology used in projects Challenges you have faced and how did you overcome?
Difference between Encoding and Encryption?
SQL Queries

Why you want to join Paytm?

Salary expectations