- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
R
kiranreddy2409
STREAK
00/1431
days
Longest streak/Global longest streak
Language Used
Python, Java, Javascript, C++
Coding Score
27
Problem Solved
380
Contest Rating
__
68 points
Contributor
68 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
2 submissions in current year
SCHOOL (0)
BASIC (117)
EASY (142)
MEDIUM (104)
HARD (17)
- Reverse a linked list
- Frequency in a Linked List
- Inorder Traversal
- Bubble Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Middle of a Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Remove Duplicates from a Sorted Linked List
- DFS of Graph
- Stack using Linked List
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Square Root
- Lowest Common Ancestor in a BST
- BST Keys in a Range
- Three way partitioning
- Level order traversal
- More than n/k Occurrences
- Counting Sort
- Delete Mid of a Stack
- Get min at pop
- Deque Implementations
- Hashing for pair - 1
- Hashing for pair - 2
- Implement Stack Using Array
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Inverse
- Power of 2
- Swap odd and even bits
- Frequencies in a Limited Array
- Array Leaders
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Roof Top
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Sort by Absolute Difference
- Print adjacency list
- Print Matrix in snake Pattern
- Transpose of Matrix
- Separate chaining in Hashing
- Naive Pattern Search
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Anagram
- Winner of an election
- String Rotated by 2 Places
- Strings Rotations of Each Other
- Isomorphic Strings
- Reverse Words
- Non Repeating Character
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Parenthesis Checker
- Minimum indexed character
- N meetings in one room
- Count Digits in a Number
- Power Set Using Recursion
- Recursively Sum N Numbers
- Factorial Using Recursion
- Check Palindrome
- Middle Of Stack
- Uppercase to Lowercase
- First Repeating Element
- Union of Arrays with Duplicates
- Check Equal Arrays
- Nth number made of prime digits
- Numbers containing 1, 2 and 3
- Positive Negative Pair
- Count Elements Greater Than X
- Count Smaller Than X
- Find Immediate Smaller Than X
- Array Update At Index
- Array Delete And Shift
- Is Array Sorted
- Find Immediate Greater Than X
- Reverse The Array
- Find nCr
- String Validation
- Insert In Sorted Linked List
- Delete Tail of Linked List
- Delete Head of Linked List
- Linked List Delete at Position
- Is Linked List Sorted
- Join Two Linked Lists
- Circular Linked List Head Insert
- Circular Linked List Tail Insert
- Circular Linked List Insertion At Position
- Delete Tail of Circular Linked List
- Delete Head of Circular Linked List
- Circular Linked List Delete at Position
- Intersection of Arrays with Distinct
- Left Index
- The FizzBuzz Program
- List Traversal Reverse
- Sum The List
- Length of The List
- Decrement List Values
- Print Square Wall 2
- Right Angle Triangle 2
- Check Prime
- Greatest of Three
- Print Alphabets
- Capitalize and Count
- AP Term
- Leap Year
- Less Than
- Separate Even Odd
- Average
- Count Distinct
- Tuple 1
- Find Union
- Check Subset
- Solving queries
- Test if tuple is distinct
- Find index
- Implement Set in Python
- Implement Dictionary in Python
- Assign Cookies
- Bit Manipulation
- Bots on social media
- Count Linked List Nodes
- Postorder Traversal
- Queue using Linked List
- Queue Using Array
- Preorder Traversal
- First Occurence
- Search a node in BST
- Peak element
- Linked List Insertion At End
- Minimum element in BST
- Identical Linked Lists
- Insert in Middle of Linked List
- Who has the majority?
- Array insert at index
- Array insert at end
- Operations on Stack
- Operations on Queue
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Bit Difference
- Number is sparse or not
- Binary To Gray Code Conversion
- Print 1 To N Without Loop
- Array Search
- Sorted Array Search
- Binary Array Sorting
- Check if a string is Isogram or not
- Binary String
- Most Frequent Character
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Print Array Elements Using Recursion
- The Sequence
- GCD Euclid
- Insert In Stack
- Reverse Array Using Stack
- Preorder in BST
- Inorder in BST
- Postorder in BST
- Levelorder in BST
- Length of String
- Vowels in String
- Count Distinct Vowels in String
- Count Words in String
- Reverse a String
- Lowercase to Upercase
- Panagram Checking
- Missing Characters in Panagram
- Insertion in deque
- Deque Traversal
- Deque deletion
- Keypad typing
- Get Element At Index
- Maximum and Minimum In Array
- Display Linked List
- Sum The Nodes of Linked List
- Maximum And Minimum In Linked List
- Search In Linked List
- Linked List Insertion At Position
- Display Circular Linked List
- Length of Circular Linked List
- Implement Dequeue Using Linked List
- Check for subsequence
- The If Statement
- The Else Statement
- The Elif Statement
- Input String
- Input Integer
- Input Floating Number
- Print Statement
- Print With Space
- Print Without Newline
- Print With Separator
- Swap The Numbers
- Arithmetic Operators
- Logical Operators
- Bitwise Operators
- Print Without Space
- Multi Printing
- Add and Print
- Multi Printing with Space
- Print Horizontal Line
- Evaluate Formulae
- Int Str
- List Traversal
- Append To List
- Table Difference
- Print Square
- Print Square wall
- Right Angle Triangle
- Reverse String
- Inverted Right AngleTriangle
- Inverted Right Angle Triangle 2
- Check Palindrome
- Find Pattern
- Slice The String
- Sum of N Numbers
- Factorial
- Divisor
- Function With No Arguments
- Function With Arguments
- Function With Return Value
- Fibonacci Number
- GCD
- Change Case
- For Loop - 1
- For Loop - 2
- While Loop
- TypeCast And Double It
- Concatenate Integers
- Clone List with Next and Random
- LRU Cache
- Merge Sort on Doubly Linked List
- Fixing Two nodes of a BST
- Trapping Rain Water
- Max Circular Subarray Sum
- Pattern Search
- Smallest window containing all characters of another string
- Histogram Max Rectangular Area
- Max of min for every window size
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Median of Two sorted arrays
- Merge Without Extra Space
- Articulation Point - II
- Articulation Point - I
- Number of pairs
- Count BST nodes that lie in a given range
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Merge two sorted linked lists
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Two Stacks in an Array
- The Celebrity Problem
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Serialize and deserialize a binary tree
- Linked List to Binary Tree
- Check if subtree
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Strongly Connected
- Closest in BST
- Merge two BST 's
- Bridge edge in a graph
- Find triplets with zero sum
- Top View of Binary Tree
- Find Common Nodes in two BSTs
- Merge Sort for Linked List
- Binary Tree to CDLL
- Foldable Binary Tree
- Count the nodes at distance K from leaf
- Maximum path sum from any node
- Children Sum in a Binary Tree
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees having given Sum
- Vertical Width of a Binary Tree
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Mother Vertex
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Count set bits
- Gray to Binary Conversion
- Maximum AND Value
- Tower Of Hanoi
- Smallest Positive Missing
- Power Of Numbers
- Possible Words From Phone Digits
- Rearrange an array with O(1) extra space
- Maximum Index
- Stock buy and sell
- Rotate Array
- Check if array is sorted and rotated
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Smallest Positive missing number
- Indexes of Subarray Sum
- Count the number of possible triangles
- Triplet Sum in Array
- Merge three sorted arrays
- Closer to sort
- Level of Nodes
- Unit Area of largest region of 1's
- Possible paths between 2 vertices
- Subarray with 0 sum
- Subarray range with given sum
- Subarrays with equal 1s and 0s
- Sort Elements by Decreasing Frequency
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- Minimum Platforms
- Allocate Minimum Pages
- Preorder to BST
- X Total Shapes
- Zero Sum Subarrays
- Find whether path exist
- Kth Smallest
- Rotten Oranges
- Steps by Knight
- Smaller on Right
- Count only Repeated
- Longest Subarray Of Evens And Odds
- Distance of nearest cell having 1
- Maximum Water Between Two Buildings
- Print Arrow
- Next Prime Number
- Tuple 2
- Game of Chocolates
- Divide and Subtract Game
- Prefix to Infix Conversion
- Postfix to Infix Conversion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy