Saturday, 6 June 2026

πŸš€ Day 60/150 – Find Second Largest Element in Python

 


πŸš€ Day 60/150 – Find Second Largest Element in Python

The second largest element is the number that is just smaller than the largest number in the list.

Example:
[10, 20, 4, 45, 99] → Largest = 99, Second Largest = 45

Let’s explore different ways to find it πŸ‘‡

πŸ”Ή Method 1 – Using Sorting

numbers = [10, 20, 4, 45, 99] numbers.sort() print("Second Largest:", numbers[-2])





πŸ”Ή Method 2 – Using set() + 
max()

numbers = [10, 20, 4, 45, 99] numbers = list(set(numbers)) numbers.remove(max(numbers)) print("Second Largest:", max(numbers))






πŸ”Ή Method 3 – Using Loop

numbers = [10, 20, 4, 45, 99] largest = second = float('-inf') for num in numbers: if num > largest: second = largest largest = num elif num > second and num != largest: second = num print("Second Largest:", second)









πŸ”Ή Method 4 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) numbers = sorted(set(numbers)) print("Second Largest:", numbers[-2])





πŸ’‘ Key Takeaways

  • Sorting is the easiest way
  • set() helps remove duplicates
  • Loop method is efficient because it scans only once
  • Always consider duplicate values when finding the second largest


Friday, 5 June 2026

πŸš€ Day 59/150 – Rotate a List in Python

 



πŸš€ Day 59/150 – Rotate a List in Python

Rotating a list means shifting its elements either to the left or to the right.

Example:
[1, 2, 3, 4, 5]

Rotate right by 2 → [4, 5, 1, 2, 3]
Rotate left by 2 → 
[3, 4, 5, 1, 2]

Let’s explore different ways to rotate a list πŸ‘‡

πŸ”Ή Method 1 – Right Rotation Using Slicing

numbers = [1, 2, 3, 4, 5] k = 2 rotated = numbers[-k:] + numbers[:-k] print("Right Rotated:", rotated)

πŸ”Ή Method 2 – Left Rotation Using Slicing

numbers = [1, 2, 3, 4, 5] k = 2 rotated = numbers[k:] + numbers[:k] print("Left Rotated:", rotated)

πŸ”Ή Method 3 – Using Loop (Right Rotation by One)

numbers = [1, 2, 3, 4, 5] last = numbers[-1] for i in range(len(numbers) - 1, 0, -1): numbers[i] = numbers[i - 1] numbers[0] = last print("Rotated List:", numbers)

πŸ”Ή Method 4 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) k = int(input("Enter rotation count: ")) k = k % len(numbers) rotated = numbers[-k:] + numbers[:-k] print("Rotated List:", rotated)

πŸ’‘ Key Takeaways

  • Slicing is the easiest way to rotate a list
  • Use k % len(list) to handle large rotation values
  • Right rotation uses [-k:] +[:-k]
  • Left rotation uses [k:] +[:k]



Python Coding Challenge - Question with Answer (ID -050626)

 


Explanation:

πŸ”Ή Step 1: Create Empty List

x = []

An empty list is created:

[]

Memory:

x ──► []

πŸ”Ή Step 2: Append the List to Itself
x.append(x)

Normally we do:

x.append(1)

or

x.append("A")

But here we're doing:

x.append(x)

which means:

Append the list itself inside itself

After execution:

x = [x]

Visual representation:

x
[ x ]

More accurately:

x

The list contains a reference to itself.

πŸ”Ή Step 3: Understand x[0]
x[0]

First element of the list is:

x

itself.

So:

x[0] is x

becomes:

True

Both point to the exact same object.

πŸ”Ή Step 4: Evaluate Comparison
x == x[0]

Substitute:

x == x

Python is effectively comparing the same object with itself.

Result:

True

πŸ”Ή Step 5: Print Result
print(True)


Output:

True


Thursday, 4 June 2026

πŸš€ Day 58/150 – Find Unique Elements in a List in Python

 


πŸš€ Day 58/150 – Find Unique Elements in a List in Python

Unique elements are values that appear only once in the list.

Example:
[1, 2, 2, 3, 4, 4, 5] → Unique elements = [1, 3, 5]

Let’s explore different ways to find them πŸ‘‡

πŸ”Ή Method 1 – Using Loop

numbers = [1, 2, 2, 3, 4, 4, 5] unique = [] for num in numbers: if numbers.count(num) == 1: unique.append(num) print("Unique Elements:", unique)


πŸ”Ή Method 2 – Using List Comprehension

numbers = [1, 2, 2, 3, 4, 4, 5] unique = [num for num in numbers if numbers.count(num) == 1] print("Unique Elements:", unique)




πŸ”Ή Method 3 – Using collections.Counter

from collections import Counter numbers = [1, 2, 2, 3, 4, 4, 5] freq = Counter(numbers) unique = [num for num in numbers if freq[num] == 1] print("Unique Elements:", unique)


πŸ”Ή Method 4 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) unique = [num for num in numbers if numbers.count(num) == 1] print("Unique Elements:", unique)

πŸ’‘ Key Takeaways

  • Unique elements appear exactly once
  • count() is easy to understand but slower for large lists
  • Counter is better for larger datasets
  • Useful in data cleaning and duplicate detection






Popular Posts

Categories

100 Python Programs for Beginner (119) AI (300) Android (25) AngularJS (1) Api (7) Assembly Language (2) aws (30) Azure (12) BI (10) Books (270) Bootcamp (12) C (78) C# (12) C++ (83) cloud (1) Course (87) Coursera (300) Cybersecurity (32) data (7) Data Analysis (38) Data Analytics (26) data management (16) Data Science (382) Data Strucures (23) Deep Learning (187) Django (16) Downloads (3) edx (21) Engineering (15) Euron (30) Events (7) Excel (21) Finance (10) flask (4) flutter (1) FPL (17) Generative AI (74) Git (12) Google (53) Hadoop (3) HTML Quiz (1) HTML&CSS (48) IBM (43) IoT (3) IS (25) Java (99) Leet Code (4) Machine Learning (335) Meta (24) MICHIGAN (5) microsoft (13) Nvidia (8) Pandas (14) PHP (20) Projects (34) Python (1397) Python Coding Challenge (1178) Python Mathematics (4) Python Mistakes (51) Python Quiz (559) Python Tips (22) Questions (3) R (72) React (7) Scripting (3) security (4) Selenium Webdriver (4) Software (20) SQL (52) Udemy (18) UX Research (1) web application (11) Web development (9) web scraping (3)

Followers

Python Coding for Kids ( Free Demo for Everyone)