Name

Princy Pandey

Rank in Institute

#12

Courses Attended

Campus Ambassador

Overall Coding Score: 585

Monthly Coding Score: 585

Weekly Coding Score: 0

- Missing number in array
- Intersection of two arrays
- Union of two arrays
- Keypad typing
- Check if two arrays are equal or not
- Count nodes of linked list
- Bubble Sort
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Insert a node in Doubly linked list
- Implement strstr
- Search a node in BST
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Identical Linked Lists
- Queue Reversal
- Insert in Middle of Linked List
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Reversing an Array
- 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
- Power of 2
- Reverse array in groups
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- Majority Element
- Left Index
- Binary Array Sorting
- Count possible triangles
- Adding two matrices
- Sum of upper and lower triangles
- Multiply the matrices
- Print Matrix in snake Pattern
- Rotate by 90 degree
- Check if a string is Isogram or not
- Check if string is rotated by two places
- Check if strings are rotations of each other or not
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion

- Number of Unique Paths
- First Repeating Element
- Sort an array of 0s, 1s and 2s
- Subarray with given sum
- Nth number made of prime digits
- Numbers containing 1, 2 and 3
- Positive Negative Pair
- Reverse a linked list
- Rotate 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
- Diameter of Binary Tree
- Heap Sort
- 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
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Level order traversal Line by Line
- Print BST elements in given range
- Josephus problem
- Check if Linked List is Palindrome
- Three way partitioning
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Merge Sort for Linked List
- Counting Sort
- Huffman Decoding
- Children Sum Parent
- Find length of Loop
- Reverse First K elements of Queue
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Get min at pop
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Pairwise swap of nodes in LinkeList
- 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
- Wave Array
- Frequencies of Limited Range Array Elements
- Equilibrium point
- Leaders in an 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
- Sort by Absolute Difference
- Triplet Sum in Array
- Print adjacency list
- Spirally traversing a matrix
- Search in a matrix
- Interchanging the rows of a Matrix
- Exchange matrix columns
- Separate chaining in Hashing
- Naive Pattern Search
- Linear 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
- Smallest window in a string containing all the characters of another string
- Minimum indexed character
- Pangram Checking
- Non Repeating Character
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Count Total Digits in a Number
- Digital Root

- Minimum number of jumps
- Subset Sum Problem
- Relative Sorting
- X Total Shapes
- Kth smallest element
- Find whether path exist
- Zero Sum Subarrays
- Rotten Oranges
- Steps by Knight
- Count only Repeated
- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- The Celebrity Problem
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Remove loop in Linked List
- LRU Cache
- Minimum Swaps to Sort
- Max sum subarray by removing at most one element
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- Binary Tree to CDLL
- Count More than n/k Occurences
- Convert Level Order Traversal to BST
- Swap Kth nodes from ends
- Rabin Karp - Pattern Searching
- 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
- Stock buy and sell
- Kadane's Algorithm
- Number of pairs
- Merge three sorted arrays
- Closer to sort
- Make Matrix Beautiful
- Boolean Matrix Problem
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Case-specific Sorting of Strings
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Infix to Postfix
- Minimum Platforms
- Largest number in K swaps
- Count ways to N'th Stair(Order does not matter)