📊 Interactive Streamlit dashboard to analyze VAHAN vehicle registration data by category & manufacturer, with YoY insights, growth trends, and investor-focused visualizations.

Given the `root` of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

Given two strings s and part, perform the following operation on s until all occurrences of the substring part are removed:

Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n,

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Given the `root` of a binary tree, return the `postorder` traversal of its nodes' values.

Given the `root` of a binary tree, return the `preorder` traversal of its nodes' values.

Given the `root` of a binary tree, return the inorder traversal of its nodes' values.

Design a HashSet without using any built-in hash table libraries.

You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additional child pointer.

You are given an array of integers arr[]. Your task is to reverse the given array. Note: Modify the array in place.

Given a string s, find the length of the longest substring without repeating characters.

Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously …

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.

This project is a simple text summarization service built using Spring Boot and Apache OpenNLP. It extracts summaries from long texts by detecting sentences and returning the first three sentences …

Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node.