Naveen Jetty

Longest String Chain

You are given an array of words where each word consists of lowercase English letters.

wordA is a predecessor of wordB if and only if we can insert exactly one letter anywhere in wordA without changing the order of the other characters to make it equal to wordB.

Delete Operation for Two Strings

Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same.

In one step, you can delete exactly one character in either string.

Maximum Erasure Value

You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.

Return the maximum score you can get by erasing exactly one subarray.

Maximum profile for Salesman traveling between 2 cities

You are a traveling salesperson who travels back and forth between two cities (A and B). 
You are given a pair of arrays (revA and revB) of length n.

Remove Zero Sum Consecutive Nodes from Linked List

Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.

After doing so, return the head of the final linked list. You may return any such…

Return List of Reverse Levels of Binary Tree

Given a binary tree, return the bottom-up level order traversal of its nodes’…

Diameter of the binary tree

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree…

Single Element in a Sorted Array

Given a sorted array consisting of only integers where every element appears twice except for one…

Stack Implementation using Linked List

I was trying to implement a stack. As we all know that a stack is a Last In First Out (LIFO)…