Bharath

Coding Interviews

Subsets / Power-set Problem

In the Subsets problem, we find the power set of a given input using bitwise operations. In general, if we have n elements then the subsets are 2^​n​​ subsets.

Coding Interviews

Monotonic Array Problem

For the monotonic increasing array, we need to check if the previous index is less than the current index. And for the monotonic decreasing array, we need to check if the previous index is greater than the current index.

Coding Interviews

Check Kth bit either '1' or '0'

Check Kth bit either '1' or '0'

React

How To Build a Simple React To-Do App with React Hooks

Building a React To-Do app with React Hooks is a great way to learn how to use React Hooks in your projects.

Coding Interviews

What is Big O Notation? Why it is Important For Coding Interviews!!!!

What is Big O Notation? Why it is Important For Coding Interviews?

React

React Hook: A Guide To Beginners

React Hooks were introduced in React 16.8 to allow functional components to manage state and side effects. They provide a way to use stateful logic without writing a class component.

Coding Interviews

Java Program for Longest Substring Without Repeating Characters Solution - LeetCode

Java Program for Longest Substring Without Repeating Characters Solution - LeetCode

LeetCode

Java Program for Add Two Numbers Solution - LeetCode

Java Program for Add Two Numbers Solution - LeetCode

Coding Interviews

Java Program for Two Sum Solution - LeetCode

Java Program for Two Sum Solution - LeetCode

Coding Interviews

Two Sum Problem

Two Sum problem is a classic problem. Let us solve this using five different types from brute force to an optimized approach using Hashtable.