# Coding Interview Questions

Coding Interviews are important. Startups and FAANG companies filter candidates through an online coding test or whiteboard coding interviews. Its a technical problem-based job interview technique to assess applicants for a computer programming or software development position.

## Two Sum Problem

In this two-sum problem, we use various approaches to solve the problem from brute force to an optimized approach. We also discuss the take-offs and talk about complexity analysis.

## Solution Review: Get the First Set Bit Position Using the Right Shift

In the kth bit set/unset problem, we first write the algorithm, then some pseudocode, and then implement the solution.

## Challenge 1: Get the First Set Bit Position Using the Right Shift

This problem is similar to the last lesson we discussed. If you need a clue, return to the previous lesson to further your understanding.

## Check If Kth Bit Is Set/Unset Using Right Shift

In the kth bit set/unset problem, we need to write a program that checks whether the kth bit of a number is 1 or 0.

## Solution Review: Get The First Set Bit Position Using the Left Shift

In the kth bit set/unset problem, we first write the algorithm, then some pseudocode, and then implement the solution.

## Challenge 1: Get the First Set Bit Position Using the Left Shift

This problem is similar to the last lesson we discussed. If you need a clue, return to the previous lesson to further your understanding.

## Check If Kth Bit Is Set/Unset Using Left Shift

In the kth bit set/unset problem, we need to write a program that checks whether the kth bit of a number is either 1 or 0.

## Solution Review: Missing Number

We solved the problem using lookup (hashtable), using the mathematical formula. Let's solve this more efficiently using bit-level operations with XOR and then optimize the solution.

## Solution Review: Single Number

Single Number coding question, can be easily solved with XOR bitwise technique with linear time complexity.