Sunday, 29 November 2020
A small library which will convert censored words to * so that we can process string on frontend side
There are many cases in Android app where the user enters some abusive content.
So what does admin needs to supervise all the posts and then publish to public feeds !
Isn't that a hectic work, So where the CENSORY used.
With censory, frontend dev can filter the Input string to a well suitable string.
HOW TO USE
Saturday, 15 August 2020
So the Code for the styling part will be:
After applying this code our final contact form looks something like
So just stay tuned for more exciting posts every week!
Sunday, 9 August 2020
So today we are gonna make a registration form layout as below using HTML and CSS.
To run the code you can use any editor of your choice like
- Notepad++
- Sublime Text
- Atom
- Adobe Dreamweaver CC
Note: The background image is uploaded from local host and not any URL so use yours in the code.Html Tags Used:- <html>
- <title>
- <body>
- <div>
- <button>
- <input>
- <label>
- <textarea>
Code:
- <html>
- <title>
- <body>
- <div>
- <button>
- <input>
- <label>
- <textarea>
Thursday, 6 August 2020
Git-hub Best Android Open Source Project
So, welcome back guys with top 5 android open source projects that are available on Github to serve community.So, without wasting time, lets get start..
1. TrebleShot
- Pause, resume and reconnect transfers
- Share large files
- Share all kinds of content, video, photo, music and app libraries
- No Internet connection is required: Set up a hotspot and connect to it using a QR code
- Share between multiple devices at the same time
- Exchange texts of any kind and save them to TrebleShot
- Share folders for backup and other purposes
- Light UI: Works faster than its rivals on low-end devices
- Speed-oriented: Minimal UI optimized for speed
- Advanced features: Network change handling, choose network based on measured speed
2. NewPipe
- Search videos
- Display general info about videos
- Watch YouTube videos
- Listen to YouTube videos
- Popup mode (floating player)
- Select streaming player to watch video with
- Download videos
- Download audio only
- Open a video in Kodi
- Show next/related videos
- Search YouTube in a specific language
- Watch/Block age restricted material
- Display general info about channels
- Search channels
- Watch videos from a channel
- Orbot/Tor support (not yet directly)
- 1080p/2K/4K support
- View history
- Subscribe to channels
- Search history
- Search/watch playlists
- Watch as enqueued playlists
- Enqueue videos
- Local playlists
- Subtitles
- Livestream support
- Show comments
3. TiberX
- play music on timber
- play 'song name' on timber
- play
- pause
- next song
- previous song
5. MOVIE GUIDE
- Customizable
- Search any movie
- Display general and detailed info for any movie using IMDB
- Clean
- Powerful
- Safe
- Private
Problem:
Objective: To Check whether two strings are Anagrams
or Not.
What are
Anagram strings?
The strings which
constitutes of the same letters but arranged in different order are called as
Anagrams.
Example: Silent
and Listen are Anagrams since both contain the same letters {I,E,L,S,T}.
Input Format:
First two
lines takes the two strings to check for.
Gets is used
although it is not advised to use gets() since it can cause Buffer Overflow.
But since it is a simple program we have neglected that.
We have
used vector for this program.
Vector
are nothing but kind of dynamic arrays.
We daclare a vector as
“vector<string> s11,s22; ”
Here s11 and s22 are vector strings
Sample Code:
Problem:Objective: To find the Factorial of Numbers whose factorial is of the order 10^7.Input:- First line takes t number of test case
- the next t lines takes the number whose factorial is to be found.
Output: The next t lines after input gives the ouput.
Code
We are storing the factorial in parts in array indices. Instead of finding the factorial of given number we are finding the factorials of all numbers upto 100001 in their respective array indices and just print the desired facts.
By taking mod with our self defined value of 10^7 we are in a way compressing the number at each level so that are data types can hold that value.
a[i] = ((i%mod)*(a[i-1]%mod))%mod;
The above line of code is very important to understand the code.This is the line in which through which we are compressing the number to our data type limits (long long)