## Longest Substring Without Repeating Characters – Java Solution | Python Solution

Given a string s, find the length of the longest substring without repeating characters | LeetCode solution | Java | Python

3. Add Two Numbers LinkedList You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add … Read More

## Merge two sorted list

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first … Read More

## Valid Parenthesis

Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. … Read More

## LeetCode 1366. Rank Teams by Votes – Java

Problem Statement In a special ranking system, each voter gives a rank from highest to lowest to all teams participating in the competition. The ordering of teams is decided by … Read More

## 1235. Maximum Profit in Job Scheduling – Solution – Java

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You’re given the startTime, endTime and profit arrays, return the maximum profit you can take such that there are no … Read More

## 735. Asteroid Collision – Leetcode – Java – Explanation

Problem statement We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning … Read More

## Two Sum – LeetCode

1. Two Sum Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and … Read More

## Best Time to Buy and Sell Stock – LeetCode – Solution

121. Best Time to Buy and Sell Stock – Solution You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by … Read More

## Two sum problem | Solution

Problem: Two Sum | LeetCode Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would … Read More