<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: saurabh belote</title>
    <description>The latest articles on DEV Community by saurabh belote (@s_belote_dev).</description>
    <link>https://dev.to/s_belote_dev</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F686304%2F992c1398-cae3-4d59-8923-abf6a2b72beb.png</url>
      <title>DEV Community: saurabh belote</title>
      <link>https://dev.to/s_belote_dev</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/s_belote_dev"/>
    <language>en</language>
    <item>
      <title>Boost Your Interview Calls: Update Your Resume with ATS Score Checker, ChatGPT and JobForm Automator</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Wed, 29 May 2024 15:31:42 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/boost-your-interview-calls-update-your-resume-with-ats-score-checker-chatgpt-and-jobform-automator-312h</link>
      <guid>https://dev.to/s_belote_dev/boost-your-interview-calls-update-your-resume-with-ats-score-checker-chatgpt-and-jobform-automator-312h</guid>
      <description>&lt;p&gt;In today's competitive job market, getting your resume noticed by recruiters and hiring managers is more challenging than ever. With many companies using Applicant Tracking Systems (ATS) to screen resumes, ensuring your resume passes through these systems is crucial. Here’s how you can update your resume to get more interview calls using an ATS score checker, ChatGPT, and JobForm Automator.&lt;/p&gt;

&lt;h4&gt;
  
  
  Understanding Applicant Tracking Systems (ATS)
&lt;/h4&gt;

&lt;p&gt;ATS is a software application used by employers to manage their recruitment process. It helps in sorting and filtering resumes based on specific keywords and criteria. If your resume isn’t optimized for ATS, it might never reach a human recruiter, no matter how qualified you are.&lt;/p&gt;

&lt;h3&gt;
  
  
  Step-by-Step Guide to Optimize Your Resume
&lt;/h3&gt;

&lt;h4&gt;
  
  
  1. &lt;strong&gt;Research Keywords&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;The first step in optimizing your resume for ATS is to identify relevant keywords. These keywords are usually found in job descriptions. Pay close attention to the skills, qualifications, and job titles mentioned frequently.&lt;/p&gt;

&lt;h4&gt;
  
  
  2. &lt;strong&gt;Use an ATS Score Checker&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;An ATS score checker helps you evaluate how well your resume aligns with the job description. Tools like &lt;a href="https://www.jobscan.co"&gt;Jobscan&lt;/a&gt; or &lt;a href="https://resumeworded.com"&gt;Resume Worded&lt;/a&gt; can analyze your resume and provide a match score.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;How to Use an ATS Score Checker:&lt;/strong&gt;

&lt;ol&gt;
&lt;li&gt;Upload your resume and the job description into the ATS score checker tool.&lt;/li&gt;
&lt;li&gt;Review the report and note areas that need improvement.&lt;/li&gt;
&lt;li&gt;Adjust your resume to better match the job description by incorporating missing keywords.&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;h4&gt;
  
  
  3. &lt;strong&gt;Leverage ChatGPT for Tailored Content&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;&lt;a href="https://chatgpt.com"&gt;ChatGPT&lt;/a&gt;, an AI language model, can be a valuable tool for enhancing your resume content. It can help you craft compelling bullet points, summaries, and professional profiles.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;How to Use ChatGPT:&lt;/strong&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Bullet Points:&lt;/strong&gt; Provide ChatGPT with details about your job roles, responsibilities, and achievements. Ask it to create impactful bullet points.

&lt;ul&gt;
&lt;li&gt;Example: "ChatGPT, can you help me rewrite this bullet point to be more impactful: 'Managed a team of 5 people.'"&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Professional Summary:&lt;/strong&gt; Share your career highlights and goals with ChatGPT, and ask for a polished summary.

&lt;ul&gt;
&lt;li&gt;Example: "ChatGPT, based on my experience as a marketing manager and my goal to lead a digital marketing team, can you draft a professional summary for my resume?"&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Skills Section:&lt;/strong&gt; Ensure your skills are relevant and formatted correctly. ChatGPT can suggest the best way to present them.

&lt;ul&gt;
&lt;li&gt;Example: "ChatGPT, can you help me list my skills effectively for a software development role?"&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;h4&gt;
  
  
  4. &lt;strong&gt;Use Job Descriptions to Enhance Skills Section&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;To ensure your resume is tailored to what employers are looking for, gather several job descriptions (JDs) for positions you are interested in. Analyze these JDs to identify common skills and qualifications. Here’s how you can use ChatGPT to refine this process:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;How to Use Job Descriptions and ChatGPT:&lt;/strong&gt;

