Find Word without repeating character

Question

Find longest word without repeating characters in given sentence. E.g. Sanatana dharma is the oldest dharma in the world. Output :- oldest

Manas Mohapatra · Answer

Hi Imran Please find below code: string testVal = Sanatana dharma is the oldest dharma in the world; int topLength; List strList = new List (); // Looping over strings by splitting the whole string foreach (string temp in testVal.Split(new[]{' '} StringSplitOptions.RemoveEmptyEntries))) { topLength = 0; foreach (char tempChar in temp.ToCharArray()) { // Checking the character exists in string topLength = (from repeatChar in temp.ToCharArray() where repeatChar== tempChar select repeatChar).Count(); if (topLength > 1) { break; } } if (topLength == 1) { strList.Add(temp); } } // Getting string with maximum length string updatedVal = (from p in strList where p.Length == strList.Max(tempVal => tempVal.Length) select p).FirstOrDefault(); // Checking value null in case of empty string if (updatedVal == null) { Console.WriteLine(Sorry no value exist as you expected); } else { Console.WriteLine(The value is:  + updatedVal); }

Ramesh Maruthi · Answer

Hey Imran class Program { static void Main(string[] args) { string s = Sanatana dharma is the oldest dharma in the world; Program p = new Program(); string noduplicateandlongest= p.findLongestWord(s); Console.WriteLine(The longest word without duplicate value is {0} noduplicateandlongest); Console.ReadLine(); } public string findLongestWord(string big) { string[] split = big.Split(new[] { ' '} StringSplitOptions.RemoveEmptyEntries ); var lis = split.ToList(); List nodups = new List (); foreach(string s in lis) { char[] charr = s.ToCharArray(); bool val = charr.Distinct().Count() == charr.Length; if (val) { nodups.Add(s); } } var result = nodups.OrderByDescending(s => s.Length).FirstOrDefault(); return result; } }