Find maximum occuring integer(Mode) in an unsorted array
- by Rajendra
How to find maximum occuring integer(Mode) in an unsorted array of integers? One O(nlogn) approach I could think of is to sort. Is there any other best approach?
Search Results
Search found 65 results on 3 pages for 'rajendra bhole'.
Page 3/3 | < Previous Page | 1 2 3
-
-
How can i use cron job in Social engine?
- by Rajendra Banker
Hi All, I am new with cron job in php,basically i want to send email to user on certain time of period.i want to send email daily,weekly,monthly,quarterly,yearly,or specific amount of days. In smarty template i want to use this type of function Can any body know how to do tihs?Read the article
-
How to arrange an array in decreasing order of frequency of each number?
- by Rajendra
Input : {5, 13, 6, 5, 13, 7, 8, 6, 5} Output : {5, 5, 5, 13, 13, 6, 6, 7, 8} The question is to arrange the numbers in the array in decreasing order of their frequency, preserving the order of their occurrence. If there is a tie, like in this example between 13 and 6, then the number occurring first in the input array would come first in the output array.Read the article
-
You don't have permission fckeditor php
- by G-Rajendra
i upload fckeditor in myadmin and i also make upload files in $Config['UserFilesPath'] = '/uploadfiles/' ; i had also gave 777 permission in upload files and browse.html but when i want to upload files there is showing error as below "You don't have permission to access /wealthfinance/admin/fckeditor/editor/filemanager/browser/default/browser.html on this server." what is main problem in fckeditor could you please anyone help meRead the article
-
How to arrange array in decreasing order of frequency of each number?
- by Rajendra
Input : {5, 13, 6, 5, 13, 7, 8, 6, 5} Output : {5, 5, 5, 13, 13, 6, 6, 7, 8} Question is to arrange the numbers in the array in decreasing order of their frequency preserving the order of their occurrence. If their is a tie, for example, here 13 and 6 then the number occurring first in input array would come first in output array.Read the article
-
Read/Write file metadata using C/C++
- by Rajendra Kumar Uppal
Hi, Searched through net, could't find a way to read/write file metadata using C or C++, however, there are tools available for this, and also there are API's in C# and Java to do this. But I want to do it from scratch in C or C++. For example, read/write image metadata. Have found out that there are three formats in which metadata is written to files. EXIF, IPTC and XMP. Thanks.Read the article
-
How to find smallest substring which contains all characters from a given string?
- by Rajendra
I have recently come across an interesting question on strings. Suppose you are given following: Input string1: "this is a test string" Input string2: "tist" Output string: "t stri" So, given above, how can I approach towards finding smallest substring of string1 that contains all the characters from string 2?Read the article
-
Integration of fckeditor in Social engine tepmplate
- by Rajendra Banker
Hi all, I want to integrate FCK editor instead of text area filed in social engine .tpl file. Does Any one know ? How to integrate?Read the article
-
How to find validity of a string of parentheses, curly brackets and square brackets?
- by Rajendra
I recently came in contact with this interesting problem. You are given a string containing just the characters '(', ')', '{', '}', '[' and ']', for example, "[{()}]", you need to write a function which will check validity of such an input string, function may be like this: bool isValid(char* s); these brackets have to close in the correct order, for example "()" and "()[]{}" are all valid but "(]", "([)]" and "{{{{" are not! I came out with following O(n) time and O(n) space complexity solution, which works fine: Maintain a stack of characters. Whenever you find opening braces '(', '{' OR '[' push it on the stack. Whenever you find closing braces ')', '}' OR ']' , check if top of stack is corresponding opening bracket, if yes, then pop the stack, else break the loop and return false. Repeat steps 2 - 3 until end of the string. This works, but can we optimize it for space, may be constant extra space, I understand that time complexity cannot be less than O(n) as we have to look at every character. So my question is can we solve this problem in O(1) space?Read the article
-
What will happen when I call a member function on a NULL object pointer?
- by Rajendra Kumar Uppal
I was given the following as an interview question: class A { public: void fun() { std::cout << "fun" << std::endl; } }; A* a = NULL; a->fun(); What will happen when this code is executed, and why?Read the article
-
Tricky C++ interview question
- by Rajendra
Given class A { public: void fun() { std::cout << "fun" << std::endl; } }; A* a = NULL; a->fun(); What will happen and why?Read the article
-
Trick C++ interview question
- by Rajendra
Given class A { public: void fun() { std::cout << "fun" << std::endl; } }; A* a = NULL; a->fun(); What will happen and why?Read the article
-
How to find sum of elements from given index interval (i, j) in constant time?
- by Rajendra
Given an array. How can we find sum of elements in index interval (i, j) in constant time. You are allowed to use extra space. Example: A: 3 2 4 7 1 -2 8 0 -4 2 1 5 6 -1 length = 14 int getsum(int* arr, int i, int j, int len); // suppose int array "arr" is initialized here int sum = getsum(arr, 2, 5, 14); sum should be 10 in constant time.Read the article
-
Find largest rectangle containing only zeros in an N×N binary matrix
- by Rajendra
Given an NxN binary matrix (containing only 0's or 1's), how can we go about finding largest rectangle containing all 0's? Example: I 0 0 0 0 1 0 0 0 1 0 0 1 II->0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 <--IV 0 0 1 0 0 0 IV is a 6×6 binary matrix; the return value in this case will be Cell 1: (2, 1) and Cell 2: (4, 4). The resulting sub-matrix can be square or rectangular. The return value can also be the size of the largest sub-matrix of all 0's, in this example 3 × 4.Read the article
-
android compilation
- by user1241903
I am trying to compile android source v2.3.4. When I give "make -j32", I am getting result like this.I am using fedora 14(32 bit). [root@localhost WORKING_DIRECTORY]# make -j32 ============================================ PLATFORM_VERSION_CODENAME=REL PLATFORM_VERSION=2.3.4 TARGET_PRODUCT=full TARGET_BUILD_VARIANT=eng TARGET_SIMULATOR=false TARGET_BUILD_TYPE=release TARGET_BUILD_APPS= TARGET_ARCH=arm HOST_ARCH=x86 HOST_OS=linux HOST_BUILD_TYPE=release BUILD_ID=GRJ22 ============================================ Checking build tools versions... build/core/main.mk:76: ************************************************************ build/core/main.mk:77: You are attempting to build on a 32-bit system. build/core/main.mk:78: Only 64-bit build environments are supported beyond froyo/2.2. build/core/main.mk:79: ************************************************************ build/core/main.mk:80: *** stop. Stop. [root@localhost WORKING_DIRECTORY]# Please help me to solve this issue. How to compile android source code on 32 bit os?. Thank You RajendraRead the article
