Codezen Solutions using Python

Python Programming Solutions                           

Loops

1. Sum or Product
2. Terms of AP
3. Reverse of Number
4. Binary to decimal
5. Decimal to binary
6. Square root (Integral)

Conditionals and Loops

1. Total Salary
2. Sum of even & odd
3. Find power of number
4. Number Pattern 1
5. Number Pattern 2
6. Number Pattern 3
7. Number Pattern 
8. Alpha Pattern

Fundamentals

1. Average Marks
2. First Character Case
3. Sum of Even till N Number
4. Fahrenheit to Celsius
5. Number Pattern
6. Number Pattern
7. Star Pattern
8. Nth Fibonacci number
9. All prime numbers
10. Fahrenheit to Celsius Function
11. Fibonacci Member

Strings

1. Two substrings
2. Amazing Strings
3. Pangram
4. Remove Duplicates
5. Special strings
6. Internet_Address
7. Longest Bracket
8. Compress the String
9. Find smallest substring

Number Theory

1. Divisor sum
2. Get Palindromic
3. Binary Numbers
4. Reverse Level Order Traversal
5. GCD
6. Check Even Partitioning
7. Factorial
8. New position

Arrays

1. Array Equilibrium Index
2. Division of 4 
3. Special Sum of array
4. Consecutive elements
5. Alternatives
6. Duplicate in array
7. Stocks are profitable
8. Count Inversions
9. Array Equilibrium Index
10. Smallest subarray with required sum
11. Maximum subarray

LinkedList

1. Let last be the first
2. Merge Two linked lists

Other Practice

1. Duplicate in array
2. Maximum Profit on App
3. Interview Shuriken 55: Missing Numbers
4. Interview Shuriken 53: Find the Missing Number
5. Interview Shuriken 52: Sort the Objects

Coding Ninja Tutorial

Linked list 1

1. Length of LL
2. Print ith node
3. Delete node
4. Length of LL (recursive)
5. Delete node (recursive)
6. Insert a node at a specific position in a linked list
7. Find a Node in Linked List
8. AppendLastNToFirst
9. Eliminate duplicates from LL
10. Palindrome LinkedList
11. Print Reverse LinkedList

Linked list 2

1. Reverse LL (Recursive)
2. Reverse LL (Iterative)
3. Midpoint of Linked list
4. Code : Merge two sorted LL
5. Code : Merge Sort
6. Find a node in LL (recursive)
7. Even after Odd LinkedList
8. Delete every N nodes
9. Swap two Nodes of LL
10. kReverse
11. Bubble Sort (Iterative) LinkedList

Stack

1. Code : Stack Using LL
2. Balanced Paranthesis
3. Reverse Stack
4. Check redundant brackets
5. Stock Span
6. Minimum bracket Reversal

Queue

1. Queue Using LL
2. Stack Using 2 Queues
3. Reverse Queue
4. Reverse the First K Elements in the Queue

Binary Tree 1

1. Sum Of Nodes
2. Preorder Binary Tree
3. Postorder Binary Tree
4. Nodes Greater Than X
5. Height Of Tree
6. Replace Node With Depth
7. Is node present?
8. Nodes without sibling

Binary Tree 2

1. Mirror Binary Tree
2. Diameter Of Binary Tree
3. Print Levelwise
4. Construct Tree Using Inorder and Preorder
5. Construct Tree Using Inorder and PostOrder
6. Create & Insert Duplicate Node
7. Min and max
8. Level order traversal
9. Path Sum Root to Leaf
10. Print nodes at distance k from node (Draft)

BST1

1. Search In BST
2. Elements Between K1 and K2
3. Construct BST

BST2

1. Find path in BST
2. BST Class

Dynamic Programming 1

1. Min Steps To 1
2. Minimum Number Of Squares
3. Longest Increasing Subsequence

Dynamic Programming 2

1. Min Cost Path Problem
2. LCS - Problem
3. 0 1 Knapsack - Problem
4. Matrix Chain Multiplication

Backtracking

1. N-Queens
2. Sudoku Solver