• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Given a float number convert it into the string WITHOUT using any inbuilt Function

March 25, 2014 by Dhaval Dave

Convert a floating point number to string

Given a float number convert it into the string WITHOUT using any inbuilt Function

Method 1:

class Float2String 
{ 
   public static void main(String[] args) 
   { 
      float f=7.64f; 
      String result; 
      result=""+f; 
      System.out.println(result); 
   } 
}


-by karthik dheeraj

Method 2:

#include<stdio.h>
#include<math.h>
 
// reverses a string 'str' of length 'len'
void reverse(char *str, int len)
{
    int i=0, j=len-1, temp;
    while (i<j)
    {
        temp = str[i];
        str[i] = str[j];
        str[j] = temp;
        i++; j--;
    }
}
 
 // Converts a given integer x to string str[]. 
int intToStr(int x, char str[], int d)
{
    int i = 0;
    while (x)
    {
        str[i++] = (x%10) + '0';
        x = x/10;
    }
 
    while (i < d)
        str[i++] = '0';
 
    reverse(str, i);
    str[i] = '\0';
    return i;
}
 
// Converts a floating point number to string.
void ftoa(float n, char *res, int afterpoint)
{
    int ipart = (int)n;
 
    float fpart = n - (float)ipart;
 
    int i = intToStr(ipart, res, 0);
 
    if (afterpoint != 0)
    {
        res[i] = '.';  // add dot
 
        // Get the value of fraction part upto given no.
        fpart = fpart * pow(10, afterpoint);
 
        intToStr((int)fpart, res + i + 1, afterpoint);
    }
}
 
int main()
{
    char res[20];
    float n = 233.007;
    ftoa(n, res, 4);
    printf("\n\"%s\"\n", res);
    return 0;
}

Similar Articles

Filed Under: Amazon Interview Question, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Level order traversal in Spiral form

Python Dictionaries

Find the element that appears once others appears thrice

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Check Binary Tree is Binary Search Tree or not

Sort an array according to the order defined by another array

Find and print longest consecutive number sequence in a given sequence in O(n)

The greedy coins game Dynamic Programming

Flipkart SDET Interview Experience

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Possible sizes of bus to carry n groups of friends

Edit Distance ( Dynamic Programming )

Singly linked list

Search element in a matrix with all rows and columns in sorted order

Word Break Problem

Stickler thief

SAP Interview Questions

Printing intermediate Integers between one element & next element of array

Binary Tree in Java

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Amazon Interview Experience – SDE Chennai

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Generate largest number arranging a no. of given non negative integer numbers

Minimum insertions to form a palindrome

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Reliance Jio Software Developer Interview Experience

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

The Magic HackerEarth Nirvana solutions Hiring Challenge

Binary Tree in Java

Copyright © 2026 · Genesis Framework · WordPress · Log in