&lt;ol&gt;
&lt;li&gt;Collect 5-10 job descriptions for roles similar to what you’re applying for.&lt;/li&gt;
&lt;li&gt;Input these job descriptions into ChatGPT and ask for a consolidated list of required skills.

&lt;ul&gt;
&lt;li&gt;Example: "ChatGPT, based on these five job descriptions, can you list the top skills that are required?"&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;li&gt;Learn these skills through online courses, workshops, or self-study.&lt;/li&gt;
&lt;li&gt;Once proficient, update your resume to include these skills.&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;h4&gt;
  
  
  5. &lt;strong&gt;Refine Your Format and Structure&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;Ensure your resume is clean, professional, and easy to read. Use a simple layout with clear headings, bullet points, and consistent formatting. Avoid graphics and complex designs that may confuse the ATS.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Tips for Formatting:&lt;/strong&gt;

&lt;ul&gt;
&lt;li&gt;Use standard section headings like "Professional Experience," "Education," and "Skills."&lt;/li&gt;
&lt;li&gt;Stick to common fonts such as Arial, Times New Roman, or Calibri.&lt;/li&gt;
&lt;li&gt;Avoid images, tables, and columns.&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;/ul&gt;

&lt;h4&gt;
  
  
  6. &lt;strong&gt;Use JobForm Automator to Boost Applications&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;Maximize your job application efforts by using the &lt;a href="https://jobformautomator.com"&gt;JobForm Automator&lt;/a&gt;, a Chrome extension that helps you apply for hundreds of jobs daily. This tool increases your chances of getting more interview calls by automating the repetitive task of filling out job application forms.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;How to Use JobForm Automator:&lt;/strong&gt;

&lt;ol&gt;
&lt;li&gt;Install the &lt;a href="https://jobformautomator.com"&gt;JobForm Automator Chrome extension&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;Create an account and enter your personal details, work experience, desired salary range, and upload your resume.&lt;/li&gt;
&lt;li&gt;When you visit job portals like LinkedIn, Indeed, or Foundit.in, use the extension to detect the "Easy Apply" or "Quick Apply" options.&lt;/li&gt;
&lt;li&gt;Right-click on job listings and let the extension auto-fill the application forms and auto-apply for jobs.&lt;/li&gt;
&lt;li&gt;Visit &lt;a href="https://jobformautomator.com"&gt;Jobform Automator&lt;/a&gt; to know more.&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;With JobForm Automator, you can efficiently apply to multiple job listings, significantly increasing your chances of securing interviews.&lt;/p&gt;

&lt;h4&gt;
  
  
  7. &lt;strong&gt;Proofread and Test Your Resume&lt;/strong&gt;
&lt;/h4&gt;

&lt;p&gt;Before submitting your resume, proofread it thoroughly to eliminate any typos or errors. Use tools like &lt;a href="https://www.grammarly.com"&gt;Grammarly&lt;/a&gt; to catch grammatical mistakes. Additionally, test your resume with multiple ATS score checkers to ensure it’s optimized.&lt;/p&gt;

&lt;h3&gt;
  
  
  Conclusion
&lt;/h3&gt;

&lt;p&gt;Optimizing your resume for ATS is crucial in getting more interview calls. By researching keywords, using an ATS score checker, leveraging ChatGPT for tailored content, refining your format, and proofreading your resume, you can significantly improve your chances of passing through the initial screening process. Additionally, by analyzing multiple job descriptions and acquiring relevant skills, you can ensure your resume stands out to recruiters. Finally, boost your job application efforts with &lt;a href="https://jobformautomator.com"&gt;JobForm Automator&lt;/a&gt; to apply for hundreds of jobs daily, increasing your likelihood of landing interviews.&lt;/p&gt;

</description>
      <category>job</category>
      <category>webdev</category>
      <category>javascript</category>
      <category>programming</category>
    </item>
    <item>
      <title>Is My Data Safe on JobForm Automator?</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Thu, 30 Nov 2023 19:08:30 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/is-my-data-safe-on-jobform-automator-373e</link>
      <guid>https://dev.to/s_belote_dev/is-my-data-safe-on-jobform-automator-373e</guid>
      <description>&lt;p&gt;In today's digital world, the safety and privacy of your personal information are paramount. At JobForm Automator, we deeply understand this responsibility. That's why we've built our platform with industry-leading security measures.&lt;/p&gt;

