Skip to main content

what exactly the happiness is and how to get it ?

 Happiness is a CHOICE. Happiness is not a happenstance, it is not something that if the right stars move into the right alignment then boom we will be happy, it’s not a case of meeting the right girl/boy, it’s not a case of whether we get the promotion or anything external to us.



If we look around the world, we see a mass of humanity all searching for the same thing – happiness. A human being seems to need to pursue happiness as though it is a life necessity, like air, or water etc. In fact, most of society is based on catering for this human drive. We search for it in food – looking for new and exciting taste sensations; clothes – trying to find that outfit that brings out the best in us; relationships, music, art, success, money, spiritual experiences and popularity etc. We hope by fulfilling our needs, wants, desires or even whims we will attain this ultimate goal called happiness.

Happiness is NEVER dependant on other people.We may have people in our lives that are extremely challenging and frustrate us immensely – but they are not the ones that decide whether we are happy or not. People maybe placed in our lives to help us work on our inter-personal relationships. If we can use challenging people and situations as a springboard for developing ourselves into better people and bettering our personal character traits (such as patience, unconditional love, assertiveness etc) then we will be happy to have had the opportunity to meet these difficult people – because they would have helped make us into better people. 

Developing the inner feeling of happiness is completely up to us. Other people cannot be the determiners of whether we are happy, it’s only how we choose to react to or view these people that determine our state of mind. We can choose to be upbeat and positive in the face of other’s negativity and poor behaviour, and we can choose not to give them power over us and let their influence undermine our peaceful, joyful outlook.  

So let’s choose to be happy! We can choose to be happy, we can choose to turn our lives around and make them into joyful experiences – every day. We can choose to live a life we love and to love the life we live – it’s all up to us. We only live once – we can make it a great life with no regrets.

happiness is completely related to richness. someone who is rich may or may not ne happy. But the person who is happy always chose to be rich in this beautiful world. To be happy is the most  precious thing you do in your life and to make someone happy is also the excellent thing you should do.

now the question is how to get happiness?



happiness should not be a target it should be a habit for someone who wants to get happy. As an example A girl who wake up in the morning and go to city mall to get some stuff and then come back to home . is she really happy ? she may or may not be.  suppose she is not much satisfied by the stuff she comes with to the home. right?😉

yes , satisfaction is one of the key to happiness . Do get satisfy what you are getting in the present but don't let your streak break towards your goal. Dont think if your goal will be achieved by you . Do the effort from  your  side and be happy on the other hand.

  


Comments

Post a Comment

Popular posts from this blog

leetcode 48 solution

  48 .  Rotate Image You are given an  n x n  2D  matrix  representing an image, rotate the image by  90  degrees (clockwise). You have to rotate the image  in-place , which means you have to modify the input 2D matrix directly.  DO NOT  allocate another 2D matrix and do the rotation.   Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [[7,4,1],[8,5,2],[9,6,3]] Example 2: Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]] Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]   Constraints: n == matrix.length == matrix[i].length 1 <= n <= 20 -1000 <= matrix[i][j] <= 1000 solution: class Solution { public:     void swap(int& a , int &b)     {         int c ;         c = a;         a = b;         b = c;     }     void transpose (vector<vector<int>...
Post a Comment
Read more

2485. Find the Pivot Integer | Binary search

  Given a positive integer   n , find the   pivot integer   x   such that: The sum of all elements between  1  and  x  inclusively equals the sum of all elements between  x  and  n  inclusively. Return  the pivot integer  x . If no such integer exists, return  -1 . It is guaranteed that there will be at most one pivot index for the given input.   Example 1: Input: n = 8 Output: 6 Explanation: 6 is the pivot integer since: 1 + 2 + 3 + 4 + 5 + 6 = 6 + 7 + 8 = 21. Example 2: Input: n = 1 Output: 1 Explanation: 1 is the pivot integer since: 1 = 1. Example 3: Input: n = 4 Output: -1 Explanation: It can be proved that no such integer exist.   Constraints: 1 <= n <= 1000 Solution : class Solution { publ ic:     int pivotInteger( int n ) {         int sum = (( n )*( n + 1 ))/ 2 ;         int i = 1 ;         int j =...
Post a Comment
Read more

Regular Expression Matching Leetcode Solution

Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where: '.' Matches any single character.​​​​ '*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). Example 1: Input: s = "aa", p = "a"  Output: false  Explanation: "a" does not match the entire string "aa". Example 2: Input: s = "aa", p = "a*"  Output: true  Explanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa". Example 3: Input: s = "ab", p = ".*"  Output: true  Explanation: ".*" means "zero or more (*) of any character (.)". Constraints: 1 <= s.length <= 20 1 <= p.length <= 20 s contains only lowercase English letters. p contains only lowercase Englis...
Post a Comment
Read more