VISHWANATH T S (@vishwanathts)

Why Python’s Built-In Functions Outperform Manual Optimization?

Introduction When solving problems in Python, many developers try to manually optimize solutions, believing it will outperform built-in functions. However, Python’s built-ins are often optimized for performance, making manual approaches unnecessary i...

Jan 2, 2025 · 4 min readvishwanathts.hashnode.dev

Checking if a Binary Tree is Balanced : Leetcode Solution

Introduction In computer science, a balanced binary tree is a tree where the height difference between the left and right subtrees of any node is at most 1. This property ensures optimal performance for tree operations like search, insert, and delete...

Dec 24, 2024 · 3 min readvishwanathts.hashnode.dev

Convert Sorted Array to Binary Search Tree : Leetcode Solution.

Problem Statement You are given an integer array nums where the elements are sorted in ascending order. Convert it into a height-balanced binary search tree. The problem can be found on LeetCode. Intuition The first thought is that a binary search t...

Dec 22, 2024 · 2 min readvishwanathts.hashnode.dev

Solving 'Final Array State After K Multiplication Operations' : Leetcode Solution

In this article, we will discuss a solution to the LeetCode problem "Final Array State After K Multiplication Operations". This problem challenges us to repeatedly multiply the smallest element in an array by a given multiplier and return the final s...

Dec 19, 2024 · 3 min readvishwanathts.hashnode.dev

Maximum Depth of a Binary Tree : Leetcode Solution.

Introduction The depth of a binary tree is one of the fundamental properties used to understand its structure. Calculating the maximum depth of a binary tree involves determining the longest path from the root node to a leaf node. This article explai...

Dec 16, 2024 · 3 min readvishwanathts.hashnode.dev

VISHWANATH T S

About

Available for

VISHWANATH T S's blogs

Why Python’s Built-In Functions Outperform Manual Optimization?

Checking if a Binary Tree is Balanced : Leetcode Solution

Convert Sorted Array to Binary Search Tree : Leetcode Solution.

Solving 'Final Array State After K Multiplication Operations' : Leetcode Solution

Maximum Depth of a Binary Tree : Leetcode Solution.

VISHWANATH T S

About

Available for

VISHWANATH T S's blogs

Why Python’s Built-In Functions Outperform Manual Optimization?

Checking if a Binary Tree is Balanced : Leetcode Solution

Convert Sorted Array to Binary Search Tree : Leetcode Solution.

Solving 'Final Array State After K Multiplication Operations' : Leetcode Solution

Maximum Depth of a Binary Tree : Leetcode Solution.

VISHWANATH T S

About

Available for

VISHWANATH T S's blogs

Why Python’s Built-In Functions Outperform Manual Optimization?

Checking if a Binary Tree is Balanced : Leetcode Solution

Convert Sorted Array to Binary Search Tree : Leetcode Solution.

Solving 'Final Array State After K Multiplication Operations' : Leetcode Solution

Maximum Depth of a Binary Tree : Leetcode Solution.

Search Hashnode

VISHWANATH T S

About

Available for

VISHWANATH T S's blogs

Why Python’s Built-In Functions Outperform Manual Optimization?

Checking if a Binary Tree is Balanced : Leetcode Solution

Convert Sorted Array to Binary Search Tree : Leetcode Solution.

Solving 'Final Array State After K Multiplication Operations' : Leetcode Solution

Maximum Depth of a Binary Tree : Leetcode Solution.