&lt;p&gt;Encryption and Secure Storage: Rest assured, your data is encrypted and stored securely. Our state-of-the-art encryption ensures that your personal information is protected from unauthorized access.&lt;/p&gt;

&lt;p&gt;User Control and Privacy: We believe in giving you full control over your data. With JobForm Automator, you have the flexibility to delete your account at any time. When you choose to delete your account, we ensure that your data is permanently removed from our servers.&lt;/p&gt;

&lt;p&gt;Ongoing Commitment to Security: We are committed to continuously improving our security measures. Our team stays up-to-date with the latest security trends and technologies to safeguard your information.&lt;/p&gt;

&lt;p&gt;In conclusion, at JobForm Automator, your data’s safety is our top priority. We strive to provide a secure and reliable service, so you can focus on what matters most – landing your dream job.&lt;/p&gt;

&lt;p&gt;Thank you for trusting us with your job application process.&lt;/p&gt;

&lt;p&gt;Sincerely,&lt;br&gt;
[Saurabh Belote]&lt;br&gt;
Founder, Aiking Solutions&lt;/p&gt;

</description>
      <category>job</category>
      <category>productivity</category>
      <category>security</category>
      <category>automation</category>
    </item>
    <item>
      <title>Are you tired of repeatedly filling out the same information on job applications?</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Thu, 16 Nov 2023 17:44:50 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/are-you-tired-of-spending-too-much-time-on-job-applications-hi</link>
      <guid>https://dev.to/s_belote_dev/are-you-tired-of-spending-too-much-time-on-job-applications-hi</guid>
      <description>&lt;p&gt;JobForm Automator is here to help! It's a handy tool that fills out forms for you, saving time and reducing errors.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Easy Data Management:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Log in once, and JobForm Automator stores your info securely.&lt;/li&gt;
&lt;li&gt;No more mistakes or missing details on forms.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Quick Form Filling:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Open a form, press a button, and watch it fill up in a snap.&lt;/li&gt;
&lt;li&gt;Say goodbye to the hassle of typing your information repeatedly.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Fix Problems Fast:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;If you run into issues, just press a button to report them.&lt;/li&gt;
&lt;li&gt;Our team will work on fixing them in the next update.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Unlock Your Dream Job Easily:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;it's free&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;We value your feedback and ideas. Visit our website, watch our video, and get in touch with us for collaboration or suggestions. &lt;a href="https://chromewebstore.google.com/detail/jobfrom-automator/lknamgjmcmbfhcjjeicdndokedcmpbaa"&gt;Download from web store.&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;JobForm Automator is here to make your job search easier. Try it today and get closer to your dream job! 😊&lt;/p&gt;

</description>
      <category>job</category>
      <category>productivity</category>
      <category>news</category>
      <category>programmers</category>
    </item>
    <item>
      <title>Github Readme for 100 day challange</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Wed, 02 Mar 2022 10:26:16 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/github-readme-for-100-day-challange-1d0n</link>
      <guid>https://dev.to/s_belote_dev/github-readme-for-100-day-challange-1d0n</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;# 100-days-django-challange
100 days django challange
04/01/2022 to 13/04/2022


