Arpit KhuranaHow to use file masking in IntelliJ IDEA (Updated)Intellij Idea is a popular Java IDE. But usually, a java project may contain different kinds of files as well. For example in my case, we…1 min read·Jun 13, 2021----
Arpit Khurana8. Majority ElementGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.1 min read·Oct 20, 2020----
Arpit Khurana7. Binary SearchGiven a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If…1 min read·Oct 20, 2020----
Arpit Khurana6. Longest Consecutive SequenceGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.1 min read·Oct 20, 2020----
Arpit Khurana0–1 Knapsack Problem — Techie DelightIn 0–1 Knapsack problem, we are given a set of items, each with a weight and a value and we need to determine the number of each item to…3 min read·Oct 20, 2020----
Arpit Khurana1. Fibonacci NumberThe Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two…1 min read·Oct 20, 2020----
Arpit Khurana5. Binary Tree Preorder Traversal(Recursive)Given the root of a binary tree, return the preorder traversal of its nodes' values.2 min read·Oct 20, 2020----
Arpit KhuranaBinary Tree Preorder Traversal (Iterative)Given the root of a binary tree, return the preorder traversal of its nodes' values.2 min read·Oct 20, 2020----
Arpit Khurana3. Find Level Order Traversal of a Binary Tree.Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).1 min read·Oct 19, 2020----
Arpit Khurana2. Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.1 min read·Oct 19, 2020----