Insert Delete GetRandom O(1) | LeetCode 380 | C++, Java, Python | 🔥🔥

Показать описание

**** Best Books For Data Structures & Algorithms for Interviews:**********
*****************************************************************************

June LeetCoding Challenge | Problem 12 | Insert Delete GetRandom O(1) | 12 June,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Insert Delete GetRandom O(1),
Insert Delete GetRandom O(1) c++,
Insert Delete GetRandom O(1) Java,
Insert Delete GetRandom O(1) python,
Insert Delete GetRandom O(1) solution,
380. Insert Delete GetRandom O(1),

#Facebook #CodingInterview #LeetCode #JuneLeetCodingChallenge #Google #Amazon #InsertDeleteGetRandom

Рекомендации по теме

Комментарии

This is true Machine Learning, Program automatically learns how to be fast.

Amit_Kumar_

hi...i just want to know where the elements of vector and their indexes are being assigned to the unordered map...or is it prewritten in the code?

hemanthshankar

In my java solution, Time is taking 132 ms and runtime is beating only 9.5% . Although I am performing all the operations in o(1) time.

Here is my java code : Please suggest Where I went wrong

ArrayList<Integer> list;
HashMap<Integer, Integer> map;
public RandomizedSet() {
list=new ArrayList();
map=new HashMap();
}

/** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
public boolean insert(int val) {
if(!list.contains(val)){
list.add(val);
map.put(val, list.size()-1);
return true;
}
else
return false;

}

/** Removes a value from the set. Returns true if the set contained the specified element. */
public boolean remove(int val) {
if(map.containsKey(val)){
int curIndex =map.get(val);
list.set(curIndex, list.get(list.size()-1));
map.put(list.get(curIndex), curIndex);
list.remove(list.size()-1);
map.remove(val);
return true;
}
else
return false;

}

/** Get a random element from the set. */
public int getRandom() {
int
return list.get(random);

}

praveenj

Isn't the insert function taking O(n) time??

sushilsekharsatapathy

Sir pls share java code in discription

himanshuchhikara

Insert Delete GetRandom O(1) | LeetCode 380 | C++, Java, Python | 🔥🔥

Insert Delete GetRandom O(1) - Leetcode 380 - Python

Design data structure | Insert Delete GetRandom O(1) | Leetcode #380

Leetcode - Insert Delete GetRandom O(1) (Python)

INSERT/DELETE/GETRANDOM() O(1) | PYTHON | LEETCODE # 380

[Java] Leetcode 380. Insert Delete GetRandom O(1) [Design #2]

Insert Delete GetRandom O(1) | LeetCode 380 | C++, Java, Python | 🔥🔥

Insert Delete GetRandom O(1) | Detailed | Google | Leetcode 380

Leetcode | 380. Insert Delete GetRandom O(1) | Medium | Java Solution

Insert Delete GetRandom O(1) | Day 12 | [June LeetCoding Challenge] [Leetcode #380] [2020]

Leetcode Insert Delete GetRandom O(1) With/Without Duplicates |Solving AlgoPrep 151 | Nishant Chahar

380. Insert Delete GetRandom O(1) | Hot & Important Question

Insert Delete GetRandom O(1) | Java | LeetCode - Medium - 380

Leetcode 381. Insert Delete GetRandom O(1) - Duplicates Allowed| Python| LinkedIn Interview Question

Insert Delete Getrandom O(1) || Leetcode

Amazon Coding Question - Insert Delete GetRandom O(1)

LeetCode 380 | Insert Delete GetRandom O(1) | Medium | C# solution |

Insert Delete GetRandom O(1) | LeetCode 380 | Programming Tutorials

381. Insert Delete GetRandom O(1) - Duplicates allowed | full - explained

Insert Delete Getrandom O(1) - Duplicates allowed || Leetcode

380. Insert Delete GetRandom O(1)

380. Insert Delete GetRandom O(1) - Day 29/30 Leetcode November Challenge

Insert Delete GetRandom O(1) | leetcode 380 | Hindi

HOW TO Insert Delete GetRandom O(1) - Leetcode 380

380. Insert Delete GetRandom O(1) | JavaScript | LeetCode Daily Challenge