| Day #  |▶ What was done| 📚 Topics Covered |
| -------|:-------------:| ------------------:|
| 1      |               |                    |
| 1      |               |                    |
| 2      |               |                    |
| 3      |               |                    |
| 4      |               |                    |
| 5      |               |                    |
| 6      |               |                    |
| 7      |               |                    |
| 8      |               |                    |
| 9      |               |                    |
| 10     |               |                    |
| 11     |               |                    |
| 12     |               |                    |
| 13     |               |                    |
| 14     |               |                    |
| 15     |               |                    |
| 16     |               |                    |
| 17     |               |                    |
| 18     |               |                    |
| 19     |               |                    |
| 20     |               |                    |
| 21     |               |                    |
| 22     |               |                    |
| 23     |               |                    |
| 25     |               |                    |
| 26     |               |                    |
| 27     |               |                    |
| 28     |               |                    |
| 29     |               |                    |
| 30     |               |                    |
| 31     |               |                    |
| 32     |               |                    |
| 33     |               |                    |
| 34     |               |                    |
| 35     |               |                    |
| 36     |               |                    |
| 37     |               |                    |
| 38     |               |                    |
| 39     |               |                    |
| 40     |               |                    |     
| 41     |               |                    |     
| 42     |               |                    |     
| 43     |               |                    |     
| 44     |               |                    |     
| 45     |               |                    |     
| 46     |               |                    |     
| 47     |               |                    |     
| 48     |               |                    | 
| 49     |               |                    |     
| 50     |               |                    |     
| 51     |               |                    |     
| 52     |               |                    | 
| 53     |               |                    |     
| 54     |               |                    |     
| 55     |               |                    |     
| 56     |               |                    |     
| 57     |               |                    |     
| 58     |               |                    |     
| 59     |               |                    |     
| 60     |               |                    |     
| 61     |               |                    |     
| 62     |               |                    |     
| 63     |               |                    | 
| 64     |               |                    |     
| 65     |               |                    |     
| 66     |               |                    |     
| 67     |               |                    |     
| 68     |               |                    |     
| 69     |               |                    |     
| 70     |               |                    |     
| 71     |               |                    |     
| 72     |               |                    |     
| 73     |               |                    |     
| 74     |               |                    |     
| 75     |               |                    | 
| 76     |               |                    |     
| 77     |               |                    | 
| 78     |               |                    |     
| 79     |               |                    |     
| 80     |               |                    | 
| 81     |               |                    |     
| 82     |               |                    |     
| 83     |               |                    | 
| 84     |               |                    |     
| 85     |               |                    |     
| 86     |               |                    |     
| 87     |               |                    |     
| 88     |               |                    |     
| 89     |               |                    |     
| 90     |               |                    |     
| 91     |               |                    |     
| 92     |               |                    |     
| 93     |               |                    |     
| 94     |               |                    |     
| 95     |               |                    |     
| 96     |               |                    |     
| 97     |               |                    |     
| 98     |               |                    |     
| 99     |               |                    |     
| 100    |               |                    |



&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>programming</category>
      <category>beginners</category>
      <category>tutorial</category>
      <category>productivity</category>
    </item>
    <item>
      <title>return vs print inside function</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Sat, 16 Oct 2021 12:26:56 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/return-vs-print-inside-function-jd9</link>
      <guid>https://dev.to/s_belote_dev/return-vs-print-inside-function-jd9</guid>
      <description>&lt;p&gt;reference &lt;br&gt;
&lt;a href="https://realpython.com/python-return-statement/"&gt;https://realpython.com/python-return-statement/&lt;/a&gt;&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;print_greeting&lt;/span&gt;&lt;span class="p"&gt;():&lt;/span&gt;
    &lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Hello, World"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;


&lt;span class="n"&gt;print_greeting&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="c1"&gt;# outuput : Hello, World
&lt;/span&gt;

&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;return_greeting&lt;/span&gt;&lt;span class="p"&gt;():&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="s"&gt;"Hello, World"&lt;/span&gt;

&lt;span class="n"&gt;return_greeting&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="c1"&gt;# output : 
&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;return_greeting&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="c1"&gt;# output :  &amp;lt;function return_greeting at 0x000001C1F88C6950&amp;gt;
&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;return_greeting&lt;/span&gt;&lt;span class="p"&gt;())&lt;/span&gt;
&lt;span class="c1"&gt;# output : Hello, World
&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>python</category>
    </item>
    <item>
      <title>find gcd with recursion</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Sat, 16 Oct 2021 10:50:51 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/find-gcd-with-recursion-14d4</link>
      <guid>https://dev.to/s_belote_dev/find-gcd-with-recursion-14d4</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;gcd&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="k"&gt;assert&lt;/span&gt; &lt;span class="nb"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="ow"&gt;and&lt;/span&gt; &lt;span class="nb"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="s"&gt;'the number must be integer only ! '&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; 
    &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;gcd&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="o"&gt;%&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;gcd&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;48&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;12&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;                   
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>python</category>
    </item>
    <item>
      <title>find factorial with recursion</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Sat, 16 Oct 2021 10:41:30 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/find-factorial-with-recursion-32a</link>
      <guid>https://dev.to/s_belote_dev/find-factorial-with-recursion-32a</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;factorial&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
  &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
  &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;factorial&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;factorial&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;21&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>python</category>
    </item>
    <item>
      <title>recursion sum of array</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Sat, 16 Oct 2021 10:39:08 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/recursion-sum-of-array-4ibf</link>
      <guid>https://dev.to/s_belote_dev/recursion-sum-of-array-4ibf</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;arr&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;90&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;7&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;8&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;101&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;len&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
&lt;span class="n"&gt;Num&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;recursor&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;Num&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;
    &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="c1"&gt;#print(arr[i])
