# JSFiddle

## Abhishek's public fiddles

• ### L6t4szvd

No-Library (pure JS), HTML, CSS, JavaScript

• ### Flowchart Sample

No-Library (pure JS), HTML, CSS, JavaScript

• ### kz067p9c

No-Library (pure JS), HTML, CSS, JavaScript

• ### snx4couy

No-Library (pure JS), HTML, CSS, JavaScript

• ### Heap Sort

No-Library (pure JS), HTML, CSS, JavaScript

• ### Quick Sort

No-Library (pure JS), HTML, CSS, JavaScript

• ### Merge sort alogrithm

No-Library (pure JS), HTML, CSS, JavaScript

• ### Stack

No-Library (pure JS), HTML, CSS, JavaScript

• ### Queue

No-Library (pure JS), HTML, CSS, JavaScript

• ### zrox3wb7

No-Library (pure JS), HTML, CSS, JavaScript

• ### 32. Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

• ### 32. Longest Valid Parentheses

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

• ### 4. Median of Two Sorted Arrays

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

• ### 1029. Two City Scheduling

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti. Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.

• ### z2xbrn73

No-Library (pure JS), HTML, CSS, JavaScript

• ### vcpzx2j1

No-Library (pure JS), HTML, CSS, JavaScript

• ### wg4qnfmd

No-Library (pure JS), HTML, CSS, JavaScript

• ### 7kesdcbv

No-Library (pure JS), HTML, CSS, JavaScript

• ### <hello-kitty>

snuggsiツ Kitty Carousel