Name

pranathi bhuvanagiri

Rank in Institute

#28

Courses Attended

Overall Coding Score: 506

Monthly Coding Score: 0

Weekly Coding Score: 0

- Preorder Traversal
- Sum of Binary Tree
- Postorder Traversal
- Finding middle element in a linked list
- Find Number of Numbers
- Height of Binary Tree
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Count Non-Leaf Nodes in Tree
- Count Leaves in Binary Tree
- Inorder Traversal
- Size of Binary Tree
- Minimum element in BST
- Rotate Array
- Height of Heap
- Reverse array in groups
- Power of 2

- Vertical Width of a Binary Tree
- Largest subarray with 0 sum
- Reverse a linked list
- Binary Tree to BST
- Sum of Left Leaf Nodes
- Sum of Right Leaf Nodes
- Odd even level difference
- Sum of Leaf Nodes
- Need Some Change
- Lowest Common Ancestor in a Binary Tree
- Vertical sum
- Full binary tree
- Max and min element in Binary Tree
- Counting Sort
- Symmetric Tree
- Maximum Bipartite Matching
- Convert Ternary Expression to Binary Tree
- Index Of an Extra Element
- Print Common Nodes in BST
- Expression Tree
- Root to leaf paths sum
- Maximum Node Level
- Max Level Sum in Binary Tree
- Max distance between same elements
- Check if Linked List is Palindrome
- Maximum Difference
- Remove Half Nodes
- Lowest Common Ancestor in a BST
- Rotate 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
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Winner of an election
- Print adjacency list
- Diameter of Binary Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Find Transition Point
- Queue using two Stacks
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Matrix Interchange
- BFS of graph
- Stack Operations
- BigInteger Multiply
- Determine if Two Trees are Identical
- Postorder traversal from given Inorder and Preorder traversals
- Transitive closure of a Graph
- Count the Zeros
- Reach a given score
- Count pairs with given sum
- Efficiently sorting numbers in range from 0 to n^2 - 1
- Leaders in an array
- Maximum difference Indexes
- First negative integer in every window of size k
- Subarray with given sum
- Count Smaller elements
- Paths to reach origin
- Facing the sun
- Mr Modulo and Pairs
- Distinct absolute array elements
- Find the number of sub-arrays having even sum
- Print adjacency list
- Sachin's love for runs
- Largest Fibonacci Subsequence
- Equilibrium point
- Pairs with specific difference
- Count Pairs in an Array
- Min sum formed by digits
- Min Subsets with Consecutive Numbers
- Chocolate Distribution Problem
- Flood fill Algorithm
- Drive the car
- Minimum Operations
- Check if array contains contiguous integers with duplicates allowed
- The Optimal Selection
- Good Pairs
- Count Occurences of Anagrams
- Squares in N*N Chessboard
- Minimum Swaps required to group all 1’s together
- Common Divisor
- Remove all duplicates from a given string
- Sort an array of 0s, 1s and 2s
- Counts Zeros Xor Pairs
- Rope Cutting
- Eulerian Path in an Undirected Graph
- Count increasing Subarrays
- Pairs which are Divisible by 4
- Count the triplets
- Sum of Lengths of Non-Overlapping SubArrays
- Number of Unique Paths
- Maximum sum Problem
- Count of strings that can be formed using a, b and c under given constraints
- Addition of submatrix
- Bitonic Generator Sort

- Longest consecutive subsequence
- C++ Generic sort
- Find the number of islands
- Sorting Elements of an Array by Frequency
- Smallest Positive missing number
- Print a Binary Tree in Vertical Order
- Reverse a Linked List in groups of given size.
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Flattening a Linked List
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- The Celebrity Problem
- Topological sort
- Euler Circuit in a Directed Graph
- Get minimum element from stack
- Circular tour
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Merge k Sorted Arrays
- Top View of Binary Tree
- Next larger element
- Construct binary palindrome by repeated appending and trimming
- Zero Sum Subarrays
- Rotten Oranges
- Large Factorials
- Smallest distinct window
- Nearly Sorted Algorithm
- The Tiny Miny
- Fill the Tank
- Maximum Intervals Overlap
- In First But Second
- Maximum of all subarrays of size k
- Find Missing And Repeating
- Overlapping Intervals
- Next Permutation
- Longest Increasing Subsequence
- Longest Span with same Sum in two Binary arrays
- Count of Subarrays
- Trapping Rain Water
- Sum of bit differences
- Maximize The Array
- Minimum Platforms
- Stock buy and sell
- Largest Number formed from an Array
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Relative Sorting
- Stock span problem
- Negative weight cycle
- Kth smallest element
- X Total Shapes
- Kadane's Algorithm
- Your Social Network
- Minimum steps to get desired array
- Convert an array to reduced form
- Find whether path exist
- Longest consecutive subsequence
- Inversion of array
- Rotate a 2D array without using extra space
- Nuts and Bolts Problem
- Design a tiny URL or URL shortener
- Boolean Matrix Problem
- Row with max 1s