- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Check If Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Binary Search
- Remove duplicate elements from sorted Array
- Count zeros in a sorted matrix
- Preorder Traversal
- Implement strstr
- Search a node in BST
- Implement Atoi
- Find Number of Numbers
- Minimum distance between two numbers
- Find triplets with zero sum
- Operating an array
- Linked List Insertion
- Minimum element in BST
- Anagram of String
- Queue Reversal
- Triplet Family
- Product of array elements
- C++ Call by reference
- Java Generic Class
- logical Operators
- Sort and Reverse Vector
- Front to Back
- Stack designer
- Queue Push & Pop
- Set Operations
- Sum Array Puzzle
- Search an Element in an array
- Factorial
- Prime Number
- LCM And GCD
- Searching a number
- Power of 2
- Series GP
- Sort The Array
- Pythagorean Triplet
- Nth Fibonacci Number
- Print the Kth Digit
- Majority Element
- Count possible triangles
- Rotate Array
- Permutations of a given string
- Check if the number is Fibonacci
- Missing number in array
- Number of paths
- Count total set bits
- Immediate Smaller Element
- Convert array into Zig-Zag fashion
- Number of occurrence
- k largest elements
- Find position of set bit
- Sum of all prime numbers between 1 and N.
- Find the Odd Occurence
- Angle between hour and minute hand
- Rotating an Array
- Reverse array in groups
- Set Bits
- Missing number
- Squares in a Matrix
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Find the element that appears once in sorted array
- Uncommon characters
- Find minimum and maximum element in an array
- Smallest power of 2 greater than or equal to n
- Max Sum Subarray of size K
- Rightmost different bit
- Set kth bit
- Toggle bits given range
- Print first n Fibonacci Numbers
- Anagram Palindrome
- Closest Number
- Merge two strings
- Sort the string in descending order
- Find the closest number
- Series X1
- Check if strings are rotations of each other or not
- Tower of Hanoi

Name

Imbrisca Alexandra

Institution

Rank in Institute

#2

Campus Ambassador

Overall Coding Score: 1109

Monthly Coding Score: 0

Weekly Coding Score: 0

