7 Helpful Python Snippets

-

 ANAGRAMS

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

from collections import Counter
def anagram(first, second):
    return Counter(first) == Counter(second)
anagram( "abcd3", "3acdb") # True

This method can be used to check if two strings are anagrams.


ALL UNIQUE

The following method checks whether the given list has duplicate elements. It uses the property of set which removes duplicate elements from the list.


def all_unique(lst):
    return len(lst) == len( set(lst))
x = [1,1,2,2,3,2,3,4,5,6]
y = [1,2,3,4,5]
all_unique(x) # False
all_unique(y) # True



CAPITALIZE FIRST LETTERS

s = "live to code"
print(s.title()) # Live to code

This snippet simply uses the method title() to capitalize the first letters of every word in a string.


BYTE SIZE
The following method returns the length of a string in bytes.

def byte_size(string):
    return(len(string.encode('utf-8')))
byte_size('Hii') # 3
byte_size('Tech with fahad') # 15


PRINT A STRING N TIMES
n = 3
s="Hello"
print(s * n) # Hello Hello Hello

This snippet can be used to print a string n times without having to use loops to do it.


CHUNK

The following method chunks a list into smaller lists of a specified size.
def chunk(list, size):
    return [list[i:i+size] for i in range(0, len(list), size)]


MEMORY

import sys
var = {"name":"john"}
print(sys.getsizeof(var)) # 232

This snippet can be used to check the memory usage of an object.

Comments

Post a Comment

Popular posts from this blog

LeetCode 350: Intersection of Two Arrays II

-
Question:-  Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order. Example 1: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [4,9] Explanation: [9,4] is also accepted. Example 2: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Solution:- class Solution {     public int [] intersect ( int [] nums1 , int [] nums2 ) {         int length1 = nums1 . length ;           int length2 = nums2 . length ;         int [] ans = new int [ length1 * length2 ];         int i = 0 , j = 0 , k = 0 ;         Arrays . sort ( nums1 );         Arrays . sort ( nums2 );         while ( i < length1 && j < length2 ){             if ( nums1 [ i ...
Read more

LeetCode 35: Search Insert Position

-
 Question Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with  O(log n)  runtime complexity.   Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2 Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1 Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4   Solution 1- Javascript /** * @param {number[]} nums * @param {number} target * @return {number} */ var searchInsert = function ( nums , target ) { let left = 0 ; let right = nums . length ; while ( left < right ) { const middle = Math . floor (( left + right ) / 2 ); if ( nums [ middle ] < target ) { left = middle + 1 ; } else { right = middle ; } } return left ; };
Read more

LeetCode 217: Contains Duplicate

-
  Question Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: Input: nums = [1,2,3,1] Output: true Example 2: Input: nums = [1,2,3,4] Output: false Example 3: Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true Solutions 1) Go func containsDuplicate ( nums [] int ) bool {     dict := make ( map [ int ] int )     for _ , num := range nums {         dict [ num ]= dict [ num ]+ 1         if ( dict [ num ]> 1 ){             return true ;         }             }     return false } 2) Javascript function containsDuplicate ( nums ) {   const temp = new Set ( nums );   return !( nums . length === temp . size ); }
Read more