Spammer : spam words in whatsapp, Instagram and anywhere

-



GitHub:     https://github.com/AdithyakrishnaV/Spammer
YouTube:  https://www.youtube.com/watch?v=_1GeJM1lL7I

  1. import time: This line imports the time module in Python, which provides various time-related functions.

  2. import pyautogui: This line imports the pyautogui module, which is a Python library for automating mouse and keyboard actions.

  3. time.sleep(10): This line pauses the program for 10 seconds using the sleep function from the time module. This is useful if you want to delay a particular action in your code.

  4. for i in range(39):: This line starts a for loop that will iterate 39 times. The variable i will take on the values 0 through 38 during each iteration.

  5. pyautogui.typewrite("It's a spam \n" ): This line uses the typewrite function from the pyautogui module to simulate keyboard input. It will type the string "It's a spam" followed by a newline character (\n) each time the loop runs. This could be used to automate the sending of repeated messages, although it's worth noting that such behavior could be seen as spamming and could potentially violate terms of service on certain platforms.

Comments

Post a Comment

Popular posts from this blog

Day 30: Sliding Window Maximum: Sliding Window - leetcode - Python3

-
You are given an array of integers  nums , there is a sliding window of size  k  which is moving from the very left of the array to the very right. You can only see the  k  numbers in the window. Each time the sliding window moves right by one position. Return  the max sliding window . Example 1: Input: nums = [1,3,-1,-3,5,3,6,7], k = 3 Output: [3,3,5,5,6,7] Explanation: Window position Max --------------- ----- [1 3 -1] -3 5 3 6 7 3 1 [3 -1 -3] 5 3 6 7 3 1 3 [-1 -3 5] 3 6 7 5 1 3 -1 [-3 5 3] 6 7 5 1 3 -1 -3 [5 3 6] 7 6 1 3 -1 -3 5 [3 6 7] 7 Example 2: Input: nums = [1], k = 1 Output: [1] Constraints: 1 <= nums.length <= 10 5 -10 4 <= nums[i] <= 10 4 1 <= k <= nums.length    SOLUTION class Solution :     def maxSlidingWindow ( self , nums : List [ int ], k : int ) -> List [ int ]:         result = []         q = collections.deque ()         l = r = 0
Read more

Day 31: Climbing Stairs : leetcode: python3

-
  You are climbing a staircase. It takes   n   steps to reach the top. Each time you can either climb  1  or  2  steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps Example 2: Input: n = 3 Output: 3 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2. 1 step + 2 steps 3. 2 steps + 1 step Constraints: 1 <= n <= 45    SOLUTION: class Solution :     def climbStairs ( self , n : int ) -> int :         pOne , pTwo = 1 , 1         for i in range ( n -1 ):             temp = pOne             pOne = pOne + pTwo             pTwo = temp         return pOne Time Complexity: O(n) Space Complexity:O(1) How it works: The climbStairs function takes an integer n as input and returns the number of distinct ways to climb to the top of the staircase. The variables pOne and pTwo are initialized to 1. These variables represent
Read more

Day 7: Top K Frequent Elements - leetcode - Python3

-
Image
  Given an integer array   nums   and an integer k , return   the   k   most frequent elements . You may return the answer in   any order . Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input: nums = [1], k = 1 Output: [1] Constraints: 1 <= nums.length <= 10 5 -10 4 <= nums[i] <= 10 4 k  is in the range  [1, the number of unique elements in the array] . It is  guaranteed  that the answer is  unique . Follow up:  Your algorithm's time complexity must be better than  O(n log n) , where n is the array's size. SOLUTION : class Solution :     def topKFrequent ( self , nums : List [ int ], k : int ) -> List [ int ]:         count : dict [ int , int ] = {}         freq : List [ List [ int ]] = [[] for i in range ( len ( nums ) + 1 )]         result : List [ int ] = []         for n in nums :             count [ n ] = count.get ( n , 0 ) + 1             # using hashmap to find the frequency             #of each occurance    
Read more