DS & Algo

A curated list of problems, solutions, and notes for interview prep.

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

O(n)

You are given two non-empty linked lists representing two non-negative integers. Add the two numbers and return the sum as a linked list.

Implement binary search to find a target in a sorted array.

O(log n)

Merge k sorted linked lists and return it as one sorted list.

O(n log k)

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

O(n)

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

O(\log(min(m,n)))