Hartalika Teej Festival on 30 August : Everything you need to know

-

Hartalika Teej also known as the Haryali (meaning greenery) Teej is the festival to welcome the monsoon season. It is celebrated primarily by girls and women, with songs, dances, and praying rituals.

On Hartalika Teej, people worship both Lord Shiva and Mother Parvati. It is thought that Mata Parvati observed this fast as well in order to obtain Lord Shankar. Women observe a Nirjala fast on this day to pray for the long life of their husbands, and unmarried girls observe a similar fast to seek out a nice husband.

Hartalika Teej has great importance in Hinduism. According to the Hindu calendar, Hartalika Teej is celebrated on the third day of Shukla Paksha of Bhadrapada. This time Hartalika Teej will be celebrated on Tuesday, 30 August 2022. On this day, women keep a fast for the long life of their husbands and girls also keep a fast on this day to get a good husband. It is believed that if women keep a fast on this day with a sincere heart, then they get good luck.

Hartalika Teej mythological significance (Hartalika Teej 2022 importance)



Actually, the holy festival of Hartalika Teej is celebrated for the reunion of Lord Shiva and Mother Parvati. According to a legend, Mata Parvati did severe penance to get Lord Bholenath as her husband. Mata Parvati did penance after being hungry and thirsty on the banks of the river Ganges in the Himalayas. Seeing this condition of Mother Parvati, her father Himalaya was very sad. One day Maharishi Narada came with a marriage proposal from Lord Vishnu to Parvati, but when Mother Parvati came to know about this, she started mourning.

On being asked by a friend, she told that she is doing a severe penance to get Lord Shiva as her husband. After this, on the advice of her friend, Mother Parvati went to the forest and got absorbed in the worship of Lord Shiva. During this, on the third day of Shukla Paksha in Bhadrapada, in Hasta Nakshatra, Mother Parvati constructed a Shivling from sand and awakened the night by being engrossed in the worship of Bholenath. Seeing the harsh penance of Mother Parvati, Lord Shiva appeared to her and accepted her as his wife as per the wishes of Parvati. Since then, for the wish of a good husband and the longevity of the husband, unmarried girls, and fortunate women observe a fast of Hartalika Teej and get blessings by worshiping Lord Shiva and Mother Parvati.

Hartalika Teej Shubh Muhurat 2022

The Tritiya Tithi of Shukla Paksha of Bhadrapada month will start from 03.20 pm on Monday, 29th August, and will last till 03.33 pm on the next day i.e. Tuesday, 30th August. On the day of Hartalika Teej, the auspicious time of worship will be from 06:05 in the morning to 08:38 in the morning and from 06:33 in the evening to 08:51 in the night.

To know more about Hartalika Teej click here.

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