raghavan93513/raghavan-portfolio

Stars
1
Language
JavaScript
License
GNU General Publi...
Created 8 months ago
Updated 7 months ago

raghavan93513/raghavan-portfolio

raghavan93513

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Knowledge-Graphs-for-Research-Navigation

Jupyter Notebook

Twitter-Sentimental-Analysis

Jupyter Notebook

Time-Conversion-12hrs-to-24hrs-

Given a time in the 12-hour format with the suffix , either AM/PM, convert that into a 24-hour format. 12-hour format is hours:minutes:seconds followed by AM or PM, where the hours range from 0 to 12, minutes range from 0 to 59, seconds range from 0 to 59. 24-hours format is hours:minutes and seconds , where hours range from 0 to 23, minutes range from 0 to 59, seconds range from 0 to 59. All the three components: hours, minutes, seconds are represented in the two digit format. Note Midnight 12 o’clock is 12:00:00AM in the 12-hour format and it is 00:00:00 in 24- hour format. 12 Noon is 12:00:00PM in the 12-hour format and it is 12:00:00 in the 24- hour format. For example, if input is 07:05:45PM then the output is 19:05:45 and if the input is 07:05:45AM then the output is 07:05:45.

Vowel-Count-KYU-7

Return the number (count) of vowels in the given string. We will consider a, e, i, o, u. The input string will only consist of lower case letters and/or spaces.

Langchain-Food-Recommender

Jupyter Notebook

Online-Chat-Room

raghavan93513

Passenger-Counter-App

Passenger Counter App in which we can increment, reset and save data

Face-Mask-Detection

Jupyter Notebook

Salary-Analysis-and-Prediction

Jupyter Notebook

Square-to-oval-design

Its a rotational dynamic design where squares turn into ovals upon rotation

Search-Bar

A normal search bar for a website

Polynomial-Addition-using-lists

Write an algorithm and the subsequent Python program to add the two given polynomials. Assume that the coefficients of each polynomial are stored in a separate list. Eg: 4x3 + 3x + 1 can be stored as [4,0,3,1] 2x2 - 3x - 4 can be stored as [2,-3,-4] Output is [4, 2, 0, -3]

Password-Security-Check

Given a word, check if it is a valid password or not. A password is said to be valid if it satisfies the following conditions: i) Should begin with a letter ii) Should contain atleast one digit and one special character iii) Length of the password should be atleast 8 Print ‘Valid' if the given word satisfies the above three conditions and print ‘Invalid’ otherwise.

Finding-a-Friend-with-Longest-Name

Write an algorithm and the subsequent Python program to store the names of your friends, count the number of friends, identify the longest name and the number of letters in the longest name. Get the names of friends till 'Stop' is entered. For example, if the input sequence is Ravi, Raj, Puela, Stop, then the output is 3, Puela and 5. When you are coding in the online judge (SkillRack), use rstrip() function to remove carriage return from the input string. Note: First letter of Stop should be in Upper Case

Arrangement-of-Plants-on-the-basis-of-height

A gardener has the practice of assigning ID to the plants during plantation. One day, he makes a note of the heights of plants in his garden. He writes the height of the plant against the ID of the plant. He then instructs his employee to keep the plants, in ascending order of its height. Design an algorithm and write the Python code to display the list of ID numbers of plants in ascending order of their height. IDs are also numbers. Check for boundary conditions and print 'Invalid input' for wrong input. For example, if there are three trees with IDs as 175, 160, 120 and height as 47, 73 and 23 then the output should be 120, 175, 160(all should be in different lines)

Same-row-keyboard-Letters

Given an English word, write an algorithm and the subsequent Python code to check if the given word can be typed using just a single row of the keyboard. (e.g. POTTER, EQUITY). Print 'Yes' if the letters of the word are from a single row and print 'No' otherwise.

Creating-Unique-List-and-Searching

A login register is maintained in the library of VITCC in which, the register number of students are recorded when they enter the library. Sometimes it happens that the students visit the library more than once in a day and hence duplicate entries occur so frequently in the register. The librarian wants to have a report of all students who have visited on a particular day, ‘x’. Given the list of students who visited the library on the day ‘x’, write an algorithm and the subsequent Python program to prepare a report with unique register number of students. Also read a register number ‘r’ and search for it in the list. Print ‘Found’ if ‘r’ is in the list and print ‘Not found’ otherwise.

Mumbling-7-KYU

his time no story, no theory. Create the function uff, 1) uff("abcd") -> "A-Bb-Ccc-Dddd", 2) uff("RqaEzty") -> "R-Qq-Aaa-Eeee-Zzzzz-Tttttt-Yyyyyyy", 3) uff("cwAt") -> "C-Ww-Aaa-Tttt"

Distinct-Letter-word

A word is called as a good word if all the letters of the word are distinct. That is, all the letters of the word are different from each other letter. Else, the word is called as a bad word. Write an algorithm and the subsequent Python code to check if the given word is good or bad.: e.g. START, GOOD, BETTER are bad: WRONG is good! Make the comparison to be case insensitive.

Caesar-Cipher

In Caesar cipher, each letter is replaced by another letter which occurs at the d-th position (when counted from the position of the original letter), in the English alphabet. For identifying the position of a letter, we follow the usual order of the English alphabet, from a to z. Given a word and a positive integer d, use Caesar cipher to encrypt it. For example, if the word is 'ball' and the value of 'd' is 3 then the new encrypted word is 'edoo'. 'x' will be replaced by 'a', 'y' should be replaced by 'b' and 'z' should be replaced by 'c'. While the code is submitted for Online Judge (SkillRack), use rstrip(), to remove carriage return character in the input.

Sparse-Matrix

Write an algorithm and the subsequent Python program to check whether the given matrix is sparse or not. A matrix is said to be a “Sparse” if the number of zero entries in the matrix, is greater than or equal to the number of non-zero entries. Otherwise it is “Not sparse”. Check for boundary conditions and print 'Invalid input' when not satisfied.

Youtube-Recommendation-Layout

After you watch a video you often get Youtube Recommendations, we are going to mimic this only using html and css