,

Browse Programming Solutions


   
33 Solution(s) found
Programming
4 ratings
Views 394
Big-Data security algorithm
This is a new encryption standard, in which the shape of the encryption algorithm is user defined.

Programming
0 ratings
Views 405
Lotus Notes Agent call from web.
How do you call an agent on web?

Programming
0 ratings
Views 428
Lotus Notes Agent call
A form is having two Buttons, one is having ToolsRunMacro and other one is having lotusscript..are they same..?

Programming
0 ratings
Views 490
Huge Effort saved by automation
There was need to adjust the cost-basis of stock holdings for Major USA Investment Bank. The existing process was not handling all adjustments accurately. There were huge number of exceptions. Business team had to manually adjust the cost for all exceptions. It was time consuming, error-prone and not good experince for end clients.

Programming
9 ratings
Views 436
In Real Life,Un knowing Problem
I know very few people who don't hate their job, and sometimes it's because their job is eating away at their humanity day by day and other times it's because of their outlook. If you're in a situation ?

Programming
0 ratings
Views 481
Fenwick Tree (Binary Indexed Tree)
What are Fenwick Tree?

Programming
0 ratings
Views 529
TestComplete Automation
How to Setup effective Script Driven Framework.

Programming
0 ratings
Views 1381
Evernote Coding Challenge : Problem#2
Frequency Counting of Words / Top N words in a document. Given N terms, your task is to find the k most frequent terms from given N terms. Input format First line of input contains N, denoting the number of terms to add. In each of the next N lines, each contains a term. Next line contains k, most frequent terms. Output format Print the k most frequent terms in descending order of their frequency. If two terms have same frequency print them in lexicographical order.

Programming
0 ratings
Views 1310
Algorithm to solve N Queen Problem
Given a n x n grid, how would you place n queens so that no two are attacking. Two queens are said to be attacking if they are on same row, column or diagonal. The naive solution of this problem will require to find all the permutations i.e. finding all the n! arrangements. A typical example of n queen problem is 8 queen problem which requires us to find possible placements of 8 queens on a 8 x 8 chess board. One of the arrangements of 8 x 8 problem is shown below :

Programming
3 ratings
Views 577
Create new Project and Submit this site to link to world
People have knowledge to develop new project idea and about it. how to publish the project idea to world and improve the project efficient .?



Advertisement