skip to main
|
skip to sidebar
Random musings
Saturday, May 22, 2010
Dynamic arrays
Implement dynamic arrays.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Followers
Blog Archive
▼
2010
(73)
▼
May
(73)
Leaf to root path sum up to given number
Successor integer with all unique digits.
Pair of numbers which sum up to zero
Program to convert numbers into roman literals
Decreasing order of integers from a stream of infi...
All duplicates and their counts in a string
Given sum is consecutive integer or not
boggle solver problem
highest frequency element in an array
smallest window of an array
Random number from given range
Sorted order linked list in a tree
Return all negative numbers in a matrix
k th smallest element in two sorted arrays.
Top k elements in an array
All bit related quesions.
permutation and comibnation
Scheduling algorithm
Median in a BST
Matrix multiplication
Queue with Max efficient MAX operation
Balanced binary tree from a linked list
Multiple white spaces in a string to single whites...
Binary Indexed Tree (BIT)
Number of binary trees for n nodes
Multiply number by 7
Maximum word made of other words.
Maximum sum of matrix.
Three numbers summing up to zero
Largest matrix with 0's and 1's
Dynamic arrays
Three integers in an array whose sum is closest to S
Subset sum problem
patience sort
Implement strstr function
find sum of numbers equal to constant k
find the nth string in a file
Continuos sequence having the maximum sum
Random element from a linked list.
binary search on a circularly shifted array
Implement Queue using Stack.
pairwise swap
find the diameter of a tree
Good programming problem
find all anagrams in a file
smallest number of multiplications
Intersection of rectangles
Find cycles in directed graph
Facility location problems
k largest elements in an array
Element which has no duplicate entries
Maximum collinear points.
Towers of hanoi
Design patterns.
Design patterns.
If you are given two traversal sequences, can you ...
nearest neighbor problem
First 3 horses among 25 horses
Strongly connected components.
Depth first search notes.
Two different ways to to topological sorting over ...
Fractional and Discrete knapsack problem
Program for inorder traversal without implicit or ...
Threaded binary trees inorder implementation.
Another good way of implementing iterative postorder.
Pre order traversal with and without recursion.
Post order traversal with and without recursion.
Find the longest increasing subsequence in a given...
Longest common subsequence problem
Longest common substring for given two strings.
My iphone mishap
good hat puzzle (simultaneous guess hat number)
My first algorithm puzzle on the net.
About Me
Hanumanth Rao
View my complete profile
No comments:
Post a Comment