- Power of Four
- Delete node in Doubly Linked List
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Doubly linked list Insertion
- Binary Search
- Remove duplicate elements from sorted Array
- Print all possible strings
- Add two fractions
- Replace all 0's with 5
- Count zeros in a sorted matrix
- Largest product
- Third largest element
- Convert to Roman No
- Preorder Traversal
- Implement strstr
- Search a node in BST
- Remainder with 7
- Java Collection | Set 4 (TreeMap)
- Implement Atoi
- Java Collection | Set 5 (LinkedHash Set)
- Missing number in array
- Sum of Digits Divisibility
- Maximum Occuring Character
- Check if a number is power of another number
- k largest elements
- Interesting Patterns
- Sum of distinct elements
- Shortest direction
- Find the Odd Occurence
- Binary String
- Parity of unsigned integer
- Rotate Array
- Reverse each word in a given string
- Majority Element
- Reverse array in groups
- Good String
- Elements before which no element is bigger
- GCD of Array
- LCM And GCD
- Find Substring from last of the Given String
- String Reversal

Name

Amit Khandelwal

Rank in Institute

#99

Courses Attended

Campus Ambassador

Overall Coding Score: 343

Monthly Coding Score: 0

Weekly Coding Score: 0

- Reverse a linked list
- Add two numbers represented by linked lists
- Compare two linked lists
- Merge 2 sorted linked list in reverse order
- Remove duplicates from an unsorted linked list
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Insertion Sort
- Merge Sort
- Quick Sort
- Two Mirror Trees
- Maximum Width of Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Intersection of two sorted Linked lists
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- Reverse Level Order Traversal
- Reverse alternate levels of a perfect binary tree
- Insert a node in a BST
- Determine if Two Trees are Identical
- Root to leaf path sum
- Print all nodes that don't have sibling
- Postorder traversal from given Inorder and Preorder traversals
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Max sum path in two arrays
- Run Length Encoding
- 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
- Minimum Depth of a Binary Tree
- Remove duplicates in small prime array
- Odd even level difference
- Almost Prime Numbers
- Binary Tree to BST
- K-Palindrome
- Find nth element of spiral matrix
- Max sum in the configuration
- Remove every k'th node
- Leaf at same level
- Is Binary Tree Heap
- Subtraction in Linked List
- Find Maximum value
- Distinct occurrences
- Sum of subset differences
- Java Collection | Set 1 (ArrayList) Part-2
- Java Collection | Set 2 (Set)
- You and your books
- Java Collection | Set 3 (HashMap) Part-2
- Maximum Difference
- Check if Linked List is Palindrome
- Max distance between same elements
- Print matrix in diagonal pattern
- Longest Consecutive Subsequence
- Generate Grey Code Sequences
- Delete a Node in Single Linked List
- Multiply two polynomials II
- Count distinct elements in every window
- Special array reversal
- 1[0]1 Pattern Count
- String Manipulation
- Overlapping rectangles
- Tom and String
- Triplet Sum in Array
- Reverse words in a given string
- Frequencies of Limited Range Array Elements
- Anagram
- Adding One
- Rotation
- Distinct Substrings
- Inorder Traversal and BST
- Remove all duplicates from a given string
- Sort an array of 0s, 1s and 2s
- Maximum Product Subarray
- Remove Duplicates
- Overlapping Substrings
- Equal to product

- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Connect Nodes at Same Level
- Flattening a Linked List
- Boundary Traversal of binary tree
- Delete a node from BST
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Get minimum element from stack
- Circular tour
- Count Palindromic Subsequences
- Number of root to leaf paths
- Delete keys in a Linked list
- Next larger element
- 3 Divisors
- Count Number
- Parenthesis Checker
- Sorting Elements of an Array by Frequency
- Longest Increasing Subsequence
- Kadane's Algorithm
- Is Binary Number Multiple of 3