Skip to content

Latest commit

 

History

History

Code Practice

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
7 Segment Display
7 Segment Display
 
 
Biconnected Graph
Biconnected Graph
 
 
Bitwise AND of the Array
Bitwise AND of the Array
 
 
Bottom View of Binary Tree
Bottom View of Binary Tree
 
 
Boundary Traversal of binary tree
Boundary Traversal of binary tree
 
 
Can Make Triangle
Can Make Triangle
 
 
Check Mirror in N-ary tree
Check Mirror in N-ary tree
 
 
Check for BST
Check for BST
 
 
Check if subtree
Check if subtree
 
 
Choose and Swap
Choose and Swap
 
 
Coin Piles
Coin Piles
 
 
Compute Before Matrix
Compute Before Matrix
 
 
Concatenate two numbers
Concatenate two numbers
 
 
Detect Cycle in an Undirected Graph
Detect Cycle in an Undirected Graph
 
 
Detect cycle in a directed graph
Detect cycle in a directed graph
 
 
Escape the Forbidden Forest
Escape the Forbidden Forest
 
 
Exactly one swap
Exactly one swap
 
 
Form a palindrome
Form a palindrome
 
 
Get minimum element from stack
Get minimum element from stack
 
 
Height Using Parent Array
Height Using Parent Array
 
 
Insertion Sort for Singly Linked List
Insertion Sort for Singly Linked List
 
 
Interleaved Strings
Interleaved Strings
 
 
Intersection Point in Y Shapped Linked Lists
Intersection Point in Y Shapped Linked Lists
 
 
Kadane's Algorithm
Kadane's Algorithm
 
 
Kth smallest element
Kth smallest element
 
 
LCS of three strings
LCS of three strings
 
 
Longest Common Subsequence
Longest Common Subsequence
 
 
Longest Prefix Suffix
Longest Prefix Suffix
 
 
Longest substring to form a Palindrome
Longest substring to form a Palindrome
 
 
Lowest Common Ancestor in a Binary Tree
Lowest Common Ancestor in a Binary Tree
 
 
Majority Element
Majority Element
 
 
Matrix Operations
Matrix Operations
 
 
Maximum Product Subarray
Maximum Product Subarray
 
 
Maximum Winning score
Maximum Winning score
 
 
Maximum XOR of two numbers in an array
Maximum XOR of two numbers in an array
 
 
Maximum average subarray
Maximum average subarray
 
 
Merge K sorted linked lists
Merge K sorted linked lists
 
 
Minimize the Heights II
Minimize the Heights II
 
 
Minimum number of jumps
Minimum number of jumps
 
 
Minimum times A has to be repeated such that B is a substring of it
Minimum times A has to be repeated such that B is a substring of it
 
 
Nodes at given distance in binary tree
Nodes at given distance in binary tree
 
 
Number of distict Words with k maximum contiguous vowels
Number of distict Words with k maximum contiguous vowels
 
 
Overlapping Intervals
Overlapping Intervals
 
 
Preorder traversal (Iterative)
Preorder traversal (Iterative)
 
 
Rank The Permutations
Rank The Permutations
 
 
Rearrange a linked list
Rearrange a linked list
 
 
Remove loop in Linked List
Remove loop in Linked List
 
 
Return two prime numbers
Return two prime numbers
 
 
Reverse a string using Stack
Reverse a string using Stack
 
 
Robots
Robots
 
 
Rotate a 2D array without using extra space
Rotate a 2D array without using extra space
 
 
Rotate and delete
Rotate and delete
 
 
Search Pattern (Z-algorithm)
Search Pattern (Z-algorithm)
 
 
Smaller on Left
Smaller on Left
 
 
Smallest greater elements in whole array
Smallest greater elements in whole array
 
 
Smallest window containing 0, 1 and 2
Smallest window containing 0, 1 and 2
 
 
Special Matrix
Special Matrix
 
 
Spidey Sense
Spidey Sense
 
 
Subsets
Subsets
 
 
Surpasser Count
Surpasser Count
 
 
Swap Kth nodes from ends
Swap Kth nodes from ends
 
 
The Celebrity Problem
The Celebrity Problem
 
 
The Fibonacci-prime number
The Fibonacci-prime number
 
 
Zero Sum Subarrays
Zero Sum Subarrays
 
 
README.md
README.md
 
 

README.md

Code Practice in Java

Hi, I'm Ujjawal Singh! 👋

🚀 About Me

I'm Ujjawal Singh and now i'm an Engineering Student

Connect with me 🤝

Linkedin Badge GitHub followers

Feedback

If you have any feedback, please reach out to us at ayeujjawalsingh@gmail.com