InterviewBit

Solution of InterviewBit Problems in python 3

Topic Covered ::

Level	Topic	Python	Go	CPP	Note
2	Arrays	Done	--	--	Working
2	Math	Done	--	--	Working
3	Binary Search	Done	--	--	Working
3	Strings	Done	--	--	Working
3	Bit Manipulation	Done	--	--	Working
3	Two Pointers	Done	--	--	Working
4	Linked List	Done	--	--	Working
4	Stacks And Queues	Done	--	--	Working
5	Backtracking	Done	--	--	Working
5	Hashing	Done	--	--	Working
6	Heaps and Maps	Done	--	--	Working
6	Tree Data Structure	Done	--	--	Working
7	Dynamic Programming	Done	--	--	Working
7	Greedy Algorithm	Done	--	--	Working
8	Graph Data Structure and Algorithms	Done	--	--	Working

#	Title	Python	Go	CPP	Note
1	Length of Longest Subsequence	Done	---	---	Medium
2	Largest area of rectangle with permutations	Done	---	---	Hard
3	Ways to Decode	Done	---	---	Easy
4	Stairs	Done	---	---	Basic
5	Intersecting Chords in a Circle	Done	---	---	Medium

#	Title	Python	Go	CPP	Note
1	Vertical Order traversal of Binary Tree	Done	---	---	Medium
2	Inorder Traversal	Done	---	---	Basic
3	Postorder Traversal	Done	---	---	Basic
4	Preorder Traversal	Done	---	---	Basic
5	ZigZag Level Order Traversal BT	Done	---	---	Easy
6	Populate Next Right Pointers Tree	Done	---	---	Medium
7	Path Sum	Done	---	---	Medium
8	Root to Leaf Paths With Sum	Done	---	---	Medium
9	Max Depth of Binary Tree	Done	---	---	Easy
10	Min Depth of Binary Tree	Done	---	---	Easy
11	Sum Root to Leaf Numbers	Done	---	---	Medium

#	Title	Python	Go	CPP	Note
1	Min Steps in Infinite Grid	Done	---	---	Easy
2	Add One To Number	Done	---	---	Easy
3	Max Sum Contiguous Subarray	Done	---	---	Easy
4	Maximum Absolute Difference	Done	---	---	Easy
5	Repeat and Missing Number Array	Done	---	---	Easy
6	Flip	Done	---	---	Medium

Authors

• Amit Kumar - Initial work - AlgorithmsAndDatastructure