• 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

Urban Ladder Written Test.

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

CodeChef’ RRCOPY

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

Python Array String

Find if a binary tree is height balanced ?

Closed Parentheses checker

Common Ancestor in a Binary Tree or Binary Search Tree

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Implement LRU Cache

How Radix sort works

Printing each word reverse in string

System Design: Designing a LLD for Hotel Booking

Implement a generic binary search algorithm for Integer Double String etc

Get K Max and Delete K Max in stream of incoming integers

Find the kth number with prime factors 3, 5 and 7

Subset Sum Problem Dynamic programming

How strtok() Works

Find if two rectangles overlap

Interfaces in C++ (Abstract Classes in C++)

LeetCode : Word Search

Find min element in Sorted Rotated Array (With Duplicates)

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

BFS (Breath First Search)

Password Predictor

Code Chef PRGIFT Solution

Maximum sum contiguous subarray of an Array

Linked List V/S Binary Search Tree

Knight Tour Problem (Graph – Breadth First Search)

Copyright © 2026 · Genesis Framework · WordPress · Log in