- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using array
- Square root
- Preorder Traversal
- Implement strstr
- Search a node in BST
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Modular Node
- Find n/k th node in Linked list
- Queue Reversal
- Insert in Middle of Linked List
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Operations on Stack
- Absolute Value
- Convert Celsius To Fahrenheit
- Check whether K-th bit is set or not
- Count total set bits
- Bit Difference
- Number is sparse or not
- Gray Code
- Gray to Binary equivalent
- Power of 2
- Tower Of Hanoi
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- Majority Element
- Left Index
- Binary Array Sorting
- Adding two matrices
- Sum of upper and lower triangles
- Multiply the matrices
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Check if a string is Isogram or not
- Binary String
- Check if string is rotated by two places
- Check if strings are rotations of each other or not
- Maximum Occuring Character
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Generate Binary Numbers
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Print first n Fibonacci Numbers
- Check if two arrays are equal or not
- Keypad typing
- Union of two arrays
- Intersection of two arrays

Name

vamsi krishna

Institution

Rank in Institute

#63

Courses Attended

Campus Ambassador

Overall Coding Score: 626

Monthly Coding Score: 0

Weekly Coding Score: 0

- Reverse a linked list
- Occurence of an integer in a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Quick Sort
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- DFS of Graph
- Insert a node in a BST
- Determine if Two Trees are Identical
- Implement two stacks in an array
- Level order traversal Line by Line
- Josephus problem
- Check if Linked List is Palindrome
- Delete a Node in Single Linked List
- Sort a stack
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Counting Sort
- Reverse a string using Stack
- Children Sum Parent
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- ZigZag Tree Traversal
- Delete middle element of a stack
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Maximum AND Value
- Power Of Numbers
- Maximum occured integer
- Wave Array
- Frequencies of Limited Range Array Elements
- Leaders in an array
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Two Repeated Elements
- Roof Top
- Union of Two Sorted Arrays
- Subarray with given sum
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Print adjacency list
- Search in a matrix
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Boundary traversal of matrix
- Exchange matrix columns
- Separate chaining in Hashing
- Naive Pattern Search
- Distinct Pattern Search
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Subarray with 0 sum
- Winner of an election
- Subarray range with given sum
- Isomorphic Strings
- The Modified String
- Reverse words in a given string
- Minimum indexed character
- Pangram Checking
- Non Repeating Character
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Evaluation of Postfix Expression
- Count Total Digits in a Number
- Digital Root
- Numbers containing 1, 2 and 3
- Reach a given score
- Spirally traversing a matrix
- Subarray with 0 sum
- Array Subset of another array
- First Repeating Element

- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Find the Closest Element in BST
- Merge two BST 's
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Count More than n/k Occurences
- Foldable Binary Tree
- Node at distance
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Rabin Karp - Pattern Searching
- Implementing Ceil in BST
- Pair Sum in BST
- Smallest Positive missing number
- Possible Words From Phone Digits
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Trapping Rain Water
- Check if array is sorted and rotated
- Possible paths between 2 vertices
- Level of Nodes
- Make Matrix Beautiful
- Boolean Matrix Problem
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Infix to Postfix
- Maximum of all subarrays of size k
- Rat Maze With Multiple Jumps
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Count only Repeated
- Minimum number of jumps
- Smaller on Right
- Steps by Knight
- Rotten Oranges
- Zero Sum Subarrays
- Find whether path exist
- Recursively remove all adjacent duplicates
- Unique BST's
- X Total Shapes
- Stock span problem
- Preorder to Postorder
- Relative Sorting
- Stock buy and sell