- Print Linked List elements
- Count nodes of linked list
- Delete node in Doubly Linked List
- Count Leaves in Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Binary Search
- Convert to Roman No
- Search a node in BST
- Remainder with 7
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Queue Reversal
- Search an Element in an array
- Binary String
- LCM And GCD
- Power of 2
- Pythagorean Triplet
- Sieve of Eratosthenes
- Dice throw
- Rotate Array
- Permutations of a given string
- Missing number in array
- Number of paths
- Count total set bits
- Number is sparse or not
- Immediate Smaller Element
- Number of occurrence
- Check if a number is power of another number
- Generate Binary Numbers
- Find the Odd Occurence
- Angle between hour and minute hand
- Rotating an Array
- Reverse array in groups
- Find first and last occurrence of x
- Type of array
- Sum of dependencies in a graph
- Sort in specific order
- Check if two arrays are equal or not
- Unique Numbers
- Find first set bit
- Print an array in Pendulum Arrangement
- First element to occur k times
- Check whether K-th bit is set or not
- Check if a string is Isogram or not
- Rightmost different bit
- Toggle bits given range
- Print first n Fibonacci Numbers
- Remove repeated digits in a given number
- Absolute Difference of 1
- Find the fine
- Find the closest number
- Remove consonants from a string
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Gray Code
- Gray to Binary equivalent
- Height of Heap

Name

Shameek Agarwal

Rank in Institute

#10

Courses Attended

Campus Ambassador

Overall Coding Score: 641

Monthly Coding Score: 0

Weekly Coding Score: 0

- Occurence of an integer in a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- K distance from root
- Maximum Width of Tree
- Diameter of Binary Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Transform to Sum Tree
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Postorder traversal from given Inorder and Preorder traversals
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Print BST elements in given range
- Odd even level difference
- Binary Tree to BST
- Is Binary Tree Heap
- Validate an IP Address
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Delete a Node in Single Linked List
- Kth largest element in BST
- Count distinct elements in every window
- Sort a stack
- Print Common Nodes in BST
- Peak element
- Delete nodes greater than k
- Index Of an Extra Element
- Construct BST from Postorder
- Check if Tree is Isomorphic
- Diagonal Sum In Binary Tree
- Find length of Loop
- Change of Key in BST
- Normal BST to Balanced BST
- Linked List Matrix
- Exchange the Leaf Nodes
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Start Coding - Java
- The New Line - Java
- Taking input - Java
- Learn to Comment - Java
- nextLine and next
- Precise Fomat - Java
- logical Operators - Java
- Bitwise Operators - Java
- Even Odd - Java
- For Loop- primeCheck - Java
- While loop- printTable - Java
- Step by Step Condition - Java
- Count Odd Even - Java
- The Pattern Matcher - Java
- Need Some Change - Java
- Almost Equal -Java
- Count the Specials - Java
- Even Subsets - Java
- Matrix Interchange - Java
- Consonants and Vowels check - Java
- Predict the Column - Java
- Xoring and Clearing - Java
- Pair in Java
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- BigInteger mod
- Print Pattern
- Reverse words in a given string
- Count distinct pairs with difference k
- Maximum sum increasing subsequence
- Array to BST
- Reverse Bits
- Lucky Number
- Subarray with given sum
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Count pairs with given sum
- Inorder Traversal and BST
- Chinky and diamonds
- 0 - 1 Knapsack Problem
- Longest Common Increasing Subsequence
- Valid Substring
- Equilibrium point
- Floor in a Sorted Array
- Maximize Dot Product
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Longest K unique characters substring
- Shortest distance in infinite tree
- Largest zigzag sequence
- Longest Palindromic Subsequence
- Evaluation of Postfix Expression
- Rod Cutting
- Sequence of Sequence
- Transitive closure of a Graph
- Array Subset of another array
- First negative integer in every window of size k
- Merge two binary Max heaps
- Group Anagrams Together
- Count all possible paths from top left to bottom right
- Swapping pairs make sum equal
- Count of strings that can be formed using a, b and c under given constraints
- Minimum indexed character
- Stickler Thief
- Maximum Product Cutting
- Check if a Integer is power of 8 or not
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Check if array contains contiguous integers with duplicates allowed
- Winner of an election
- Print Binary Tree levels in sorted order
- Arya's Long String
- Find the closest pair from two arrays
- Print Bracket Number
- Cutting Binary String

- Check for BST
- Bottom View of Binary Tree
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Circular tour
- Max rectangle
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Interleaved Strings
- LRU Cache
- Multiply two strings
- Merge two BST 's
- Length of longest palindrome in linked list
- k-th smallest element in BST
- Polynomial Addition
- Construct tree from Inorder and LevelOrder
- Leaves to DLL
- Right Sibling in Binary Tree
- Coin Change
- Parenthesis Checker
- Count ways to reach the n'th stair
- Egg Dropping Puzzle
- Maximum Rectangular Area in a Histogram
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Maximum of all subarrays of size k
- Minimum Cost of ropes
- Preorder to Postorder
- Longest consecutive subsequence
- Stock span problem
- Is Binary Number Multiple of 3
- Card Rotation
- Super Primes
- Maximum XOR subset
- Next larger element
- Unique BST's
- Longest Prefix Suffix
- Longest Common Substring
- Check Mirror in N-ary tree
- Unit Area of largest region of 1's
- Rearrange characters
- First non-repeating character in a stream
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Magnet Array Problem
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Nearly Sorted Algorithm
- Infix to Postfix
- Firing employees
- Rotten Oranges
- Two water Jug problem
- Longest Common Prefix in an Array
- Matrix Chain Multiplication
- Lazy Pasha
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K