Name

Mohit Kumar

Rank in Institute

#102

Courses Attended

Campus Ambassador

Overall Coding Score: 587

Monthly Coding Score: 4

Weekly Coding Score: 0

- Count nodes of linked list
- Node at a given index in linked list
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Remove duplicate elements from sorted Array
- Replace all 0's with 5
- Search a node in BST
- Find Number of Numbers
- Minimum element in BST
- Maximum in Struct Array
- Queue Reversal
- Start Coding
- logical Operators
- Stack designer
- Queue Push & Pop
- Start Coding - Python
- Space Seperated - Python
- Concatenating Strings - Python
- Taking input and typecasting - Python
- Taking input - Python
- Comparison Operators - Python
- Start coding - C
- The new line - C
- Height of Heap
- Missing number in array
- Find minimum and maximum element in an array
- Max value after m range operation
- Check set bits
- Rotate Array
- Inverse Permutation
- Ishaan Loves Chocolates
- Multiply left and right array sum.
- Doctors Clinic
- Sum of f(a[i], a[j]) over all pairs in an array of n integers

- Occurence of an integer in a Linked List
- Given a linked list of 0s, 1s and 2s, sort it.
- Add 1 to a number represented as linked list
- Compare two linked lists
- Detect Loop in linked list
- Delete Middle of Linked List
- Find Transition Point
- Queue using two Stacks
- Stack using two queues
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- Expression Tree
- Check if Linked List is Palindrome
- Level order traversal
- Peak element
- Index Of an Extra Element
- Sum of leaf nodes in BST
- Counting elements in two arrays
- Reverse a string using Stack
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- Rotate doubly Linked List
- The Size of
- Taking input
- Learn to Comment
- GetLine and Ignore
- Learning to be precise
- Bitwise Operators
- Even Odd
- For Loop- primeCheck
- While loop- printTable
- Learning Macros
- Step by Step Condition
- Start Coding - Java
- The New Line - Java
- Data Types - Java
- Taking input - Java
- Learn to Comment - Java
- nextLine and next
- Count Odd Even
- Need Some Change
- Count the Specials
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Even Subsets
- Matrix Interchange - Java
- Consonants and Vowels check - Java
- Structs and Objects
- Learning Structs
- Sum of Big Integers
- BigInteger Multiply
- BigInteger mod
- ArrayList Operation
- Operations on ArrayList
- Stack Operations
- Queue Operations
- Deque Implementations
- Min Heap implementation
- Repetitive Printing - Python
- Operators in Python
- Split the input - Python
- Comment in Python
- Logical Operators - Python
- Increment and Decrement - Python
- Bitwise Operators - Python
- If conditional statement- Python
- Check the status - Python
- Mark Even and Odd - Python
- For loop - Python
- For Loop 2- Python
- While loop in Python
- Jumping through While - Python
- Is and In Operator
- sep and end in Print()
- First negative integer in every window of size k
- Leaders in an array
- Count pairs with given sum
- Chinky and diamonds
- Count the Zeros
- Element appearing once
- Equilibrium point
- Finding the numbers
- Count Pairs in an Array
- Min sum formed by digits
- Maximum no of 1's row
- Floor in a Sorted Array
- Paths to reach origin
- Pairs which are Divisible by 4
- Maximum distinct elements after removing K elements
- Print Binary Tree levels in sorted order
- Convert a sentence into its equivalent mobile numeric keypad sequence
- Check if a number is divisible by 8
- Segregate even and odd nodes in a Linked List
- Good Pairs
- Single Number
- Maximum value in a bitonic array
- Addition of submatrix
- Move all zeroes to end of array

- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Quick Sort on Linked List
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Clone a linked list with next and random pointer
- Flattening a Linked List
- The Celebrity Problem
- Merge K sorted linked lists
- Get minimum element from stack
- Make Binary Tree From Linked List
- Remove loop in Linked List
- LRU Cache
- Minimum Swaps to Sort
- Delete keys in a Linked list
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Polynomial Addition
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Leaves to DLL
- Convert Level Order Traversal to BST
- C++ Generic sort
- Operations on PriorityQueue
- Cat and Hat - Python
- Zero Converter - Python
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Smallest Positive missing number
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Case-specific Sorting of Strings
- In First But Second
- Killing Spree
- Print N-bit binary numbers having more 1’s than 0’s
- Previous number in one swap
- Alternate Vowel and Consonant String
- Nine Divisors
- Mail System Design
- Factorials of large numbers
- Median In a Row-Wise sorted Matrix
- Largest Number formed from an Array
- Rearrange Array Alternately
- Count of Palindromic substrings in an Index range
- Nearly Sorted Algorithm
- Subarrays with equal 1s and 0s
- Maximize The Array
- Sum of bit differences
- Case-specific Sorting of Strings
- Trapping Rain Water
- Longest Even Length Substring
- Save Gotham!
- Count of Subarrays
- Maximize the sum of selected numbers from an array to make it empty
- Parenthesis Checker
- Equal Sum
- Boolean Matrix Problem
- Smallest number on left
- Convert an array to reduced form
- Preorder to Postorder
- Minimum steps to get desired array
- Minimum Cost of ropes
- Card Rotation
- Super Primes
- Number of pairs
- Rotate a 2D array without using extra space
- Nuts and Bolts Problem
- Next larger element
- Sorting Elements of an Array by Frequency
- Kth smallest element
- Find Missing And Repeating
- Infix to Postfix
- Count Palindrome Sub-Strings of a String
- Row with max 1s
- Check if a string is repetition of its substring of k-length
- Rotate and delete
- Maximum of all subarrays of size k
- Recursively remove all adjacent duplicates
- Relative Sorting
- Print leaf nodes from preorder traversal of BST
- Rearrange characters
- First non-repeating character in a stream
- Zero Sum Subarrays
- Magnet Array Problem
- Length of the longest substring