- Reverse a linked list
- 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.
- Add two numbers represented by linked lists
- Rearrange a linked list
- Add 1 to a number represented as linked list
- Detect Loop in linked list
- 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
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- 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
- 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
- Root to leaf path sum
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Max sum path in two arrays
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Largest subarray with 0 sum
- Remove every k'th node
- Validate an IP Address
- Multiply two linked lists
- Josephus problem
- Check if Linked List is Palindrome
- Longest Consecutive Subsequence
- Delete a Node in Single Linked List
- Count distinct elements in every window
- Check if two strings are k-anagrams or not
- Special Stack
- Root to leaf paths sum
- Three way partitioning
- Level order traversal
- Peak element
- Merge Sort for Linked List
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Insert in a Sorted List
- Sum of leaf nodes in BST
- Maximum path sum
- XOR Linked List
- Counting elements in two arrays
- Reverse a string using Stack
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Count Pairs whose sum is equal to X
- Insert in Sorted way in a Sorted DLL
- Predecessor and Successor
- Children Sum Parent
- Find length of Loop
- Median of BST
- Linked List Matrix
- Reverse First K elements of Queue
- Closest Neighbor in BST
- ZigZag Tree Traversal
- Rotate doubly Linked List
- Java Collections | Set 7 (LinkedList)
- C++ Template
- Taking input
- Learn to Comment
- Learning to be precise
- While loop- printTable
- Learning Macros
- Start Coding - Java
- Learn to Comment - Java
- Matrix Interchange
- Magic in CPP
- Two Dimensional World
- Learning Structs
- Delete Array
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- Find the Frequency
- Back to Front
- Pair Sum in Vector
- Queue Operations
- Deque Implementations
- Min Heap implementation
- Multimap Operations
- Frequencies of Limited Range Array Elements
- Anagram
- Wave Array
- Print Pattern
- Rotation
- Search in a Rotated Array
- Non Repeating Character
- Reverse words in a given string
- Move all zeroes to end of array
- Remove “b” and “ac” from a given string
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Finding Number
- Segregate even and odd nodes in a Linked List
- Longest Distinct characters in string
- Count distinct pairs with difference k
- Maximum Product Subarray
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Key Pair
- Add Binary Strings
- Product array puzzle
- Reverse Bits
- Subarray with given sum
- Leaders in an array
- Swap all odd and even bits
- Equal to product
- Count pairs with given sum
- Inorder Traversal and BST
- Triplet Sum in Array
- Minimum element in a sorted and rotated array
- Search in a matrix
- Missing element of AP
- 0 - 1 Knapsack Problem
- Maximize The Cut Segments
- Power of Numbers
- Perfect Numbers
- The Nth Fibonnaci
- Equilibrium point
- Floor in a Sorted Array
- Flip Bits
- Finding the numbers
- Game of cells
- Help Nobita
- Chocolate Distribution Problem
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Roman Number to Integer
- Game of XOR
- Find largest word in dictionary
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Meta Strings
- Largest Fibonacci Subsequence
- K-th element of two sorted Arrays
- Common elements
- Element with left side smaller and right side greater
- Array Subset of another array
- Karatsuba Algorithm
- Four Elements
- Subarray with 0 sum
- Group Anagrams Together
- Count all possible paths from top left to bottom right
- Find distinct elements
- 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
- Count the triplets
- Sum of two large numbers
- Pairs with Positive Negative values
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Find winner of the Game of Nim
- Arya and The Great War
- Nearest multiple of 10
- Winner of an election
- Ease the Array
- Count pairs Sum in matrices
- Minimum changes to make all substrings distinct
- Save Ironman
- Print adjacency list
- Pair with given sum in a sorted array

- Reverse a Linked List in groups of given size.
- 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
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Boundary Traversal of binary tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Largest BST
- LRU Cache
- Multiply two strings
- Minimum Swaps to Sort
- Bipartite Graph
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- k-th smallest element in BST
- Polynomial Addition
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Find a pair with given target in BST
- Leaves to DLL
- Convert Level Order Traversal to BST
- Operations on PriorityQueue
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Sub Array
- Overlapping Intervals
- Maximum Index
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Egg Dropping Puzzle
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Longest Span with same Sum in two Binary arrays
- Consecutive 1's not allowed
- Path in Matrix
- Trapping Rain Water
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Largest Number formed from an Array
- Jumping Numbers
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Minimum Cost of ropes
- Form a palindrome
- Inversion of array
- Preorder to Postorder
- Longest consecutive subsequence
- Stock span problem
- Handshakes
- Is Binary Number Multiple of 3
- Preorder Traversal and BST
- Number of pairs
- Circle of strings
- Minimize the heights
- Next larger element
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Kth smallest element
- Longest Common Substring
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Knight Walk
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Is Sudoku Valid
- Find whether path exist
- 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
- Floyd Warshall
- Nearly Sorted Algorithm
- Smallest Positive missing number
- Array Pair Sum Divisibility Problem
- Rotten Oranges
- Longest Common Prefix in an Array
- Median In a Row-Wise sorted Matrix
- In First But Second
- Maximum Tip Calculator
- Longest subarray with sum divisible by K
- Longest Sub-Array with Sum K
- The Painter's Partition Problem
- Optimal Strategy For A Game

- QuickSort on Doubly Linked List
- Reorder List
- Binary Tree to DLL
- Longest Palindromic Substring in Linear Time
- Alien Dictionary
- Fixing Two nodes of a BST
- Merge Without Extra Space
- Allocate minimum number of pages
- A Simple Fraction
- Ugly Numbers
- Longest valid Parentheses
- Minimum Cost Path
- Find median in a stream
- Count the subarrays having product less than k
- Closest Palindrome