Knapsack problem is called Weakly NP complete or pseudo-polynomial. Time complexity of solving it is - O(n*W) .The value of W is linear but the length of W is exponential - length in terms of bits. Pseudo polynomial means - running time is a polyno...
I have created the above road map when I was going through Cracking the Coding Interview book's first chapter a while back. I felt that the roadmap needed a little customization so I created this. Hopefully someone may stumble upon this and get some ...
When solving Data Structures and Algorithms (DSA) questions related to strings, I consistently have a conceptual understanding of manipulating input strings to achieve the desired output. However, leveraging the built-in methods or properties of the ...
The perception that modernism and technology are failing us might stem from various factors and viewpoints. It's important to recognize that technology itself is not inherently good or bad; it's how we use it and the consequences of its use that matt...
Problem Link: https://practice.geeksforgeeks.org/problems/swap-all-odd-and-even-bits-1587115621/1?page=1&status[]=bookmarked&sortBy=submissions Problem Statement: Given an unsigned integer N. The task is to swap all odd bits with even bits. For examp...
Problem 1 - https://leetcode.com/contest/weekly-contest-343/problems/determine-the-winner-of-a-bowling-game/ class Solution { public int isWinner(int[] p1, int[] p2) { int n = p1.length; if(n==0) return 0; if...
Given a 2n*2n matrix. You can flip the entire row and entire column as many times as you want, you have to make the first quadrant value maximum after a certain number of operations. Return the sum of the first quadrant after flipping the matrix's co...
Remove all the half nodes and return the final binary tree. class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int val) { this.val = val; this.left = null; this.right = null; } } class Solu...
Problem Statement: A top secret message containing uppercase letters from 'A' to 'Z' has been encoded as numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 You are an FBI agent and you need to determine the total number of ways tha...