Legend of Narcissism

-

 Legend of Narcissism



Long ago, there was a nymph named Echo, who was a favored servant of Artemis, the Greek goddess of the hunt. Echo loved to talk to anyone and everyone, and often Zeus would use her to distract his wife Hera so he could sneak down from Mt. Olympus and entertain himself with the women of Earth. Eventually, Hera realized what was happening, and in her anger, she cursed Echo so that the nymph could no longer speak any words of her own. Morose at her loss, Echo wandered the lands, only able to repeat what others had said.

One day on her travels, she encountered a young man who was very beautiful to behold. She longed to tell him how she felt, but unless he spoke to her first, she could only follow him in silence. Eventually, the man heard the sound of her footsteps, and he called out, 'Who's there?' Echo repeated his words, and again he tried, 'Why do you run from me?', but again she could only repeat what he had said. One more time he spoke, 'Let us meet here together.' Overjoyed at his invitation, Echo leaped from the woods to embrace him, but as soon as he saw whom he had been talking to, the young man rejected her.

Never would she have him or his love, he said before running away. The heartbroken nymph was again alone, and as she grieved she withered away until eventually, all that was left was her voice. Artemis was furious at the callousness with which the young man had treated the nymph, and so she cursed him that he might know the same pain he had so casually inflicted. The young man soon came upon a still pool, and as he bent down to take a drink, he gazed upon a handsome man. He reached out to his newfound love, but no matter how he tried, he could not manage to touch him. His mind cleared then, and he realized that he had fallen deeply, irrevocably in love with his own reflection in the water.

With a cry of anguish, the young man pulled out his knife and stabbed himself in the heart, and he bled out as he looked at himself. Where his blood touched the shore, flowers sprang up, flowers that even today share that young man's name. Narcissus.

Comments

Post a Comment

Popular posts from this blog

Multiply Strings Leetcode 43 question Correct Solution

-
 Question : Given two non-negative integers  num1  and  num2  represented as strings, return the product of  num1  and  num2 , also described as a string. Note:  You must not use any built-in BigInteger library or directly convert the inputs to integers. Constraints: 1 <= num1.length, num2.length <= 200 num1  and  num2  consist of digits only. Both  num1  and  num2  do not contain any leading zero, except the number  0  itself. /**  * @param {string} num1  * @param {string} num2  * @return {string}  */ var add = function ( a , b ){     // length of a should be smaller     if ( a . length > b . length ) return add ( b , a );     // iterate a     let i = a . length - 1 , j = b . length - 1 , carry = 0 , currAns = '' ;     while ( i >= 0 ){         // get nums        ...
Read more

In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute.

-
Image
Q1 (12 points) In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute. On the answer sheet, enter the values for nij, i = 1, 2, 3, j = 1, 2, 3, 4. Q1. Solution: Aim: Each entry denotes the largest integer n such that f(n) milliseconds do not exceed t. FIRST ROW........................................... i) Solving n11 :   Here , f(n) = 100n + 200 And t = 1 second. so,    where n is an integer   : [t = 1second = 1000ms]  Ans:  ii) Solving n12 Here , f(n) = 100n + 200 And t = 1minute = 60sec = 60000ms Ans :  iii) Solving n13 Here , ...
Read more

Longest Palindromic Substring Solution

-
Image
 Question:  Given a string  s , return  the longest palindromic substring  in  s . Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Solution : Let us create a Table. If the string size is n, then the table will have n rows and n columns. The element a(i, j) of the table will determine whether the substring from index i to j is a palindrome or not. So in this way, we will calculate the maximum length of the palindromic substring.  Now to fill this table we will use the following algorithm:  STEP 1: Create a Table, Where the Row index is the start of the palindrome substring and the column index is the end of the palindromic substring. STEP 2:  Fill the diagonal of the table with 1. Because (i, i) is itself a palindrome of length 1. STEP 3: Fill (i, i+1) by checking adjacent characters. If they are equal then 1, else 0. STEP 4: For every Distance other su...
Read more