Name

Harshit Singh

Institution

Rank in Institute

#141

Courses Attended

Campus Ambassador

Other Profile Link

Overall Coding Score: 260

Monthly Coding Score: 0

Weekly Coding Score: 0

- Height of Binary Tree
- Square root
- Implement Stack using Linked List
- Replace all 0's with 5
- Convert to Roman No
- Implement strstr
- Check If Circular Linked List
- Finding middle element in a linked list
- Implement Atoi
- Count Leaves in Binary Tree
- longest substring containing '1'
- Minimum element in BST
- Maximum in Struct Array
- Number of occurrence
- Boolean String Value
- Closest Number
- Find position of set bit
- Maximum money
- Binary Array Sorting
- Majority Element
- Check if string is rotated by two places
- Immediate Smaller Element
- Missing number in array
- Replace the Bit
- Swap two nibbles in a byte
- Reverse each word in a given string

- Construct Tree from Inorder & Preorder
- Reverse words in a given string
- Reverse a linked list
- Sum of Leaf Nodes at Min Level
- Implement two stacks in an array
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Check if Tree is Isomorphic
- Maximum path sum
- Check if Linked List is Palindrome
- Lowest Common Ancestor in a BST
- Special Stack
- Level order traversal
- Delete nodes greater than k
- Merge Sort for Linked List
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Diameter of Binary Tree
- Delete N nodes after M nodes of a linked list
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Merge 2 sorted linked list in reverse order
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Root to leaf path sum
- Nth node from end of linked list
- Delete Middle of Linked List
- Determine if Two Trees are Identical
- Level order traversal in spiral form
- Queue using two Stacks
- Merge two sorted linked lists
- Roman Number to Integer
- Equilibrium point
- Reverse Bits
- Find the highest occurring digit in prime numbers in a range
- Shortest Common Supersequence
- String comparison
- Stickler Thief
- Ease the Array
- Add Binary Strings
- Maximum Difference
- Key Pair
- Number of Unique Paths
- Column name from a given column number
- Element that appears once where every element occurs twice
- Non Repeating Character
- Reverse words in a given string

- Flattening a Linked List
- Boundary Traversal of binary tree
- Count Number of SubTrees having given Sum
- Diagonal Traversal of Binary Tree
- Node at distance
- Check for BST
- Clone a linked list with next and random pointer
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Circular tour
- Check if subtree
- Multiply two strings
- Remove loop in Linked List
- Kadane's Algorithm
- Coin Change
- Maximum Index
- Next Permutation
- Longest Even Length Substring
- First non-repeating character in a stream
- Factorials of large numbers
- Nuts and Bolts Problem
- Longest Common Substring
- Kth smallest element
- Is Binary Number Multiple of 3