Jibendu007/Coursera-Algorithmic-Toolbox-master Jibendu007/Coursera-Algorithmic-Toolbox-master

  • Stars
    star
    3
  • Rank 3,963,521 (Top 79 %)
  • Language
    Python
  • Created over 3 years ago
  • Updated over 3 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
Jibendu007/Coursera-Algorithmic-Toolbox-master
github

Jibendu007

Reviews

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

Repository Details

More Repositories

1

Music-Player-2.0

Python
3
star
2

Movie-App

HTML
3
star
3

Music-Player

Python
3
star
4

Todo-with-react

JavaScript
3
star
5

Hackerrank-problem-solving

just uploads
2
star
6

Open-cv-AIR-CANVAS

Python
2
star
7

Algorithm-Toolbox-Coursera

Python
2
star
8

SQL-Hackerrank

2
star
9

basic-website

HTML
1
star
10

C-PROGRAMS

1
star
11

my-Portfolio

just a basic website with boxes
HTML
1
star
12

Jibendu007

1
star
13

GUI-app-for-DICE-simulator

1
star
14

big-data

Python
1
star
15

Jibendu-Paul

Looking for oppurtunities
1
star
16

ML-Car-Prediction-

I could not do the deployment if anyone can.. feel free to pull req and commit.
Jupyter Notebook
1
star
17

pointers

Write a program to reverse a string using pointer Input and Output Format: Refer sample input and output for formatting specification. All float values are displayed correct to 2 decimal places. All text in bold corresponds to input and the rest corresponds to output.
1
star
18

Rock-or-Mine-Prediction

The dataset having both Rock and Mine details for about 60 columns is tested and trained to predict if the given values are of a rock or a mine.
Jupyter Notebook
1
star
19

LONGEST-WEIRD-SUBSEQUENCE

Finding the longest increasing subsequence is an old and well-known problem now. Here you will have to do something similar. You need to find the longest weird subsequence (LWS) of the given string. The subsequence is called weird if it can be split into two disjoint subsequences, one of which is non-decreasing and the other one is non-increasing. Just for clarity, by subsequence of the given string S we mean any string that can be obtained from S by erasing from it zero or more characters. So empty string is a subsequence of any string and any string is a subsequence of itself. Further, note that we consider only strings composed of lowercase Latin letters and these letters compared by their ASCII codes. So, for example, 'a' is smaller than 'b' and 'p' is larger than 'h'. Now let's consider some example. Let S="aabcazcczba". Then "abczz" is its some non-decreasing subsequene, "zccb" is its some non-increasing subsequence and "aabczcczba" is its some weird subsequence since it can be split into non-decreasing subsequence "aabzz" and non-increasing subsequence "cccba": "AABcZccZba" (first subsequence is shown by capital letters just for calrity). Input The first line contains a single positive integer T, the number of test cases. T test cases follow. The only line of each test case contains a non-empty string S composed of lowercase Latin letters. Output For every test case, output the length of the LWS of the given string. Constraints 1<= T <= 10 1 <= length of S <= 2000 Explanation First case: The string itself is LWS since it can be split into non-decreasing subsequence "abc" and non-increasing empty subsequence. Second case: One of the possible LWS is "cbaabc" since it can be split as "cbaABC". Here we indicate by capital letters non-decreasing subsequence and by lowercase letters non-increasing one. Other possible LWS's are "cbaZZa", "AzyaBC". Third case: Here the desired splitting is "ddAABBaaCC".
1
star