Thejus — AI Developer Portfolio

03 // Experience

ROLE TITLE

2024-PRESENT

Technical specifications and project outcomes...

0 0 0 0 0 0

OTHER EXPERIENCE

Open Source Contributions

Active contributor to various open-source projects, including React.js ecosystem and Python data science libraries.

★★★★★

Technical Writing

Author of technical blog posts and tutorials on web development, machine learning, and cloud computing.

Hackathons & Competitions

Participated and won in several hackathons, developing innovative solutions for real-world problems.

Volunteer Work

Volunteered as a coding instructor for underprivileged students, teaching programming fundamentals.

// DSA_KNOWLEDGE_BASE

Algorithmic Mastery

A structured approach to understanding data structures and algorithms. Optimize your problem-solving process.

Balanced Binary Tree

EASY TREES DFS

Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is defined as a binary tree in which the left and right subtrees of every node differ in height by no more than 1.

class Solution: def isBalanced(self, root: Optional[TreeNode]) -> bool: def dfs(root): # Base case: empty tree is balanced if not root: return [True, 0] # ... implementation hidden

INITIALIZE EXPLORER

// DEV_LOGS_INDEX

Knowledge Base & Documentation

A curated collection of technical documentation, tutorials, and reference guides. Covering everything from development tools to distributed systems theory.

Thoughts, Stories & Experiences

Personal reflections, technical insights, and stories from the journey of building intelligent systems and crafting meaningful software.

Articles

24K

Words Written