Skip to content

Instantly share code, notes, and snippets.

View plnagaraju's full-sized avatar

Lakshmi Nagaraju Peruboina plnagaraju

View GitHub Profile
Below are the Big O performance of common functions of different Java Collections.
List | Add | Remove | Get | Contains | Next | Data Structure
---------------------|------|--------|------|----------|------|---------------
ArrayList | O(1) | O(n) | O(1) | O(n) | O(1) | Array
LinkedList | O(1) | O(1) | O(n) | O(n) | O(1) | Linked List
CopyOnWriteArrayList | O(n) | O(n) | O(1) | O(n) | O(1) | Array
@plnagaraju
plnagaraju / grokking_to_leetcode.md
Created August 31, 2022 20:28 — forked from tykurtz/grokking_to_leetcode.md
Grokking the coding interview equivalent leetcode problems

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

@plnagaraju
plnagaraju / Array.fill()
Last active November 11, 2019 11:37
Array.fill()
dyyjVEw
-------
A [Pen](https://codepen.io/plnagaraju/pen/dyyjVEw) by [PLNagaraju](https://codepen.io/plnagaraju) on [CodePen](https://codepen.io).
[License](https://codepen.io/plnagaraju/pen/dyyjVEw/license).