aadipoddar

using System.Diagnostics;
using System.Reflection;

namespace PubEntry;

public static class UpdateManager
{
	private static async Task<string> GetLatestVersionFromGithub()
	{
		string fileUrl = "https://raw.githubusercontent.com/aadipoddar/PubEntry/refs/heads/main/README.md";

aadipoddar

<?xml version="1.0" encoding="utf-8" ?>
<CodeSnippets  xmlns="http://schemas.microsoft.com/VisualStudio/2005/CodeSnippet">
	<CodeSnippet Format="1.0.0">
		<Header>
			<Title>Custom PropFull</Title>
			<Shortcut>pprop</Shortcut>
			<Description>Custom Code snippet for property and backing field</Description>
			<Author>Aadi Poddar</Author>
			<SnippetTypes>
				<SnippetType>Expansion</SnippetType>

aadipoddar

{
    "$help": "https://aka.ms/terminal-documentation",
    "$schema": "https://aka.ms/terminal-profiles-schema",
    "actions": 
    [
        {
            "command": 
            {
                "action": "copy",
                "singleLine": false

aadipoddar

/*
Input a word check for the position of the first occurring vowel and perform the following operation.

(a) Words that begin with a vowel are concatenated with “Y”.
    Eg: EUROPE becomes EUROPEY
    
(b) Words that contain a vowel in-between should have the first part from the position of the vowel till the end,
    followed by the part of the string from beginning till the position of the vowel and is concatenated by "C".
    Eg: PROJECT becomes OJECTPRC

aadipoddar

/*
Accept a senetnce and print the frequency of each alphabet present

INPUT:  Smooth Road
OUTPUT:
    s: 1
    m: 1
    o: 3
    t: 1
    h: 1

aadipoddar

/*
Program to Find the LCM and HCF using Recursion
*/

import java.util.Scanner;

class HCM_LCM_Recursion {

    int common = 0;

aadipoddar

/*
Check is Number is Krishnamorty or not by using Recursion

A krishnamurty Number is a number which
is the sum of the factorial of each digits of a number
is equal to the original number.

INPUT:  145
OUTPUT: Yes
 */

aadipoddar

/*
Write a program to accept a sentence
and the number of words in the sentence.

INPUT:  Kolkata is a nice City
OUTPUT: Number of Words: 5
*/

import java.util.Scanner;

aadipoddar

/*
Write a program to accept a number
and print the number is a perfect number or not using a recursion
and print the result. 

INPUT:  6
OUTPUT: 6 is a perfect number
*/

import java.util.Scanner;

aadipoddar

/*
Write a program to accept a word using String accept() function
and count the number of vowels in the word using int vowels(String, int) recursive function
and display the word and the frequency of vowels in the word using void display(String, int) function.
*/

import java.util.Scanner;

class VowelsRecursion {