Email ID: sanmishetty21@gmail.com
This repository contains the code for three questions as part of the LoveLocal round 1 assignment.
[Question 1] Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only.
[Question 2 ] Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.
[Question 3 ] You are given a string s. You can convert s to a palindrome by adding characters in front of it. Return the shortest palindrome you can find by performing this transformation
Thank you!