Summary
Keywords
Full Transcript
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem where we are required to create a string such that it contains the difference of ASCII of two consecutive characters. In this problem, 1. You are given a string that contains only lowercase and uppercase alphabets. 2. You have to form a string that contains the difference of ASCII values of every two consecutive characters between those characters. For "abecd", the answer should be "a1b3e-2c1d", as 'b'-'a' = 1 'e'-'b' = 3 'c'-'e' = -2 'd'-'c' = 1 To attempt and submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/string,-string-builder-and-arraylist/string-with-difference-of-every-two-consecutive-characters-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education