&lt;/span&gt;        &lt;span class="n"&gt;Num&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;Num&lt;/span&gt;
        &lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;Num&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
        &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;recursor&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;Num&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;recursor&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;Num&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>python</category>
    </item>
    <item>
      <title>Write a Python program to reverse only the vowels of a given string.</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Fri, 24 Sep 2021 18:05:16 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/write-a-python-program-to-reverse-only-the-vowels-of-a-given-string-3blk</link>
      <guid>https://dev.to/s_belote_dev/write-a-python-program-to-reverse-only-the-vowels-of-a-given-string-3blk</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;reverse_vowels&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;str1&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="n"&gt;vowels&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s"&gt;""&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;str1&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="s"&gt;"aeiouAEIOU"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;vowels&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt;
    &lt;span class="n"&gt;result_string&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s"&gt;""&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;str1&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="s"&gt;"aeiouAEIOU"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;result_string&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;vowels&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
            &lt;span class="n"&gt;vowels&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;vowels&lt;/span&gt;&lt;span class="p"&gt;[:&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
        &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;result_string&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;char&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;result_string&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;reverse_vowels&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"w3resource"&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;reverse_vowels&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Python"&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;reverse_vowels&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Perl"&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;reverse_vowels&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"USA"&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
    <item>
      <title>Write a Python program to count the number of prime numbers less than a given non-negative number.</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Fri, 24 Sep 2021 18:03:58 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/write-a-python-program-to-count-the-number-of-prime-numbers-less-than-a-given-non-negative-number-213j</link>
      <guid>https://dev.to/s_belote_dev/write-a-python-program-to-count-the-number-of-prime-numbers-less-than-a-given-non-negative-number-213j</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;count_Primes_nums&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="n"&gt;ctr&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;

    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="k"&gt;continue&lt;/span&gt;
        &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
            &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
                &lt;span class="k"&gt;break&lt;/span&gt;
        &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;ctr&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;ctr&lt;/span&gt;

&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;count_Primes_nums&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;count_Primes_nums&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;100&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
    <item>
      <title>Write a Python program to find common divisors between two numbers in a given pair.</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Fri, 24 Sep 2021 18:01:57 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/write-a-python-program-to-find-common-divisors-between-two-numbers-in-a-given-pair-37h7</link>
      <guid>https://dev.to/s_belote_dev/write-a-python-program-to-find-common-divisors-between-two-numbers-in-a-given-pair-37h7</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;ngcd&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;y&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="k"&gt;while&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;=&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt; &lt;span class="ow"&gt;and&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;=&lt;/span&gt;&lt;span class="n"&gt;y&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;%&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;==&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="ow"&gt;and&lt;/span&gt; &lt;span class="n"&gt;y&lt;/span&gt;&lt;span class="o"&gt;%&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
            &lt;span class="n"&gt;gcd&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;+=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;gcd&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;num_comm_div&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;y&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
  &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;ngcd&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;y&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
  &lt;span class="n"&gt;result&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
  &lt;span class="n"&gt;z&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;**&lt;/span&gt;&lt;span class="mf"&gt;0.5&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
  &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
  &lt;span class="k"&gt;while&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;z&lt;/span&gt; &lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
      &lt;span class="n"&gt;result&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt; 
      &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;/&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
        &lt;span class="n"&gt;result&lt;/span&gt;&lt;span class="o"&gt;-=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;+=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;result&lt;/span&gt;

&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Number of common divisors: "&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;num_comm_div&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Number of common divisors: "&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;num_comm_div&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;8&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"Number of common divisors: "&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;num_comm_div&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;12&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;24&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
    <item>
      <title>Write a Python program to find the digits which are absent in a given mobile number.</title>
      <dc:creator>saurabh belote</dc:creator>
      <pubDate>Fri, 24 Sep 2021 18:00:24 +0000</pubDate>
      <link>https://dev.to/s_belote_dev/write-a-python-program-to-find-the-digits-which-are-absent-in-a-given-mobile-number-4224</link>
      <guid>https://dev.to/s_belote_dev/write-a-python-program-to-find-the-digits-which-are-absent-in-a-given-mobile-number-4224</guid>
      <description>&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;absent_digits&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
  &lt;span class="n"&gt;all_nums&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;set&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;7&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;8&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
  &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;set&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="nb"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
  &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;symmetric_difference&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;all_nums&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
  &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;sorted&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;absent_digits&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;8&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;7&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;]))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
    </item>
  </channel>
</rss>
