Behavioral questions

 

Resume

 Copy and paste these ChatGPT Prompts to write a killer Resume

Turn your resume into a powerful tool that stands out!
[ Save Now ]

1. Enhance Visual Presentation
Prompt: Provide recommendations on how to improve the visual layout and formatting of my resume to make it more appealing and easy to read. Here's my resume: [ Resume].

2. Customize for the Desired Role
Prompt: Adapt my resume to emphasize the skills and experiences that align with the [DESIRED ROLE] role. Here's my resume: [ Resume]. Here’s job description: [Job Description].

3. Highlight Leadership Experience
Prompt: Review my resume to better highlight my leadership skills for a [JOB TITLE] role at [COMPANY]. Here's my resume and job description: [Paste Resume] [Job Des].

4. Refine for Impactful Language
Prompt: Enhance my resume to make my experiences sound more impactful and action-oriented for a [ROLE] position. Here's my resume: [ Resume]. Here’s job description: [Job Description].

5. Showcase Problem-Solving Abilities
Prompt: Review my resume and suggest ways to highlight my problem-solving skills and how they've contributed to success in previous roles. Here's my resume: [Resume].

6. Craft a Compelling Objective Statement
Prompt: Based on my resume and the job description, create an objective statement that clearly communicates my goals and alignment with the [JOB TITLE] role at [COMPANY]. Here's my resume: [Resume].

Need a professional resume? Contact me for a well-structured and standout resume that highlights your skills and experience effectively.

Google is offering FREE online courses with certification.

𝗙𝗥𝗘𝗘 (𝗚𝗼𝗼𝗴𝗹𝗲) 𝗖𝗼𝘂𝗿𝘀𝗲𝘀 𝘆𝗼𝘂 𝘄𝗶𝗹𝗹 𝗿𝗲𝗴𝗿𝗲𝘁 𝗻𝗼𝘁 𝘁𝗮𝗸𝗶𝗻𝗴 𝗶𝗻 𝟮𝟬𝟮𝟱.

1. Google data Analytics:
→https://lnkd.in/gmpYBGQz

2. Google Project Management:
→ https://lnkd.in/g2SFqfdw

3. Foundations of Project Management:
→ https://lnkd.in/gAphbnV7

4. Google Introduction to Generative AI:
→https://lnkd.in/gHnK6GAA

5. Google Cybersecurity:
→ https://lnkd.in/gwT8n2XD

6. Google UX Design:
→ https://lnkd.in/gtifc_sH

7. Google Digital Marketing & E-commerce:
→ https://lnkd.in/gNUkiJN6

8. Google IT Support:
→ https://lnkd.in/gHrnNNrc

9. Web Applications for Everybody Specialization:
→ https://lnkd.in/gm5jjAEu

10. Get Started with Python:
→ https://lnkd.in/gE_8qkVJ

11. Learn Python Basics for Data Analysis:
https://lnkd.in/gshCUpGM

12. Create your own Python objects
→ https://lnkd.in/d_rR29MN

13. Data Analysis with R Programming:
→ https://lnkd.in/gDxWYtnD

14. IBM Full Stack Software Developer Professional Certificate:
→ https://lnkd.in/gyVWhYXv

15. Introduction to Web Development with HTML, CSS, JavaScript​
→ https://lnkd.in/giSVuNjj

16. IBM Front-End Developer Professional Certificate:
→ https://lnkd.in/gBUVNYZv

17. IBM Back-End Development Professional Certificate:
→ https://lnkd.in/gsjv5uBi

18. IBM Python for Data Science, AI & Development:
→https://lnkd.in/gXivBaC6

To check later palindrom what mistake i did. Earn Inte

 /*

A palindrome is a word that is the same when read left-to-right and right-to-left.  For example, “racecar” is a palindrome.

Given a string, find all of the substrings that are also palindromes.

Example input:

  "racecar"

Example output:

   [“racecar”, “aceca”, “cec”, “r”, “a”, “c”, “e”, “c”, “a”, “r”]

*/

import java.io.*;

import java.util.*;

class Solution {

  public static void main(String[] args) {

    String str = "racecar";

    ArrayList<String> resultSet = new ArrayList<String>();

   /*  

   for(int i = 0; i< str.length(); i++)

    {

       for(int j = i; j< str.length(); j++)

       {

          String subStr =str.substring(i, j+1);

          if(isPalindrome(subStr))

          {

              resultSet.add(subStr);

              System.out.println(subStr);

          }

       }

    }

    */

   int left = 0;

   int right = str.length();

   for(int i = 0; i< str.length(); i++)

   {

          int oddString = isPalindrome(str ,i,i);

          int evenString = isPalindrome(str ,i,i+1);

         

    }

   

   

  }

public static int isPalindrome(String str, int left, int right)

    {

        while(left>=0 && right < str.length() && str.charAt(left) == str.charAt(right))

        {

           

              left--;

              right ++;

               System.out.println(str.substring(left+1, right));

         

        }

       // System.out.println(str.substring(left+1, right));

        return right-left-1;

       

    }

    public static Boolean isPalindrome(String str)

    {

        int left = 0;

        int right = str.length() -1;

        for(int i = left; i< right; i++, right--)

        {

          if(str.charAt(i) != str.charAt(right))

          {

            return false;

          }

         

        }

        return true;

    }

   

}