SDE - 1

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

You are given a Singly Linked List of integers. You have to find the N-th node from end.

For Example

If the given list is (1 -> -2 -> 0 -> 4) and N=2:

Then the 2nd node from the end is 0.

Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order.

Example:

Input:

Output: 2 35 2 10 2

Print the following pattern for the given N number of rows.

Pattern for N = 4

1
11
121
1221

Reverse the given string word-wise. The last word in the given string should come at 1st place, the last-second word at 2nd place, and so on. Individual words should remain as it is.

What is DBMS , Normalisation ,SQL Query?

Discussion on Project from Start to end