girish_thatte
STREAK
108/1480
days
Longest streak/Global longest streak
Organization
Qualcomm
Language Used
Java, C++, Python, C
Coding Score
3049
Problem Solved
875
Contest Rating
-
1169 points
Contributor
1169 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
128 submissions in current year
SCHOOL (1)
BASIC (36)
EASY (222)
MEDIUM (543)
HARD (73)
- Reverse squared sum
- Reverse a linked list
- Frequency in a Linked List
- Delete N nodes after M nodes of a linked list
- Pairwise swap elements of a linked list
- Delete nodes having greater value on right
- Remove duplicates from an unsorted linked list
- Delete in a Doubly Linked List
- Inorder Traversal
- Reverse a Doubly Linked List
- Bubble Sort
- Selection Sort
- Insertion Sort
- Check for BST
- Right View of Binary Tree
- Mirror Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Middle of a Linked List
- Left View of Binary Tree
- Delete Middle of Linked List
- Decimal Equivalent of Binary Linked List
- Remove Duplicates from a Sorted Linked List
- Stack using two queues
- DFS of Graph
- Implement stack using array
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Square Root
- Insertion at doubly linked list
- Lowest Common Ancestor in a BST
- Binary Search
- Largest subarray of 0's and 1's
- Remove Duplicates Sorted Array
- Minimum Depth of a Binary Tree
- Remove Duplicates from an array
- Binary Tree to BST
- Leaves at Same Level or Not
- Convert to Roman No
- Multiply two linked lists
- Max distance between same elements
- Delete in a Singly Linked List
- Max Level Sum in Binary Tree
- Inorder Successor in BST
- Disjoint set (Union-Find)
- Insert in a Sorted List
- Split Linked List Alternatingly
- Sum of leaf nodes in BST
- More than n/k Occurrences
- Counting Sort
- Symmetric Tree
- Delete Alternate Nodes
- Find the Sum of Last N nodes of the Linked List
- Count Pairs whose sum is equal to X
- Median of BST
- Leaf under budget
- Linked List Matrix
- Reverse first K of a Queue
- Swap the array elements
- Reverse an Array
- Get min at pop
- First Set Bit
- Rightmost different bit
- Check K-th Bit
- Power of 2
- Equilibrium Point
- Array Leaders
- Floor in a Sorted Array
- Roof Top
- Print adjacency list
- Matrix Boundary Traversal
- Anagram
- Winner of an election
- Isomorphic Strings
- Reverse Words
- Panagram Checking
- Non Repeating Character
- Parenthesis Checker
- K largest elements
- Minimum Cost of ropes
- N meetings in one room
- Reach a given score
- Count ways to N'th Stair
- Count number of hops
- Union of Arrays with Duplicates
- Missing in Array
- Product array puzzle
- Roman Number to Integer
- Missing And Repeating
- Find Kth Rotation
- Maximum AND Value
- Sorted and Rotated Minimum
- Maximum no of 1's row
- Sum of elements between k1'th and k2'th smallest elements
- Search in a Row-Column sorted matrix
- Move All Zeroes to End
- String Duplicates Removal
- Minimize the sum of product
- Missing number
- Move all negative elements to end
- Chocolate Distribution Problem
- Find Pair Given Difference
- Pairs with difference k
- Swap and Maximize
- Bitonic Point
- Single Number
- Alternate Positive Negative
- Kth distance
- Palindrome Sentence
- Nearest multiple of 10
- Reorganize The Array
- Facing the sun
- Second Largest
- Two Sum - Pair with Given Sum
- Rotate Bits
- Find all pairs with a given sum
- Number of occurrence
- Does array represent Heap
- Modify the Array
- Check if array is sorted
- Sum Pair closest to target
- Find missing in second array
- String's Count
- Longest Common Prefix of Strings
- Two sum -Pairs with 0 Sum
- Play With OR
- At Least K Occurrences
- Find the closest pair from two arrays
- Palindrome String
- Maximum average subarray
- Total count
- K-th missing element
- Pair with given sum in a sorted array
- Pattern Searching
- Last Match
- Is Binary Number Multiple of 3
- Divisibility by 8
- Number of 1 Bits
- Armstrong Numbers
- Max Sum Subarray of size K
- Nth Fibonacci Number
- Ceil The Floor
- Maximum Sum Problem
- Minimum insertions to sort an array
- Minimum number of deletions to make a sorted sequence
- Party of Couples
- Sum 1 to n Divisors
- Minimum steps to minimize n as per given condition
- Find maximum number
- Happy Number
- Reach the Nth point
- Minimum number of Coins
- Maximize Toys
- Page Faults in LRU
- Recamans sequence
- Integral Root
- Good Numbers
- Recursive sequence
- Row with Minimum 1s
- Make Zeroes
- Surround the 1's
- Count all possible paths from top left to bottom right
- Reverse Bits
- Search insert position of K in a sorted array
- Queue using stack
- Most Booked Hotel Room
- Smallest window containing 0, 1 and 2
- Insert an Element at the Bottom of a Stack
- Find pairs with given sum in doubly linked list
- Pattern 17
- Pattern 18
- Pattern 19
- Pattern 20
- Pattern 21
- Print N to 1 without loop
- Print GFG n times
- Fibonacci series up to Nth term
- Pattern 12
- Pattern 22
- Largest odd number in string
- Maximum Nesting Depth of the Parentheses
- Stock Buy and Sell – Max one Transaction Allowed
- Outermost Parentheses
- Search in Linked List
- Remove duplicates from a sorted doubly linked list
- Assign Cookies
- Array to Linked List
- Introduction to Trees
- Introduction to Doubly Linked List
- Pass by Reference and Value
- Implementation of Priority Queue using Binary Heap
- Transform to Sum Tree
- Number of Subarrays of 0's
- Weight Problem
- Separate Stone
- Silver and Gold
- Explosives
- Mean BST
- Even Sum
- High Frequency
- Weird Island
- Super Palindrome
- Two Smallests in Every Subarray
- Largest Pair Sum
- Two Swaps
- Meeting Rooms
- Count Pairs whose sum is less than target
- Union of Two Sorted Arrays with Distinct Elements
- Search in a row-wise sorted matrix
- Count Trips
- Find Only Repetitive Element from 1 to n-1
- Restricted Scoring
- Max x
- Seating Arrangement
- Bitwise Operations
- Minimum Jumps
- Can Transform ?
- Count the complement pairs
- Maximum Score
- Reverse alternate nodes in Link List
- Rotate a Linked List
- Sort a linked list of 0s, 1s and 2s
- Add Number Linked Lists
- Rearrange a linked list
- Add 1 to a Linked List Number
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Insert in Sorted Circular Linked List
- Count BST nodes that lie in a given range
- Merge Sort
- Quick Sort
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Heap Sort
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Sum Tree
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Flattening a Linked List
- Tree Boundary Traversal
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Absolute List Sorting
- Two Stacks in an Array
- Binary Heap Operations
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Merge K sorted linked lists
- Find the number of islands
- Find kth element of spiral matrix
- Get Min from Stack
- Wildcard Pattern Matching
- Linked List to Binary Tree
- Check if subtree
- Extreme nodes in alternate order
- Is Binary Tree Heap
- Clone a Binary Tree
- Validate an IP Address
- Remove loop in Linked List
- Dijkstra Algorithm
- Minimum Spanning Tree
- Largest BST
- Interleaved Strings
- Sum of permutations
- Sorted subsequence of size 3
- Multiply two strings
- Implement Atoi
- Maximum Difference
- Palindrome Linked List
- Strongly Connected
- Print matrix in diagonal pattern
- Rat in a Maze Problem - I
- Bipartite Graph
- Number of root to leaf paths
- Closest in BST
- BST with Dead End
- Pots of Gold Game
- Merge two BST 's
- Count distinct elements in every window
- Merge k Sorted Arrays
- Root to leaf paths sum
- Bridge edge in a graph
- Print Nodes having K leaves
- Find triplets with zero sum
- Sort a stack
- Top View of Binary Tree
- k-th Smallest in BST
- Level order traversal
- Peak element
- Polynomial Addition
- Delete nodes greater than k
- Pair Sum in BST
- Root to Leaf Paths
- Complete Binary Tree
- Populate Inorder Successor for all nodes
- XOR Linked List
- Counting elements in two arrays
- Linked List that is Sorted Alternatingly
- K Sum Paths
- Leftmost and rightmost nodes of binary tree
- Construct Tree from Inorder & Preorder
- Count the nodes at distance K from leaf
- Insert in Sorted way in a Sorted DLL
- Isomorphic Trees
- Maximum path sum from any node
- Predecessor and Successor
- Children Sum in a Binary Tree
- Diagonal sum in binary tree
- Deletion and Reverse in Circular Linked List
- Normal BST to Balanced BST
- Sum of nodes on the longest path
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees
- Mother Vertex
- Ceil in BST
- Count set bits
- Maximum AND Value
- Tower Of Hanoi
- Smallest Positive Missing
- Power Of Numbers
- Wave Array
- Possible Words From Phone Digits
- Rotate and delete
- Rearrange Array Alternately
- Maximum Index
- Stock buy and sell
- Rotate Array
- Kadane's Algorithm
- Majority Element
- Count Inversions
- Two Repeated Elements
- Unique BST's
- Union of 2 Sorted Arrays
- Indexes of Subarray Sum
- Count the number of possible triangles
- Triplet Sum in Array
- Merge Without Extra Space
- Possible paths between 2 vertices
- Level of Nodes
- Boolean Matrix
- Spirally traversing a matrix
- Search in a sorted Matrix
- Rotate by 90 degree
- Determinant of a Matrix
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarray with 0 sum
- Subarray range with given sum
- Sort Elements by Decreasing Frequency
- Longest Consecutive Subsequence
- Strings Rotations of Each Other
- Postfix Evaluation
- Stock span problem
- Next Greater Element
- Infix to Postfix
- K Sized Subarray Maximum
- Nearly sorted
- Activity Selection
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Combination Sum
- M-Coloring Problem
- Minimum Jumps
- Detect Cycle using DSU
- Stickler Thief
- Ways to Reach the n'th Stair
- Optimal Strategy For A Game
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Number of Unique Paths
- Sort according to an Array
- Allocate Minimum Pages
- X Total Shapes
- Zero Sum Subarrays
- Find whether path exist
- Kth Smallest
- Implement Trie
- Shortest Common Supersequence
- Nth Catalan Number
- Rotten Oranges
- Steps by Knight
- Most frequent word in an array of strings
- Maximize The Cut Segments
- Print Anagrams Together
- Rotate by 90 degree
- Top K Frequent in Array
- Closest Three Sum
- Word Break
- Stock Buy and Sell – Multiple Transaction Allowed
- Generate Parentheses
- Word Search
- Prerequisite Tasks
- 4 Sum - All Quadruples
- Sort 0s, 1s and 2s
- Paths to reach origin
- Maximum Sub Array
- Pascal Triangle
- Maximum Index
- Number of subarrays with maximum values in given range
- Sum of Subarrays
- Equal Sum
- Top k numbers in a stream
- Large Factorial
- Maximize Number of 1's
- Equivalent Sub-Arrays
- Single Among Doubles in a Sorted
- Consecutive 1's not allowed
- Split the Array
- Count Occurences of Anagrams
- Count of Subarrays
- Single Among Doubles
- Pythagorean Triplet
- Happiest Triplet
- Painting the Fence
- Pair Sum Closest to 0
- Search in Rotated Sorted Array
- Count pairs Sum in matrices
- Sum of bit differences
- Print Binary Tree levels in sorted order
- Max Score from Subarray Mins
- Form the Largest Number
- Alternate Vowel and Consonant String
- Add Binary Strings
- Maximum Product Subarray
- Longest subarray with sum divisible by K
- Check if a string is repetition of its substring of k-length
- Row with max 1s
- Check if frequencies can be equal
- Column name from a given column number
- Substrings with K Distinct
- Form a palindrome
- Rotate a Matrix
- Longest Subarray with Sum K
- Number of positive integral solutions
- Sum of two large numbers
- Max Sum without Adjacents
- Beautiful SubSequence
- Factorials of large numbers
- Reverse each word in a given string
- Find the N-th character
- Length of the longest substring
- k largest elements
- Sum of XOR of all pairs
- Longest Common Substring
- Smallest distinct window
- Longest substring with distinct characters
- Count of substrings containing K ones
- Longest Substring with K Uniques
- Longest Palindrome in a String
- Valid Expression
- K-th element of two Arrays
- Triplets with Smaller Sum
- Rod Cutting
- Missing element of AP
- LCS of three strings
- Longest Palindromic Subsequence
- Largest Sum Subarray of Size at least K
- First negative in every window of size k
- Minimum sum
- Not a subset sum
- Build the smallest
- Minimize the Heights II
- Transform to prime
- First and Last Occurrences
- Reaching the heights
- Minimum Deletions
- Print N-bit binary numbers having more 1s than 0s
- Nine Divisors
- Minimum number of deletions
- Permutations of a String
- String Subsequence Game
- Count divisors of product of array elements
- Sum of Products
- Subarrays Product Less than K
- Unique Number II
- Bleak Numbers
- Ways to sum to N
- Skip the work
- Maximum calorie
- Game of XOR
- 3 Divisors
- Modified Game of Nim
- Minimum number of deletions and insertions
- Maximize dot product
- Max Sum Increasing Subsequence
- Minimum cost to fill given weight in a bag
- Coin Change (Count Ways)
- Sequence of Sequence
- Gold Mine Problem
- Coin Change (Minimum Coins)
- Dice throw
- Perfect Sum Problem
- Fibonacci Sum
- Power Of 2 and Subsequences
- Power Set
- Count ways to N'th Stair(Order does not matter)
- Minimum Cost To Make Two Strings Identical
- Knapsack with Duplicate Items
- nCr
- Maximum path sum in matrix
- Partition Equal Subset Sum
- Longest Bitonic subsequence
- Min Coin
- Get Minimum Squares
- Count possible ways to construct buildings
- Count digit groupings of a number
- Array Pair Sum Divisibility Problem
- Subset Sums
- Prime Pair with Target Sum
- Count Numbers in Range
- Number of paths
- Knight Walk
- Number of paths in a matrix with k coins
- LCM Triplet
- Find nth root of m
- Find Prime numbers in a range
- Game with String
- Smith Number
- Next Permutation
- Prime factorization and geek number
- Smaller on Left
- How Many X's?
- Power of k in factorial of n
- Composite and Prime
- Total Decoding Messages
- Stream First Non-repeating
- Count Divisors
- Kth Largest in a Stream
- Geek and Strings
- Satisfy the equation
- Product of Primes
- Transitive closure of a Graph
- Replace O's with X's
- Two odd Occuring
- Find all distinct subset (or subsequence) sums
- Rohan's Love for Matrix
- Traverse All Edges And Vertices
- Find the string in grid
- Reverse Delete Algorithm for Minimum Spanning Tree
- Help a Thief!!!
- Floyd Warshall
- Negative weight cycle
- Flood fill Algorithm
- Techfest and the Queue
- Largest subsquare surrounded by X
- Shortest Source to Destination Path
- Height Using Parent Array
- Reverse Spiral Form of Matrix
- Geek in a Maze
- Spiral Matrix
- Valid Pair Sum
- Triplets in Sorted Linked List
- Restrictive Candy Crush
- Help Classmates
- Valentine Sum
- Lucy's Neighbours
- Jump Game
- Iterative Inorder
- Triplets with sum with given range
- Preorder traversal (Iterative)
- Iterative Postorder
- Subset Sum Problem
- Form a palindrome
- All Palindromic Partitions
- Covid Spread
- 3 Sum Closest
- Bellman-Ford
- Subarrays with sum K
- Remove BST keys outside given range
- Capacity To Ship Packages Within D Days
- Rearrange characters
- Remove K Digits
- Substrings of length k with k-1 distinct elements
- Maximum XOR of two numbers in an array
- Count pairs in array divisible by K
- Number of Provinces
- Prefix match with other strings
- Maximum sum leaf to root path
- Find duplicate rows in a binary matrix
- Maximum sum of elements not part of LIS
- BST to greater sum tree
- Paths from root with a specified sum
- Shortest Prime Path
- Shortest Prime Path
- Sort for Singly Linked List
- Remove all occurences of duplicates in a linked list
- Minimize the Heights I
- Subsets
- Flatten binary tree to linked list
- Anti Diagonal Traversal of Matrix
- Design Twitter
- IPL 2021 - Match Day 2
- Sum Distance K in Tree
- Unique Number III
- All Unique Permutations of an array
- Course Schedule
- Clone an Undirected Graph
- Maximum Time
- Min Cost Climbing Stairs
- Target Sum
- Overlapping Intervals
- Longest Possible Route in a Matrix with Hurdles
- Reverse a Stack
- Maximum product subset of an array
- Maximum Meetings in One Room
- Buy Maximum Stocks
- Exactly one swap
- Maximum Winning score
- Levels Of Game
- Smallest sum contiguous subarray
- Max Sum without Adjacents 2
- Stack Permutations
- Calculate the coefficient
- Expression contains redundant bracket or not
- Graph is Tree or Not
- Geek fight
- Minimum Cost Car
- Minimize connections
- Maximum selections
- Next element with greater frequency
- Sum of nodes within k distance from target
- Sort a k sorted doubly linked list
- Construct Binary Tree from String with bracket representation
- Number of Distinct Islands
- Shortest Distance in a Binary Maze
- Minimum Multiplications to reach End
- Number Of Enclaves
- Eventual Safe States
- City With the Smallest Number of Neighbors at a Threshold Distance
- Alex Travelling
- Number Of Islands
- Merging Details
- Number of Ways to Arrive at Destination
- Pattern
- Path With Minimum Effort
- Cheapest Flights Within K Stops
- Connecting the graph
- Shortest Path in Undirected Graph
- Maximum Stone Removal
- Shortest path in Directed Acyclic Graph
- Majority Element - More Than n/3
- Sum of Beauty of All Substrings
- Koko Eating Bananas
- Search in Rotated Array 2
- Count Good numbers
- Longest subarray with Atmost two distinct integers
- Maximum Consecutive Ones
- Count Subarray with k odds
- Count Substring
- Binary subarray with sum
- Sum of subarray minimum
- Frog Jump
- Asteroid Collision
- Minimal Cost
- Geek's Training
- Grid Path 2
- Maximum point you can obtain from cards
- Subarrays with K Distinct Integers
- Stock Buy and Sell – with Cooldown
- Combination Sum III
- Aggressive Cows
- Smallest Divisor
- Subset II
- Check if there exists a subsequence with sum K
- Next Greater Element 2
- Number of greater elements to the right
- Shortest Path in Weighted undirected graph
- Prime Factorization using Sieve
- Prefix to Infix Conversion
- Prefix to Postfix Conversion
- Minimum days to make M bouquets
- Generate all binary strings
- Delete all occurrences of a given key in a doubly linked list
- Postfix to Prefix Conversion
- Postfix to Infix Conversion
- Task Scheduler
- Hands of Straights
- Minimum Absolute Difference In BST
- Buy Stock with Transaction Fee
- Number of Longest Increasing Subsequence
- Lemonade Change
- Maximum Sum Combination
- Non-overlapping Intervals
- Stickler Thief II
- Replace elements by its rank in the array
- Convert Min Heap to Max Heap
- Insert Interval
- Shortest Job first
- Partition Array for Maximum Sum
- Count Square Submatrices with All Ones
- Count Number of Nodes in a Binary Tree
- Introduction to DP
- Longest String Chain
- Print Longest Increasing Subsequence
- Partitions with Given Difference
- Index of the First Occurrence of pattern in a text
- Floor in BST
- Triangle Path Sum
- Largest Divisible Subset
- Minimize number of Students to be removed
- Maximum Value
- Shortest Prime Path
- Absolute difference divisible by K
- Make array elements unique
- Next Greater Element in Circular Array
- Minimum X (xor) A
- Find the longest string
- Minimum repeat to make substring
- Paint N Houses
- Max Sum without Adjacents
- BST Downward Traversal
- Prime List
- Walls Coloring
- Water the plants
- Connect Nodes at Same Level
- Unique Paths in a Grid
- Fill the Matrix
- Number of Good Components
- Optimal Array
- Bheem Wants Ladoos
- Smaller Sum
- BST Maximum Difference
- Another Coin Change Problem
- Maximum subset sum
- Gathering Boulders
- Find Kth permutation
- Remove the balls
- Minimum Distance Graph
- Odd Triplets
- Plucking Flowers
- Empty the String
- New Year Resolution
- Grinding Geek
- Flatten BST to sorted list
- Three Sum
- Count Subarrays with given XOR
- Count pairs with given sum
- Connected Components in an Undirected Graph
- Find All Triplets with Zero Sum
- Split array in three equal sum subarrays
- Search in an almost Sorted Array
- Count Valid Pairs
- Subset XOR
- Merge k Sorted Arrays
- Subarrays With At Most K Distinct Integers
- K Closest Points to Origin
- Longest Bounded-Difference Subarray
- Divisible by 13
- Count Unique Vowel Strings
- ASCII Range Sum
- Linked List Group Reverse
- Reorder List
- Binary Tree to DLL
- Clone List with Next and Random
- Min distance between two given nodes of a Binary Tree
- Serialize and deserialize a binary tree
- Max rectangle
- Subtraction in Linked List
- Distinct occurrences
- LRU Cache
- Alien Dictionary
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- String Permutations
- Trapping Rain Water
- Smallest window containing all characters
- Histogram Max Rectangular Area
- Find median in a stream
- Solve the Sudoku
- Minimum Cost Path
- Word Ladder I
- Median of 2 Sorted Arrays of Different Sizes
- Burning Tree
- The Painter's Partition Problem-II
- Palindrome SubStrings
- Search Pattern
- Longest Prefix Suffix
- Number of distinct subsequences
- Wildcard string matching
- Longest repeating and non-overlapping substring
- Sub-arrays with equal number of occurences
- Edit Distance
- Minimum sum partition
- Palindromic Partitioning
- Stock Buy and Sell – Max K Transactions Allowed
- Matrix Chain Multiplication
- Bit Difference
- Median in a row-wise sorted Matrix
- Generalised Fibonacci numbers
- Boolean Parenthesization
- Possible Paths in a Tree
- Word Break - 2
- N-Queen Problem
- Brackets in Matrix Chain Multiplication
- Articulation Point - II
- Travelling Salesman Problem
- Let's Play!!!
- Search Pattern (Rabin-Karp Algorithm)
- Minimum X (xor) A
- Find all Critical Connections in the Graph
- Sorted Linked List to BST
- Longest Increasing Path in a Matrix
- Reverse a sublist of a linked list
- Word Ladder II
- Distribute candies in a binary tree
- Split Array Largest Sum
- Scrambled String
- Articulation Point - I
- Stock Buy and Sell – Max 2 Transactions Allowed
- Largest rectangular sub-matrix whose sum is 0
- Vertex Cover
- Maximum Triple Product
- Maximum Connected group
- Minimum travel time
- MaxSkill
- Minimize Max Distance to Gas Station
- LFU cache
- Candy
- Chocolates Pickup
- Better String
- Fixing Two swapped nodes of a BST
- Geekina Hate 1s
- Making A Large Island
- Find Length of Linked List
- Size of Binary Tree
- Postorder Traversal
- Queue Using Array
- Preorder Traversal
- Sum Except First and Last
- Linked List Insertion At End
- Is Linked List Length Even?
- Triplet Family
- Bit Difference
- Print 1 To N Without Loop
- Sorted Array Search
- Reverse a String
- First n Fibonacci
- Searching in an Array
- Alternative Sorting
- Quick Left Rotation
- Rotate Array by One
- One odd Occuring
- Rotating an Array
- Min and Max in Array
- Odd or Even
- Check set bits
- Find position of set bit
- Set kth bit
- Set the rightmost unset bit
- Numbers having alternate bits
- Binary number to decimal number
- Swap two numbers
- Max Min
- Pattern 7
- Pattern 8
- Pattern 10
- Pattern 11
- Pattern 13
- Valid Triangle
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