• 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

Right view of Binary tree

CodeChef Code SGARDEN

Handle duplicates in Binary Search Tree

BlueStone E-commerce Interview Experience

Generic Object Oriented Stack with Template

Check Binary Tree is Binary Search Tree or not

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

FizzBuzz Solution C C++

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Check if an array has duplicate numbers in O(n) time and O(1) space

DFS (Depth First Search)

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Templates in C++

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

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

System Design: Designing a LLD for Hotel Booking

Add Sub Multiply very large number stored as string

ADOBE Aptitude C Language Test

Convert number to words java

Binary Tree in Java

Subset Sum Problem Dynamic programming

Minimum insertions to form a palindrome

Python Array String

Stock Buy Sell to Maximize Profit

Leetcode: Edit Distance

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

Given Set of words or A String find whether chain is possible from these words or not

Max Sum in circularly situated Values

C++ OOPs Part1

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Copyright © 2026 · Genesis Framework · WordPress · Log in