Time to take confident baby

 1. Focus on what you can control so your self-talks , your words :how you talk about yourself and how you talk about other people your attitude towards life i don't see problem i see solution 

2. Don't focus on things you can't control :your past ,your past doesn't exist 

3. You are the main character of your life so start acting like it ,

4.  confidence is about knowing who you are.  if you don't know who you are or how to define yourself focus on who you are

5. In order to make your life more structured , you.   need to create new routines for for yourself i like to go yoga, meditation, walk-around , i like to do gratitude meditation i like to shower myself. so i have routines

6. Listen if you are out of job right now ,just go find a job anywhere . anything literally . The 1 thing i have always done in my life i have worked because i wanted money  ,I don't feel confident in myself if i don't have money because i can't even go out with my friends i am not kind of person i will allow my friends just to pay for me No, I will stay home literally if i have no money because i don't want to go out and then constantly paying for me so I see confidence in my successes see confidence in the fact that i have job .  I have money , It doesn't matter what kind of job you have okay ,i always focus on myself trying to create money for myself

7. Learn the art of communication , communication is one of the biggest reason people can confident , people can be successful, the way you talk to people is very important because you can leave imprint on them 

8. How can you. learn to communicate better?? Go out and socialize with people surround yourself with different type of people

9. Start wearing sunglasses and look people in the eyes and this is a practice why , i would start looking people in the eyes when they are walking by. obviously they can't see that i'm looking at them so i felt more confident and comfortable ......etc

10. What you believe about yourself will be your reality , literally the way you think about yourself affects other people reality as will as 

11. The brain is wired to believe negativity over positivity , to refresh your brain listen to something that will actually lift you up another thing is when you are walking around put on some music that makes you feel confident or even you wakeup in the morning put on some music that makes you feel confident and stands front of mirror and start da....ing 

12. Start making decision that are best for you A confident person does what is best for them people even like to call them selfish , no they are not selfish no they always know that their needs has to be put farward first . because they know they are the most imp person for their life that's why 


Comments

Post a Comment

Popular posts from this blog

Coding Ninjas

  Given a NxM matrix containing Uppercase English Alphabets only. Your task is to tell if there is a path in the given matrix which makes the sentence “CODINGNINJA” . There is a path from any cell to all its neighbouring cells. For a particular cell, neighbouring cells are those cells that share an edge or a corner with the cell. Input Format : The first line of input contains two space separated integers N and M, where N is number of rows and M is the number of columns in the matrix. Each of the following N lines contain M characters. Please note that characters are not space separated. Output Format : Print 1 if there is a path which makes the sentence “CODINGNINJA” else print 0. Constraints : 1 <= N <= 1000 1 <= M <= 1000 Time Limit: 1 second Sample Input 1: 2 11 CXDXNXNXNXA XOXIXGXIXJX Sample Output 1: 1 bool hasPath ( vector < vector < char >> & board , int n , int m ) { // Write your code here. } #include < iostream > #include <
Read more

Code : Get Path - BFS

  Given an undirected graph G(V, E) and two vertices v1 and v2 (as integers), find and print the path from v1 to v2 (if exists). Print nothing if there is no path between v1 and v2. Find the path using BFS and print the shortest path available. Note: 1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 2. E is the number of edges present in graph G. 3. Print the path in reverse order. That is, print v2 first, then intermediate vertices and v1 at last. 4. Save the input graph in Adjacency Matrix. Input Format : The first line of input contains two integers, that denote the value of V and E. Each of the following E lines contains two integers, that denote that there exists an edge between vertex a and b. The following line contain two integers, that denote the value of v1 and v2. Output Format : Print the path from v1 to v2 in reverse order. Constraints : 2 <= V <= 1000 1 <= E <= (V * (V - 1)) / 2 0 <= a <= V - 1 0 <= b <= V
Read more

Code : All connected components

  Given an undirected graph G(V,E), find and print all the connected components of the given graph G. Note: 1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 2. E is the number of edges present in graph G. 3. You need to take input in main and create a function which should return all the connected components. And then print them in the main, not inside function. Print different components in new line. And each component should be printed in increasing order (separated by space). Order of different components doesn't matter. Input Format : The first line of input contains two integers, that denote the value of V and E. Each of the following E lines contains two space separated integers, that denote that there exists an edge between vertex a and b. Output Format : Print different components in new line. And each component should be printed in increasing order of vertices (separated by space). Order of different components doesn't matter.
Read more