amanbidla / todayilearntto Goto Github PK

Given a boolean expression containing '&', '|' , '^' and a boolean result, find the total number of ways of parenthesizing expression such that the expression evalutes to the given boolean result 
Find the largest Continguous sum in an array of int
Given net total value and US currency find how many ways you can generate total value
Generate all subsets of set
Generate all left and right parenthesis 
Compression string 'aaabbcccc' to a3b2c4
Clone a singly linked list with a random pointer to any other node
Find intersection between two linkedlist
Find all nodes between given 2 numbers in a binary search tree
Change binary search tree to replace each node with sum of each nodes below
Reverse a single linked list iteratively
kreverse a single linked list
Show all paths from root to leaf in binary tree
Find number of nodes of BST
mirror a BT
check if tree is BST
find all paths in BT which adds to a sum
find size of BT 
find depth of node say root node of BT
find successor of a node in BST
store all nodes in a leve in list. if there are 3 levels there should be 3 linked lists
Find the length of longest non repeated substring
Find the least common ancestor of 2 nodes in Binary Tree
Find if 2 strings are anagrams ?
Find the longest common subsequence.
Replace all spaces with '%20' without using replace
Find the k-th smallest element of an unsorted array of n elements
Sort stack without loop
Code to covert infix to postfix notation
Code to find if pattern is present in string
Code to reverse a singly linked list
Code to rotate a matrix by 90,180,270 degrees
Code to find all permutations of string
Given a 2 dimensional point of a rectangle and its area, find permutations of 
all the other 3 points of the rectangle in 2-D space.
Compress string: "aaabbcccaa" should o/p a3b2c3a2 but if compressed string length > original string length then o/p original 
string.
Write single line to convert array to set using generics
code to Iterate through hashmap
Find L1 & L2 are 2 linked lists and L2 is connected to L1. Find the node where L2 connects to L1 in O(1) space and O(n) time
L1 [][][][][][][]-NULL
		   /
L2 [][]][]/
Implement a Hashmap NOTE: PENDING DO CODE