Jai-Prakash-Singh/django_rest_frame_work_practice
Public repository.
Discovered public repositories for Jai-Prakash-Singh in the GitHub catalog.
Public repository.
Public repository.
Public repository.
Public repository.
code to parse snap_deal_parse run snap_deal_trigger.py
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
scrapy_hindilink_actor
scrapy_hindi_latest
parsing scrapy_hindi_link
flip_with_scrapy
Random proxy middleware for Scrapy
parse_flip
bot_blog_com
bot_for_wp
automatic bot
fetching source code of a particular site from selenium from firebug
parsing of h_link
parsing only for a perticualr site e****.com
Write a function that takes a character (i.e. a string of length 1) and returns True if it is a vowel, False otherwise. running step: python is_vowel.py
Define a function that computes the length of a given list or string. (It is true that Python has the len() function built in, but writing it yourself is nevertheless a good exercise.) running step: python compute_len.py ~
Public repository.
Define a function max() that takes two numbers as arguments and returns the largest of them. Use the if-then-else construct available in Python. (It is true that Python has the max() function built in, but writing it yourself is nevertheless a good exercise.) running step: python max_fun.py
write a version of a palindrome recogniser that accepts a file name from the user, reads each line, and prints the line to the screen if it is a palindrome.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
Public repository.
""" Your task in this exercise is as follows: Generate a string with N opening brackets ("[") and N closing brackets ("]"), in some arbitrary order. Determine whether the generated string is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest. Examples: [] OK ][ NOT OK [][] OK ][][ NOT OK [[][]] OK []][[] NOT OK """
A sentence splitter is a program capable of splitting a text into sentences
A certain childrens game involves starting with a word in a particular category. Each participant in turn says a word, but that word must begin with the final letter of the previous word. Once a word has been given, it cannot be repeated. If an opponent cannot give a word in the category, they fall out of the game.
An alternade is a word in which its letters, taken alternatively in a strict sequence, and used in the same order as the original word, make up at least two other words.
Public repository.