#interview

Read more stories on Hashnode

Articles with this tag

Finding subsets of an array using bit manipulation(Power Set) and recursion. · Bit Manipulation public List<List<Integer>> subsets(int[] nums) { ...

Search in a Binary Search Tree - LeetCode. O(log n) solutions. Iterative and recursive · Binary Search Tree (BST) is an excellent data structure for...

Solving and analyzing space and time complexity of an easy leetcode problem · This problem is very straightforward, we just have to convert the problem...

You can find the link to the problem- here First solution with bucket sort and time complexity O(n) class Solution { public int[]...